Conferences in DBLP
Hans L. Bodlaender , John R. Gilbert , Ton Kloks , Hjálmtyr Hafsteinsson Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Courcelle , Mohamed Mosbah Monadic Second-Order Evaluations on Tree-Decomposable Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ralf Heckmann , Ralf Klasing , Burkhard Monien , Walter Unger Optimal Embedding of Complete Binary Trees into Lines and Grids. [Citation Graph (0, 0)][DBLP ] Conf ] Yasuyoshi Okada , Masahiro Hayashi Graph Rewriting Systems and their Application to Network Reliability Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Albert Zündorf , Andy Schürr Nondeterministic Control Structures for Graph Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Andries , Jan Paredaens A Language for Generic Graph-Transformations. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Freund , Brigitte Haberstroh Attributed Elementarz Programmed Graph Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Edmund Ihler The Complexity of Approximating the Class Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Zbigniew Lonc On Complexity of Some Chain and Antichain Partition Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Jurek Czyzowicz , Eduardo Rivera-Campo , Nicola Santoro , Jorge Urrutia , Joseph Zaks Tight Bounds for the Rectangualr Art Gallery Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , Joseph S. B. Mitchell Voronoi Diagrams of Moving Points in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Takayoshi Shoudai Using Maximal Independent Sets to Solve Problems in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Zvi M. Kedem , Krishna V. Palem , Grammati E. Pantziou , Paul G. Spirakis , Christos D. Zaroliagis Fast Parallel Algorithms for Coloring Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaoyi Jiang , Horst Bunke Optimal Vertex Ordering of a Graph and its Application to Symmetry Detection. [Citation Graph (0, 0)][DBLP ] Conf ] Ondrej Sýkora , Imrich Vrto Edge Separators for Graphs of Bounded Genus with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Ding-Zhu Du , Yuh-Dauh Lyuu , D. Frank Hsu Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Ludek Kucera A Generalized Encryption Scheme Based on Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Esteban Feuerstein , Alberto Marchetti-Spaccamela Dynamic Algorithms for Shortest Paths in Planar Graphs. [Citation Graph (1, 0)][DBLP ] Conf ] Iain A. Stewart Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Tadao Takaoka A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Ondrej Sýkora , Imrich Vrto On the Crossing Number of the Hypercube and the Cube Connected Cycles. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Damaschke Logic Arrays for Interval Indicator Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Elena Stöhr On the Broadcast Time of the Butterfly network. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender On Disjoint Cycles. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Brandstädt Short Disjoint Cycles in Cubic Bridgeless Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] 