Journals in DBLP

SIAM J. Discrete Math.
2005, volume: 19, number: 1

1. Harold N. Gabow
   An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2005, v:19, n:1, pp:1-18 [Journal]
   
2. Michael Drmota, Hsien-Kuei Hwang
   Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2005, v:19, n:1, pp:19-45 [Journal]
   
3. Gunnar Forst, Anders Thorup
   What Costs Are Minimized by Huffman Trees? [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2005, v:19, n:1, pp:46-68 [Journal]
   
4. Yael Ben-Haim, Simon Litsyn
   Exact Minimum Density of Codes Identifying Vertices in the Square Grid. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2005, v:19, n:1, pp:69-82 [Journal]
   
5. Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju
   On Equitable Coloring of d-Degenerate Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2005, v:19, n:1, pp:83-95 [Journal]
   
6. Eyal Kushilevitz, Yishay Mansour
   Computation in Noisy Radio Networks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2005, v:19, n:1, pp:96-108 [Journal]
   
7. Marc Chardon, Aziz Moukrim
   The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2005, v:19, n:1, pp:109-121 [Journal]
   
8. Gabriel Robins, Alexander Zelikovsky
   Tighter Bounds for Graph Steiner Tree Approximation. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2005, v:19, n:1, pp:122-134 [Journal]
   
9. Tomás Dvorák
   Hamiltonian Cycles with Prescribed Edges in Hypercubes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2005, v:19, n:1, pp:135-144 [Journal]
   
10. Sylvia B. Encheva
    On Projective Codes Satisfying the Chain Condition. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:145-148 [Journal]
    
11. Robert W. Chen, Alan Zame, Chien-Tai Lin, Hsiu-fen Wu
    A Random Version of Shepp's Urn Scheme. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:149-164 [Journal]
    
12. James A. Muir, Douglas R. Stinson
    Alternative Digit Sets for Nonadjacent Representations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:165-191 [Journal]
    
13. Peter Braß
    An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:192-195 [Journal]
    
14. Rongquan Feng, Jin Ho Kwak, Young Soo Kwon
    Enumerating Typical Circulant Covering Projections Onto a Circulant Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:196-207 [Journal]
    
15. John P. Georges, David W. Mauro
    On the Structure of Graphs with Non-Surjective L(2, 1)-Labelings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:208-223 [Journal]