Vol. 16 No. 2 (2012)

Published: 2012-01-01

Vertex Intersection Graphs of Paths on a Grid

Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern

129-150
- article (PDF)
Drawing Recurrent Hierarchies

Christian Bachmaier, Franz Brandenburg, Wolfgang Brunner, Raymund Fülöp

151-198
- article (PDF)
Centdian Computation in Cactus Graphs

Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir

199-224
- article (PDF)
Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph

Bojan Mohar, Petr Škoda

225-241
- article (PDF)
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area

Erin Chambers, David Eppstein, Michael Goodrich, Maarten Löffler

243-259
- article (PDF)
The Black-and-White Coloring Problem on Chordal Graphs

Shira Zucker

261-281
- article (PDF)
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs

Krishnam Raju Jampani, Anna Lubiw

283-315
- article (PDF)
Visibility Representation of Plane Graphs with Simultaneous Bound for Both Width and Height

Jiun-Jie Wang, Xin He

317-334
- article (PDF)
Finding Hamilton cycles in robustly expanding digraphs

Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus

335-358
- article (PDF)
DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations

Vassilis Tsiaras, Ioannis Tollis

359-380
- article (PDF)
Subgraph Homeomorphism via the Edge Addition Planarity Algorithm

John Boyer

381-410
- article (PDF)
Dynamic Graph Clustering Using Minimum-Cut Trees

Robert Görke, Tanja Hartmann, Dorothea Wagner

411-446
- article (PDF)
The Shortcut Problem - Complexity and Algorithms

Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Andrea Schumm, Dorothea Wagner

447-481
- article (PDF)
The Parking Problem for Finite-State Robots

Arnold Rosenberg

483-506
- article (PDF)
Generating Geometric Graphs Using Automorphisms

Gregory McColm

507-541
- article (PDF)
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics

David Eppstein, Emma Spiro

543-567
- article (PDF)
The Straight-Line RAC Drawing Problem is NP-Hard

Evmorfia Argyriou, Michael Bekos, Antonios Symvonis

569-597
- article (PDF)
Augmenting the Connectivity of Planar and Geometric Graphs

Ignaz Rutter, Alexander Wolff

599-628
- article (PDF)

Vol. 16 No. 2 (2012)

Vertex Intersection Graphs of Paths on a Grid

Drawing Recurrent Hierarchies

Centdian Computation in Cactus Graphs

Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph

Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area

The Black-and-White Coloring Problem on Chordal Graphs

The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs

Visibility Representation of Plane Graphs with Simultaneous Bound for Both Width and Height

Finding Hamilton cycles in robustly expanding digraphs

DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations

Subgraph Homeomorphism via the Edge Addition Planarity Algorithm

Dynamic Graph Clustering Using Minimum-Cut Trees

The Shortcut Problem - Complexity and Algorithms

The Parking Problem for Finite-State Robots

Generating Geometric Graphs Using Automorphisms

The h-Index of a Graph and its Application to Dynamic Subgraph Statistics

The Straight-Line RAC Drawing Problem is NP-Hard

Augmenting the Connectivity of Planar and Geometric Graphs

Make a Submission

Information

Browse

Current Issue

Journal publisher

Journal network

Journal Supporters