|
Journals in DBLP
- Anders Björner, Volkmar Welker
Complexes of Directed Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1999, v:12, n:4, pp:413-424 [Journal]
- Balaji Raghavachari, Jeyakesavan Veerasamy
A 3/2-Approximation Algorithm for the Mixed Postman Problem. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1999, v:12, n:4, pp:425-433 [Journal]
- Bernhard Gittenberger
On the Contour of Random Trees. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1999, v:12, n:4, pp:434-458 [Journal]
- Cyril Gavoille, David Peleg
The Compactness of Interval Routing. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1999, v:12, n:4, pp:459-473 [Journal]
- Meena Mahajan, V. Vinay
Determinant: Old Algorithms, New Insights. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1999, v:12, n:4, pp:474-490 [Journal]
- Ko-Wei Lih, Daphne Der-Fen Liu, Xuding Zhu
Star Extremal Circulant Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1999, v:12, n:4, pp:491-499 [Journal]
- William W. Hager, Yaroslav Krylyuk
Graph Partitioning and Continuous Quadratic Programming. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1999, v:12, n:4, pp:500-523 [Journal]
- Samit Dasgupta
On the Size of Minimum Super Arrovian Domains. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1999, v:12, n:4, pp:524-534 [Journal]
|