Regular

All Items

• Pole Dancing: 3D Morphs for Tree Drawings

  Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmović, Fabrizio Frati, Stefan Langerman, Alessandra Tappini

  579-602

• Polygons with Prescribed Angles in 2D and 3D

  Alon Efrat, Radoslav Fulek, Stephen Kobourov, Csaba Tóth

  363-380

• Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics

  Nils Kriege, Petra Mutzel, Till Schäfer

  577-602

• Problems on One Way Road Networks

  Jammigumpula Ajay, Avinandan Das, Binayak Dutta, Arindam Karmakar, Sasanka Roy, Navaneeta Saikia

  523-546

• Progress on Partial Edge Drawings

  Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff

  757-786

• Propagation Rules for Graph Partitioning Constraints

  Radosław Cymer

  363-410

• Properties of Large 2-Crossing-Critical Graphs

  Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko Wagner, Tilo Wiedera

  111-147

• Proportional Contact Representations of Planar Graphs

  Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen Kobourov

  701-728

• Quasipolynomiality of the Smallest Missing Induced Subgraph

  David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams

  329-339

• RAC-Drawability is ∃ℝ-complete and Related Results

  Marcus Schaefer

  803-841

• Radial Level Planarity Testing and Embedding in Linear Time

  Christian Bachmaier, Franz Brandenburg, Michael Forster

  53-97

• Radial Level Planarity with Fixed Embedding

  Guido Brückner, Ignaz Rutter

  353-366

• Random Popular Matchings with Incomplete Preference Lists

  Suthee Ruangwises, Toshiya Itoh

  815-835

• Realization of Posets

  Patrice Ossona deMendez

  149-153

• Recognition of Unigraphs through Superposition of Graphs

  Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi

  323-343

• Recognizing IC-Planar and NIC-Planar Graphs

  Franz Brandenburg

  239-271

• Recognizing Partial Cubes in Quadratic Time

  David Eppstein

  269-293

• Recognizing Stick Graphs with and without Length Constraints

  Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink

  657-681

• Reconfiguration of vertex-disjoint shortest paths on graphs

  Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara

  87-101

• Reconfiguring Minimum Dominating Sets in Trees

  Magdalena Lemańska, Paweł Żyliński

  47-61

• Reconstructing Generalized Staircase Polygons with Uniform Step Length

  Nodari Sitchinava, Darren Strash

  431-459

• Rectangle-visibility Layouts of Unions and Products of Trees

  Alice Dean, Joan Hutchinson

  1-21

• Rectilinear Planarity of Partial 2-Trees

  Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali

  679-719

• Recursive generation of simple planar 5-regular graphs and pentangulations

  Mahdieh Hasheminezhad, Brendan McKay, Tristan Reeves

  417-436

• Removing Popular Faces in Curve Arrangements

  Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote

  47-82