Testing Simultaneous Planarity when the Common Graph is 2-Connected

Type: Preprint

Publication Date: 2010-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.1009.4517

Locations

  • arXiv (Cornell University) - View - PDF
  • DataCite API - View

Similar Works

Action Title Year Authors
+ Testing Simultaneous Planarity when the Common Graph is 2-Connected 2010 Bernhard Haeupler
Krishnam Raju Jampani
Anna Lubiw
+ Testing Simultaneous Planarity when the Common Graph is 2-Connected 2013 Bernhard Haeupler
Krishnam Raju Jampani
Anna Lubiw
+ PDF Chat Testing Simultaneous Planarity When the Common Graph Is 2-Connected 2010 Bernhard Haeupler
Krishnam Raju Jampani
Anna Lubiw
+ Parameterized Complexity of Simultaneous Planarity 2023 Simon D. Fink
Matthias Pfretzschner
Ignaz Rutter
+ Simultaneous Orthogonal Planarity 2016 Patrizio Angelini
Steven Chaplick
Sabine Cornelsen
Giordano Da Lozzo
Giuseppe Di Battista
Peter Eades
Philipp Kindermann
Jan Kratochvı́l
Fabian Lipp
Rutter
+ Simultaneous Orthogonal Planarity 2016 Patrizio Angelini
Steven Chaplick
Sabine Cornelsen
Giordano Da Lozzo
Giuseppe Di Battista
Peter Eades
Philipp Kindermann
Jan Kratochvı́l
Fabian Lipp
and Ignaz Rutter
+ On the $\mathcal{NP}$-hardness of GRacSim Drawing and k-SEFE Problems 2016 Luca Grilli
+ (k,p)-Planarity: A Relaxation of Hybrid Planarity 2018 Emilio Di Giacomo
William Lenhart
Giuseppe Liotta
Timothy W. Randolph
Alessandra Tappini
+ (k,p)-Planarity: A Relaxation of Hybrid Planarity 2018 Emilio Di Giacomo
William Lenhart
Giuseppe Liotta
Timothy W. Randolph
Alessandra Tappini
+ PDF Chat A Simple Partially Embedded Planarity Test Based on Vertex-Addition 2024 Simon D. Fink
Ignaz Rutter
Siva Sankaran P.
+ On the Simultaneous Minimum Spanning Trees Problem 2017 Matěj Konečný
Stanislav Kučera
Jana Novotná
Jakub Pekárek
Martin Smolík
Jakub Tětek
Martin Töpfer
+ On the Simultaneous Minimum Spanning Trees Problem 2017 Matěj Konečný
Stanislav Kučera
Jana Novotná
Jakub Pekárek
Martin Smolík
Jakub Tětek
Martin Töpfer
+ An Exponential Time Parameterized Algorithm for Planar Disjoint Paths 2021 Daniel Lokshtanov
Pranabendu Misra
Michał Pilipczuk
Saket Saurabh
Meirav Zehavi
+ An Exponential Time Parameterized Algorithm for Planar Disjoint Paths 2021 Daniel Lokshtanov
Pranabendu Misra
Michał Pilipczuk
Saket Saurabh
Meirav Zehavi
+ A pair of trees without a simultaneous geometric embedding in the plane 2005 Martin Kütz
+ On a Tree and a Path with no Geometric Simultaneous Embedding 2010 Patrizio Angelini
Markus Geyer
Michael Kaufmann
Daniel Neuwirth
+ On a Tree and a Path with no Geometric Simultaneous Embedding 2010 Patrizio Angelini
Markus Geyer
Michael Kaufmann
Daniel Neuwirth
+ PDF Chat On a Tree and a Path with no Geometric Simultaneous Embedding 2012 Patrizio Angelini
Markus Geyer
Michael Kaufmann
Daniel Neuwirth
+ (k, p)-Planarity: A Generalization of Hybrid Planarity. 2018 Emilio Di Giacomo
William Lenhart
Giuseppe Liotta
Timothy W. Randolph
Alessandra Tappini
+ An Experimental Study of a 1-planarity Testing and Embedding Algorithm 2019 Carla Binucci
Walter Didimo
Fabrizio Montecchiani

Works That Cite This (0)

Action Title Year Authors

Works Cited by This (0)

Action Title Year Authors