Regular

All Items

• 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

• On Aligned Bar 1-Visibility Graphs

  Franz Brandenburg, Alexander Esch, Daniel Neuwirth

  281-312

• On Alliance Partitions and Bisection Width for Planar Graphs

  Martin Olsen, Morten Revsbaek

  599-614

• On Area-Universal Quadrangulations

  William Evans, Stefan Felsner, Linda Kleist, Stephen Kobourov

  171-193

• On a Tree and a Path with no Geometric Simultaneous Embedding

  Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth

  37-83

• On Balloon Drawings of Rooted Trees

  Chun-Cheng Lin, Hsu-Chun Yen

  431-452

• On Compatible Matchings

  Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber

  225-240

• On Cotree-Critical and DFS Cotree-Critical Graphs

  Hubert de Fraysseix, Patrice Ossona de Mendez

  411-427

• On Critical Node Problems with Vulnerable Vertices

  Jannik Schestag, Niels Gruettemeier, Christian Komusiewicz, Frank Sommer

  1-26