Regular

All Items

• Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics

  Markus Chimani, Max Ilsen, Tilo Wiedera

  71-94

• Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry

  Chris Barrett, Achla Marathe, Madhav Marathe, Doug Cook, Gregory Hicks, Vance Faber, Aravind Srinivasan, Yoram Sussmann, Heidi Thornquist

  3-31

• Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio

  Ashim Garg, Adrian Rusu

  135-160

• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions

  Stefan Felsner, Giuseppe Liotta, Stephen Wismath

  363-398

• Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area

  Md. Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman

  437-456

• Straight-Line Triangle Representations via Schnyder Labelings

  Nieke Aerts, Stefan Felsner

  467-505

• Subgraph Homeomorphism via the Edge Addition Planarity Algorithm

  John Boyer

  381-410

• Subgraph Isomorphism in Planar Graphs and Related Problems

  David Eppstein

  1-27

• Superpatterns and Universal Point Sets

  Michael Bannister, Zhanpeng Cheng, William Devanny, David Eppstein

  177-209

• Switch-Regular Upward Planarity Testing of Directed Trees

  Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin

  587-629

• Symmetry Breaking Constraints for the Minimum Deficiency Problem

  Sivan Altinakar, Gilles Caporossi, Alain Hertz

  195-218

• Synchronized Traveling Salesman Problem

  Gyula Pap, József Varnyú

  437-459

• Techniques for the Refinement of Orthogonal Graph Drawings

  Janet Six, Konstantinos Kakoulis, Ioannis Tollis

  75-103

• Testing Simultaneous Planarity when the Common Graph is 2-Connected

  Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw

  147-171

• 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