23. WG 1997:
Berlin,
Germany
Rolf H. Möhring (Ed.):
Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings.
Lecture Notes in Computer Science 1335 Springer 1997, ISBN 3-540-63757-5 BibTeX
- David P. Williamson:
Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture).
1 BibTeX
- Paola Alimonti:
Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT.
2-14 BibTeX
- Helmut Alt, Ulrich Fuchs, Klaus Kriegel:
On the Number of Simple Cycles in Planar Graphs.
15-24 BibTeX
- Luitpold Babel, Stephan Olariu:
On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract).
25-37 BibTeX
- Luitpold Babel, Gerhard J. Woeginger:
Pseudo-Hamiltonian Graphs.
38-51 BibTeX
- Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes:
Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract).
52-64 BibTeX
- Karell Bertet, Jens Gustedt, Michel Morvan:
Weak-Order Extensions of an Order.
65-77 BibTeX
- Alberto Bertoni, Paola Campadelli, Roberto Posenato:
An Upper Bound for the Maximum Cut Mean Value.
78-84 BibTeX
- Ulrik Brandes, Dagmar Handke:
NP-Completness Results for Minimum Planar Spanners.
85-99 BibTeX
- Stephan Brandt:
Computing the Independence Number of Dense Triangle-Free Graphs.
100-108 BibTeX
- Hajo Broersma, Elias Dahlhaus, Ton Kloks:
Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.
109-117 BibTeX
- Christian Capelle:
Block Decomposition of Inheritance Hierarchies.
118-131 BibTeX
- Elias Dahlhaus:
Minimal Elimination Ordering Inside a Given Chordal Graph.
132-143 BibTeX
- Fabrizio d'Amore, Fabio Iacobini:
On-Line Algorithms for Networks of Temporal Constraints.
144-156 BibTeX
- Babette de Fluiter, Hans L. Bodlaender:
Parallel Algorithms for Treewidth Two.
157-170 BibTeX
- Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks:
On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres.
171-183 BibTeX
- Feodor F. Dragan:
On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract).
184-198 BibTeX
- Thomas Erlebach, Klaus Jansen:
Off-Line and On-Line Call-Scheduling in Stars and Trees.
199-213 BibTeX
- Petr Hlinený, Jan Kratochvíl:
Computational Complexity of the Krausz Dimension of Graphs.
214-228 BibTeX
- Ton Kloks, Dieter Kratsch, Haiko Müller:
Asteroidal Sets in Graphs.
229-241 BibTeX
- Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Complexity of Colored Graph Covers I. Colored Directed Multigraphs.
242-257 BibTeX
- Mohamed Mosbah, Nasser Saheb:
A Syntactic Approach to Random Walks on Graphs.
258-272 BibTeX
- Erich Prisner:
Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs.
273-287 BibTeX
- Michael Sampels:
Large Networks with Small Diameter.
288-302 BibTeX
- Konstantin Skodinis:
The Bounded Tree-Width Problem of Context-Free Graph Languages.
303-317 BibTeX
- Mikkel Thorup:
Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract).
318-332 BibTeX
- Ryuhei Uehara:
A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems.
333-341 BibTeX
- Tanja E. J. Vos, S. Doaitse Swierstra:
Make your Enemies Transparent.
342-353 BibTeX
- Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi:
Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs.
354-367 BibTeX
Copyright © Sat May 16 23:47:49 2009
by Michael Ley (ley@uni-trier.de)
