Graph-theoretic concepts in computer science. 15th international workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989. Proceedings (Q1188643)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Madhavapeddy, Seshu; Sudborough, I. Hal}, Disjoint paths in the hypercube, 3-18 [Zbl 0768.68163] \textit{Capocelli, Renato M.; Gargano, Luisa; Vaccaro, Ugo}, Time bounds for broadcasting in bounded degree graphs, 19-33 [Zbl 0768.68123] \textit{Das, A.; Thulasiraman, K.; Agarwal, V. K.; Lakshmanan, K. B.}, \(t/s\)-diagnosable systems: A characterization and diagnosis algorithm, 34-45 [Zbl 0778.68016] \textit{Geva, Robert Y.; Paz, Azaria}, Toward a complete representation of graphoids in graphs. (Abridged version), 46-62 [Zbl 0768.68141] \textit{Ruland, Detlev}, CADULA -- A graph-based model for monitoring CAD-processes, 63-77 [Zbl 0788.68152] \textit{Vogler, Walter}, On hyperedge replacement and BNLC graph grammars, 78-93 [Zbl 0768.68186] \textit{Billaud, Michel; Lafon, Pierre; Metivier, Yves; Sopena, Eric}, Graph rewriting systems with priorities, 94-106 [Zbl 0768.68120] \textit{Habel, Annegret; Kreowski, Hans-Jörg}, Filtering hyperedge-replacement languages through compatible properties, 107-120 [Zbl 0787.68067] \textit{Schneider, H. J.}, Describing distributed systems by categorical graph grammars, 121-135 [Zbl 0768.68178] \textit{Bunke, H.; Haller, B.}, A parser for context free plex grammars, 136-150 [Zbl 0778.68054] \textit{Schürr, Andy}, Introduction to PROGRESS, an attribute graph grammar based specification language, 151-165 [Zbl 0788.68097] \textit{Brandenburg, Franz J.}, On the complexity of optimal drawings of graphs, 166-180 [Zbl 0768.68122] \textit{Sysło, Maciej M.}, Bounds to the page number of partially ordered sets, 181-195 [Zbl 0774.06002] \textit{Reich, Gabriele; Widmayer, Peter}, Beyond Steiner's problem: A VLSI oriented generalization, 196-210 [Zbl 0768.68176] \textit{Schiermeyer, Ingo}, A fast sequential and parallel algorithm for the computation of the k- closure of a graph, 211-217 [Zbl 0768.68028] \textit{Speckenmeyer, Ewald}, On feedback problems in digraphs, 218-231 [Zbl 0768.68181] \textit{Bodlaender, Hans L.}, Improved self-reduction algorithms for graphs with bounded treewidth, 232-244 [Zbl 0768.68033] \textit{Simon, Klaus}, Finding a minimal transitive reduction in a strongly connected digraph within linear time, 245-259 [Zbl 0768.68180] \textit{Henrich, Andreas; Six, Hans-Werner; Widmayer, Peter}, Paging binary trees with external balancing, 260-276 [Zbl 0768.68144] \textit{Lozano, Antonio; Balcázar, José L.}, The complexity of graph problems for succinctly represented graphs, 277-286 [Zbl 0768.68053] \textit{Anderson, Richard; Kahan, Simon; Schlag, Martine}, An \(O(n\log n)\) algorithm for 1-D tile compaction, 287-301 [Zbl 0778.68086] \textit{Menzel, K.; Monien, B.}, Weighted parallel triangulation of simple polygons, 302-315 [Zbl 0771.68105] \textit{Dehne, Frank; Rau-Chaplin, Andrew}, Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry, 316-329 [Zbl 0768.68010] \textit{Roos, Thomas}, k-nearest-neighbor Voronoi diagrams for sets of convex polygons, line segments and points, 330-340 [Zbl 0779.68090] \textit{van Kreveld, Marc J.; Berg, Mark T.}, Finding squares and rectangles in sets of points, 341-355 [Zbl 0783.68133] \textit{Klein, Rolf}, Combinatorial properties of abstract Voronoi diagrams, 356-369 [Zbl 0778.68089]