Result 1 to 20 of 318 total
A note on exact algorithms for vertex ordering problems on graphs. (English)
Theory Comput. Syst. 50, No. 3, 420-432 (2012).
1
Cops and robber game without recharging. (English)
Theory Comput. Syst. 50, No. 4, 611-620 (2012).
2
Connected graph searching. (English)
Inf. Comput. 219, 1-16 (2012).
3
Parameterized complexity of the spanning tree congestion problem. (English)
Algorithmica 64, No. 1, 85-111 (2012).
4
Fast minor testing in planar graphs. (English)
Algorithmica 64, No. 1, 69-84 (2012).
5
Minimizing rosenthal potential in multicast games. (English)
Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9‒13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 525-536 (2012).
6
A polynomial kernel for proper interval vertex deletion. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 467-478 (2012).
7
Counting subgraphs via homomorphisms. (English)
SIAM J. Discrete Math. 26, No. 2, 695-717 (2012).
8
Cops and robber with constraints. (English)
SIAM J. Discrete Math. 26, No. 2, 571-590 (2012).
9
FPT suspects and tough customers: open problems of Downey and Fellows. (English)
Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 457-468 (2012).
10
Parameterized complexity of connected even/odd subgraph problems. (English)
Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th ‒ March 3rd, 2012. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPICS ‒ Leibniz International Proceedings in Informatics 14, 432-440, electronic only (2012).
11
Making life easier for firefighters. (English)
Kranakis, Evangelos (ed.) et al., Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30346-3/pbk). Lecture Notes in Computer Science 7288, 177-188 (2012).
12
To satisfy impatient web surfers is hard. (English)
Kranakis, Evangelos (ed.) et al., Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30346-3/pbk). Lecture Notes in Computer Science 7288, 166-176 (2012).
13
Catalan structures and dynamic programming in $H$-minor-free graphs. (English)
J. Comput. Syst. Sci. 78, No. 5, 1606-1622 (2012).
14
Local search: is brute-force avoidable? (English)
J. Comput. Syst. Sci. 78, No. 3, 707-719 (2012).
15
Faster algorithms for finding and counting subgraphs. (English)
J. Comput. Syst. Sci. 78, No. 3, 698-706 (2012).
16
$k$-gap interval graphs. (English)
Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 350-361 (2012).
17
The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. (English)
Lecture Notes in Computer Science 7370. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). xxx, 497~p. EUR~74.90 (2012).
18
Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. (English)
Lecture Notes in Computer Science 7357. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). xv, 400~p. EUR~66.34 (2012).
19
Parameterized complexity of firefighting revisited. (English)
Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6‒8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 13-26 (2012).
20
Result 1 to 20 of 318 total