Imagen de Portada

Parameterized Complexity of Simultaneous Planarity

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fink, Simon D., Pfretzschner, Matthias, Rutter, Ignaz
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Clustered Planarity Variants for Level Graphs
por: Fink, Simon D., et al.
Publicado: (2024)

Circle graphs can be recognized in linear time
por: Paul, Christophe, et al.
Publicado: (2025)

Upward-Planar Drawings with Bounded Span
por: Angelini, Patrizio, et al.
Publicado: (2026)

Upward Book Embeddings of Partitioned Digraphs
por: Da Lozzo, Giordano, et al.
Publicado: (2026)

The Parameterized Complexity of Extending Stack Layouts
por: Depian, Thomas, et al.
Publicado: (2024)

Weakly Leveled Planarity with Bounded Span
por: Bekos, Michael, et al.
Publicado: (2024)

Simple Realizability of Abstract Topological Graphs
por: Da Lozzo, Giordano, et al.
Publicado: (2024)

Structural Parameterizations of $k$-Planarity
por: Gima, Tatsuya, et al.
Publicado: (2025)

Parameterized Complexity of Efficient Sortation
por: Ganian, Robert, et al.
Publicado: (2024)

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
por: Bentert, Matthias, et al.
Publicado: (2026)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem
por: Ganian, Robert, et al.
Publicado: (2024)

Parameterized Complexity of Finding Dissimilar Shortest Paths
por: Funayama, Ryo, et al.
Publicado: (2024)

Parameterized Complexity of MinCSP over the Point Algebra
por: Osipov, George, et al.
Publicado: (2023)

EF(X) Orientations: A Parameterized Complexity Perspective
por: Kanellopoulos, Sotiris, et al.
Publicado: (2025)

Complexity of Local Search for CSPs Parameterized by Constraint Difference
por: Anand, Aditya, et al.
Publicado: (2025)

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
por: Blažej, Václav, et al.
Publicado: (2024)

Parameterized Algorithms for the Drone Delivery Problem
por: Bartlmae, Simon, et al.
Publicado: (2026)

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
por: Bentert, Matthias, et al.
Publicado: (2024)

Independence-Number Parameterized Space Complexity for Directed Connectivity Certificate
por: Chen, Ho-Lin, et al.
Publicado: (2026)

A Survey on Graph Problems Parameterized Above and Below Guaranteed Values
por: Gutin, Gregory, et al.
Publicado: (2022)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
por: Ganian, Robert, et al.
Publicado: (2025)

Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs
por: Goyal, Dishant, et al.
Publicado: (2024)

Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
por: Bentert, Matthias, et al.
Publicado: (2024)

Parameterized Complexity of Vehicle Routing
por: Döring, Michelle, et al.
Publicado: (2025)

On the Parameterized Complexity of Odd Coloring
por: Bhyravarapu, Sriram, et al.
Publicado: (2025)

On the Parameterized Complexity of Diverse SAT
por: Misra, Neeldhara, et al.
Publicado: (2024)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
por: Kaul, Matthias, et al.
Publicado: (2025)

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
por: Bergougnoux, Benjamin, et al.
Publicado: (2023)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
por: Bai, Tian, et al.
Publicado: (2026)

Parameterized Complexity of Path Set Packing
por: Aravind, N. R., et al.
Publicado: (2022)

On the Parameterized Complexity of Min-Sum-Radii
por: Kumar, Pankaj, et al.
Publicado: (2026)

Parameterizing Path Partitions
por: Fernau, Henning, et al.
Publicado: (2022)

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
por: Cabello, Sergio, et al.
Publicado: (2025)

Approximate Light Spanners in Planar Graphs
por: Le, Hung, et al.
Publicado: (2025)

Planar Length-Constrained Minimum Spanning Trees
por: Hershkowitz, D Ellis, et al.
Publicado: (2025)

Level Planarity Is More Difficult Than We Thought
por: Fink, Simon D., et al.
Publicado: (2024)

Structural Parameterizations of Vertex Integrity
por: Gima, Tatsuya, et al.
Publicado: (2023)

Parameterized algorithms for $k$-Inversion
por: Antony, Dhanyamol, et al.
Publicado: (2026)

Faster Parameterized Vertex Multicut
por: Chu, Huairui, et al.
Publicado: (2026)

Parameterized Complexity of Submodular Minimization under Uncertainty
por: Kakimura, Naonori, et al.
Publicado: (2024)