Journals in DBLP

Discrete Applied Mathematics
2005, volume: 145, number: 2

1. Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra
   Structural decompositions, width parameters, and graph labelings. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2005, v:145, n:2, pp:141-142 [Journal]
   
2. Hans L. Bodlaender, Fedor V. Fomin
   Tree decompositions with small cost. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2005, v:145, n:2, pp:143-154 [Journal]
   
3. Andreas Brandstädt, Dieter Kratsch
   On the structure of (P₅, gem)-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2005, v:145, n:2, pp:155-166 [Journal]
   
4. Reinhard Diestel, Daniela Kühn
   Graph minor hierarchies. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2005, v:145, n:2, pp:167-182 [Journal]
   
5. Michel Habib, Christophe Paul
   A simple linear time algorithm for cograph recognition. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2005, v:145, n:2, pp:183-197 [Journal]
   
6. Ross M. McConnell, Fabien de Montgolfier
   Linear-time modular decomposition of directed graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2005, v:145, n:2, pp:198-209 [Journal]
   
7. Jan Arne Telle
   Tree-decompositions of small pathwidth. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2005, v:145, n:2, pp:210-218 [Journal]
   
8. Jochen Alber, Frederic Dorn, Rolf Niedermeier
   Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2005, v:145, n:2, pp:219-231 [Journal]
   
9. Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
   Chordal co-gem-free and (P₅, gem)-free graphs have bounded clique-width. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2005, v:145, n:2, pp:232-241 [Journal]
   
10. Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
    Embeddings of k-connected graphs of pathwidth k. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:242-265 [Journal]
    
11. Ton Kloks, Jan Kratochvíl, Haiko Müller
    Computing the branchwidth of interval graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:266-275 [Journal]
    
12. Johann A. Makowsky
    Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:276-290 [Journal]
    
13. Zsolt Tuza
    Strong branchwidth and local transversals. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:291-296 [Journal]
    
14. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    The restrictive H-coloring problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:297-305 [Journal]
    
15. Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
    Systems of distant representatives. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:306-316 [Journal]
    
16. Pranava K. Jha, Sandi Klavzar, Aleksander Vesel
    L(2, 1)-labeling of direct product of paths and cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:317-325 [Journal]
    
17. Daniel Král
    An exact algorithm for the channel assignment problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:326-331 [Journal]