Parameterized Algorithms

2015/01/01 by Marek Cygan, Fedor V. Fomin, Łukasz Kowalik +5 · 30 citations
Computer Science · #Algorithm #Computer science #Metaheuristic Optimization Algorithms Research #Parameterized complexity

paper · doi:10.1007/978-3-319-21275-3

crossref issued 2015/01/01 · crossref published 2015/01/01 · crossref published-print 2015/01/01 · openalex publication_date 2015/01/01 · crossref created 2015/07/20 · crossref deposited 2023/02/21 · openalex created_date 2025/10/10 · crossref indexed 2026/07/31 · openalex updated_date 2026/08/03

Cited by

• Parameterized Algorithms for Computing MAD Trees
• FO Value Discovery and Partial Vertex Cover Discovery
• Scheduling Tasks towards Energy Autarky: Benefits and Computational Costs of Flexibility
• Fixed-parameter algorithms for DAG Partitioning
• d-QBF with Few Existential Variables Revisited
• On the parameterized complexity of Broadcast Independence and Broadcast Packing
• Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
• Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
• Parameterized Capacitated Vertex Cover Revisited
• Quickly excluding an annotated planar graph
• All ascents exponential from valued constraint graphs of pathwidth three
• EF(X) Orientations: A Parameterized Complexity Perspective
• Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number
• Pushing the frontiers of subexponential FPT time for Feedback Vertex Set
• Graph modification of bounded size to minor-closed classes as fast as vertex deletion
• Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics
• Subdivided expanders and counterexamples to the Tree Product Conjecture
• Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
• On Exploring Temporal Graphs of Small Pathwidth
• Improved bounds for the sunflower lemma
• A Note on the Complexity of Defensive Domination
• Temporal Graph Realization With Bounded Stretch
• Broadcasting under Structural Restrictions
• Finding Optimal Triangulations Parameterized by Edge Clique Cover
• On the (Parameterized) Complexity of Almost Stable Marriage
• On the Tractability Landscape of the Conditional Minisum Approval Voting Rule
• Stable Marriage with Groups of Similar Agents
• Safe sets in digraphs
• Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction
• Michael Langston [wikipedia]