Regular

All Items

• Drawing Clustered Graphs on an Orthogonal Grid

  Peter Eades, Qingwen Feng, Hiroshi Nagamochi

  3-29

• Drawing Clustered Planar Graphs on Disk Arrangements

  Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel

  105-131

• Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area

  Erin Chambers, David Eppstein, Michael Goodrich, Maarten Löffler

  243-259

• Drawing Graphs on a Smartphone

  Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia

  109-126

• Drawing Graphs on Few Circles and Few Spheres

  Myroslav Kryven, Alexander Ravsky, Alexander Wolff

  371-391

• Drawing Graphs on Two and Three Lines

  Sabine Cornelsen, Thomas Schank, Dorothea Wagner

  161-177

• Drawing graphs using modular decomposition

  Charis Papadopoulos, Costas Voglis

  481-511

• Drawing Graphs with Few Arcs

  André Schulz

  393-412

• Drawing Graphs Within Graphs

  Paul Holleis, Thomas Zimmermann, Daniel Gmach

  7-18

• Drawing Halin-graphs with small height

  Therese Biedl, Milap Sheth

  473-502

• Drawing Order Diagrams Through Two-Dimension Extension

  Dominik Dürrschnabel, Tom Hanika, Gerd Stumme

  783-802

• Drawing outer-1-planar graphs revisited

  Therese Biedl

  59-73

• Drawing Outer 1-planar Graphs with Few Slopes

  Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani

  707-741

• Drawing Partially Embedded and Simultaneously Planar Graphs

  Timothy Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer

  681-706

• Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments

  Alexander Igamberdiev, Wouter Meulemans, André Schulz

  561-588

• Drawing Planar Graphs with Few Geometric Primitives

  Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz

  357-387

• Drawing Planar Graphs with Large Vertices and Thick Edges

  Gill Barequet, Michael Goodrich, Chris Riley

  3-20

• Drawing Planar Graphs with Reduced Height

  Stephane Durocher, Debajyoti Mondal

  433-453

• Drawing Recurrent Hierarchies

  Christian Bachmaier, Franz Brandenburg, Wolfgang Brunner, Raymund Fülöp

  151-198

• Drawing Shortest Paths in Geodetic Graphs

  Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen Kobourov, Thomas Schneck

  353-361

• Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles

  Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz

  1-28

• Drawing Unordered Trees on k-Grids

  Christian Bachmaier, Marco Matzeder

  103-128

• D-resolvability of vertices in planar graphs

  James Tilley

  649-661

• Dynamic Graph Clustering Using Minimum-Cut Trees

  Robert Görke, Tanja Hartmann, Dorothea Wagner

  411-446

• Dynamic Spectral Layout with an Application to Small Worlds

  Ulrik Brandes, Daniel Fleischer, Thomas Puppe

  325-343