A piecewise approach for the analysis of exact algorithms
Open Access
- 14 February 2026
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1070
Abstract
No abstract availableAll Related Versions
Funding Information
- Government of Western Australia
- Australian Research Council (DP210103849)
This publication has 14 references indexed in Scilit:
- Faster Graph Coloring in Polynomial SpaceAlgorithmica, 2022
- Exact algorithms for counting 3-colorings of graphsDiscrete Applied Mathematics, 2022
- A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSPAlgorithmica, 2014
- A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in betweenJournal of Computer and System Sciences, 2012
- Branch and Recharge: Exact Algorithms for Generalized DominationAlgorithmica, 2010
- On Two Techniques of Combining Branching and TreewidthAlgorithmica, 2007
- 3-coloring in timeJournal of Algorithms, 2005
- Exact algorithms for finding minimum transversals in rank-3 hypergraphsJournal of Algorithms, 2004
- New methods for 3-SAT decision and worst-case analysisTheoretical Computer Science, 1999
- Graph minors. III. Planar tree-widthJournal of Combinatorial Theory, Series B, 1984