Conferences in DBLP
Emo Welzl The Number of Triangulations on Planar Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Oliver Deussen The Algorithmic Beauty of Digital Nature. [Citation Graph (0, 0)][DBLP ] Conf ] Tim Dwyer , Kim Marriott , Michael Wybrow Integrating Edge Routing into Force-Directed Layout. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Lauther Multipole-Based Force Approximation Revisited - A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Ali Civril , Malik Magdon-Ismail , Eli Bocek-Rivele SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrik Brandes , Christian Pich Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrik Brandes , Barbara Schlieper Angle and Distance Constraints on Tree Drawings. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Gudmundsson , Marc J. van Kreveld , Damian Merrick Schematisation of Tree Drawings. [Citation Graph (0, 0)][DBLP ] Conf ] Josiah Carlson , David Eppstein Trees with Convex Faces and Optimal Angles. [Citation Graph (0, 0)][DBLP ] Conf ] Fabrizio Frati , Giuseppe Di Battista Three-Dimensional Drawings of Bounded Degree Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Justin Cappos , Alejandro Estrella-Balderrama , J. Joseph Fowler , Stephen G. Kobourov Simultaneous Graph Embedding with Bends and Circular Arcs. [Citation Graph (0, 0)][DBLP ] Conf ] Fabrizio Frati Embedding Graphs Simultaneously with Fixed Edges. [Citation Graph (0, 0)][DBLP ] Conf ] Balázs Keszegh , János Pach , Dömötör Pálvölgyi , Géza Tóth Drawing Cubic Graphs with at Most Five Slopes. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Gutwenger , Karsten Klein , Petra Mutzel Planarity Testing and Optimal Edge Insertion with Embedding Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuyuki Miura , Tetsuya Matsuno , Takao Nishizeki Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] David R. Wood , Jan Arne Telle Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Hlinený , Gelasio Salazar On the Crossing Number of Almost Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jacob Fox , Csaba D. Tóth On the Decay of Crossing Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Helen C. Purchase , Eve E. Hoggan , Carsten Görg How Important Is the "Mental Map"? - An Empirical Investigation of a Dynamic Graph Layout Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Klein , Martin Kutz Computing Geometric Minimum-Dilation Graphs Is NP-Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Cornelia Dangelmayr , Stefan Felsner Chordal Graphs as Intersection Graphs of Pseudosegments. [Citation Graph (0, 0)][DBLP ] Conf ] Charalampos Papamanthou , Ioannis G. Tollis Parameterized st -Orientations of Graphs: Algorithms and Experiments. [Citation Graph (0, 0)][DBLP ] Conf ] Éric Fusy Straight-Line Drawing of Quadrangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Katharina A. Lehmann , Stephan Kottler Visualizing Large and Clustered Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Siebenhaller Partitioned Drawings. [Citation Graph (0, 0)][DBLP ] Conf ] Damian Merrick , Joachim Gudmundsson Path Simplification for Metro Map Layout. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Benkert , Martin Nöllenburg , Takeaki Uno , Alexander Wolff Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Upright-Quad Drawing of st -Planar Learning Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Michael B. Dillencourt , David Eppstein , Michael T. Goodrich Choosing Colors for Geometric Graphs Via Color Space Embeddings. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen G. Kobourov , Matthew Landis Morphing Planar Graphs in Spherical Space. [Citation Graph (0, 0)][DBLP ] Conf ] Emilio Di Giacomo , Walter Didimo , Giuseppe Liotta , Henk Meijer , Francesco Trotta , Stephen K. Wismath k -Colored Point-Set Embeddability of Outerplanar Graphs.Citation Graph (0, 0)][DBLP ] Conf ] Stefan Felsner , Mareike Massow Thickness of Bar 1-Visibility Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Wilhelm Barth , Petra Mutzel , Canan Yildiz A New Approximation Algorithm for Bend Minimization in the Kandinsky Model. [Citation Graph (0, 0)][DBLP ] Conf ] Emilio Di Giacomo , Walter Didimo , Giuseppe Liotta Radial Drawings of Graphs: Geometric Constraints and Trade-Offs. [Citation Graph (0, 0)][DBLP ] Conf ] Alejandro Estrella-Balderrama , J. Joseph Fowler , Stephen G. Kobourov Characterization of Unlabeled Level Planar Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Emilio Di Giacomo , Luca Grilli , Giuseppe Liotta Drawing Bipartite Graphs on Two Curves. [Citation Graph (0, 0)][DBLP ] Conf ] Emden R. Gansner , Yehuda Koren Improved Circular Layouts. [Citation Graph (0, 0)][DBLP ] Conf ] Huamin Qu , Hong Zhou , Yingcai Wu Controllable and Progressive Edge Clustering for Large Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Hirsch , Henk Meijer , David Rappaport Biclique Edge Cover Graphs and Confluent Drawings. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Felsner , Florian Zickfeld Schnyder Woods and Orthogonal Surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Therese C. Biedl , Franz-Josef Brandenburg Partitions of Graphs into Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Pinaud , Pascale Kuntz , Fabien Picarougne The Website for Graph Visualization Software References (GVSR). [Citation Graph (0, 0)][DBLP ] Conf ] Christopher Homan , Andrew Pavlo , Jonathan Schull Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings. [Citation Graph (0, 0)][DBLP ] Conf ] Tim Dwyer , Kim Marriott , Peter J. Stuckey Fast Node Overlap Removal - Correction. [Citation Graph (0, 0)][DBLP ] Conf ] Christian A. Duncan , Gunnar W. Klau , Stephen G. Kobourov , Georg Sander Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP ] Conf ] 