Result 1 to 20 of 42 total
Courcelle’s theorem ‒ a game-theoretic approach. (English)
Discrete Optim. 8, No. 4, 568-594 (2011).
1
An exact algorithm for the maximum leaf spanning tree problem. (English)
Theor. Comput. Sci. 412, No. 45, 6290-6302 (2011).
2
A new algorithm for finding trees with many leaves. (English)
Algorithmica 61, No. 4, 882-897 (2011).
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
Courcelle’s theorem - A game-theoretic approach. (English)
Comput. Res. Repos. 2011, Article No. 1104.3905 (2011).
5
Are there any good digraph width measures? (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, 135-146 (2010).
6
Are there any good digraph width measures? (English)
Comput. Res. Repos. 2010, Article No. 1004.1485 (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
Are there any good digraph width measures? (English)
IPEC, 135-146 (2010).
9
A parameterized route to exact puzzles: breaking the $2^{n}$-barrier for irredundance (English)
CIAC, 311-322 (2010).
10
A fine-grained analysis of a simple independent set algorithm. (English)
Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15‒17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPICS ‒ Leibniz International Proceedings in Informatics 4, 287-298, electronic only (2009).
11
Breaking the 2^n-barrier for irredundance: A parameterized route to solving exact puzzles. (English)
Comput. Res. Repos. 2009, Article No. 0909.4224 (2009).
12
A practical approach to courcelle’s theorem. (English)
Electron. Notes Theor. Comput. Sci. 251, 65-81 (2009).
13
A bound on the pathwidth of sparse graphs with applications to exact algorithms. (English)
SIAM J. Discrete Math. 23, No. 1, 407-427 (2009).
14
On digraph width measures in parameterized algorithmics. (English)
Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10‒11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 185-197 (2009).
15
An exact algorithm for the maximum leaf spanning tree problem. (English)
Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10‒11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 161-172 (2009).
16
Randomized divide-and-conquer: improved path, matching, and packing algorithms. (English)
SIAM J. Comput. 38, No. 6, 2526-2547 (2009).
17
Approximation hardness of deadline-TSP reoptimization. (English)
Theor. Comput. Sci. 410, No. 21-23, 2241-2249 (2009).
18
An exact algorithm for the maximum leaf spanning tree problem (English)
IWPEC, 161-172 (2009).
19
On digraph width measures in parameterized algorithmics (English)
IWPEC, 185-197 (2009).
20
Result 1 to 20 of 42 total
Start
Contact
Print
General Help
