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

Document type :
Conference papers
CIAC'2010 : 7th International Conference on Algorithms and Complexity, May 2010, Rome, Italy. 6078, pp.311-322, 2010, 〈10.1007/978-3-642-13073-1_28〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00461068
Contributor : Mathieu Liedloff <>
Submitted on : Wednesday, March 3, 2010 - 11:38:03 AM
Last modification on : Thursday, February 8, 2018 - 4:20:02 PM

Identifiers

Citation

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. 6078, pp.311-322, 2010, 〈10.1007/978-3-642-13073-1_28〉. 〈hal-00461068〉

Share

Metrics

Record views

189