Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Journal of the ACM (JACM)
On the all-pairs-shortest-path problem in unweighted undirected graphs
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
All pairs shortest paths for graphs with small integer length edges
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Computing optimal rectilinear Steiner trees: a survey and experimental evaluation
Discrete Applied Mathematics - Special volume on VLSI
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Spanning trees in hypergraphs with applications to steiner trees
Spanning trees in hypergraphs with applications to steiner trees
Inclusion--Exclusion Algorithms for Counting Set Partitions
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Dynamic Programming for Minimum Steiner Trees
Theory of Computing Systems
A faster algorithm for the steiner tree problem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Enumerative Combinatorics: Volume 1
Enumerative Combinatorics: Volume 1
Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Parameterized complexity of generalized vertex cover problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On Steiner trees and minimum spanning trees in hypergraphs
Operations Research Letters
Exact and approximate link scheduling algorithms under the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Facility Location Problems: A Parameterized View
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Iterative Compression and Exact Algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Faster Steiner Tree Computation in Polynomial-Space
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Vertex and edge covers with clustering properties: Complexity and algorithms
Journal of Discrete Algorithms
Finding, minimizing, and counting weighted subgraphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Information Processing Letters
Topology-Free Querying of Protein Interaction Networks
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Approaches to the Steiner Problem in Networks
Algorithmics of Large and Complex Networks
Counting Subgraphs via Homomorphisms
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Exact and Approximate Bandwidth
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Set multi-covering via inclusion-exclusion
Theoretical Computer Science
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
ACM Transactions on Algorithms (TALG)
Determination of Glycan Structure from Tandem Mass Spectra
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
An exact algorithm for subgraph homeomorphism
Journal of Discrete Algorithms
Exact Algorithms for Set Multicover and Multiset Multicover Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Iterative compression and exact algorithms
Theoretical Computer Science
On exact complexity of subgraph homeomorphism
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Dynamic programming based algorithms for set multicover and multiset multicover problems
Theoretical Computer Science
A moderately exponential time algorithm for full degree spanning tree
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Speeding up dynamic programming for some NP-hard graph recoloring problems
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Saving space by algebraization
Proceedings of the forty-second ACM symposium on Theory of computing
Exact and approximate bandwidth
Theoretical Computer Science
Covering and packing in linear space
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Faster algorithms on branch and clique decompositions
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Finding and counting vertex-colored subtrees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Complexity issues in vertex-colored graph pattern matching
Journal of Discrete Algorithms
Facility location problems: A parameterized view
Discrete Applied Mathematics
Computing fragmentation trees from metabolite multiple mass spectrometry data
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Determination of Glycan Structure from Tandem Mass Spectra
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Breaking the 2n-barrier for Irredundance: Two lines of attack
Journal of Discrete Algorithms
An exact algorithm for connected red-blue dominating set
Journal of Discrete Algorithms
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
An exact algorithm for the Boolean connectivity problem for k-CNF
Theoretical Computer Science
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
Invitation to algorithmic uses of inclusion-exclusion
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
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
Covering and packing in linear space
Information Processing Letters
Faster algorithm for optimum Steiner trees
Information Processing Letters
Scheduling partially ordered jobs faster than 2n
ESA'11 Proceedings of the 19th European conference on Algorithms
Capacitated domination faster than O(2n)
Information Processing Letters
Linear kernels for (connected) dominating set on H-minor-free graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Counting perfect matchings as fast as Ryser
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast zeta transforms for lattices with few irreducibles
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Sharp separation and applications to exact and parameterized algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Known algorithms on graphs of bounded treewidth are probably optimal
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Capacitated domination faster than O(2n)
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
An exact algorithm for the boolean connectivity problem for k-CNF
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Irredundant set faster than O(2n)
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Improved steiner tree algorithms for bounded treewidth
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Solving the 2-disjoint connected subgraphs problem faster than 2n
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Efficient arbitrary and resolution proofs of unsatisfiability for restricted tree-width
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Finding maximum colorful subtrees in practice
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
Survey: Subexponential parameterized algorithms
Computer Science Review
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
Parameterized approximation via fidelity preserving transformations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Improved Steiner tree algorithms for bounded treewidth
Journal of Discrete Algorithms
Partitioning into colorful components by minimum edge deletions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Information Processing Letters
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
TREEWIDTH and PATHWIDTH parameterized by the vertex cover number
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
Theoretical Computer Science
Fast monotone summation over disjoint sets
Information Processing Letters
Hi-index | 0.01 |
We present a fast algorithm for the subset convolution problem:given functions f and g defined on the lattice of subsets of ann-element set n, compute their subset convolution f*g, defined for S⊆ N by [ (f * g)(S) = [T ⊆ S] f(T) g(S/T),,]where addition and multiplication is carried out in an arbitrary ring. Via Möbius transform and inversion, our algorithm evaluates the subset convolution in O(n2 2n) additions and multiplications, substanti y improving upon the straightforward O(3n) algorithm. Specifically, if the input functions have aninteger range [-M,-M+1,...,M], their subset convolution over the ordinary sum--product ring can be computed in Õ(2n log M) time; the notation Õ suppresses polylogarithmic factors.Furthermore, using a standard embedding technique we can compute the subset convolution over the max--sum or min--sum semiring in Õ(2n M) time. To demonstrate the applicability of fast subset convolution, wepresent the first Õ(2k n2 + n m) algorithm for the Steiner tree problem in graphs with n vertices, k terminals, and m edges with bounded integer weights, improving upon the Õ(3kn + 2k n2 + n m) time bound of the classical Dreyfus-Wagner algorithm. We also discuss extensions to recent Õ(2n)-time algorithms for covering and partitioning problems (Björklund and Husfeldt, FOCS 2006; Koivisto, FOCS 2006).