Journals in DBLP

Discrete Applied Mathematics
2003, volume: 129, number: 2-3

1. Lali Barrière
   Symmetry properties of chordal rings of degree 3. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:211-232 [Journal]
   
2. András A. Benczúr
   Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:233-262 [Journal]
   
3. Martina Bosíková
   Minimum 3-geodetically connected graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:263-283 [Journal]
   
4. Andreas Brandstädt, Feodor F. Dragan
   On linear and circular structure of (claw, net)-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:285-303 [Journal]
   
5. Peter Dankelmann, Ortrud Oellermann
   Bounds on the average connectivity of a graph. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:305-318 [Journal]
   
6. Italo J. Dejter, Oriol Serra
   Efficient dominating sets in Cayley graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:319-328 [Journal]
   
7. Guoli Ding, Peter P. Chen
   Generating r-regular graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:329-343 [Journal]
   
8. Fedor V. Fomin, Petr A. Golovach
   Interval degree and bandwidth of a graph. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:345-359 [Journal]
   
9. Krzysztof Giaro, Robert Janczewski, Michal Malafiejski
   The complexity of the T-coloring problem for graphs with small degree. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:361-369 [Journal]
   
10. Krzysztof Giaro, Robert Janczewski, Michal Malafiejski
    A polynomial algorithm for finding T-span of generalized cacti. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:371-382 [Journal]
    
11. Xiaofeng Guo, Fuji Zhang
    Planar k-cycle resonant graphs with k=1, 2. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:383-397 [Journal]
    
12. Harri Haanpää, Patric R. J. Östergård
    Classification of whist tournaments with up to 12 players. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:399-407 [Journal]
    
13. Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn
    Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:409-419 [Journal]
    
14. Hua-Min Huang, Frank K. Hwang, Jian-Feng Ma
    Using transforming matrices to generate DNA clone grids. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:421-431 [Journal]
    
15. Yoshiyuki Karuno, Hiroshi Nagamochi
    2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:433-447 [Journal]
    
16. Sandi Klavzar, Aleksander Vesel
    Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:449-460 [Journal]
    
17. Hiroshi Nagamochi, Toshimasa Ishii
    On the minimum local-vertex-connectivity augmentation in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:475-486 [Journal]
    
18. M. Nakamura
    Excluded-minor characterizations of antimatroids arisen from posets and graph searches. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:487-498 [Journal]
    
19. Eunseuk Oh, Jianer Chen
    On strong Menger-connectivity of star graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:499-511 [Journal]
    
20. Gregory Gutin, Alek Vainshtein, Anders Yeo
    Domination analysis of combinatorial optimization problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:513-520 [Journal]
    
21. Andreas Brandstädt, Raffaele Mosca
    On variations of P₄-sparse graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:521-532 [Journal]
    
22. Gregory Gutin, Anders Yeo
    Upper bounds on ATSP neighborhood size. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:533-538 [Journal]
    
23. Romeo Rizzi
    A simple minimum T-cut algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:539-544 [Journal]
    
24. John C. Wierman
    Pairs of graphs with site and bond percolation critical probabilities in opposite orders. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:545-548 [Journal]