27. WG 2001:
Boltenhagen,
Germany
Andreas Brandstädt, Van Bang Le (Eds.):
Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings.
Lecture Notes in Computer Science 2204 Springer 2001, ISBN 3-540-42707-4 BibTeX
- Hans-Jürgen Bandelt:
Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces.
1-7
Electronic Edition (Springer LINK) BibTeX
- Friedhelm Meyer auf der Heide:
Invited Presentation: Data Management in Networks.
8
Electronic Edition (Springer LINK) BibTeX
- Sergei L. Bezrukov, Robert Elsässer:
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs.
9-20
Electronic Edition (Springer LINK) BibTeX
- Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano:
Approximate Constrained Bipartite Edge Coloring.
21-31
Electronic Edition (Springer LINK) BibTeX
- Maw-Shang Chang, Ton Kloks, Chuan-Min Lee:
Maximum Clique Transversals.
32-43
Electronic Edition (Springer LINK) BibTeX
- Maw-Shang Chang, Haiko Müller:
On the Tree-Degree of Graphs.
44-54
Electronic Edition (Springer LINK) BibTeX
- Jianer Chen, Iyad A. Kanj:
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms.
55-65
Electronic Edition (Springer LINK) BibTeX
- Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano:
(k, +)-Distance-Hereditary Graphs.
66-77
Electronic Edition (Springer LINK) BibTeX
- Derek G. Corneil, Udi Rotics:
On the Relationship between Clique-Width and Treewidth.
78-90
Electronic Edition (Springer LINK) BibTeX
- Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner:
Planarity of the 2-Level Cactus Model.
91-102
Electronic Edition (Springer LINK) BibTeX
- Feodor F. Dragan:
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach.
103-116
Electronic Edition (Springer LINK) BibTeX
- Wolfgang Espelage, Frank Gurski, Egon Wanke:
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.
117-128
Electronic Edition (Springer LINK) BibTeX
- Haodi Feng:
(g, f)-Factorizations Orthogonal to k Subgraphs.
129-139
Electronic Edition (Springer LINK) BibTeX
- Guillaume Fertin, André Raspaud, Bruce A. Reed:
On Star Coloring of Graphs.
140-153
Electronic Edition (Springer LINK) BibTeX
- Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel:
Graph Subcolorings: Complexity and Algorithms.
154-165
Electronic Edition (Springer LINK) BibTeX
- Fedor V. Fomin, Hans L. Bodlaender:
Approximation of Pathwidth of Outerplanar Graphs.
166-176
Electronic Edition (Springer LINK) BibTeX
- Fedor V. Fomin, Dimitrios M. Thilikos:
On the Monotonicity of Games Generated by Symmetric Submodular Functions.
177-188
Electronic Edition (Springer LINK) BibTeX
- Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth:
Multiple Hotlink Assignment.
189-200
Electronic Edition (Springer LINK) BibTeX
- Cyril Gavoille, David Peleg, André Raspaud, Eric Sopena:
Small k-Dominating Sets in Planar Graphs with Applications.
201-216
Electronic Edition (Springer LINK) BibTeX
- Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel:
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem.
217-228
Electronic Edition (Springer LINK) BibTeX
- Öjvind Johansson:
log n-Approximative NLCk-Decomposition in O(n2k+1) Time.
229-240
Electronic Edition (Springer LINK) BibTeX
- Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart:
On Subfamilies of AT-Free Graphs.
241-253
Electronic Edition (Springer LINK) BibTeX
- Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger:
Complexity of Coloring Graphs without Forbidden Induced Subgraphs.
254-262
Electronic Edition (Springer LINK) BibTeX
- Van Bang Le, Bert Randerath:
On Stable Cutsets in Line Graphs.
263-271
Electronic Edition (Springer LINK) BibTeX
- Eunseuk Oh, Jianer Chen:
On Strong Menger-Connectivity of Star Graphs.
272-283
Electronic Edition (Springer LINK) BibTeX
- Maurizio Patrignani, Maurizio Pizzonia:
The Complexity of the Matching-Cut Problem.
284-295
Electronic Edition (Springer LINK) BibTeX
- Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger:
De Bruijn Graphs and DNA Graphs.
296-305
Electronic Edition (Springer LINK) BibTeX
- Antonio Puricella, Iain A. Stewart:
A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness.
306-316
Electronic Edition (Springer LINK) BibTeX
- Annegret Wagler:
Critical and Anticritical Edges in Perfect Graphs.
317-328
Electronic Edition (Springer LINK) BibTeX
Copyright © Sat May 16 23:47:49 2009
by Michael Ley (ley@uni-trier.de)