Conferences in DBLP
Andreas Brandstädt On Improved Time Bounds for Permutation Graph Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Wen-Lian Hsu A Simple Test for Interval Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Felsner Tolerance Graphs and Orders. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen On Scheduling Problems Restricted to Interval Orders. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Klaus Jansen , Gerhard J. Woeginger Scheduling with Incompatible Jobs. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen , Petra Scheffler Generalized Coloring for Tree-like Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Elias Dahlhaus Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic Topology of Parallel Networks and Computational Complexity (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] W. Preilowski Parallel Triangulation of Nonconvex Polytopes. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. [Citation Graph (0, 0)][DBLP ] Conf ] Dinesh Bhatia , Frank Thomson Leighton , Fillia Makedon , Carolyn Haibt Norton Improved Algorithms for Routing on Two-Dimensional Grids. [Citation Graph (0, 0)][DBLP ] Conf ] Edmund Ihler Minimum Rectilinear Steiner Tree for Intervals on two Parallel Lines. [Citation Graph (0, 0)][DBLP ] Conf ] Ornan Ori Gerstel , Shmuel Zaks A New Characterization of Tree Medians with Applications to Distributed Algorithms. [Citation Graph (1, 0)][DBLP ] Conf ] Yefim Dinitz The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Arkady Kanevsky On Assembly of Four-Connected Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Beverly Jamison , Stephan Olariu On the Homogeneous Decomposition of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Sajal K. Das , Aisheng Mao Embeddings in Recursive Combinatorial Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup On Shortcutting Digraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Alain Cournier , Michel Habib An Efficient Algorithm to Recognize Prime Undirected Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Felsner , Dorothea Wagner On the Complexity of Partial Order Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Mohamed Mosbah Probabilistic Graph Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Francesco Parisi-Presicce Single vs. Double Pushout Derivations of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Goos Kant Hexagonal Grid Drawings. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Erwig Graph Algorithms = Iteration + Data Structures? The Structure of Graph Algorithms and a Corresponding Style of Programming. [Citation Graph (1, 0)][DBLP ] Conf ] Paola Alimonti , Esteban Feuerstein Petri Nets, Hypergraphs and Conflicts (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Jordan Gergov , Christoph Meinel Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Una-May O'Reilly , Nicola Santoro The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence. [Citation Graph (0, 0)][DBLP ] Conf ] Igor Litovsky , Yves Métivier , Wieslaw Zielonka The Power and the Limitations of Local Computations on Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] 