An algorithm for counting maximum weighted independent sets and its applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
(2+ f(n))-SAT and Its Properties
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
(2 +f(n))-SAT and its properties
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On miniaturized problems in parameterized complexity theory
Theoretical Computer Science - Parameterized and exact computation
ACM Transactions on Algorithms (TALG)
Variable Influences in Conjunctive Normal Forms
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
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
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)
Hardness amplification in proof complexity
Proceedings of the forty-second ACM symposium on Theory of computing
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
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms for dominating set in disk graphs: breaking the log n Barrier
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Dominating set based exact algorithms for 3-coloring
Information Processing Letters
A quasipolynomial-time algorithm for the quantum separability problem
Proceedings of the forty-third annual ACM symposium on Theory of computing
On variants of the spanning star forest problem
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Satisfiability certificates verifiable in subexponential time
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Scheduling partially ordered jobs faster than 2n
ESA'11 Proceedings of the 19th European conference on Algorithms
Known algorithms on graphs of bounded treewidth are probably optimal
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The complexity of geometric problems in high dimension
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
On moderately exponential time for SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Computing a nonnegative matrix factorization -- provably
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A new point of NP-hardness for unique games
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Parameterized maximum path coloring
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized complexity of maxsat above average
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Solving the 2-disjoint connected subgraphs problem faster than 2n
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
Approximating MAX SAT by moderately exponential and parameterized algorithms
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Finding efficient circuits for ensemble computation
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Max-cut parameterized above the edwards-erdős bound
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
Sitting closer to friends than enemies, revisited
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Finding a maximum induced degenerate subgraph faster than 2n
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Homomorphic hashing for sparse coefficient extraction
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Test-Case design by feature trees
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Bisections above tight lower bounds
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
Journal of the ACM (JACM)
Sensitivity of Boolean formulas
European Journal of Combinatorics
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Strong ETH holds for regular resolution
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
Quantum de finetti theorems under local measurements with applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Upper and lower bounds for weak backdoor set detection
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Faster exponential-time algorithms in graphs of bounded average degree
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Lift-and-Project methods for set cover and knapsack
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Bounding the running time of algorithms for scheduling and packing problems
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover
ACM Transactions on Computation Theory (TOCT)
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science
Parameterized maximum path coloring
Theoretical Computer Science
Parameterized complexity of MaxSat Above Average
Theoretical Computer Science
On exact algorithms for the permutation CSP
Theoretical Computer Science
A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |