
Conferences in DBLP
 Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello
Hypertree Decompositions: Structure, Algorithms, and Applications. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:115 [Conf]
 Mathilde Bouvel, Vladimir Grebinski, Gregory Kucherov
Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:1627 [Conf]
 Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun
Domination Search on Graphs with Low DominatingTargetNumber. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:2837 [Conf]
 Christophe Crespelle, Christophe Paul
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:3848 [Conf]
 Sangil Oum
Approximating RankWidth and CliqueWidth Quickly. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:4958 [Conf]
 Omer Giménez, Petr Hlinený, Marc Noy
Computing the Tutte Polynomial on Graphs of Bounded CliqueWidth. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:5968 [Conf]
 Frank Gurski, Egon Wanke
Minimizing NLCWidth is NPComplete. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:6980 [Conf]
 Frédéric Havet, JeanSébastien Sereni
Channel Assignment and Improper Choosability of Graphs. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:8190 [Conf]
 Daniel Meister
Computing Treewidth and Minimum FillIn for Permutation Graphs in Linear Time. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:91102 [Conf]
 Mathieu Liedloff, Ton Kloks, Jiping Liu, ShengLung Peng
Roman Domination over Some Graph Classes. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:103114 [Conf]
 Jirí Fiala, Daniël Paulusma, Jan Arne Telle
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:115126 [Conf]
 Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram
Network Discovery and Verification. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:127138 [Conf]
 Emeric Gioan
Complete Graph Drawings Up to Triangle Mutations. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:139150 [Conf]
 Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan
Collective Tree 1Spanners for Interval Graphs. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:151162 [Conf]
 Van Bang Le, Raffaele Mosca, Haiko Müller
On Stable Cutsets in ClawFree Graphs and Planar Graphs. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:163174 [Conf]
 Prosenjit Bose, Vida Dujmovic, David R. Wood
Induced Subgraphs of Bounded Degree and Bounded Treewidth. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:175186 [Conf]
 Pinar Heggernes, Daniel Lokshtanov
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:187198 [Conf]
 Anne Berry, Richard Krueger, Geneviève Simonet
Ultimate Generalizations of LexBFS and LEX M. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:199213 [Conf]
 Stavros D. Nikolopoulos, Leonidas Palios
Adding an Edge in a Cograph. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:214226 [Conf]
 Michael Gatto, Riko Jacob, Leon Peeters, Anita Schöbel
The Computational Complexity of Delay Management. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:227238 [Conf]
 Daniel Gonçalves, Mickaël Montassier
Acyclic Choosability of Graphs with Small Maximum Degree. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:239248 [Conf]
 ShinIchi Nakano, Takeaki Uno
Generating Colored Trees. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:249260 [Conf]
 Ephraim Korach, Margarita Razgon
Optimal Hypergraph TreeRealization. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:261270 [Conf]
 Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
FixedParameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:271282 [Conf]
 Peter Damaschke
On the FixedParameter Enumerability of Cluster Editing. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:283294 [Conf]
 Manuel Bodirsky, Daniel Král
Locally Consistent Constraint Satisfaction Problems with Binary Constraints. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:295306 [Conf]
 Robert Elsässer, Thomas Sauerwald
On Randomized Broadcasting in Star Graphs. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:307318 [Conf]
 Torsten Tholey
Finding Disjoint Paths on Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:319330 [Conf]
 Eric Angel, Evripidis Bampis, Laurent Gourvès
Approximation Algorithms for the Bicriteria Weighted maxcut Problem. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:331340 [Conf]
 Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson
Approximation Algorithms for the Weighted Independent Set Problem. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:341350 [Conf]
 Erik Jan van Leeuwen
Approximation Algorithms for Unit Disk Graphs. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:351361 [Conf]
 Pascal Berthomé, Sylvain Lebresne, Kim Nguyen
Computation of Chromatic Polynomials Using Triangulations and Clique Trees. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:362373 [Conf]
 Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca
Computing Branchwidth Via Efficient Triangulations and Blocks. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:374384 [Conf]
 Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
Algorithms Based on the Treewidth of Sparse Graphs. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:385396 [Conf]
 Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
Extending the Tractability Border for Closest Leaf Powers. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:397408 [Conf]
 Joachim Giesen, Dieter Mitsche
Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:409420 [Conf]
 Ross M. McConnell, Fabien de Montgolfier
Algebraic Operations on PQ Trees and Modular Decomposition Trees. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:421432 [Conf]
 Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
LinearTime Counting Algorithms for Independent Sets in Chordal Graphs. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:433444 [Conf]
 Anne Berry, Alain Sigayret, Jeremy Spinrad
Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:445455 [Conf]
 Stavros D. Nikolopoulos, Leonidas Palios
Recognizing HHDSFree Graphs. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:456467 [Conf]
