25. WG 1999:
Ascona,
Switzerland
Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz (Eds.):
Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings.
Lecture Notes in Computer Science 1665 Springer 1999, ISBN 3-540-66731-8 BibTeX
- Hartmut Noltemeier:
Invited Lecture: Silver Graphs: Achievements and New Challenges.
1-9
Electronic Edition (Springer LINK) BibTeX
- Susanne Albers:
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts.
10-26
Electronic Edition (Springer LINK) BibTeX
- Thomas Lengauer:
Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and Car Manufacturing Industries.
27-28
Electronic Edition (Springer LINK) BibTeX
- Nicola Santoro:
Informatica, Scoula, Communità: Uno Sguardo dall' Occhio del Ciclone.
29 BibTeX
- David Peleg:
Proximity-Preserving Labeling Schemes and Their Applications.
30-41
Electronic Edition (Springer LINK) BibTeX
- Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth:
Euler is Standing in Line.
42-54
Electronic Edition (Springer LINK) BibTeX
- Sascha Ott:
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2.
55-64
Electronic Edition (Springer LINK) BibTeX
- Assaf Natanzon, Ron Shamir, Roded Sharan:
Complexity Classification of Some Edge Modification Problems.
65-77
Electronic Edition (Springer LINK) BibTeX
- Hans-Christoph Wirth, Jan Steffan:
On Minimum Diameter Spanning Trees under Reload Costs.
78-88
Electronic Edition (Springer LINK) BibTeX
- Michele Zito:
Induced Matchings in Regular Graphs and Trees.
89-100
Electronic Edition (Springer LINK) BibTeX
- Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Mod-2 Independence and Domination in Graphs.
101-109
Electronic Edition (Springer LINK) BibTeX
- Öjvind Johansson:
NLC2-Decomposition in Polynomial Time.
110-121
Electronic Edition (Springer LINK) BibTeX
- Benno Stein, Oliver Niggemann:
On the Nature of Structure and Its Identification.
122-134
Electronic Edition (Springer LINK) BibTeX
- Martin Charles Golumbic, Udi Rotics:
On the Clique-Width of Perfect Graph Classes.
135-147
Electronic Edition (Springer LINK) BibTeX
- Ljubomir Perkovic, Bruce A. Reed:
An Improved Algorithm for Finding Tree Decompositions of Small Width.
148-154
Electronic Edition (Springer LINK) BibTeX
- Konstantin Skodinis:
Efficient Analysis of Graphs with Small Minimal Separators.
155-166
Electronic Edition (Springer LINK) BibTeX
- Anne Berry, Jean Paul Bordat, Olivier Cogis:
Generating All the Minimal Separators of a Graph.
167-172
Electronic Edition (Springer LINK) BibTeX
- Stefan Dobrev, Imrich Vrto:
Two Broadcasting Problems in Faulty Hypercubes.
173-178
Electronic Edition (Springer LINK) BibTeX
- Olivier Baudon, Guillaume Fertin, Ivan Havel:
Routing Permutations in the Hypercube.
179-190
Electronic Edition (Springer LINK) BibTeX
- Koichi Wada, Yoriyuki Nagata, Wei Chen:
An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs.
191-201
Electronic Edition (Springer LINK) BibTeX
- Paola Flocchini, Frédéric Geurts, Nicola Santoro:
Optimal Irreversible Dynamos in Chordal Rings.
202-214
Electronic Edition (Springer LINK) BibTeX
- Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille:
Recognizing Bipartite Incident-Graphs of Circulant Digraphs.
215-227
Electronic Edition (Springer LINK) BibTeX
- Sergei L. Bezrukov, Sajal K. Das, Robert Elsässer:
Optimal Cuts for Powers of the Petersen Graph.
228-239
Electronic Edition (Springer LINK) BibTeX
- Jung-Heum Park, Hee-Chul Kim:
Dihamiltonian Decomposition of Regular Graphs with Degree Three.
240-249
Electronic Edition (Springer LINK) BibTeX
- Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Box-Rectangular Drawings of Plane Graphs.
250-261
Electronic Edition (Springer LINK) BibTeX
- Ronny Hadany, David Harel:
A Multi-Scale Algorithm for Drawing Graphs Nicely.
262-277
Electronic Edition (Springer LINK) BibTeX
- Anna Accornero, Massimo Ancona, Sonia Varini:
All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time.
278-290
Electronic Edition (Springer LINK) BibTeX
- Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna:
Linear Orderings of Random Geometric Graphs.
291-302
Electronic Edition (Springer LINK) BibTeX
- Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Finding Smallest Supertrees Under Minor Containment.
303-312
Electronic Edition (Springer LINK) BibTeX
- Jianer Chen, Iyad A. Kanj, Weijia Jia:
Vertex Cover: Further Observations and Further Improvements.
313-324
Electronic Edition (Springer LINK) BibTeX
- Annegret Liebers, Dorothea Wagner, Karsten Weihe:
On the Hardness of Recognizing Bundles in Time Table Graphs.
325-337
Electronic Edition (Springer LINK) BibTeX
- Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen:
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition.
338-349
Electronic Edition (Springer LINK) BibTeX
- Jirí Fiala, Ton Kloks, Jan Kratochvíl:
Fixed-Parameter Complexity of lambda-Labelings.
350-363
Electronic Edition (Springer LINK) BibTeX
- Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler:
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs.
364-376
Electronic Edition (Springer LINK) BibTeX
- Harald Hempel, Dieter Kratsch:
On Claw-Free Asteroidal Triple-Free Graphs.
377-390
Electronic Edition (Springer LINK) BibTeX
- Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani:
Vertex Partitioning of Crown-Free Interval Graphs.
391-401
Electronic Edition (Springer LINK) BibTeX
- Igor Parfenoff, Florian Roussel, Irena Rusu:
Triangulated Neighbourhoods in C4-Free Berge Graphs.
402-412
Electronic Edition (Springer LINK) BibTeX
Copyright © Sat May 16 23:47:49 2009
by Michael Ley (ley@uni-trier.de)