InhaltsangabeDomino treewidth.- A lower bound for treewidth and its consequences.- Tree-width and path-width of comparability graphs of interval orders.- A declarative approach to graph based modeling.- Multilevel graph grammars.- The algorithmic use of hypertree structure and maximum neighbourhood orderings.- On domination elimination orderings and domination graphs.- Complexity of graph covering problems.- Dominoes.- GLB-closures in directed acyclic graphs and their applications.- Minimum vertex cover, distributed decision-making, and communication complexity.- Cartesian products of graphs as spanning subgraphs of de Bruijn graphs.- Specification of graph translators with triple graph grammars.- Using programmed graph rewriting for the formal specification of a configuration management system.- Exponential time analysis of confluent and boundary eNCE graph languages.- Time-optimal tree computations on sparse meshes.- Prefix graphs and their applications.- The complexity of broadcasting in planar and decomposable graphs.- The maximal f-dependent set problem for planar graphs is in NC.- On-line convex planarity testing.- Book embeddings and crossing numbers.- Measuring the distance to series-parallelity by path expressions.- Labelled trees and pairs of input-output permutations in priority queues.- Rankings of graphs.- Bypass strong V-structures and find an isomorphic labelled subgraph in linear time.- Efficient algorithms for a mixed k-partition problem of graphs without specifying bases.- Fugitive-search games on graphs and related parameters.- New approximation results on graph matching and related problems.- New lower bounds and hierarchy results for restricted branching programs.- On-line algorithms for satisfiability problems with uncertainty.- NC algorithms for antidirected hamiltonian paths and cycles in tournaments.- Directed path graph isomorphism.