Regular

All Items

• Optimal Algorithms to Embed Trees in a Point Set

  P. Bose, M. McAllister, J. Snoeyink

  1-15

• Optimal Angular Resolution for Face-Symmetric Drawings

  David Eppstein, Kevin Wortman

  551-564

• Optimal Data Structures for Farthest-Point Queries in Cactus Networks

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

  11-41

• Ordering Metro Lines by Block Crossings

  Martin Fink, Sergey Pupyrev, Alexander Wolff

  111-153

• Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width)

  Johannes Batzill, Therese Biedl

  1-19

• Order Reconfiguration under Width Constraints

  Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf

  409-431

• Orthogonal Drawings of Plane Graphs Without Bends

  Md. Saidur Rahman, Takao Nishizeki, Mahmuda Naznin

  335-362

• Orthogonal Hypergraph Drawing for Improved Visibility

  Thomas Eschbach, Wolfgang Guenther, Bernd Becker

  141-157

• Overlapping Cluster Planarity

  Walter Didimo, Francesco Giordano, Giuseppe Liotta

  267-291

• Packing Trees into 1-planar Graphs

  Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen Wismath

  605-624

• Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game

  Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi

  247-263

• Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs

  Sepp Hartung, Christian Komusiewicz, André Nichterlein

  155-190

• Parameterized Algorithms for Book Embedding Problems

  Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg

  603-620

• Parameterized Algorithms for Queue Layouts

  Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg

  335-352

• Parameterized Algorithms for (r,l)-Partization

  R. Krithika, N. Narayanaswamy

  129-146

• Parameterized Algorithms for the H-Packing with t-Overlap Problem

  Alejandro López-Ortiz, Jazmín Romero

  515-538

• Parameterized and approximation complexity of the detection pair problem in graphs

  Florent Foucaud, Ralf Klasing

  1039-1056

• Parameterized Complexity of 1-Planarity

  Michael Bannister, Sergio Cabello, David Eppstein

  23-49

• Parameterized Complexity of Geodetic Set

  Leon Kellerhals, Tomohiro Koana

  401-419

• Parameterized Complexity of Safe Set

  Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi

  215-245

• Parameters of Bar k-Visibility Graphs

  Stefan Felsner, Mareike Massow

  5-27

• Phylogenetic incongruence through the lens of Monadic Second Order logic

  Steven Kelk, Leo van Iersel, Celine Scornavacca, Mathias Weller

  189-215

• Pinning balloons with perfect angles and optimal area

  Immanuel Halupczok, André Schulz

  847-870

• Planar and Toroidal Morphs Made Easier

  Jeff Erickson, Patrick Lin

  95-118

• Planar Confluent Orthogonal Drawings of 4-Modal Digraphs

  Sabine Cornelsen, Gregor Diatzko

  523-540