A Parameterized Route to Exact Puzzles: Breaking the $2^n$-barrier for irredundancy - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Dates and versions

hal-00461068 , version 1 (03-03-2010)

Identifiers

Cite

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⟩
265 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More