Abstract is missing.
- Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture)David P. Williamson. 1
- Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUTPaola Alimonti. 2-14
- On the Number of Simple Cycles in Planar GraphsHelmut Alt, Ulrich Fuchs, Klaus Kriegel. 15-24
- On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract)Luitpold Babel, Stephan Olariu. 25-37
- Pseudo-Hamiltonian GraphsLuitpold Babel, Gerhard J. Woeginger. 38-51
- Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract)Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes. 52-64
- Weak-Order Extensions of an OrderKarell Bertet, Jens Gustedt, Michel Morvan. 65-77
- An Upper Bound for the Maximum Cut Mean ValueAlberto Bertoni, Paola Campadelli, Roberto Posenato. 78-84
- NP-Completness Results for Minimum Planar SpannersUlrik Brandes, Dagmar Handke. 85-99
- Computing the Independence Number of Dense Triangle-Free GraphsStephan Brandt. 100-108
- Algorithms for the Treewidth and Minimum Fill-in of HHD-Free GraphsHajo Broersma, Elias Dahlhaus, Ton Kloks. 109-117
- Block Decomposition of Inheritance HierarchiesChristian Capelle. 118-131
- Minimal Elimination Ordering Inside a Given Chordal GraphElias Dahlhaus. 132-143
- On-Line Algorithms for Networks of Temporal ConstraintsFabrizio d Amore, Fabio Iacobini. 144-156
- Parallel Algorithms for Treewidth TwoBabette de Fluiter, Hans Leo Bodlaender. 157-170
- On Optimal Graphs Embedded into Path and Rings, with Analysis Using l::1::-SpheresYefim Dinitz, Marcelo Feighelstein, Shmuel Zaks. 171-183
- On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract)Feodor F. Dragan. 184-198
- Off-Line and On-Line Call-Scheduling in Stars and TreesThomas Erlebach, Klaus Jansen. 199-213
- Computational Complexity of the Krausz Dimension of GraphsPetr Hlinený, Jan Kratochvíl. 214-228
- Asteroidal Sets in GraphsTon Kloks, Dieter Kratsch, Haiko Müller. 229-241
- Complexity of Colored Graph Covers I. Colored Directed MultigraphsJan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle. 242-257
- A Syntactic Approach to Random Walks on GraphsMohamed Mosbah, Nasser Saheb. 258-272
- Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line DigraphsErich Prisner. 273-287
- Large Networks with Small DiameterMichael Sampels. 288-302
- The Bounded Tree-Width Problem of Context-Free Graph LanguagesKonstantin Skodinis. 303-317
- Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract)Mikkel Thorup. 318-332
- A Measure of Parallelization for the Lexicographically First Maximal Subgraph ProblemsRyuhei Uehara. 333-341
- Make your Enemies TransparentTanja E. J. Vos, S. Doaitse Swierstra. 342-353
- Optimal Fault-Tolerant ATM-Routings for Biconnected GraphsKoichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi. 354-367