Cover Image

A Unified FPT Framework for Crossing Number Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	de Verdière, Éric Colin, Hliněný, Petr
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry Combinatorics 68Q27, 68R10
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs
by: Hliněný, Petr
Published: (2023)

Crossing Number is NP-hard for Constant Path-width (and Tree-width)
by: Hliněný, Petr, et al.
Published: (2024)

Stack and Queue Numbers of Graphs Revisited
by: Hliněný, Petr, et al.
Published: (2023)

Note on Min-k-Planar Drawings of Graphs
by: Hliněný, Petr, et al.
Published: (2024)

Hereditary Graph Product Structure and $\cal H$-clique-width
by: Hliněný, Petr, et al.
Published: (2024)

Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)

Untangling Graphs on Surfaces
by: de Verdière, Éric Colin, et al.
Published: (2023)

On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)

Cluster Vertex Deletion Problems on Cubic Graphs
by: Rusu, Irena
Published: (2025)

On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
by: Avila, Tatiana Rocha, et al.
Published: (2026)

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

The metric Menger problem
by: Baligács, Júlia, et al.
Published: (2024)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
by: Gollin, J. Pascal, et al.
Published: (2023)

A Morse-Bott Framework for Blind Inverse Problems: Local Recovery Guarantees and the Failure of the MAP
by: Nguyen, Minh-Hai, et al.
Published: (2025)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
by: Golovach, Petr A., et al.
Published: (2022)

Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching
by: Hougardy, Stefan, et al.
Published: (2024)

On plane cycles in geometric multipartite graphs
by: Ricci, Marco, et al.
Published: (2025)

Shuffle squares and ordered nest-free graphs
by: Grytczuk, Jarosław, et al.
Published: (2025)

A cornering strategy for synchronizing a DFA
by: Bradshaw, Peter, et al.
Published: (2024)

A new factorization of the generalized period-doubling sequences through kernel words and gaps sequences
by: Bognini, K. Ernest, et al.
Published: (2025)

Tight complexity bounds for diagram commutativity verification
by: Malko, Artem, et al.
Published: (2025)

Computing shortest closed curves on non-orientable surfaces
by: Bulavka, Denys, et al.
Published: (2024)

Extending simple monotone drawings
by: Kynčl, Jan, et al.
Published: (2023)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
by: Petrov, Petar P.
Published: (2022)

Trifferent codes with small lengths
by: Kurz, Sascha
Published: (2023)

Approximating branchwidth on parametric extensions of planarity
by: Thilikos, Dimitrios M., et al.
Published: (2023)

Shortest Paths in a Weighted Simplicial Complex
by: Chakraborty, Sukrit, et al.
Published: (2025)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
by: Abdullah, Duaa, et al.
Published: (2025)

A polynomial Time Algorithm to Solve The Max-atom Problem
by: Lahlou, Chams, et al.
Published: (2021)

Reduced Jeffries-Matusita distance: A Novel Loss Function to Improve Generalization Performance of Deep Classification Models
by: Lashkari, Mohammad, et al.
Published: (2024)

Antimagic Labelings of Caterpillars
by: Lozano, Antoni, et al.
Published: (2017)

Looking for all solutions of the Max Atom Problem (MAP)
by: Truffet, Laurent
Published: (2024)

Unbent Collections of Orthogonal Drawings
by: Antić, Todor, et al.
Published: (2025)

Some Counterexamples for Compatible Triangulations
by: Barnson, Cody, et al.
Published: (2016)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)

A Second-Order TGV Discretization with $90^{\circ}$ Rotational Invariance Property
by: Hosseini, Alireza, et al.
Published: (2022)

A study of ferronematic thin films including a stray field energy
by: Dutta, Shilpa, et al.
Published: (2025)

A space-time dual-pairing summation-by-parts framework for forward and adjoint wave equations
by: Wiratama, Kenny, et al.
Published: (2026)

Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming
by: Lagerkvist, Victor, et al.
Published: (2026)

$(t,r)$ Broadcast Domination Numbers and Densities of the Truncated Square Tiling Graph
by: Cervantes, Jillian, et al.
Published: (2024)