Cover Image

Directed disjoint paths remains W[1]-hard on acyclic digraphs without large grid minors

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kawarabayashi, Ken-ichi, Lorenz, Nicola, Milani, Marcelo Garlet, Stegemann, Jacob
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Edge-Disjoint Paths in Eulerian Digraphs
by: Cavallaro, Dario, et al.
Published: (2024)

Direct Product Primality Testing of Graphs is GI-hard
by: Calderoni, Luca, et al.
Published: (2020)

Minimizing the Weighted Number of Tardy Jobs is W[1]-hard
by: Heeger, Klaus, et al.
Published: (2024)

An analogue of Reed's conjecture for digraphs
by: Kawarabayashi, Ken-ichi, et al.
Published: (2024)

Walking through Doors is Hard, even without Staircases: Universality and PSPACE-hardness of Planar Door Gadgets
by: MIT Gadgets Group, et al.
Published: (2020)

Directed Ear Anonymity
by: Milani, Marcelo Garlet
Published: (2024)

Injective hardness condition for PCSPs
by: Banakh, Demian, et al.
Published: (2024)

If VNP is hard, then so are equations for it
by: Kumar, Mrinal, et al.
Published: (2020)

Communication Complexity is NP-hard
by: Hirahara, Shuichi, et al.
Published: (2025)

The complexity of frugal digraph homomorphisms
by: Bard, Stefan, et al.
Published: (2026)

Coordinating "7 Billion Humans" is hard
by: Panconesi, Alessandro, et al.
Published: (2024)

Dichotomies for \#CSP on graphs that forbid a clique as a minor
by: Meng, Boning, et al.
Published: (2025)

Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard
by: Krokhin, Andrei, et al.
Published: (2025)

On the hardness of finding normal surfaces
by: Burton, Benjamin A., et al.
Published: (2019)

DQC1-hardness of estimating correlation functions
by: Moulik, Subhayan Roy, et al.
Published: (2024)

Freeze-Tag is NP-hard in 2D with $L_1$ distance
by: Silva, Lucas de Oliveira, et al.
Published: (2025)

Optimizing for aggressive-style strategies in Flesh and Blood is NP-hard
by: Romão, Leonardo Gasparini, et al.
Published: (2025)

An even simpler hard variant of Not-All-Equal 3-SAT
by: Darmann, Andreas, et al.
Published: (2024)

Partial Minimum Branching Program Size Problem is ETH-hard
by: Glinskih, Ludmila, et al.
Published: (2024)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
by: Le, Hoang-Oanh, et al.
Published: (2023)

A polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2026)

Man, these New York Times games are hard! A computational perspective
by: Alberti, Alessandro Giovanni, et al.
Published: (2025)

NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
by: Baraskar, Omkar, et al.
Published: (2024)

On a tree-based variant of bandwidth and forbidding simple topological minors
by: Jacob, Hugo, et al.
Published: (2025)

Sorting by pile shuffles on queue-like and stack-like piles can be hard
by: Treleaven, Kyle B.
Published: (2025)

A quasi-polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2025)

On the power of counting the total number of computation paths of NPTMs
by: Bakali, Eleni, et al.
Published: (2023)

King Chasing Problem in Chinese Chess is NP-hard
by: Li, Chao, et al.
Published: (2026)

Constant congestion linkages in polynomially strong digraphs in polynomial time
by: Lopes, Raul, et al.
Published: (2024)

Two NP-hard Extensions of the Spearman Footrule even for a Small Constant Number of Voters
by: Durand, Martin
Published: (2026)

Directed st-connectivity with few paths is in quantum logspace
by: Apers, Simon, et al.
Published: (2024)

On the hardness of cloning and connections to representation theory
by: Havlíček, Vojtěch, et al.
Published: (2024)

Optimising quantum circuits is generally hard
by: van de Wetering, John, et al.
Published: (2023)

Complexity and hardness of random peaked circuits
by: Zhang, Yuxuan
Published: (2025)

Geometric and computational hardness of bilevel programming
by: Bolte, Jérôme, et al.
Published: (2024)

On hardness of computing analytic Brouwer degree
by: Chakraborty, Somnath
Published: (2023)

NP-hardness of SVP in Euclidean Space
by: Wan, Daqing
Published: (2026)

Pushing Blocks without Fixed Walls via Checkable Gizmos: Push-1 is PSPACE-Complete
by: MIT Hardness Group, et al.
Published: (2025)

Between proper and square coloring of planar graphs, hardness and extremal graphs
by: Delépine, Thomas
Published: (2026)

Quantum Max-Cut is NP hard to approximate
by: Piddock, Stephen
Published: (2025)