Result 1 to 11 of 11 total
Parameterized measure \& conquer for problems with no small kernels. (English)
Algorithmica 64, No. 1, 189-212 (2012).
1
An exact exponential-time algorithm for the directed maximum leaf spanning tree problem. (English)
J. Discrete Algorithms 15, 43-55 (2012).
2
An exact exponential time algorithm for {\sc Power} {\sc Dominating} {\sc Set}. (English)
Algorithmica 63, No. 1-2, 323-346 (2012).
3
io-port 05941895 Binkele-Raible, Daniel;
Brankovic, Ljiljana;
Cygan, Marek;
Fernau, Henning;
Kneis, Joachim;
Kratsch, Dieter;
Langer, Alexander;
Liedloff, Mathieu;
Pilipczuk, Marcin;
Rossmanith, Peter;
Wojtaszczyk, Jakub Onufry
Breaking the $2^{n}$-barrier for irredundance: two lines of attack. (English)
J. Discrete Algorithms 9, No. 3, 214-230 (2011).
4
A new upper bound for Max-2-SAT: A graph-theoretic approach. (English)
J. Discrete Algorithms 8, No. 4, 388-401 (2010).
5
Enumerate and measure: improving parameter budget management. (English)
Raman, Venkatesh (ed.) et al., Parameterized and exact computation. 5th international symposium, IPEC 2010, Chennai, India, December 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17492-6/pbk). Lecture Notes in Computer Science 6478, 38-49 (2010).
6
A faster exact algorithm for the directed maximum leaf spanning tree problem. (English)
Ablayev, Farid (ed.) et al., Computer science ‒ theory and applications. 5th international computer science symposium in Russia, CSR 2010, Kazan, Russia, June 16‒20, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13181-3). Lecture Notes in Computer Science 6072, 328-339 (2010).
7
A parameterized route to exact puzzles: Breaking the $2^{n }$-barrier for irredundance. (Extended abstract). (English)
Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 7th international conference, CIAC 2010, Rome, Italy, May 26‒28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13072-4/pbk). Lecture Notes in Computer Science 6078, 311-322 (2010).
8
A faster exact algorithm for the directed maximum leaf spanning tree problem (English)
CSR, 328-339 (2010).
9
Enumerate and measure: improving parameter budget management (English)
IPEC, 38-49 (2010).
10
A parameterized route to exact puzzles: breaking the $2^{n}$-barrier for irredundance (English)
CIAC, 311-322 (2010).
11
Result 1 to 11 of 11 total
Start
Contact
Print
General Help
