Regular

All Items

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

• On the Maximum Independent Set Problem in Subclasses of Planar Graphs

  Vadim Lozin, Martin Milanič

  269-286

• On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens

  Stefan Felsner, Michael Hoffmann, Kristin Knorr, Jan Kynčl, Irene Parada

  381-399

• On the NP-hardness of GRacSim drawing and k-SEFE Problems

  Luca Grilli

  101-116

• On the Page Number of Upward Planar Directed Acyclic Graphs

  Fabrizio Frati, Radoslav Fulek, Andres Ruiz-Vargas

  221-244

• On the Perspectives Opened by Right Angle Crossing Drawings

  Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati, Giuseppe Di Battista, Michael Kaufmann, Antonios Symvonis

  53-78

• On the size of planarly connected crossing graphs

  Eyal Ackerman, Balázs Keszegh, Mate Vizer

  11-22

• On the threshold-width of graphs

  Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng

  253-268

• On the Total Number of Bends for Planar Octilinear Drawings

  Michael Bekos, Michael Kaufmann, Robert Krug

  709-730

• On the Upward Planarity of Mixed Plane Graphs

  Fabrizio Frati, Michael Kaufmann, János Pach, Csaba Tóth, David Wood

  253-279

• On Turn-Regular Orthogonal Representations

  Michael Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter

  285-306

• On Universal Point Sets for Planar Graphs

  Jean Cardinal, Michael Hoffmann, Vincent Kusters

  529-547

• Optical Graph Recognition

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

  541-565

• Optimal 3D Angular Resolution for Low-Degree Graphs

  David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg

  173-200