A Parameterized Route to Exact Puzzles: Breaking the $2^n$-barrier for irredundancy

Ljiljana Brankovic (1) , Henning Fernau (2) , Joachim Kneis (3) , Dieter Kratsch (4) , Alexander Langer (3) , Mathieu Liedloff (5) , Daniel Raible (2) , Peter Rossmanith (3)

1 School of Electrical Engineering and Computer Science
2 Trier University
3 Department of Computer Science [Aachen]
4 LITA - Laboratoire d'Informatique Théorique et Appliquée
5 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans

Domaines: Algorithme et structure de données [cs.DS]

Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, et al.. A Parameterized Route to Exact Puzzles: Breaking the $2^n$-barrier for irredundancy. CIAC'2010 : 7th International Conference on Algorithms and Complexity, May 2010, Rome, Italy. pp.311-322, ⟨10.1007/978-3-642-13073-1_28⟩. ⟨hal-00461068⟩