Fast construction of irreducible polynomials over finite fields
Journal of Symbolic Computation
Designing programs that check their work
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Randomized algorithms
Dynamic Programming Treatment of the Travelling Salesman Problem
Journal of the ACM (JACM)
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Improved algorithms for path, matching, and packing problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Faster Algebraic Algorithms for Path and Packing Problems
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Dynamic programming meets the principle of inclusion and exclusion
Operations Research Letters
Limits and Applications of Group Algebras for Parameterized Problems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
Journal of Computer and System Sciences
Counting stars and other small subgraphs in sublinear time
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Finding and counting vertex-colored subtrees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Parameterized complexity and kernelizability of max ones and exact ones problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Improved deterministic algorithms for weighted matching and packing problems
Theoretical Computer Science
Discrete Applied Mathematics
A polynomial algebra method for computing exemplar breakpoint distance
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
The complexity of testing monomials in multivariate polynomials
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Algorithms for testing monomials in multivariate polynomials
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Exact parameterized multilinear monomial counting via k-layer subset convolution and k-disjoint
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Fast zeta transforms for lattices with few irreducibles
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Shortest cycle through specified elements
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Counting and detecting small subgraphs via equations and matrix multiplication
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the parameterized complexity of the repetition free longest common subsequence problem
Information Processing Letters
Faster algorithms for finding and counting subgraphs
Journal of Computer and System Sciences
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Constrained multilinear detection for faster functional motif discovery
Information Processing Letters
A fast parallel algorithm for minimum-cost small integral flows
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Homomorphic hashing for sparse coefficient extraction
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Fast monotone summation over disjoint sets
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Journal of Combinatorial Optimization
On testing monomials in multivariate polynomials
Theoretical Computer Science
Algebraic data retrieval algorithms for multi-channel wireless data broadcast
Theoretical Computer Science
Exact weight subgraphs and the k-sum conjecture
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Finding the minimum-weight k-path
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.90 |
We give a randomized algorithm that determines if a given graph has a simple path of length at least k in O(2^k@?poly(n)) time. Our method extends a recent O(2^3^k^/^2@?poly(n))=