Image de couverture de livre

Parameterized Complexity of Simultaneous Planarity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fink, Simon D., Pfretzschner, Matthias, Rutter, Ignaz
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Clustered Planarity Variants for Level Graphs
par: Fink, Simon D., et autres
Publié: (2024)

Circle graphs can be recognized in linear time
par: Paul, Christophe, et autres
Publié: (2025)

Upward-Planar Drawings with Bounded Span
par: Angelini, Patrizio, et autres
Publié: (2026)

Upward Book Embeddings of Partitioned Digraphs
par: Da Lozzo, Giordano, et autres
Publié: (2026)

The Parameterized Complexity of Extending Stack Layouts
par: Depian, Thomas, et autres
Publié: (2024)

Weakly Leveled Planarity with Bounded Span
par: Bekos, Michael, et autres
Publié: (2024)

Simple Realizability of Abstract Topological Graphs
par: Da Lozzo, Giordano, et autres
Publié: (2024)

Structural Parameterizations of $k$-Planarity
par: Gima, Tatsuya, et autres
Publié: (2025)

Parameterized Complexity of Efficient Sortation
par: Ganian, Robert, et autres
Publié: (2024)

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
par: Bentert, Matthias, et autres
Publié: (2026)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem
par: Ganian, Robert, et autres
Publié: (2024)

Parameterized Complexity of Finding Dissimilar Shortest Paths
par: Funayama, Ryo, et autres
Publié: (2024)

Parameterized Complexity of MinCSP over the Point Algebra
par: Osipov, George, et autres
Publié: (2023)

EF(X) Orientations: A Parameterized Complexity Perspective
par: Kanellopoulos, Sotiris, et autres
Publié: (2025)

Complexity of Local Search for CSPs Parameterized by Constraint Difference
par: Anand, Aditya, et autres
Publié: (2025)

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
par: Blažej, Václav, et autres
Publié: (2024)

Parameterized Algorithms for the Drone Delivery Problem
par: Bartlmae, Simon, et autres
Publié: (2026)

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
par: Bentert, Matthias, et autres
Publié: (2024)

Independence-Number Parameterized Space Complexity for Directed Connectivity Certificate
par: Chen, Ho-Lin, et autres
Publié: (2026)

A Survey on Graph Problems Parameterized Above and Below Guaranteed Values
par: Gutin, Gregory, et autres
Publié: (2022)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
par: Ganian, Robert, et autres
Publié: (2025)

Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs
par: Goyal, Dishant, et autres
Publié: (2024)

Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
par: Bentert, Matthias, et autres
Publié: (2024)

Parameterized Complexity of Vehicle Routing
par: Döring, Michelle, et autres
Publié: (2025)

On the Parameterized Complexity of Odd Coloring
par: Bhyravarapu, Sriram, et autres
Publié: (2025)

On the Parameterized Complexity of Diverse SAT
par: Misra, Neeldhara, et autres
Publié: (2024)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
par: Kaul, Matthias, et autres
Publié: (2025)

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
par: Bergougnoux, Benjamin, et autres
Publié: (2023)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
par: Bai, Tian, et autres
Publié: (2026)

Parameterized Complexity of Path Set Packing
par: Aravind, N. R., et autres
Publié: (2022)

On the Parameterized Complexity of Min-Sum-Radii
par: Kumar, Pankaj, et autres
Publié: (2026)

Parameterizing Path Partitions
par: Fernau, Henning, et autres
Publié: (2022)

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
par: Cabello, Sergio, et autres
Publié: (2025)

Approximate Light Spanners in Planar Graphs
par: Le, Hung, et autres
Publié: (2025)

Planar Length-Constrained Minimum Spanning Trees
par: Hershkowitz, D Ellis, et autres
Publié: (2025)

Level Planarity Is More Difficult Than We Thought
par: Fink, Simon D., et autres
Publié: (2024)

Structural Parameterizations of Vertex Integrity
par: Gima, Tatsuya, et autres
Publié: (2023)

Parameterized algorithms for $k$-Inversion
par: Antony, Dhanyamol, et autres
Publié: (2026)

Faster Parameterized Vertex Multicut
par: Chu, Huairui, et autres
Publié: (2026)

Parameterized Complexity of Submodular Minimization under Uncertainty
par: Kakimura, Naonori, et autres
Publié: (2024)