25. WG 1999: Ascona, Switzerland

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

Last update Fri May 25 08:48:50 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page