Regular

All Items

• The (3,1)-ordering for 4-connected planar triangulations

  Therese Biedl, Martin Derka

  347-362

• The agreement problem for unrooted phylogenetic trees is FPT

  Celine Scornavacca, Leo van Iersel, Steven Kelk, David Bryant

  385-392

• The Black-and-White Coloring Problem on Chordal Graphs

  Shira Zucker

  261-281

• The Black-and-White Coloring Problem on Trees

  Daniel Berend, Shira Zucker

  133-152

• The Complexity of Angular Resolution

  Marcus Schaefer

  565-580

• The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing

  David Eppstein

  35-55

• The Complexity of Drawing a Graph in a Polygonal Region

  Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal

  421-446

• The Complexity of Drawing Graphs on Few Lines and Few Planes

  Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff

  459-488

• The Complexity of Poset Games

  Stephen Fenner, Daniel Grier, Rohit Gurjar, Arpita Korwar, Thomas Thierauf

  1-14

• The Complexity of Simultaneous Geometric Graph Embedding

  Jean Cardinal, Vincent Kusters

  259-272

• 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