Journals in DBLP
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 ] 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 ] Andreas Brandstädt , Dieter Kratsch On the structure of (P _{5} , gem)-free graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:145, n:2, pp:155-166 [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] Andreas Brandstädt , Hoàng-Oanh Le , Raffaele Mosca Chordal co-gem-free and (P _{5} , gem)-free graphs have bounded clique-width. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:145, n:2, pp:232-241 [Journal ] 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 ] 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 ] 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 ] Zsolt Tuza Strong branchwidth and local transversals. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:145, n:2, pp:291-296 [Journal ] 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 ] 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 ] 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 ] 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 ]