|
|
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:1-15 [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:16-27 [Conf]
- Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun
Domination Search on Graphs with Low Dominating-Target-Number. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:28-37 [Conf]
- Christophe Crespelle, Christophe Paul
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:38-48 [Conf]
- Sang-il Oum
Approximating Rank-Width and Clique-Width Quickly. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:49-58 [Conf]
- Omer Giménez, Petr Hlinený, Marc Noy
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:59-68 [Conf]
- Frank Gurski, Egon Wanke
Minimizing NLC-Width is NP-Complete. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:69-80 [Conf]
- Frédéric Havet, Jean-Sébastien Sereni
Channel Assignment and Improper Choosability of Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:81-90 [Conf]
- Daniel Meister
Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:91-102 [Conf]
- Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng
Roman Domination over Some Graph Classes. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:103-114 [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:115-126 [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:127-138 [Conf]
- Emeric Gioan
Complete Graph Drawings Up to Triangle Mutations. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:139-150 [Conf]
- Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan
Collective Tree 1-Spanners for Interval Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:151-162 [Conf]
- Van Bang Le, Raffaele Mosca, Haiko Müller
On Stable Cutsets in Claw-Free Graphs and Planar Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:163-174 [Conf]
- Prosenjit Bose, Vida Dujmovic, David R. Wood
Induced Subgraphs of Bounded Degree and Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:175-186 [Conf]
- Pinar Heggernes, Daniel Lokshtanov
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:187-198 [Conf]
- Anne Berry, Richard Krueger, Geneviève Simonet
Ultimate Generalizations of LexBFS and LEX M. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:199-213 [Conf]
- Stavros D. Nikolopoulos, Leonidas Palios
Adding an Edge in a Cograph. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:214-226 [Conf]
- Michael Gatto, Riko Jacob, Leon Peeters, Anita Schöbel
The Computational Complexity of Delay Management. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:227-238 [Conf]
- Daniel Gonçalves, Mickaël Montassier
Acyclic Choosability of Graphs with Small Maximum Degree. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:239-248 [Conf]
- Shin-Ichi Nakano, Takeaki Uno
Generating Colored Trees. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:249-260 [Conf]
- Ephraim Korach, Margarita Razgon
Optimal Hypergraph Tree-Realization. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:261-270 [Conf]
- Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:271-282 [Conf]
- Peter Damaschke
On the Fixed-Parameter Enumerability of Cluster Editing. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:283-294 [Conf]
- Manuel Bodirsky, Daniel Král
Locally Consistent Constraint Satisfaction Problems with Binary Constraints. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:295-306 [Conf]
- Robert Elsässer, Thomas Sauerwald
On Randomized Broadcasting in Star Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:307-318 [Conf]
- Torsten Tholey
Finding Disjoint Paths on Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:319-330 [Conf]
- Eric Angel, Evripidis Bampis, Laurent Gourvès
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:331-340 [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:341-350 [Conf]
- Erik Jan van Leeuwen
Approximation Algorithms for Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:351-361 [Conf]
- Pascal Berthomé, Sylvain Lebresne, Kim Nguyen
Computation of Chromatic Polynomials Using Triangulations and Clique Trees. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:362-373 [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:374-384 [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:385-396 [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:397-408 [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:409-420 [Conf]
- Ross M. McConnell, Fabien de Montgolfier
Algebraic Operations on PQ Trees and Modular Decomposition Trees. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:421-432 [Conf]
- Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:433-444 [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:445-455 [Conf]
- Stavros D. Nikolopoulos, Leonidas Palios
Recognizing HHDS-Free Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2005, pp:456-467 [Conf]
|
