Regular

All Items

• Minimum-Area Drawings of Plane 3-Trees

  Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Muhammad Jawaherul Alam

  177-204

• Minimum Eccentricity Shortest Paths in some Structured Graph Classes

  Feodor Dragan, Arne Leitert

  299-322

• Minimum-Layer Upward Drawings of Trees

  Muhammad Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman

  245-267

• Minimum Linear Arrangement of Generalized Sierpinski Graphs

  Sundara Rajan R, Berin Greeni A, Leo Joshwa P

  767-782

• Minmax Tree Cover in the Euclidean Space

  Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi

  345-371

• Monotone Drawings of Graphs

  Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani

  5-35

• Monotone Simultaneous Embeddings of Upward Planar Digraphs

  Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Alexander Pilz, Birgit Vogtenhuber

  87-110

• Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid

  Eranda Çela, Elisabeth Gaar

  519-552

• More Canonical Ordering

  Melanie Badent, Ulrik Brandes, Sabine Cornelsen

  97-126

• 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

• 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