No article text was recorded for this version.
parameterized complexity analysis
Version 2 of 2400 papers467 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Multivariate Algorithmics for NP-Hard String Problems
- Blog: Parameterized Complexity Analysis of Randomized Search Heuristics
- Blog: Multivariate Complexity Analysis of Swap Bribery
- Blog: The Complexity of Planning Revisited - A Parameterized Analysis
- Blog: A multivariate complexity analysis of the Generalized Noah's Ark Problem
- Blog: Model-Checking Problems as a Basis for Parameterized Intractability
- Blog: Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
- Blog: On Parameterized Complexity of Binary Networked Public Goods Game
- Blog: The Computational Complexity of Concise Hypersphere Classification
- Blog: A Parameterized Study of Maximum Generalized Pattern Matching Problems
- Blog: Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs
- Blog: Explaining Decisions in ML Models: a Parameterized Complexity Analysis
- Blog: Quantum Parameterized Complexity
- Blog: Connecting the Dots (with Minimum Crossings)
- Blog: Backdoor Trees for Answer Set Programming
- Blog: Parameterized Complexity Analysis of Randomized Search Heuristics
- Blog: Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
- Blog: Backdoors into heterogeneous classes of SAT and CSP
- Blog: The Parameterized Complexity of Global Constraints
- Blog: Valued Authorization Policy Existence Problem
- Blog: The Parameterized Complexity of Welfare Guarantees in Schelling Segregation
- Blog: A Parameterized Perspective on Attacking and Defending Elections
- Blog: The Parameterized Complexity of Abduction
- Blog: A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem
- Blog: On Making Directed Graphs Eulerian
- Blog: The Parameterized Complexity of Welfare Guarantees in Schelling Segregation
- Blog: Fine-Grained View on Bribery for Group Identification
- Blog: How Similar Are Two Elections?
- Blog: A Parameterized Perspective on Uniquely Restricted Matchings
- Blog: Prices Matter for the Parameterized Complexity of Shift Bribery
- Blog: How to Resolve Envy by Adding Goods
- Blog: Parameterized Complexity of Caching in Networks
- Blog: Parameterizing Path Partitions
- Blog: Sorting by Multi-Cut Rearrangements
- Blog: A Complete Parameterized Complexity Analysis of Bounded Planning
- Blog: Prices Matter for the Parameterized Complexity of Shift Bribery
- Blog: Parameterized Complexity of Scheduling Problems in Robotic Process Automation
- Blog: The Complexity of Planning Revisited - A Parameterized Analysis
- Blog: Prices matter for the parameterized complexity of shift bribery
- Blog: Parameterized Compilability
- Blog: Soft Constraints of Difference and Equality
- Blog: The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
- Blog: Parameterized Complexity of Propositional Inclusion and Independence Logic
- Blog: Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
- Blog: Plan Reordering and Parallel Execution - A Parameterized Complexity View
- Blog: The Minimum Feasible Tileset problem
- Blog: Bi-objective Optimization in Role Mining
- Blog: A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem
- Blog: A Parameterized Theory of PAC Learning
- Blog: Computational Geometry (Dagstuhl Seminar 25201)
- Blog: Grid recognition: Classical and parameterized computational perspectives
- Blog: Computational Social Choice: Parameterized Complexity and Challenges
- Blog: Parameterized Complexity of Problems in Coalitional Resource Games
- Blog: Balanced stable marriage: How close is close enough?
- Blog: The Complexity of Reachability in Parametric Markov Decision Processes
- Blog: Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
- Blog: Placing Green Bridges Optimally, with a Multivariate Analysis
- Blog: Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity
- Blog: The Parameterized Complexity of Motion Planning for Snake-Like Robots
- Blog: How to navigate through obstacles?
Showing 60 of 400 papers.
History & citation
Current · Permanent link
- Multivariate Complexity Analysis for NP-Hard Problems merged into this direction (65% overlap)
- NP-completeness of majority illusion detection split from this direction (67% overlap)
- fixed-parameter tractability in social choice split from this direction (56% overlap)
- fixed-parameter tractability split from this direction (80% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_parameterized_complexity_analysis_15be3957,
title = {parameterized complexity analysis},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/parameterized-complexity-analysis/rdr_15be395768614cb78adcb08ba5e9bf14},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 2, frozen text):
@misc{lacuna_parameterized_complexity_analysis_15be3957_v2,
title = {parameterized complexity analysis},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/parameterized-complexity-analysis/rdr_15be395768614cb78adcb08ba5e9bf14/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-21},
}