Regular

All Items

• 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

• Planar Octilinear Drawings with One Bend Per Edge

  Michael Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug

  657-680

• Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution

  Christian Duncan, Stephen Kobourov

  311-333

• 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