Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
Parameterized complexity of finding subgraphs with hereditary properties
Theoretical Computer Science
Parameterized graph separation problems
Theoretical Computer Science - Parameterized and exact computation
A fixed-parameter algorithm for the directed feedback vertex set problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
The complexity of finding subgraphs whose matching number equals the vertex cover number
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Complexity and exact algorithms for multicut
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Algorithm engineering for optimal graph bipartization
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Finding odd cycle transversals
Operations Research Letters
Parameterized approximability of the disjoint cycle problem
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Improved algorithms for the feedback vertex set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
An improved parameterized algorithm for the minimum node multiway cut problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
ACM Transactions on Computation Theory (TOCT)
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Proceedings of the forty-third annual ACM symposium on Theory of computing
Theoretical Computer Science
Paths, flowers and vertex cover
ESA'11 Proceedings of the 19th European conference on Algorithms
A kernel of order 2k-clogk for vertex cover
Information Processing Letters
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Fixed-Parameter tractability of almost CSP problem with decisive relations
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Strong backdoors to nested satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Fixed-parameter tractability of multicut in directed acyclic graphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized tractability of multiway cut with parity constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Deterministic parameterized connected vertex cover
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
New races in parameterized algorithmics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
European Journal of Combinatorics
Clustering with local restrictions
Information and Computation
On group feedback vertex set parameterized by the size of the cutset
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On multiway cut parameterized above lower bounds
ACM Transactions on Computation Theory (TOCT)
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.00 |
We consider the following problem. Given a 2-cnf formula, is it possible to remove at most k clauses so that the resulting 2-cnf formula is satisfiable? This problem is known to different research communities in theoretical computer science under the names Almost 2-SAT, All-but-k 2-SAT, 2-cnf deletion, and 2-SAT deletion. The status of the fixed-parameter tractability of this problem is a long-standing open question in the area of parameterized complexity. We resolve this open question by proposing an algorithm that solves this problem in O(15^kxkxm^3) time showing that this problem is fixed-parameter tractable.