Volume 11,
Number 1,
March 2000
Asian '98
Regular Papers
Volume 11,
Number 2,
June 2000
Randomized Computing
Regular Papers
Volume 11,
Number 3,
September 2000
Selected papers from WG 1999
- Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Mod-2 Independence and Domination in Graphs.
355-363 BibTeX
- Ljubomir Perkovic, Bruce A. Reed:
An Improved Algorithm for Finding Tree Decompositions of Small Width.
365-371 BibTeX
- Öjvind Johansson:
NLC2-Decomposition in Polynomial Time.
373-395 BibTeX
- Anne Berry, Jean Paul Bordat, Olivier Cogis:
Generating All the Minimal Separators of a Graph.
397-403 BibTeX
- Anna Accornero, Massimo Ancona, Sonia Varini:
All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time.
405-421 BibTeX
- Martin Charles Golumbic, Udi Rotics:
On the Clique-Width of Some Perfect Graph Classes.
423-443 BibTeX
- Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Finding Smallest Supertrees Under Minor Containment.
445-465 BibTeX
- Annegret Liebers, Dorothea Wagner, Karsten Weihe:
On the Hardness of Recognizing Bundles in Time Table Graphs.
467-484 BibTeX
Regular Paper
Volume 11,
Number 4,
December 2000
- Sven Kosub, Heinz Schmitz, Heribert Vollmer:
Uniform Characterizations of Complexity Classes of Functions.
525-551 BibTeX
- Anu G. Bourgeois, Jerry L. Trahan:
Relating Two-Dimensional Reconfigurable Meshes with Optically Pipelined Buses.
553-571 BibTeX
- Guozhu Dong, Louxin Zhang:
Separating Auxiliary Arity Hierarchy of First-Order Incremental Evaluation Systems Using (3k+1)-ary Input Relations.
573-578 BibTeX
- Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri:
Approximating the Maximum Isomorphic Agreement Subtree is Hard.
579-590 BibTeX
- Ron van der Meyden:
Predicate Boundedness of Linear Monadic Datalog is in PSPACE.
591-612 BibTeX
- Johannes Köbler, Wolfgang Lindner:
Oracles in Sp2 are Sufficient for Exact Learning.
615-632 BibTeX
- Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Victor Mitrana, György Vaszil:
Parallel Communicating Pushdown Automata Systems.
633-650 BibTeX
Copyright © Sun May 17 00:02:01 2009
by Michael Ley (ley@uni-trier.de)