Regular

All Items

• $st$-Orientations with Few Transitive Edges

  Carla Binucci, Walter Didimo, Maurizio Patrignani

  625-650

• 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved

  Therese Biedl

  1-15

• 1-Bend Orthogonal Partial Edge Drawing

  Till Bruckdorfer, Michael Kaufmann, Fabrizio Montecchiani

  111-131

• 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids

  Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides

  281-327

• 1-Planarity of Graphs with a Rotation System

  Christopher Auer, Franz Brandenburg, Andreas Gleißner, Josef Reislhuber

  67-86

• 1-Visibility Representations of 1-Planar Graphs

  Franz Brandenburg

  421-438

• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms

  Michael Jünger, Petra Mutzel

  1-25

• A 2.5D Hierarchical Drawing of Directed Graphs

  Seok-Hee Hong, Nikola Nikolov, Alexandre Tarassov

  371-396

• A 6-Regular Torus Graph Family with Applications to Cellular and Interconnection Networks

  Mihaela Iridon, David Matula

  373-404

• A Binomial Distribution Model for the Traveling Salesman Problem Based on Frequency Quadrilaterals

  Yong Wang, Jeffrey Remmel

  411-434

• A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs

  Leqiang Bai, Hajime Maeda, Hiroyuki Ebara, Hideo Nakano

  1-17

• Accelerated Bend Minimization

  Sabine Cornelsen, Andreas Karrenbauer

  635-650

• Acyclic Orientation of Drawings

  Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote

  367-384

• A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane

  Éric Colin de Verdière, Vojtěch Kaluža, Pavel Paták, Zuzana Patáková, Martin Tancer

  939-981

• A Distributed Algorithm for Minimum Distance-k Domination in Trees

  Volker Turau, Sven Köhler

  223-242

• Adjacent Crossings Do Matter

  Radoslav Fulek, Michael Pelsmajer, Marcus Schaefer, Daniel Štefankovič

  759-782

• Advances in the Planarization Method: Effective Multiple Edge Insertions

  Markus Chimani, Carsten Gutwenger

  729-757

• Advantage in the discrete Voronoi game

  Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote

  439-457

• Aesthetic Discrimination of Graph Layouts

  Tamara Mchedlidze, Alexey Pak, Moritz Klammler

  525-552

• A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping

  Reuven Bar-Yehuda, Irad Yavneh

  123-139

• A family of tree-based generators for bubbles in directed graphs

  Vicente Acuña, Leandro Ishi Soares de Lima, Giuseppe Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri

  563-580

• A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions

  Akiyoshi Shioura, Mutsunori Yagiura

  391-407

• A Fast Multi-Scale Method for Drawing Large Graphs

  David Harel, Yehuda Koren

  179-202

• A First Order Logic Definition of Beyond-Planar Graphs

  Franz Brandenburg

  51-66

• A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width

  Michael Jünger, Petra Mutzel, Christiane Spisla

  499-524