Journals in DBLP

Discrete Applied Mathematics
2004, volume: 136, number: 2-3

1. Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann Hurink
   Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:159-160 [Journal]
   
2. Jørgen Bang-Jensen, Anders Yeo
   Making a tournament k-arc-strong by reversing or deorienting arcs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:161-171 [Journal]
   
3. Paul S. Bonsma
   Sparsest cuts and concurrent flows in product graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:173-182 [Journal]
   
4. Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca
   On treewidth approximations. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:183-196 [Journal]
   
5. Paolo Detti, Carlo Meloni
   A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:197-215 [Journal]
   
6. Thomas Epping, Winfried Hochstättler, Peter Oertel
   Complexity results on a paint shop problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:217-226 [Journal]
   
7. Irene Finocchi, Rossella Petreschi
   Divider-based algorithms for hierarchical tree partitioning. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:227-247 [Journal]
   
8. Sounaka Mishra, Kripasindhu Sikdar
   On approximability of linear ordering and related NP-optimization problems on graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:249-269 [Journal]
   
9. Sven Peyer, Martin Zachariasen, David Grove Jørgensen
   Delay-related secondary objectives for rectilinear Steiner minimum trees. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:271-298 [Journal]
   
10. Bert Randerath, Ingo Schiermeyer
    3-Colorability in P for P₆-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:299-313 [Journal]
    
11. Jens Schreyer, Hansjoachim Walther
    Edge-oblique polyhedral graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:315-327 [Journal]
    
12. Ron Shamir, Roded Sharan
    A fully dynamic algorithm for modular decomposition and recognition of cographs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:329-340 [Journal]
    
13. Oswaldo Vernet, Lilian Markenzon
    Solving problems for maximal reducible flowgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:341-348 [Journal]
    
14. Ligong Wang, Xueliang Li, Shenggui Zhang
    Families of integral trees with diameters 4, 6, and 8. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:349-362 [Journal]
    
15. Xuehou Tan
    Approximation algorithms for the watchman route and zookeeper's problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:363-376 [Journal]
    
16. Blaz Zmazek, Janez Zerovnik
    The obnoxious center problem on weighted cactus graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:377-386 [Journal]