Conferences in DBLP
Hans L. Bodlaender NC-Algorithms for Graphs with Small Treewidth. [Citation Graph (1, 0)][DBLP ] Conf ] Annegret Habel Graph-Theoretic Properties Compatible with Graph Derivations. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Courcelle The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Bauderon On Systems of Equations Defining Infinite Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Henk Meijer , R. Dawes Fault Tolerant Networks of Specified Diameter. [Citation Graph (0, 0)][DBLP ] Conf ] Ephraim Korach , Zvi Ostfeld DFS Tree Construction: Algorithms and Characterizations. [Citation Graph (0, 0)][DBLP ] Conf ] K. Vidyasankar Serializable Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Biskup , Holger Stiefeling Transitive Closure Algorithms for Very Large Databases. [Citation Graph (2, 0)][DBLP ] Conf ] Dietmar Seipel A Graph-Based Decomposition Approach for Recursive Query Processing. [Citation Graph (0, 0)][DBLP ] Conf ] Udo W. Lipeck , Dasu Feng Construction of Deterministic Transition Graphs from Dynamic Integrity Constraints. [Citation Graph (2, 0)][DBLP ] Conf ] Nicola Santoro (Time × Space)-Efficient Implementations of Hierarchical Conceptual Models. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Mark H. Overmars Dominance in the Presence of Obstracles. [Citation Graph (0, 0)][DBLP ] Conf ] Otto Nurmi , Jörg-Rüdiger Sack Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Sebastian Iwanowski Linear Time Algorithms for Testing Approximate Congruence in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Stephan Abramowski , Bruno Lang , Heinrich Müller Moving Regular k-Gons in Contact. [Citation Graph (0, 0)][DBLP ] Conf ] Gerhard J. Woeginger Epsilon-Nets for Halfplanes. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Lingas Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Schimmler , Heiko Schröder A Simple Systolic Method to Find all Bridges of an Undirected Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Iain A. Stewart Colouring Perfect Planar Graphs in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Tadao Takaoka An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP ] Conf ] John E. Savage , Markus G. Wloka A Parallel Algorithm for Channel Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Hubert Kaeslin Application of Graph Theory to Topology Generation for Logic Gates. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Marchetti-Spaccamela On the Estimate of a Directed Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Pieter H. Hartel The Average Size of Ordered Binary Subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] R. Jayakumar , Krishnaiyan Thulasiraman , M. N. S. Swamy O(n²) Algorithms for Graph Planarization. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Wiegers , Burkhard Monien Bandwidth and Profile Minimization. [Citation Graph (0, 0)][DBLP ] Conf ] Ernst W. Mayr , C. Greg Plaxton On the Spanning Trees of Weighted Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Huckenbeck On Paths in Search or Decision Trees Which Require Almost Worst-Case Time. [Citation Graph (0, 0)][DBLP ] Conf ] W. Preilowski , W. Mumbeck A Time-Optimal Parallel Algorithm for the Computing of Voronoi-Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Klein Voronoi Diagrams in the Moscow Metric (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Hinrichs , Jürg Nievergelt , Peter Schorn A Sweep Algorithm and its Implementation: The All-Nearest-Neighbors Problem Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] 