default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGD 2011: Eindhoven, The Netherlands
- Marc J. van Kreveld, Bettina Speckmann
:
Graph Drawing - 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7034, Springer 2012, ISBN 978-3-642-25877-0
Obituary
- Peter Eades, Seok-Hee Hong, Kazuo Misue:
Kozo Sugiyama 1945 - 2011. 1
Papers
- David Eppstein, Joseph A. Simons:
Confluent Hasse Diagrams. 2-13 - Soroush Alamdari, Therese Biedl:
Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames. 14-25 - Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov:
Proportional Contact Representations of Planar Graphs. 26-38 - Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides:
Embedding Plane 3-Trees in ℝ2 and ℝ3. 39-51 - Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug:
Orthogeodesic Point-Set Embedding of Trees. 52-63 - Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On Point-Sets That Support Planar Graphs. 64-74 - Patrizio Angelini, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella:
Small Point Sets for Simply-Nested Planar Graphs. 75-85 - Jarke J. van Wijk:
Graph Visualization. 86 - Markus Chimani, Carsten Gutwenger:
Advances in the Planarization Method: Effective Multiple Edge Insertions. 87-98 - Ulrik Brandes, Martin Mader:
A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing. 99-110 - Sabine Cornelsen, Andreas Karrenbauer:
Accelerated Bend Minimization. 111-122 - Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades:
TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. 123-135 - Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd:
Edge Routing with Ordered Bundles. 136-147 - Peter Eades, Giuseppe Liotta:
Right Angle Crossing Graphs and 1-Planarity. 148-153 - Immanuel Halupczok, André Schulz:
Pinning Balloons with Perfect Angles and Optimal Area. 154-165 - William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner:
Approximate Proximity Drawings. 166-178 - Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Generalizing Geometric Graphs. 179-190 - Giuseppe Di Battista, Claudio Squarcella, Wolfgang Nagele:
How to Visualize the K-Root Name Server (Demo). 191-202 - Maxime Dumas, Michael J. McGuffin, Jean-Marc Robert, Marie-Claire Willig:
Optimizing a Radial Layout of Bipartite Graphs for a Tool Visualizing Security Alerts. 203-214 - Nicolas Greffard, Fabien Picarougne, Pascale Kuntz:
Visual Community Detection: An Evaluation of 2D, 3D Perspective and 3D Stereoscopic Displays. 215-225 - Michael Burch, Corinna Vehlow, Natalia Konevtsova, Daniel Weiskopf:
Evaluating Partially Drawn Links for Directed Graph Edges. 226-237 - Günter Rote:
Realizing Planar Graphs as Convex Polytopes. 238-241 - Evgenios M. Kornaropoulos, Ioannis G. Tollis:
Overloaded Orthogonal Drawings. 242-253 - Padmini Mukkamala, Dömötör Pálvölgyi:
Drawing Cubic Graphs with the Four Basic Slopes. 254-265 - Andrew Suk:
k-Quasi-Planar Graphs. 266-277 - János Pach, Géza Tóth:
Monotone Crossing Number. 278-289 - Javier Cano, Csaba D. Tóth, Jorge Urrutia:
Upper Bound Constructions for Untangling Planar Geometric Graphs. 290-295 - Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote:
Triangulations with Circular Arcs. 296-307 - Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler:
Planar and Poly-arc Lombardi Drawings. 308-319 - Roman Chernobelskiy, Kathryn I. Cunningham, Michael T. Goodrich, Stephen G. Kobourov, Lowell Trott:
Force-Directed Lombardi-Style Graph Drawing. 320-331 - János Pach:
Every Graph Admits an Unambiguous Bold Drawing. 332-342 - Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Adjacent Crossings Do Matter. 343-354 - Rik Sarkar:
Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane. 355-366 - Michael J. Bannister, David Eppstein:
Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. 367-378 - Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath:
Monotone Drawings of Graphs with Fixed Embedding. 379-390 - Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas:
On the Page Number of Upward Planar Directed Acyclic Graphs. 391-402 - Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
Upward Point Set Embeddability for Convex Point Sets Is in P. 403-414 - Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner:
Classification of Planar Upward Embedding. 415-426 - Carla Binucci, Walter Didimo:
Upward Planarity Testing of Embedded Mixed Graphs. 427-432
Posters
- Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Combining Problems on RAC Drawings and Simultaneous Graph Drawings. 433-434 - Christian Bachmaier, Franz-Josef Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein, Miro Spönemann, Matthias Stegmaier, Michael Wybrow:
The Open Graph Archive: A Community-Driven Effort. 435-440 - Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff:
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. 441-442 - Lukas Holy, Premek Brada:
Viewport for Component Diagrams. 443-444 - Tal Milea, Okke Schrijvers, Kevin Buchin, Herman J. Haverkort:
Shortest-Paths Preserving Metro Maps. 445-446 - Remus Zelina, Sebastian Bota, Siebren Houtman, Jaap Jan van Assen, Bas Hattink:
Challenger, a New Way to Visualize Data. 447-448
Graph Drawing Contest
- Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. 449-455
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-29 02:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
