Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDGD 2015: Los Angeles, CA, USA
- Emilio Di Giacomo, Anna Lubiw:
Graph Drawing and Network Visualization - 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9411, Springer 2015, ISBN 978-3-319-27260-3
Large and Dynamic Graphs
- Lev Nachmanson, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, Xiaoji Chen:
GraphMaps: Browsing Large Graphs as Interactive Maps. 3-15 - Tarik Crnovrsanin, Jacqueline Chu, Kwan-Liu Ma:
An Incremental Layout Method for Visualizing Online Dynamic Graphs. 16-29 - Henning Meyerhenke
, Martin Nöllenburg, Christian Schulz:
Drawing Large Graphs by Multilevel Maxent-Stress Optimization. 30-43 - Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Million Edge Drawing for a Fistful of Dollars. 44-51 - Fabian Lipp, Alexander Wolff, Johannes Zink:
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. 52-59
Crossing Numbers
- Marcus Schaefer, Daniel Stefankovic:
The Degenerate Crossing Number and Higher-Genus Embeddings. 63-74 - Drago Bokal, Mojca Bracic, Marek Dernár, Petr Hlinený:
On Degree Properties of Crossing-Critical Families of Graphs. 75-86 - Vida Dujmovic, David Eppstein, David R. Wood:
Genus, Treewidth, and Local Crossing Number. 87-98 - Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity. 99-110
Experiments
- Alexander Igamberdiev, Wouter Meulemans, André Schulz:
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments. 113-124 - Michael A. Bekos, Michael Kaufmann, Christian Zielke:
The Book Embedding Problem from a SAT-Solving Perspective. 125-138 - Ulf Rüegg, Christoph Daniel Schulze, John Julian Carstens, Reinhard von Hanxleden:
Size- and Port-Aware Horizontal Node Coordinate Assignment. 139-150
Area, Bends, Crossings
- Therese C. Biedl, Jens M. Schmidt:
Small-Area Orthogonal Drawings of 3-Connected Graphs. 153-165 - Fabrizio Frati, Michael Hoffmann, Vincent Kusters:
Simultaneous Embeddings with Few Bends and Crossings. 166-179 - David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun:
Rook-Drawing for Plane Graphs. 180-191 - Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash:
On Minimizing Crossings in Storyline Visualizations. 192-198 - Christian A. Duncan:
Maximizing the Degree of (Geometric) Thickness-t Regular Graphs. 199-204
Intersection Representations
- Nabil H. Mustafa, János Pach:
On the Zarankiewicz Problem for Intersection Hypergraphs. 207-216 - Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. 217-230 - Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt:
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. 231-244
Applications
- Björn Zimmer, Andreas Kerren:
Displaying User Behavior in the Collaborative Graph Visualization System OnGraX. 247-259 - Michael J. Bannister, David A. Brown, David Eppstein:
Confluent Orthogonal Drawings of Syntax Diagrams. 260-271 - Walter Didimo, Francesco Giacchè, Fabrizio Montecchiani:
Kojaph: Visual Definition and Exploration of Patterns in Graph Databases. 272-278
Drawings with Crossings
- Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis:
2-Layer Fan-Planarity: From Caterpillar to Stegosaurus. 281-294 - Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and Drawing IC-Planar Graphs. 295-308 - Jan Kyncl:
Simple Realizability of Complete Abstract Topological Graphs Simplified. 309-320 - Vida Dujmovic:
The Utility of Untangling. 321-332
Polygons and Convexity
- Oswin Aichholzer, Therese C. Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, Birgit Vogtenhuber:
Representing Directed Trees as Straight Skeletons. 335-347 - Ignacio García-Marco, Kolja Knauer:
Drawing Graphs with Vertices and Edges in Convex Position. 348-359 - Martin Balko, Josef Cibulka, Pavel Valtr:
Drawing Graphs Using a Small Number of Obstacles. 360-372 - Radoslav Fulek, Rados Radoicic:
Vertical Visibility Among Parallel Polygons in Three Dimensions. 373-379
Drawing Graphs on Point Sets
- William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Alternating Paths and Cycles of Minimum Length. 383-394 - Till Bruckdorfer, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
On Embeddability of Buses in Point Sets. 395-408 - Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, Tamara Mchedlidze:
A Universal Point Set for 2-Outerplanar Graphs. 409-422 - Maarten Löffler, Csaba D. Tóth:
Linear-Size Universal Point Sets for One-Bend Drawings. 423-429
Contact Representations
- Boris Klemz, Martin Nöllenburg, Roman Prutkin:
Recognizing Weighted Disk Contact Graphs. 433-446 - Clinton Bowen, Stephane Durocher, Maarten Löffler, Anika Rounds, André Schulz, Csaba D. Tóth:
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees. 447-459 - Vincent Kusters, Bettina Speckmann:
Towards Characterizing Graphs with a Sliceable Rectangular Dual. 460-471 - Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff:
Pixel and Voxel Representations of Graphs. 472-486
User Studies
- Wouter Meulemans, André Schulz:
A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams. 489-501 - Peter Eades, Seok-Hee Hong, Karsten Klein, An Nguyen:
Shape-Based Quality Metrics for Large Graph Visualization. 502-514 - Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
On the Readability of Boundary Labeling. 515-527
Graph Drawing Contest
- Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. 531-537
Graduate Workshop Report
- Bernardo M. Ábrego, Silvia Fernández-Merchant, Csaba D. Tóth:
Graduate Workshop Recent Trends in Graph Drawing: Curves, Graphs, and Intersections. 541
Posters
- Giuseppe Liotta, Fabrizio Montecchiani:
L-Visibility Drawings of IC-Planar Graphs. 545-547 - Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
On the Relationship Between Map Graphs and Clique Planar Graphs. 548-550 - Till Bruckdorfer, Michael Kaufmann, Simon Leibßle:
PED User Study. 551-553 - Dustin Lockhart Arendt:
SVEN: An Alternative Storyline Framework for Dynamic Graph Visualization. 554-555 - Michael T. Goodrich, Timothy Johnson, Manuel R. Torres:
Knuthian Drawings of Series-Parallel Flowcharts. 556-557 - Stephen G. Kobourov, Tamara Mchedlidze, Laura Vonessen:
Gestalt Principles in Graph Drawing. 558-560 - Yeganeh Bahoo, Andrea Bunt, Stephane Durocher, Sahar Mehrpour:
Drawing Graphs Using Body Gestures. 561-562 - Hugo Alves Akitaya, Jonathan Castello, Yauheniya Lahoda, Anika Rounds, Csaba D. Tóth:
Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity. 563-564
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 2020-11-30 21:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
