Vol. 21 No. 4 (2017)

Published: 2017-02-01

Essential Constraints of Edge-Constrained Proximity Graphs

Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel Smid

389-415
- article (PDF)
Incremental Network Design with Minimum Spanning Trees

Konrad Engel, Thomas Kalinowski, Martin Savelsbergh

417-432
- article (PDF)
Drawing Planar Graphs with Reduced Height

Stephane Durocher, Debajyoti Mondal

433-453
- article (PDF)
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory

Francisco Soulignac

455-489
- article (PDF)
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms

Francisco Soulignac

491-525
- article (PDF)
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem

Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel Smid

527-546
- article (PDF)
A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints

Max Ward, Andrew Gozzard, Amitava Datta

547-554
- article (PDF)
A Note on the Existence of All (g,f)-Factors

Radosław Cymer

555-560
- article (PDF)
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments

Alexander Igamberdiev, Wouter Meulemans, André Schulz

561-588
- article (PDF)
Topological Decomposition of Directed Graphs

Ala Abuthawabeh, Dirk Zeckzer

589-630
- article (PDF)
Ideal Drawings of Rooted Trees With Approximately Optimal Width

Therese Biedl

631-648
- article (PDF)
D-resolvability of vertices in planar graphs

James Tilley

649-661
- article (PDF)
Rooted Cycle Bases

David Eppstein, J. Michael McCarthy, Brian Parrish

663-686
- article (PDF)
Egalitarian Graph Orientations

Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon Wilfong, Lisa Zhang

687-708
- article (PDF)
On the Total Number of Bends for Planar Octilinear Drawings

Michael Bekos, Michael Kaufmann, Robert Krug

709-730
- article (PDF)
Intersection-Link Representations of Graphs

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter

731-755
- article (PDF)
Progress on Partial Edge Drawings

Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff

757-786
- article (PDF)

Vol. 21 No. 4 (2017)

Essential Constraints of Edge-Constrained Proximity Graphs

Incremental Network Design with Minimum Spanning Trees

Drawing Planar Graphs with Reduced Height

Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory

Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms

Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem

A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints

A Note on the Existence of All (g,f)-Factors

Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments

Topological Decomposition of Directed Graphs

Ideal Drawings of Rooted Trees With Approximately Optimal Width

D-resolvability of vertices in planar graphs

Rooted Cycle Bases

Egalitarian Graph Orientations

On the Total Number of Bends for Planar Octilinear Drawings

Intersection-Link Representations of Graphs

Progress on Partial Edge Drawings

Make a Submission

Information

Browse

Current Issue

Journal publisher

Journal network

Journal Supporters