Regular

All Items

• The Complexity of the Fixed Clique Property

  Bernd Schröder

  351-363

• The Complexity of the Simultaneous Cluster Problem

  Zhentao Li, Manikandan Narayanan, Adrian Vetta

  1-34

• The Degenerate Crossing Number and Higher-Genus Embeddings

  Marcus Schaefer, Daniel Štefankovič

  35-58

• The Effect of Planarization on Width

  David Eppstein

  461-481

• The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings

  Michael Bannister, William Devanny, David Eppstein, Michael Goodrich

  619-656

• The h-Index of a Graph and its Application to Dynamic Subgraph Statistics

  David Eppstein, Emma Spiro

  543-567

• The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree

  Thim Strothmann

  79-100

• The Knapsack Problem with Conflict Graphs

  Ulrich Pferschy, Joachim Schauer

  233-249

• The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability

  Vahan Mkrtchyan

  129-147

• The Minimum Consistent Spanning Subset Problem on Trees

  Ahmad Biniaz, Parham Khamsepour

  81-93

• The Minimum Moving Spanning Tree Problem

  Hugo Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid

  1-18

• The Min-Max Edge q-Coloring Problem

  Tommi Larjomaa, Alexandru Popa

  507-528

• The Multi-Commodity Source Location Problems and the Price of Greed

  Hiro Ito, Mike Paterson, Kenya Sugihara

  55-73

• The number of crossings in multigraphs with no empty lens

  Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt

  383-396

• The Parking Problem for Finite-State Robots

  Arnold Rosenberg

  483-506

• The role of twins in computing planar supports of hypergraphs

  René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge

  51-79

• The Shortcut Problem - Complexity and Algorithms

  Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Andrea Schumm, Dorothea Wagner

  447-481

• The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs

  Krishnam Raju Jampani, Anna Lubiw

  283-315

• The SNPR neighbourhood of tree-child networks

  Jonathan Klawitter

  329-355

• The Star and Biclique Coloring and Choosability Problems

  Marina Groshaus, Francisco Soulignac, Pablo Terlisky

  347-383

• The Star Clustering Algorithm for Static and Dynamic Information Organization

  Javed Aslam, Ekaterina Pelekhov, Daniela Rus

  95-129

• The Straight-Line RAC Drawing Problem is NP-Hard

  Evmorfia Argyriou, Michael Bekos, Antonios Symvonis

  569-597

• The Stub Resolution of 1-planar Graphs

  Michael Kaufmann, Jan Kratochvil, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi Raftopoulou, Pavel Valtr

  625-642

• The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant

  Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka

  29-70

• The Traveling Salesman Problem for Cubic Graphs

  David Eppstein

  61-81