|
|
Journals in DBLP
- János Komlós, Yuan Ma, Endre Szemerédi
Matching Nuts and Bolts in O(n log n) Time. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1998, v:11, n:3, pp:347-372 [Journal]
- Fred J. Rispoli, Steven Cosares
A Bound of 4 for the Diameter of the Symmetric Traveling Salesman Polytope. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1998, v:11, n:3, pp:373-380 [Journal]
- Jonathan Lichtner
Iterating an alpha-ary Gray Code. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1998, v:11, n:3, pp:381-386 [Journal]
- Ulrich Faigle, Walter Kern
Approximate Core Allocation for Binpacking Games. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1998, v:11, n:3, pp:387-399 [Journal]
- Artur Czumaj, Leszek Gasieniec, Andrzej Pelc
Time and Cost Trade-Offs in Gossiping. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1998, v:11, n:3, pp:400-413 [Journal]
- Victor Chepoi
On Distance-Preserving and Domination Elimination Orderings. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1998, v:11, n:3, pp:414-436 [Journal]
- Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin
Dually Chordal Graphs. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1998, v:11, n:3, pp:437-455 [Journal]
- Anatoly R. Rubinov, Vadim G. Timkovsky
String Noninclusion Optimization Problems. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1998, v:11, n:3, pp:456-467 [Journal]
- Martin Kochol
Partial Intersection Theorem and Flows in Abstract Networks. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1998, v:11, n:3, pp:468-486 [Journal]
- Mark Ramras
Congestion-free Routings of Linear Complement Permutations. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1998, v:11, n:3, pp:487-500 [Journal]
- Carles Padró, Paz Morillo, Xavier Muñoz
Fault-Tolerant Fixed Routings in Some Families of Digraphs. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1998, v:11, n:3, pp:501-509 [Journal]
|
