Graph-theoretic concepts in computer science. 18th international workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings (Q684569)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Brandstädt, Andreas}, On improved time bounds for permutation graph problems, 1-10 [Zbl 0789.68105] \textit{Hsu, Wen-Lian}, A simple test for interval graphs, 11-16 [Zbl 0789.68110] \textit{Felsner, Stefan}, Tolerance graphs and orders, 17-26 [Zbl 0791.05096] \textit{Jansen, Klaus}, On scheduling problems restricted to interval orders, 27-36 [Zbl 0789.68007] \textit{Bodlaender, Hans L.; Jansen, Klaus; Woeginger, Gerhard J.}, Scheduling with incompatible jobs, 37-49 [Zbl 0791.68011] \textit{Jansen, Klaus; Scheffler, Petra}, Generalized coloring for tree-like graphs, 50-59 [Zbl 0795.05057] \textit{Dahlhaus, Elias}, Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes, 60-69 [Zbl 0789.68062] \textit{Hromkovič, Juraj}, Topology of parallel networks and computational complexity, 70-77 [Zbl 0789.68064] \textit{Preilowski, W.}, Parallel triangulation of nonconvex polytopes, 78-89 [Zbl 0789.68067] \textit{Bodlaender, Hans L.}, Kayles on special classes of graphs -- An application of Sprague-Grundy theory, 90-102 [Zbl 0789.68104] \textit{Chen, Jianer}, A linear time algorithm for isomorphism of graphs of bounded average genus, 103-113 [Zbl 0790.05081] \textit{Bhatia, Dinesh; Leighton, Tom; Makedon, Fillia; Norton, Carolyn H.}, Improved algorithms for routing on two-dimensional grids, 114-122 [Zbl 0844.90052] \textit{Ihler, Edmund}, Minimum rectilinear Steiner trees for intervals on two parallel lines, 123-134 [Zbl 0789.68111] \textit{Gerstel, O.; Zaks, S.}, A new characterization of tree medians with applications to distributed algorithms, 135-144 [Zbl 0791.05085] \textit{Dinitz, Efim}, The 3-edge-components and a structural description of all 3-edge-cuts in a graph, 145-157 [Zbl 0789.05077] \textit{Chen, Jianer; Kanevsky, Arkady}, On assembly of four-connected graphs. (Extended abstract), 158-169 [Zbl 0789.05055] \textit{Jamison, Beverly; Olariu, Stephan}, On the homogeneous decomposition of graphs, 170-183 [Zbl 0789.05079] \textit{Das, Sajal K.; Mao, Aisheng}, Embeddings in recursive combinatorial networks, 184-204 [Zbl 0789.68005] \textit{Thorup, Mikkel}, On shortcutting digraphs, 205-211 [Zbl 0793.68117] \textit{Cournier, Alain; Habib, Michel}, An efficient algorithm to recognize prime undirected graphs, 212-224 [Zbl 0925.05051] \textit{Felsner, Stefan; Wagner, Dorothea}, On the complexity of partial order properties, 225-235 [Zbl 0802.68064] \textit{Mosbah, Mohamed}, Probabilistic graph grammars, 236-247 [Zbl 0789.68085] \textit{Parisi-Presicce, Francesco}, Single vs. double pushout derivations of graphs, 248-262 [Zbl 0925.68282] \textit{Kant, Goos}, Hexagonal grid drawings, 263-276 [Zbl 0925.05056] \textit{Erwig, Martin}, Graph algorithms = iteration + data structures? The structure of graph algorithms and a corresponding style of programming, 277-292 [Zbl 0789.68107] \textit{Alimonti, Paola; Feuerstein, Esteban}, Petri nets, hypergraphs and conflicts. (Preliminary version), 293-309 [Zbl 0795.68148] \textit{Gergov, Jordan; Meinel, Christoph}, Analysis and manipulation of Boolean functions in terms of decision graphs, 310-320 [Zbl 0789.68108] \textit{O'Reilly, Una-May; Santoro, Nicola}, The expressiveness of silence: Tight bounds for synchronous communication of information using bits and silence, 321-332 [Zbl 0806.90041] \textit{Litovsky, Igor; Métivier, Yves; Zielonka, Wiesław}, The power and the limitations of local computations on graphs, 333-345 [Zbl 0791.68131]