Journals in DBLP

Discrete Applied Mathematics
2003, volume: 131, number: 1

1. Hans L. Bodlaender, Richard B. Tan, Jan van Leeuwen
   Finding a bigtriangleup-regular supergraph of minimum order. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:1, pp:3-9 [Journal]
   
2. Vincent Bouchitté, Ioan Todinca
   Approximating the treewidth of AT-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:1, pp:11-37 [Journal]
   
3. Andreas Brandstädt, Chính T. Hoàng, Van Bang Le
   Stability number of bull- and chair-free graphs revisited. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:1, pp:39-50 [Journal]
   
4. Bostjan Bresar, Wilfried Imrich, Sandi Klavzar
   Fast recognition algorithms for classes of partial cubes. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:1, pp:51-61 [Journal]
   
5. Leizhen Cai
   The complexity of the locally connected spanning tree problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:1, pp:63-75 [Journal]
   
6. Eowyn Cenek, Lorna Stewart
   Maximum independent set and maximum clique algorithms for overlap graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:1, pp:77-91 [Journal]
   
7. Victor Chepoi, Feodor F. Dragan
   Finding a central vertex in an HHD-free graph. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:1, pp:93-11 [Journal]
   
8. Harold S. Connamacher, Andrzej Proskurowski
   The complexity of minimizing certain cost metrics for k-source spanning trees. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:1, pp:113-127 [Journal]
   
9. Bruno Courcelle, R. Vanicat
   Query efficient implementation of graphs of bounded clique-width. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:1, pp:129-150 [Journal]
   
10. Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart
    MAD trees and distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:151-167 [Journal]
    
11. Wenceslas Fernandez de la Vega, M. Lamari
    The task allocation problem with constant communication. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:169-177 [Journal]
    
12. Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle
    Graph coloring on coarse grained multicomputers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:179-198 [Journal]
    
13. Hoàng-Oanh Le, Van Bang Le, Haiko Müller
    Splitting a graph into disjoint induced paths or cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:199-212 [Journal]
    
14. Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
    Characterization of optimal key set protocols. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:213-236 [Journal]
    
15. Gerhard J. Woeginger
    On the approximability of average completion time scheduling under precedence constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:237-252 [Journal]