Regular

655 Items

Papers reporting the results of important and original research.

All Items

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
On Strict (Outer-)Confluent Graphs

Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg

481-512
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT

Bart Jansen

219-243
On the Approximability of Comparing Genomes with Duplicates

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette

19-53
On the Approximability of the Minimum Weight $t$-partite Clique Problem

Geoffrey Solano, Guillaume Blin, Mathieu Raffinot, Jhoirene Clemente, Jaime Caro

171-190
On the approximation of Min Split-coloring and Min Cocoloring

Marc Demange, Tinaz Ekim, Dominique de Werra

297-315
On the Balance of Unrooted Trees

Mareike Fischer, Volkmar Liebscher

133-150
On the Biplanarity of Blowups

David Eppstein

83-99
On the Circumference of Essentially 4-connected Planar Graphs

Igor Fabrici, Jochen Harant, Samuel Mohr, Jens Schmidt

21-46
On the Complexity of Partitioning Graphs for Arc-Flags

Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner

265-299
On the Complexity of Some Geometric Problems With Fixed Parameters

Marcus Schaefer

195-218
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition

John Boyer, Wendy Myrvold

241-273
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs

Vahan Mkrtchyan, Garik Petrosyan

91-110
On the Maximum Crossing Number

Markus Chimani, Stefan Felsner, Stephen Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff

67-87

Previous 426-450 of 655 Next

Regular

All Items

On Cotree-Critical and DFS Cotree-Critical Graphs

On Critical Node Problems with Vulnerable Vertices

On Dispersability of Some Circulant Graphs

On External-Memory Planar Depth First Search

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

On k-visibility graphs

On Low Treewidth Graphs and Supertrees

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

On Metro-Line Crossing Minimization

On Planar Supports for Hypergraphs

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

On RAC Drawings of Graphs with Two Bends per Edge

On Strict (Outer-)Confluent Graphs

On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT

On the Approximability of Comparing Genomes with Duplicates

On the Approximability of the Minimum Weight $t$-partite Clique Problem

On the approximation of Min Split-coloring and Min Cocoloring

On the Balance of Unrooted Trees

On the Biplanarity of Blowups

On the Circumference of Essentially 4-connected Planar Graphs

On the Complexity of Partitioning Graphs for Arc-Flags

On the Complexity of Some Geometric Problems With Fixed Parameters

On the Cutting Edge: Simplified O(n) Planarity by Edge Addition

On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs

On the Maximum Crossing Number

Make a Submission

Information

Browse

Current Issue

Journal publisher

Journal network

Journal Supporters