An improved exact algorithm for the domatic number problem
Information Processing Letters
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Exact and approximate link scheduling algorithms under the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Algorithms for Counting 2-Sat Solutions and Colorings with Applications
AAIM '07 Proceedings of the 3rd 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
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
ACM Transactions on Algorithms (TALG)
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Approximation of min coloring by moderately exponential algorithms
Information Processing Letters
Exponential-time approximation of weighted set cover
Information Processing Letters
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
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
ACM Transactions on Algorithms (TALG)
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
An exact algorithm for subgraph homeomorphism
Journal of Discrete Algorithms
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
The time complexity of constraint satisfaction
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
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
Approximating the max-edge-coloring problem
Theoretical Computer Science
Exact and approximate bandwidth
Theoretical Computer Science
Dominating set based exact algorithms for 3-coloring
Information Processing Letters
Colorings with few colors: counting, enumeration and combinatorial bounds
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
An exact algorithm for the Boolean connectivity problem for k-CNF
Theoretical Computer Science
Discrete Applied Mathematics
Capacitated domination faster than O(2n)
Information Processing Letters
Sharp separation and applications to exact and parameterized algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
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
Parameterized approximation via fidelity preserving transformations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Improved exact algorithms for counting 3- and 4-colorings
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Counting minimum weighted dominating sets
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Branch and recharge: exact algorithms for generalized domination
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Trees having many minimal dominating sets
Information Processing Letters
Hi-index | 0.01 |
Given a set U with n elements and a family of subsets S\subseteq2^U we show how to count the number of k-partitions S_1 \cup· · · \cupS_k = U into subsets S_i \in S in time 2^{n}n^{O(1)}. The only assumption on S is that it can be enumerated in time 2^{n}n^{O(1)}.In effect we get exact algorithms in time 2^{n}n^{O(1)} for several well-studied partition problems including Domatic Number, Chromatic Number, Bounded Component Spanning Forest, Partition into Hamiltonian Subgraphs, and Bin Packing. If only polynomial space is available, our algorithms run in time 3^{n}n^{O(1)} if membership in S can be decided in polynomial time. For Chromatic Number, we present a version that runs in time O(2.2461^n ) and polynomial space. For Domatic Number, we present a version that runs in time O(2.8718^n ). Finally, we present a family of polynomial space approximation algorithms that find a number between \chi \left( G \right) and \left\lceil {\left( {1 +\in } \right)\chi \left( G \right)} \right\rceilin time O(1.2209^n + 2.2461^{e^{-\in}n ).