Regular

All Items

• 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 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

• On Dispersability of Some Circulant Graphs

  Paul C. Kainen, Samuel Joslin, Shannon Overbay

  225-241

• On External-Memory Planar Depth First Search

  Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh

  105-129

• OnGraX: A Web-Based System for the Collaborative Visual Analysis of Graphs

  Björn Zimmer, Andreas Kerren

  5-27

• On k-visibility graphs

  Matthew Babbitt, Jesse Geneson, Tanya Khovanova

  345-360

• On Low Treewidth Graphs and Supertrees

  Alexander Grigoriev, Steven Kelk, Nela Lekić

  325-343

• On L-shaped point set embeddings of trees: first non-embeddable examples

  Torsten Mütze, Manfred Scheucher

  343-369

• On Metro-Line Crossing Minimization

  Evmorfia Argyriou, Michael Bekos, Michael Kaufmann, Antonios Symvonis

  75-96

• On Planar Supports for Hypergraphs

  Kevin Buchin, Marc van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek

  533-549

• On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow

  Kateřina Altmanová, Petr Kolman, Jan Voborník

  303-322

• On RAC Drawings of Graphs with Two Bends per Edge

  Csaba Tóth

  37-45