Journals in DBLP
Andrew V. Goldberg , Satish Rao Flows in Undirected Unit Capacity Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:1, pp:1-5 [Journal ] Bojan Mohar A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:1, pp:6-26 [Journal ] Kevin T. Phelps , Mike LeVan Nonsystematic Perfect codes. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:1, pp:27-34 [Journal ] Josep Rifà Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the n -cube. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:1, pp:35-47 [Journal ] Andrzej Czygrinow , Svatopluk Poljak , Vojtech Rödl Constructive Quasi-Ramsey Numbers and Tournament Ranking. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:1, pp:48-63 [Journal ] Louxin Zhang Optimal Bounds for Matching Routing on Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:1, pp:64-77 [Journal ] Ming-Yang Kao , Stephen R. Tate On-Line Difference Maximization. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:1, pp:78-90 [Journal ] Alberto Caprara Sorting Permutations by Reversals and Eulerian Cycle Decompositions. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:1, pp:91-110 [Journal ] Wilfried Imrich , Sandi Klavzar , Henry Martyn Mulder Median Graphs and Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:1, pp:111-118 [Journal ] Feodor F. Dragan , Falk Nicolai , Andreas Brandstädt Convexity and HHD-Free Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:1, pp:119-135 [Journal ] Brigitte Servatius , Walter Whiteley Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:1, pp:136-153 [Journal ]