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