No article text was recorded for this version.
fixed-parameter intractability
Version 1 of 111 papers17 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On Structural Parameterizations of the Edge Disjoint Paths Problem
- Blog: Directed disjoint paths remains W[1]-hard on acyclic digraphs without large grid minors
- Blog: The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
- Blog: Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)
- Blog: Shortest odd paths in undirected graphs with conservative weight functions
- Blog: Finding Supported Paths in Heterogeneous Networks
- Blog: The structural complexity landscape of finding balance-fair shortest paths
- Blog: Finding the Minimum-Weight k-Path
- Blog: On Routing Disjoint Paths in Bounded Treewidth Graphs
- Blog: On Structural Parameterizations of the Edge Disjoint Paths Problem
- Blog: Extensor-coding
History & citation
Current · Permanent link
- Cut Based Parameters for Edge Disjoint Routing merged into this direction (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_fixed_parameter_intractability_70bbec75,
title = {fixed-parameter intractability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fixed-parameter-intractability/rdr_70bbec755e5f4fbebfe0ccc292c1dc06},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_fixed_parameter_intractability_70bbec75_v1,
title = {fixed-parameter intractability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fixed-parameter-intractability/rdr_70bbec755e5f4fbebfe0ccc292c1dc06/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}