Regular

All Items

• More Flexible Radial Layout

  Ulrik Brandes, Christian Pich

  157-173

• More on Generalized Jewels and the Point Placement Problem

  Md. Shafiul Alam, Asish Mukhopadhyay

  133-173

• Morphing Planar Graph Drawings with Bent Edges

  Anna Lubiw, Mark Petrick

  205-227

• Morphing Planar Graphs in Spherical Space

  Stephen Kobourov, Matthew Landis

  113-127

• Morphing tree drawings in a small 3D grid

  Elena Arseneva, Rahul Gangopadhyay, Aleksandra Istomina

  241-279

• Multilayer Drawings of Clustered Graphs

  Fabrizio Frati

  633-675

• Multilevel Planarity

  Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher

  151-170

• Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme

  Markus Chimani, Philipp Hungerländer

  329-362

• Nash Equilibria in Reverse Temporal Voronoi Games

  Simeon Pawlowski, Vincent Froese

  301-312

• Navigating Clustered Graphs Using Force-Directed Methods

  Peter Eades, Mao Lin Huang

  157-181

• New Approximation to the One-sided Radial Crossing Minimization

  Seok-Hee Hong, Hiroshi Nagamochi

  179-196

• New Bounds for Oblivious Mesh Routing

  Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano

  17-38

• New complexity results for time-constrained dynamical optimal path problems

  Sebastian Kluge, Martin Brokate, Konrad Reif

  123-147

• New Lower Bounds For Orthogonal Drawings

  Therese Biedl

  1-31

• Node Overlap Removal Algorithms: an Extended Comparative Study

  Fati Chen, Laurent Piccinini, Pascal Poncelet, Arnaud Sallaberry

  683-706

• Node Overlap Removal by Growing a Tree

  Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander Holroyd

  857-872

• Non-aligned Drawings of Planar Graphs

  Therese Biedl, Claire Pennarun

  915-937

• Non-binary universal tree-based networks

  Mareike Fischer, Michelle Galla, Kristina Wicke

  81-90

• Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time

  Lorenzo Balzotti, Paolo Franciosa

  589-606

• NP-Completeness of Minimal Width Unordered Tree Layout

  Kim Marriott, Peter Stuckey

  295-312

• NP-completeness of the Planar Separator Problems

  Junichiro Fukuyama

  317-328

• On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering

  Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier

  521-547

• On 3-Coloring Circle Graphs

  Patricia Bachmann, Ignaz Rutter, Peter Stumpf

  389-402

• On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area

  Md. Rezaul Karim, Md. Saidur Rahman

  153-177

• On Algorithms Employing Treewidth for $L$-bounded Cut Problems

  Petr Kolman

  177-191