On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs

Benedikt Künzel, Jonathan Rollin

Type: Preprint

Publication Date: 2023-01-01

Citations: 0

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

View Publication

Locations

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

Similar Works

Action	Title	Year	Authors
+	On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity	2023	Walter Didimo Emilio Di Giacomo Giuseppe Liotta Fabrizio Montecchiani Giacomo Ortali
+	On the $\mathcal{NP}$-hardness of GRacSim Drawing and k-SEFE Problems	2016	Luca Grilli
+ PDF Chat	Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles	2024	Oswin Aichholzer Joachim Orthaber Birgit Vogtenhuber
+	Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in $k^2$ and Linear in $n$	2022	Kyungjin Cho Eunjin Oh Seunghyeok Oh
+	The Complexity of Simultaneous Geometric Graph Embedding	2015	Jean Cardinal Vincent Kusters
+	Using a geometric lens to find k disjoint shortest paths	2020	Matthias Bentert André Nichterlein Malte Renken Philipp Zschoche
+ PDF Chat	Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time	2019	Walter Didimo Giuseppe Liotta Giacomo Ortali Maurizio Patrignani
+ PDF Chat	FPT Algorithms for Crossing Number Problems: A Unified Approach	2024	Éric Colin de Verdière Petr Hliněný
+ PDF Chat	From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs	2024	Chandra Chekuri Rhea Jain Shubhang Kulkarni Da Wei Zheng Weihao Zhu
+ PDF Chat	A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs	2022	Debarati Das Evangelos Kipouridis Maximilian Probst Gutenberg Christian Wulff‐Nilsen
+ PDF Chat	Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in <i>k</i><sup>2</sup> and Linear in <i>n</i>	2023	Kyungjin Cho Eunjin Oh Seunghyeok Oh
+	Simultaneous Embeddings with Vertices Mapping to Pre-Specified Points	2012	Taylor Gordon
+	Simultaneous Embeddings with Vertices Mapping to Pre-Specified Points	2012	Taylor Gordon
+	Parameterized Complexity of Simultaneous Planarity	2023	Simon D. Fink Matthias Pfretzschner Ignaz Rutter
+	ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space	2021	Fedor V. Fomin Petr A. Golovach Tanmay Inamdar Saket Saurabh
+	ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space	2021	Fedor V. Fomin Petr A. Golovach Tanmay Inamdar Saket Saurabh
+	Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves	2023	Emmanuel Sam Benjamin Bergougnoux Petr A. Golovach Nello Blaser
+	On Some $\mathcal{NP}$ -complete SEFE Problems	2014	Patrizio Angelini Giordano Da Lozzo Daniel Neuwirth
+	Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs	2023	Yi‐Jun Chang Da Wei Zheng
+ PDF Chat	Inserting an Edge into a Geometric Embedding	2018	Marcel Radermacher Ignaz Rutter

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors