Regular

All Items

• 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

• Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees

  A. Karim Abu-Affash, Paz Carmi, Meytal Maman

  3-10

• 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

• Planar Drawings of Higher-Genus Graphs

  Christian Duncan, Michael Goodrich, Stephen Kobourov

  7-32

• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard

  Sergio Cabello

  353-363

• Planar Embeddings of Graphs with Specified Edge Lengths

  Sergio Cabello, Erik Demaine, Günter Rote

  259-276

• Planar Graphs as VPG-Graphs

  Steven Chaplick, Torsten Ueckerdt

  475-494

• Planar Graphs with Topological Constraints

  Christoph Dornheim

  27-66

• Planar Induced Subgraphs of Sparse Graphs

  Glencora Borradaile, David Eppstein, Pingan Zhu

  281-297

• Planarity of Overlapping Clusterings Including Unions of Two Partitions

  Jan Christoph Athenstädt, Sabine Cornelsen

  1057-1089

• Planarity Testing and Optimal Edge Insertion with Embedding Constraints

  Carsten Gutwenger, Karsten Klein, Petra Mutzel

  73-95

• Planarizing Graphs - A Survey and Annotated Bibliography

  Annegret Liebers

  1-74

• Planar L-Drawings of Bimodal Graphs

  Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo

  307-334