 |
|
|
|
| HAL: hal-00461068, version 1 |
| DOI: 10.1007/978-3-642-13073-1_28 |
| Detailed view |  Export this paper |
|
|
| CIAC'2010 : 7th International Conference on Algorithms and Complexity, Rome : Italy (2010) |
|
|
|
|
| A Parameterized Route to Exact Puzzles: Breaking the $2^n$-barrier for irredundancy |
|
|
| Ljiljana Brankovic 1Henning Fernau 2 |
|
|
| (2010) |
|
|
|
|
|
|
|
|
|
|
|
| 1: | School of Electrical Engineering and Computer Science |
|
|
|
University of Newcastle, Callaghan, Australia |
|
|
| 2: | Universität Trier |
|
|
|
Universität Trier |
|
|
| 3: | Department of Computer Science - RWTH Aachen University |
|
|
|
RWTH Aachen University |
|
|
| 4: | Laboratoire d'Informatique Théorique et Appliquée (LITA) |
|
|
|
Université Paul Verlaine - Metz |
|
|
| 5: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Data Structures and Algorithms |
| hal-00461068, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00461068 | |
| oai:hal.archives-ouvertes.fr:hal-00461068 | |
| From: Mathieu Liedloff | |
| Submitted on: Wednesday, 3 March 2010 11:38:03 | |
| Updated on: Sunday, 29 August 2010 18:43:57 | |
