22. WG 1996: Cadenabbia (Como), Italy

• Andrew Chi-Chih Yao:
  Hypergraphs and Decision Trees (Abstract). 1
  
• Paola Alimonti, Tiziana Calamoneri:
  Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. 2-16
  
• Luitpold Babel, Stephan Olariu:
  A New Characterization of P4-connected Graphs. 17-30
  
• Michel Bauderon, Hélène Jacquet:
  Node Rewriting in Hypergraphs. 31-43
  
• Sergei L. Bezrukov:
  On k-Partitioning the n-Cube. 44-55
  
• Adrienne L. Broadwater, Kemal Efe, Antonio Fernández:
  Embedding Complete Binary Trees in Product Graphs. 56-66
  
• Krzysztof Brys, Zbigniew Lonc:
  Clique and Anticlique Partition of Graphs. 67-72
  
• Chi-Chang Chen, Jianer Chen:
  Optimal Parallel Routing in Star Graphs. 73-84
  
• Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese:
  Counting Edges in a Dag. 85-100
  
• Ornella Ciotti, Francesco Parisi-Presicce:
  Closure Properties of Context-Tree Hyperedge Replacement Systems. 101-113
  
• Pierluigi Crescenzi, Paolo Penna:
  Upward Drawings of Search Trees (Extended Abstract). 114-125
  
• Krzysztof Diks, Torben Hagerup:
  More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. 126-140
  
• Krzysztof Diks, Andrzej Pelc:
  System Diagnosis with Smallest Risk of Error. 141-150
  
• Hristo Djidjev:
  On-Line Algorithms for Shortest Path Problems on Planar Digraphs. 151-165
  
• Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt:
  LexBFS-Orderings and Power of Graphs. 166-180
  
• Jens Gustedt:
  Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract). 181-195
  
• Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz:
  Switchbox Routing in VLSI Design: Closing the Complexity Gap. 196-210
  
• Michel Hurfin, Michel Raynal:
  Detecting Diamond Necklaces in Labeled Dags (A Problem from Distributed Debugging). 211-223
  
• Wolfram Kahl:
  Algebraic Graph Derivations for Graphical Calculi. 224-238
  
• Damon Kaller:
  Definability Equals Recognizability of Partial 3-Trees. 239-253
  
• Bettina Klinz, Gerhard J. Woeginger:
  One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. 254-267
  
• Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg:
  Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). 268-278
  
• Leo G. Kroon, Arunabha Sen, Haiyong Deng, Asim Roy:
  The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs. 279-292
  
• Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister:
  Modifying Networks to Obtain Low Cost Trees. 293-307
  
• Ewa Malesinska, Alessandro Panconesi:
  On the Hardness of Allocating Frequencies for Hybrid Networks. 308-322
  
• Falk Nicolai, Thomas Szymczak:
  Homogeneous Sets and Domination Problems. 323-337
  
• Koji Obokata, Yukihiro Iwasaki, Feng Bao, Yoshihide Igarashi:
  Independent Spanning Trees of Product Graphs. 338-351
  
• Swamy K. Sitarama, Abdol-Hossein Esfahanian:
  Designing Distance-Preserving Fault-Tolerant Topologies. 352-366
  
• Tadao Takaoka:
  Shortest Path Algorithms for Nearly Acyclic Directed Graphs. 367-374
  
• Spyros Tragoudas, Yaakov L. Varol:
  Computing Disjoint Path with Lenght Constraints. 375-389
  
• Xiao Zhou, Abul Kashem, Takao Nishizeki:
  Generalized Edge-Ranking of Trees (Extended Abstract). 390-404