default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29. WG 2003: Elspeet, The Netherlands
- Hans L. Bodlaender:
Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers. Lecture Notes in Computer Science 2880, Springer 2003, ISBN 3-540-20452-0
Invited Lectures
- Michael R. Fellows:
Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. 1-12 - Alexander Schrijver:
Matching, Edge-Colouring, and Dimers. 13-22
Regular Papers
- Claudio Arbib
, Michele Flammini, Fabrizio Marinelli:
Minimum Flow Time Graph Ordering. 23-33 - Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos:
Searching Is Not Jumping. 34-45 - Simon M. Becker, Bernhard Westfechtel:
Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars. 46-57 - Anne Berry, Pinar Heggernes, Geneviève Simonet:
The Minimum Degree Heuristic and the Minimal Triangulation Process. 58-70 - Pascal Berthomé, Madiagne Diallo, Afonso Ferreira:
Generalized Parametric Multi-terminal Flows Problem. 71-80 - Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. 81-92 - Paul S. Bonsma:
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes. 93-105 - Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara:
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. 106-118 - Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul:
A Simple Linear Time LexBFS Cograph Recognition Algorithm. 119-130 - Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
Backbone Colorings for Networks. 131-142 - Paz Carmi, Thomas Erlebach, Yoshio Okamoto:
Greedy Edge-Disjoint Paths in Complete Graphs. 143-155 - Christian S. Collberg, Stephen G. Kobourov, Edward Carter, Clark D. Thomborson:
Graph-Based Approaches to Software Watermarking. 156-167 - Sabine Cornelsen, Dorothea Wagner:
Completely Connected Clustered Graphs. 168-179 - Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond:
An FPT Algorithm for Set Splitting. 180-191 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Drawing Planar Graphs on a Curve. 192-204 - Vida Dujmovic, David R. Wood:
Tree-Partitions of k-Trees with Applications in Graph Layout. 205-217 - Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos:
Resource Allocation Problems in Multifiber WDM Tree Networks. 218-229 - Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto:
An Improved Upper Bound on the Crossing Number of the Hypercube. 230-236 - Alexander Glikson, Johann A. Makowsky:
NCE Graph Grammars and Clique-Width. 237-248 - Martin Charles Golumbic, Marina Lipshteyn:
Chordal Probe Graphs. 249-260 - Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher:
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). 261-272 - Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller:
On the Recognition of General Partition Graphs. 273-283 - Lukasz Kowalik:
Short Cycles in Planar Graphs. 284-296 - Jan Kratochvíl:
Complexity of Hypergraph Coloring and Seidel's Switching. 297-308 - Dieter Kratsch, Haiko Müller, Ioan Todinca:
Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. 309-321 - Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The Complexity of Graph Contractions. 322-333 - Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel:
Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs. 334-345 - Cécile Murat, Vangelis Th. Paschos:
The Probabilistic Minimum Coloring Problem. 346-357 - Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing Bipolarizable and P 4-Simplicial Graphs. 358-369 - Ioan Todinca:
Coloring Powers of Graphs of Bounded Clique-Width. 370-382
Erratum
- Franz-Josef Brandenburg:
Erratum: Cycles in Generalized Networks. 383
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 2024-11-11 21:14 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:
