Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Confronting hardness using a hybrid approach
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
On miniaturized problems in parameterized complexity theory
Theoretical Computer Science - Parameterized and exact computation
The complexity of depth-3 circuits computing symmetric Boolean functions
Information Processing Letters
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
Genus characterizes the complexity of certain graph problems: Some tight results
Journal of Computer and System Sciences
Predecessor existence problems for finite discrete dynamical systems
Theoretical Computer Science
Catalan structures and dynamic programming in H-minor-free graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An improved lower bound on approximation algorithms for the Closest Substring problem
Information Processing Letters
On parameterized exponential time complexity
Theoretical Computer Science
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Lower Bounds for Kernelizations and Other Preprocessing Procedures
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
k-SAT Is No Harder Than Decision-Unique-k-SAT
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
New Plain-Exponential Time Classes for Graph Homomorphism
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A note on width-parameterized SAT: An exact machine-model characterization
Information Processing Letters
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
Pursuing a fast robber on a graph
Theoretical Computer Science
Genus characterizes the complexity of graph problems: some tight results
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A lower bound on approximation algorithms for the closest substring problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
The time complexity of constraint satisfaction
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Balanced families of perfect hash functions and their applications
ACM Transactions on Algorithms (TALG)
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
Improved upper bounds for vertex cover
Theoretical Computer Science
Algorithmic lower bounds for problems parameterized by clique-width
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Exponential time complexity of the permanent and the Tutte polynomial
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
Dominating set based exact algorithms for 3-coloring
Information Processing Letters
Partition into triangles on bounded degree graphs
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Ranking and drawing in subexponential time
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension
ACM Transactions on Algorithms (TALG)
Computing vertex-surjective homomorphisms to partially reflexive trees
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Satisfiability certificates verifiable in subexponential time
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Discrete Applied Mathematics
Exact algorithms for dominating set
Discrete Applied Mathematics
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Hitting and harvesting pumpkins
ESA'11 Proceedings of the 19th European conference on Algorithms
Solving connected dominating set faster than 2n
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Counting perfect matchings as fast as Ryser
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
On making directed graphs transitive
Journal of Computer and System Sciences
W-hardness under linear FPT-reductions: structural properties and further applications
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Lower bounds and parameterized approach for longest common subsequence
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Slightly superexponential parameterized problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Known algorithms on graphs of bounded treewidth are probably optimal
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved parameterized upper bounds for vertex cover
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Maximum independent set in graphs of average degree at most three in O(1.08537n)
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Exact (exponential) algorithms for the dominating set problem
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
On moderately exponential time for SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Uniquely satisfiable k-SAT instances with almost minimal occurrences of each variable
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
On the minimum corridor connection problem and other generalized geometric problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Generalized above guarantee vertex cover and r-partization
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
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
Catalan structures and dynamic programming in H-minor-free graphs
Journal of Computer and System Sciences
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
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Operations Research Letters
Searching the k-change neighborhood for TSP is W[1]-hard
Operations Research Letters
Survey: Subexponential parameterized algorithms
Computer Science Review
The parameterized complexity of k-flip local search for SAT and MAX SAT
Discrete Optimization
Some remarks on the incompressibility of width-parameterized SAT instances
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
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Cluster editing with locally bounded modifications
Discrete Applied Mathematics
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Solving planar k-terminal cut in O(nc√k) time
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A tight lower bound for planar multiway cut with fixed number of terminals
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On the limits of sparsification
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Computing vertex-surjective homomorphisms to partially reflexive trees
Theoretical Computer Science
The parameterized complexity of the shared center problem
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Counting homomorphisms via hypergraph-based structural restrictions
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Sitting closer to friends than enemies, revisited
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Algorithms for dominating clique problems
Theoretical Computer Science
On the parameterized complexity of the workflow satisfiability problem
Proceedings of the 2012 ACM conference on Computer and communications security
Subexponential parameterized algorithms
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Fixed-parameter tractability for non-crossing spanning trees
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
European Journal of Combinatorics
The exponential time hypothesis and the parameterized clique problem
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Parameterized algorithmics and computational experiments for finding 2-clubs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Finding dense subgraphs of sparse graphs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Efficient algorithms for the max k-vertex cover problem
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem
ACM Transactions on Information and System Security (TISSEC)
Fast hamiltonicity checking via bases of perfect matchings
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Fast approximation algorithms for the diameter and radius of sparse graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Upper and lower bounds for weak backdoor set detection
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Exponential approximation schemata for some network design problems
Journal of Discrete Algorithms
Bounding the running time of algorithms for scheduling and packing problems
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Lower bounds on the complexity of MSO1 model-checking
Journal of Computer and System Sciences
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
Parameterized complexity of MaxSat Above Average
Theoretical Computer Science
On exact algorithms for the permutation CSP
Theoretical Computer Science
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Information and Computation
On the computation of fully proportional representation
Journal of Artificial Intelligence Research
A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
Journal of Artificial Intelligence Research
| Hi-index | 0.01 |