Conferences in DBLP
Seshu Madhavapeddy , Ivan Hal Sudborough Disjoint Paths in the Hypercube. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:3-18 [Conf ] Renato M. Capocelli , Luisa Gargano , Ugo Vaccaro Time Bound for Broadcasting in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:19-33 [Conf ] Anindya Das , Krishnaiyan Thulasiraman , Vinod K. Agarwal , K. B. Lakshmanan t/s-Diagnosable Systems: A Characterization and Diagnosis Algorithm. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:34-45 [Conf ] Robert Y. Geva , Azaria Paz Toward a Complete Representation of Graphoids in Graphs (Abridged Version). [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:46-62 [Conf ] Detlev Ruland CADULA - A Graph-Based Model for Monitoring CAD-Processes. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:63-72 [Conf ] Walter Vogler On Hyperedge Replacement and BNLC Graph Grammars. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:78-93 [Conf ] Michel Billaud , Pierre Lafon , Yves Métivier , Eric Sopena Graph Rewriting Systems with Priorities. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:94-106 [Conf ] Annegret Habel , Hans-Jörg Kreowski Filtering Hyperedge-Replacement Through Compatible Properties. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:107-120 [Conf ] Hans Jürgen Schneider Describing Distributed Systems by Categorical Graph Grammars. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:121-135 [Conf ] Horst Bunke , B. Haller A Parser for Context Free Plex Grammars. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:136-150 [Conf ] Andy Schürr Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:151-165 [Conf ] Franz-Josef Brandenburg On the Complexity of Optimal Drawings of Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:166-180 [Conf ] Maciej M. Syslo Bounds to the Page Number of Partially Ordered Sets. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:181-195 [Conf ] Gabriele Reich , Peter Widmayer Beyond Steiner's Problem: A VLSI Oriented Generalization. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:196-210 [Conf ] Ingo Schiermeyer A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:211-217 [Conf ] Ewald Speckenmeyer On Feedback Problems in Diagraphs. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:218-231 [Conf ] Hans L. Bodlaender Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:232-244 [Conf ] Klaus Simon Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:245-259 [Conf ] Andreas Henrich , Hans-Werner Six , Peter Widmayer Paging Binary Trees with External Balancing. [Citation Graph (1, 0)][DBLP ] WG, 1989, pp:260-276 [Conf ] Antoni Lozano , José L. Balcázar The Complexity of Graph Problems fore Succinctly Represented Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:277-286 [Conf ] Richard Anderson , Simon Kahan , Martine D. F. Schlag An O (n log n ) Algorithm for 1-D Tile Compaction. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:287-301 [Conf ] Knuth Menzel , Burkhard Monien WEighted Parallel Triangulation of Simple Polygons. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:302-315 [Conf ] Frank K. H. A. Dehne , Andrew Rau-Chaplin Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:316-329 [Conf ] Thomas Roos k-Nearest-Neighbor Voronoi Diagrams for Sets of Convex Polygons, Line Segments and Points. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:330-340 [Conf ] Marc J. van Kreveld , Mark de Berg Finding Squares and Rectangles in Sets of Points. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:341-355 [Conf ] Rolf Klein Combinatorial Properties of Abstract Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] WG, 1989, pp:356-369 [Conf ]