Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
The spatial complexity of oblivious k-probe Hash functions
SIAM Journal on Computing
On linear time minor tests with depth-first search
Journal of Algorithms
Journal of the ACM (JACM)
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences
Splitters and near-optimal derandomization
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
An efficient parameterized algorithm for m-set packing
Journal of Algorithms
A faster parameterized algorithm for set packing
Information Processing Letters
Greedy localization and color-coding: improved matching and packing algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Terminal backup, 3D matching, and covering cubic graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Partial vs. Complete Domination: t-Dominating Set
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Improved Parameterized Algorithms for Weighted 3-Set Packing
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A Parameterized Perspective on Packing Paths of Length Two
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Efficient algorithms for clique problems
Information Processing Letters
Finding paths of length k in O∗(2k) time
Information Processing Letters
A Problem Kernelization for Graph Packing
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
Artificial Intelligence
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
The Budgeted Unique Coverage Problem and Color-Coding
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Parameterized algorithms for weighted matching and packing problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Randomized disposal of unknowns and implicitly enforced bounds on parameters
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
An O*(3.523k) parameterized algorithm for 3-set packing
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
An automated signature generation approach for polymorphic worm based on color coding
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Finding monotone paths in edge-ordered graphs
Discrete Applied Mathematics
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
An O*(3.533k)-time parameterized algorithm for the 3-set packing problem
Theoretical Computer Science
Algorithms for testing monomials in multivariate polynomials
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
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching
ACM Transactions on Algorithms (TALG)
Terminal Backup, 3D Matching, and Covering Cubic Graphs
SIAM Journal on Computing
Sharp separation and applications to exact and parameterized algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Faster algorithms for finding and counting subgraphs
Journal of Computer and System Sciences
Kernel bounds for path and cycle problems
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized algorithms for weighted matching and packing problems
Discrete Optimization
A randomized approximation algorithm for parameterized 3-D matching counting problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Improved algorithms for weighted and unweighted set splitting problems
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Parameterized top-K algorithms
Theoretical Computer Science
Journal of Combinatorial Optimization
On testing monomials in multivariate polynomials
Theoretical Computer Science
Finding the minimum-weight k-path
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Kernel bounds for path and cycle problems
Theoretical Computer Science
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
Theoretical Computer Science
Hi-index | 0.01 |
Improved randomized and deterministic algorithms are presented for PATH, MATCHING, and PACKING problems. Our randomized algorithms are based on the divide-and-conquer technique, and improve previous best algorithms for these problems. For example, for the k-PATH problem, our randomized algorithm runs in time O(4kk3.42m) and space O(nklogk + m), improving the previous best randomized algorithm for the problem that runs in time O(5.44kkm) and space O(2kkn + m). To achieve improved deterministic algorithms, we study a number of previously proposed de-randomization schemes, and also develop a new derandomization scheme. These studies result in a number of deterministic algorithms: one of time O(4k+o(k)m) for the k-PATH problem, one of time O(2.803kk nlog2 n) for the 3-D MATCHING problem, and one of time O(43k+o(k)n) for the 3-SET PACKING problem. All these significantly improve previous best algorithms for the problems.