Conferences in DBLP
Jirí Matousek The Anatomy of a Geometric Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Stina S. Bridgeman , Giuseppe Di Battista , Walter Didimo , Giuseppe Liotta , Roberto Tamassia , Luca Vismara Turn-Regularity and Planar Orthogonal Drawings. [Citation Graph (0, 0)][DBLP ] Conf ] Gunnar W. Klau , Petra Mutzel Combining Graph Labeling and Compaction. [Citation Graph (0, 0)][DBLP ] Conf ] Ashim Garg , Giuseppe Liotta Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Closson , Shane Gartshore , John R. Johansen , Stephen K. Wismath Fully Dynamic 3-Dimensional Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP ] Conf ] Vance E. Waddle , Ashok Malhotra An E log E Line Crossing Algorithm for Levelled Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Jünger , Sebastian Leipert Level Planar Embedding in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan A. Lisitsyn , Victor N. Kasyanov Higres - Visualization System for Clustered Graphs and Graph Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir Batagelj , Andrej Mrvar , Matjaz Zaversnik Partitioning Approach to Visualization of Large Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jubin Edachery , Arunabha Sen , Franz-Josef Brandenburg Graph Clustering Using Distance-k Cliques. [Citation Graph (0, 0)][DBLP ] Conf ] Janet M. Six , Ioannis G. Tollis A Framework for Circular Drawings of Networks. [Citation Graph (0, 0)][DBLP ] Conf ] C. C. Cheng , Christian A. Duncan , Michael T. Goodrich , Stephen G. Kobourov Drawing Planar Graphs with Circular Arcs. [Citation Graph (0, 0)][DBLP ] Conf ] Bojan Mohar Drawing Graphs in the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Robin Thomas Graph Planarity and Related Topics. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuyuki Miura , Shin-Ichi Nakano , Takao Nishizeki Grid Drawings of Four-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Dornheim Graph Embedding with Topological Cycle-Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kaufmann , Roland Wiese Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Petra Mutzel , Thomas Ziegler The Constrained Crossing Minimization Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Christian A. Duncan , Michael T. Goodrich , Stephen G. Kobourov Planarity-Preserving Clustering and Embedding for Large Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] François Bertault , Mirka Miller An Algorithm for Drawing Compound Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick Healy , Ago Kuusik The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Matuszewski , Robby Schönfeld , Paul Molitor Using Sifting for k -Layer Straightline Crossing Minimization. [Citation Graph (0, 0)][DBLP ] Conf ] Farhad Shahrokhi , Imrich Vrto On 3-Layer Crossings and Pseudo Arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Ala Eddine Barouni , Ali Jaoua , Nejib Zaguia Visualizing Algorithms for the Design and Analysis of Survivable Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Lila Behzadi LayoutShow: A Signed Applet/Application for Graph Drawing and Experimentation. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrik Brandes , Patrick Kenis , Dorothea Wagner Centrality in Policy Network Drawings. [Citation Graph (0, 0)][DBLP ] Conf ] Wojciech Basalaj , Karen Eilbeck Straight-Line Drawings of Protein Interactions. [Citation Graph (0, 0)][DBLP ] Conf ] Jaroslav Nesetril Art of Drawing. [Citation Graph (0, 0)][DBLP ] Conf ] Hubert de Fraysseix An Heuristic for Graph Symmetry Detection. [Citation Graph (0, 0)][DBLP ] Conf ] Sabine Bachl Isomorphic Subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Di Battista , Walter Didimo , Maurizio Patrignani , Maurizio Pizzonia Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. [Citation Graph (0, 0)][DBLP ] Conf ] David R. Wood Multi-dimensional Orthogonal Graph Drawing with Small Boxes. [Citation Graph (0, 0)][DBLP ] Conf ] Patrice Ossona de Mendez Geometric Realization of Simplicial Complexes. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Babilon , Helena Nyklová , Ondrej Pangrác , Jan Vondrák Visibility Representations of Complete Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Natalia de Castro , Francisco Javier Cobos , Juan Carlos Dana , Alberto Márquez , Marc Noy Triangle-Free Planar Graphs as Segments Intersection Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] François Bertault A Force-Directed Algorithm that Preserves Edge Crossing Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Therese C. Biedl , Anna Bretscher , Henk Meijer Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Liotta , Henk Meijer Voronoi Drawings of Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Camil Demetrescu , Giuseppe Di Battista , Irene Finocchi , Giuseppe Liotta , Maurizio Patrignani , Maurizio Pizzonia Infinite Trees and the Future. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan Herman , Guy Melançon , Maurice M. de Ruiter , Maylis Delest Latour — A Tree Visualisation System. [Citation Graph (0, 0)][DBLP ] Conf ] Franz-Josef Brandenburg , Michael Jünger , Joe Marks , Petra Mutzel , Falk Schreiber Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrik Brandes Hunting Down Graph B. [Citation Graph (0, 0)][DBLP ] Conf ] Ho-Lin Chen , Hsu-Chun Yen Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations. [Citation Graph (0, 0)][DBLP ] Conf ] Carl-Christian Kanne , Falk Schreiber , Dietrich Trümbach Electronic Biochemical Pathways. [Citation Graph (0, 0)][DBLP ] Conf ] 