New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
Parameterized complexity of finding subgraphs with hereditary properties
Theoretical Computer Science
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Upper Bounds for MaxSat: Further Improved
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Parameterized Complexity: The Main Ideas and Some Research Frontiers
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Approximation Algorithms for Some Parameterized Counting Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Exact Algorithms for MAX-SAT
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Faster Exact Solutions for MAX2SAT
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
A fixed-parameter algorithm for minimum quartet inconsistency
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
The method of extremal structure on the k-maximum cut problem
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Improving exact algorithms for MAX-2-SAT
Annals of Mathematics and Artificial Intelligence
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Parameterized algorithms for feedback set problems and their duals in tournaments
Theoretical Computer Science - Parameterized and exact computation
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG
Information Processing Letters
Minimum Leaf Out-Branching Problems
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Parameterized algorithmics for linear arrangement problems
Discrete Applied Mathematics
Parameterizing above or below guaranteed values
Journal of Computer and System Sciences
On parameterized exponential time complexity
Theoretical Computer Science
On Parameterized Exponential Time Complexity
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks
Study of lower bound functions for MAX-2-SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Fixed-parameter algorithms for Kemeny rankings
Theoretical Computer Science
Minimum leaf out-branching and related problems
Theoretical Computer Science
Almost 2-SAT is fixed-parameter tractable
Journal of Computer and System Sciences
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Graph-modeled data clustering: fixed-parameter algorithms for clique generation
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Note on Max Lin-2 above Average
Information Processing Letters
Note on maximal bisection above tight lower bound
Information Processing Letters
Betweenness parameterized above tight lower bound
Journal of Computer and System Sciences
Solving MAX-r-SAT above a tight lower bound
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Solving MINONES-2-SAT as fast as VERTEX COVER
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
A probabilistic approach to problems parameterized above or below tight bounds
Journal of Computer and System Sciences
Theoretical Computer Science
A new bound for 3-satisfiable maxsat and its algorithmic application
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Paths, flowers and vertex cover
ESA'11 Proceedings of the 19th European conference on Algorithms
Journal of Computer and System Sciences
Connectivity is not a limit for kernelization: planar connected dominating set
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
The linear arrangement problem parameterized above guaranteed value
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the parameterized complexity of exact satisfiability problems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Algorithm engineering for optimal graph bipartization
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Programming for modular reconfigurable robots
Programming and Computing Software
Parameterizing MAX SNP problems above guaranteed values
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Towards a taxonomy of techniques for designing parameterized algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
MAX-SAT for formulas with constant clause density can be solved faster than in O(2n) time
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Generalized above guarantee vertex cover and r-partization
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Improved parameterized algorithms for above average constraint satisfaction
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Parameterized complexity of maxsat above average
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
New lower bound on max cut of hypergraphs with an application to r-set splitting
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Vertex cover, dominating set and my encounters with parameterized complexity and mike fellows
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
Kernelization --- preprocessing with a guarantee
The Multivariate Algorithmic Revolution and Beyond
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
New races in parameterized algorithmics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Parameterized study of the test cover problem
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A new algorithm for parameterized MAX-SAT
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
On multiway cut parameterized above lower bounds
ACM Transactions on Computation Theory (TOCT)
Parameterized complexity of weak odd domination problems
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Solving min ones 2-sat as fast as vertex cover
Theoretical Computer Science
A new bound for 3-satisfiable MaxSat and its algorithmic application
Information and Computation
Parameterized complexity of MaxSat Above Average
Theoretical Computer Science
Hi-index | 0.01 |