Journals in DBLP

SIAM J. Discrete Math.
1999, volume: 12, number: 3

1. Vineet Bafna, Piotr Berman, Toshihiro Fujito
   A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1999, v:12, n:3, pp:289-297 [Journal]
   
2. Todd G. Will
   Switching Distance Between Graphs with the Same Degrees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1999, v:12, n:3, pp:298-306 [Journal]
   
3. Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West
   Edge-Bandwidth of Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1999, v:12, n:3, pp:307-316 [Journal]
   
4. Xin He, Ming-Yang Kao, Hsueh-I Lu
   Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1999, v:12, n:3, pp:317-325 [Journal]
   
5. G. Bolotashvili, M. Kovalev, E. Girlich
   New Facets of the Linear Ordering Polytope. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1999, v:12, n:3, pp:326-336 [Journal]
   
6. Hikoe Enomoto, Miki Shimabara Miyauchi
   Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1999, v:12, n:3, pp:337-341 [Journal]
   
7. Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
   Finding Subsets Maximizing Minimum Structures. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1999, v:12, n:3, pp:342-359 [Journal]
   
8. Stefan Felsner, Klaus Reuter
   The Linear Extension Diameter of a Poset. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1999, v:12, n:3, pp:360-373 [Journal]
   
9. Jan Kratochvíl, Zsolt Tuza
   Rankings of Directed Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1999, v:12, n:3, pp:374-384 [Journal]
   
10. András Gyárfás, Zoltán Király, Jenö Lehel
    On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:385-411 [Journal]
    
11. Russell Merris
    Note: An Upper Bound for the Diameter of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:412-412 [Journal]