No article text was recorded for this version.
fixed-parameter tractability
Version 1 of 150 papers53 conceptsfrozen 2026-10-04
Papers in this version
- Blog: 09511 Abstracts Collection - Parameterized complexity and approximation algorithms
- Blog: Crossing and Independent Families Among Polygons
- Blog: The influence of dimensions on the complexity of computing decision trees
- Blog: Representative Families: A Unified Tradeoff-Based Approach
- Blog: On Computing Homological Hitting Sets
- Blog: On Finding the Jaccard Center
- Blog: On the complexity of connectivity in cognitive radio networks through spectrum assignment
- Blog: Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
- Blog: An efficient parameterized algorithm for m-set packing
- Blog: Co-Clustering Under the Maximum Norm
- Blog: Quantified conjunctive queries on partially ordered sets
- Blog: On the parameterized complexity of Grid Contraction
- Blog: Fixed-Parameter Complexity of Minimum Profile Problems
- Blog: 0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms
- Blog: Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
- Blog: The control complexity of r-approval: from the single-peaked case to the general case
- Blog: An improved FPT algorithm for the flip distance problem
- Blog: On the complexity and approximation of syntenic distance
- Blog: On Covering Segments with Unit Intervals
- Blog: Chebyshev center of the intersection of balls: complexity, relaxation and approximation
- Blog: The Complexity of Temporal Vertex Cover in Small-Degree Graphs
- Blog: Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
- Blog: On the Complexity of the Eigenvalue Deletion Problem
- Blog: On Group Feedback Vertex Set Parameterized by the Size of the Cutset
- Blog: Orienting Ordered Scaffolds: Complexity and Algorithms
- Blog: A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation
- Blog: Tight FPT approximation for constrained k-center and k-supplier
- Blog: On the Parameterized Complexity of Belief Revision
- Blog: New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)
- Blog: On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric
- Blog: Parameterized Complexity for the Database Theorist
- Blog: Covering Graphs with Few Complete Bipartite Subgraphs
- Blog: Parameterized Analysis of the Cops and Robber Game
- Blog: Simultaneous Feedback Edge Set: A Parameterized Perspective
- Blog: The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
- Blog: Identifying Imperfect Clones in Elections
- Blog: On Parameterized Complexity of Binary Networked Public Goods Game
- Blog: The Parameterized Complexity of the Rainbow Subgraph Problem
- Blog: Foreword: Special Issue on IPEC 2014
- Blog: Deploying vaccine distribution sites for improved accessibility and equity to support pandemic response
- Blog: Plan Reordering and Parallel Execution Ñ A Parameterized Complexity View
- Blog: On the complexity of the bilevel minimum spanning tree problem
- Blog: Multivariate Algorithmics for Finding Cohesive Subnetworks
- Blog: Balanced Judicious Bipartition is Fixed-Parameter Tractable
- Blog: Shortest Color-Spanning Intervals
- Blog: Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph
- Blog: The Complexity of Finding Fair Many-to-One Matchings
- Blog: Clustering What Matters: Optimal Approximation for Clustering with Outliers
- Blog: Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond
- Blog: Stable Matchings with Covering Constraints: A Complete Computational Trichotomy
History & citation
Current · Permanent link
- This direction split from parameterized complexity analysis (80% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_fixed_parameter_tractability_7af339f8,
title = {fixed-parameter tractability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fixed-parameter-tractability/rdr_7af339f822be433a8783cc6b130e0c8f},
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_tractability_7af339f8_v1,
title = {fixed-parameter tractability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fixed-parameter-tractability/rdr_7af339f822be433a8783cc6b130e0c8f/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}