Lower Bounds for the Parameterized Complexity of Minimum Fill-In and Other Completion Problems

doi 10.1137/1.9781611974331.ch79

Full Text

Abstract

Available in

Date

Authors

Publisher

Society for Industrial and Applied Mathematics

Related search

Subexponential Parameterized Algorithm for Minimum Fill-In

2012English

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width

SIAM Journal on Computing
MathematicsComputer Science
2014English

Tight RMR Lower Bounds for Mutual Exclusion and Other Problems

2008English

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

On Miniaturized Problems in Parameterized Complexity Theory

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2006English

Some Lower Bounds for the Complexity of Continuation Methods

Journal of Complexity
ControlNumerical AnalysisStatisticsProbabilityAlgebraApplied MathematicsNumber TheoryOptimizationMathematics
1998English

Parameterized Complexity of Generalized Vertex Cover Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Parameterized Complexity of Cardinality Constrained Optimization Problems

Computer Journal
Computer Science
2007English

A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy