Madsen: An Algorithm for Exact Satisfiability Analysed with the Number of Clauses as Parameter, Information Processing Letters, 97 (1): 28-30, January 2006.
Madsen: Exact Algorithms and Exact Satisfiability, Dissertation, May 2005 (local copy).
Byskov, Madsen and Skjernaa: New Algorithms for Exact Satisfiability, Thoretical Computer Science 332(1-3): 515-541, February 2005.
Madsen, Nielsen and Skjernaa: On the Number of Maximal Bipartite Subgraphs of a Graph, Journal of Graph Theory 48(2): 127-132, December 2004.
Madsen and Rossmanith: Maximum Exact Satisfiability: NP-completeness Proofs and Exact Algorithms, BRICS Report, October 2004.
Madsen: An Algorithm for Exact Satisfiability Analysed with the Number of Clauses as Parameter, BRICS Report, September 2004.
Byskov, Madsen and Skjernaa: New Algorithms for Exact Satisfiability, BRICS Report, October 2003.
Madsen: Exact Algorithms for Satisfiability Problems and Graph Theoretical Problems, Progress Report, November 2002 (local copy).
Madsen, Nielsen and Skjernaa: On the Number of Maximal Bipartite Subgraphs of a Graph, BRICS Report, April 2002.
E-mail: bolette@daimi.au.dk