26. WG 2000: Konstanz, Germany

• Ingo Wegener:
  On the Expected Runtime and the Success Probability of Evolutionary Algorithms. 1-10
  
• Emo Welzl:
  n Points and One Line: Analysis of Randomized Games. 11-12
  
• Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela:
  Approximating Call-Scheduling Makespan in All-Optical Networks. 13-22
  
• Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich:
  New Spectral Lower Bounds on the Bisection Width of Graphs. 23-34
  
• Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar:
  Traversing Directed Eulerian Mazes. 35-46
  
• Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto:
  On the Space and Access Complexity of Computation DAGs. 47-58
  
• Vincent Bouchitté, Ioan Todinca:
  Approximating the Treewidth of AT-Free Graphs. 59-70
  
• Andreas Brandstädt, Van Bang Le:
  Split-Perfect Graphs: Characterizations and Algorithmic Use. 71-82
  
• Edson Cáceres, Albert Chan, Frank K. H. A. Dehne, Giuseppe Prencipe:
  Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs. 83-94
  
• Serafino Cicerone, Gabriele Di Stefano:
  Networks with Small Stretch Number. 95-106
  
• Peter Damaschke:
  Efficient Dispersion Algorithms for Geometric Intersection Graphs. 107-115
  
• Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth:
  Optimizing Cost Flows by Modifying Arc Costs and Capacities. 116-126
  
• Michael J. Dinneen, Bakhadyr Khoussainov:
  Update Networks and Their Routing Strategies. 127-136
  
• Stefan Dobrev:
  Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults. 137-148
  
• Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto:
  Diameter of the Knödel Graph. 149-160
  
• Fedor V. Fomin, Dieter Kratsch, Haiko Müller:
  On the Domination Search Number. 161-171
  
• Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro:
  Efficient Communication in Unknown Networks. 172-183
  
• Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle:
  Graph Coloring on a Coarse Grained Multiprocessor. 184-195
  
• Frank Gurski, Egon Wanke:
  The Tree-Width of Clique-Width Bounded Graphs Without K_{n, n}. 196-205
  
• Dagmar Handke, Guy Kortsarz:
  Tree Spanners for Subgraphs and Related Tree Covering Problems. 206-217
  
• Jean-Michel Hélary, Giovanna Melideo:
  Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization. 218-229
  
• Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
  The Expressive Power and Complexity of Dynamic Process Graphs. 230-242
  
• Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller:
  Bandwidth of Split and Circular Permutation Graphs. 243-254
  
• Ekkehard Köhler:
  Recognizing Graphs without Asteroidal Triples. 255-266
  
• Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe:
  Budget Constrained Minimum Cost Connected Medians. 267-278
  
• Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss:
  Coloring Mixed Hypertrees. 279-289
  
• Sayaka Nagai, Shin-Ichi Nakano:
  A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs. 290-301
  
• Koichi Wada, Wei Chen:
  Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables. 302-313