1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2024★ 1 cited
A Piecewise Approach for the Analysis of Exact Algorithms
Katie Clinch, Serge Gaspers, Zixu He +2
To analyze the worst-case running time of branching algorithms, the majority of work in exponential time algorithms focuses on designing complicated branching rules over developing…
cs.DS2023★ 1 cited
Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems
Serge Gaspers, Jerry Zirui Li
Let U be a universe on n elements, let k be a positive integer, and let F be a family of (implicitly defined) subsets of U. We consider the problems of partitioning U into k sets f…