default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32. WG 2006: Bergen, Norway
- Fedor V. Fomin:
Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers. Lecture Notes in Computer Science 4271, Springer 2006, ISBN 3-540-48381-0 - Hans L. Bodlaender:
Treewidth: Characterizations, Applications, and Computations. 1-14 - Jirí Fiala, Jan Kratochvíl:
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. 15-26 - Jan Foniok, Jaroslav Nesetril, Claude Tardif:
Generalised Dualities and Finite Maximal Antichains. 27-36 - Dániel Marx
:
Chordal Deletion Is Fixed-Parameter Tractable. 37-48 - Christian Knauer, Andreas Spillner:
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. 49-57 - Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Divide-and-Color. 58-67 - Masashi Kiyomi, Shuji Kijima, Takeaki Uno:
Listing Chordal Graphs and Interval Graphs. 68-77 - Serge Gaspers, Mathieu Liedloff:
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. 78-89 - Lukasz Kowalik:
Improved Edge-Coloring with Three Colors. 90-101 - Yasuhiko Takenaga, Kenichi Higashide:
Vertex Coloring of Comparability+ke and -ke Graphs. 102-112 - Seok-Hee Hong, Hiroshi Nagamochi:
Convex Drawings of Graphs with Non-convex Boundary. 113-124 - Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz:
How to Sell a Graph: Guidelines for Graph Retailers. 125-136 - Magnús M. Halldórsson, Ragnar K. Karlsson:
Strip Graphs: Recognition and Scheduling. 137-146 - Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem in Tree and Star Networks. 147-158 - Gaurav Goel, Jens Gustedt:
Bounded Arboricity to Determine the Local Structure of Sparse Graphs. 159-167 - Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell:
An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time. 168-178 - David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
Partitioned Probe Comparability Graphs. 179-190 - Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin:
Computing Graph Polynomials on Graphs of Bounded Clique-Width. 191-204 - Christophe Paul, Andrzej Proskurowski, Jan Arne Telle:
Generation of Graphs with Bounded Branchwidth. 205-216 - Ivan Rapaport, Karol Suchan, Ioan Todinca:
Minimal Proper Interval Completions. 217-228 - Pierre Fraigniaud, Nicolas Nisse:
Monotony Properties of Connected Visible Graph Searching. 229-240 - Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Finding Intersection Models of Weakly Chordal Graphs. 241-255 - Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs. 256-268 - Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez:
Clique Graph Recognition Is NP-Complete. 269-277 - Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. 278-288 - Haim Kaplan, Yahav Nussbaum:
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. 289-300 - Jérémie Chalopin, Daniël Paulusma:
Graph Labelings Derived from Models in Distributed Computing. 301-312 - Miklós Bartha, Miklós Krész:
Flexible Matchings. 313-324 - Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz:
Simultaneous Graph Embeddings with Fixed Edges. 325-335 - Bodo Manthey:
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions. 336-347 - Sylvain Coulonges:
Circular-Perfect Concave-Round Graphs. 348-355
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-20 00:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
