Vol. 19 No. 1 (2015)

Published: 2015-01-01

Two-floor buildings need eight colors

Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni

1-9
- article (PDF)
Optimal Data Structures for Farthest-Point Queries in Cactus Networks

Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel Smid

11-41
- article (PDF)
Triangulations with Circular Arcs

Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Kateřina Čech Dobiášová, Bert Jüttler, Günter Rote

43-65
- article (PDF)
1-Planarity of Graphs with a Rotation System

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

67-86
- article (PDF)
Monotone Simultaneous Embeddings of Upward Planar Digraphs

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

87-110
- article (PDF)
Ordering Metro Lines by Block Crossings

Martin Fink, Sergey Pupyrev, Alexander Wolff

111-153
- article (PDF)
- null null
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs

Sepp Hartung, Christian Komusiewicz, André Nichterlein

155-190
- article (PDF)
Algorithms for the Hypergraph and the Minor Crossing Number Problems

Markus Chimani, Carsten Gutwenger

191-222
- article (PDF)
A Distributed Algorithm for Minimum Distance-k Domination in Trees

Volker Turau, Sven Köhler

223-242
- article (PDF)
Point-Set Embedding in Three Dimensions

Henk Meijer, Stephen Wismath

243-257
- article (PDF)
The Complexity of Simultaneous Geometric Graph Embedding

Jean Cardinal, Vincent Kusters

259-272
- article (PDF)
A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality

Khaled Elbassioni

273-280
- article (PDF)
Planar Induced Subgraphs of Sparse Graphs

Glencora Borradaile, David Eppstein, Pingan Zhu

281-297
- article (PDF)
Every graph admits an unambiguous bold drawing

János Pach

299-312
- article (PDF)
Metric Dimension Parameterized by Max Leaf Number

David Eppstein

313-323
- article (PDF)
On Low Treewidth Graphs and Supertrees

Alexander Grigoriev, Steven Kelk, Nela Lekić

325-343
- article (PDF)
On k-visibility graphs

Matthew Babbitt, Jesse Geneson, Tanya Khovanova

345-360
- article (PDF)
Embeddings Between Hypercubes and Hypertrees

R. Sundara Rajan, Paul Manuel, Indra Rajasingh

361-373
- article (PDF)
Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

Seth Pettie

375-391
- article (PDF)
Drawing Graphs with Few Arcs

André Schulz

393-412
- article (PDF)
Fitting Planar Graphs on Planar Maps

Md. Jawaherul Alam, Michael Kaufmann, Stephen Kobourov, Tamara Mchedlidze

413-440
- article (PDF)
Graph Orientations Optimizing the Number of Light or Heavy Vertices

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

441-465
- article (PDF)
Straight-Line Triangle Representations via Schnyder Labelings

Nieke Aerts, Stefan Felsner

467-505
- article (PDF)
The Min-Max Edge q-Coloring Problem

Tommi Larjomaa, Alexandru Popa

507-528
- article (PDF)
On Universal Point Sets for Planar Graphs

Jean Cardinal, Michael Hoffmann, Vincent Kusters

529-547
- article (PDF)
Connected (s,t)-Vertex Separator Parameterized by Chordality

N. Narayanaswamy, N. Sadagopan

549-565
- article (PDF)

Vol. 19 No. 1 (2015)

Two-floor buildings need eight colors

Optimal Data Structures for Farthest-Point Queries in Cactus Networks

Triangulations with Circular Arcs

1-Planarity of Graphs with a Rotation System

Monotone Simultaneous Embeddings of Upward Planar Digraphs

Ordering Metro Lines by Block Crossings

Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs

Algorithms for the Hypergraph and the Minor Crossing Number Problems

A Distributed Algorithm for Minimum Distance-k Domination in Trees

Point-Set Embedding in Three Dimensions

The Complexity of Simultaneous Geometric Graph Embedding

A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality

Planar Induced Subgraphs of Sparse Graphs

Every graph admits an unambiguous bold drawing

Metric Dimension Parameterized by Max Leaf Number

On Low Treewidth Graphs and Supertrees

On k-visibility graphs

Embeddings Between Hypercubes and Hypertrees

Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

Drawing Graphs with Few Arcs

Fitting Planar Graphs on Planar Maps

Graph Orientations Optimizing the Number of Light or Heavy Vertices

Straight-Line Triangle Representations via Schnyder Labelings

The Min-Max Edge q-Coloring Problem

On Universal Point Sets for Planar Graphs

Connected (s,t)-Vertex Separator Parameterized by Chordality

Make a Submission

Information

Browse

Current Issue

Journal publisher

Journal network

Journal Supporters