Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms
Open problems around exact algorithms
Discrete Applied Mathematics
Faster Steiner Tree Computation in Polynomial-Space
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Set multi-covering via inclusion-exclusion
Theoretical Computer Science
An exact algorithm for subgraph homeomorphism
Journal of Discrete Algorithms
On Partitioning a Graph into Two Connected Subgraphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On exact complexity of subgraph homeomorphism
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Journal of Combinatorial Theory Series B
On partitioning a graph into two connected subgraphs
Theoretical Computer Science
Exact algorithms for exact satisfiability and number of perfect matchings
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Polynomial space algorithms for counting dominating sets and the domatic number
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Operations Research Letters
Fast hamiltonicity checking via bases of perfect matchings
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.89 |