History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 121 total

On the power of randomness versus advice in online computation. (English)
Bordihn, Henning (ed.) et al., Languages alive. Essays dedicated to Jürgen Dassow on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-31643-2/pbk). Lecture Notes in Computer Science 7300, 30-43 (2012).
1
Lower bounds on the complexity of $\mathrm{MSO}_1$ model-checking. (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, 326-337, electronic only (2012).
2
On the advice complexity of the knapsack problem. (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, 61-72 (2012).
3
Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6‒8, 2011. Revised selected papers. (English)
Lecture Notes in Computer Science 7112. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). viii, 273~p. EUR~49.22 (2012).
4
Courcelle’s theorem ‒ a game-theoretic approach. (English)
Discrete Optim. 8, No. 4, 568-594 (2011).
5
An exact algorithm for the maximum leaf spanning tree problem. (English)
Theor. Comput. Sci. 412, No. 45, 6290-6302 (2011).
6
A new algorithm for finding trees with many leaves. (English)
Algorithmica 61, No. 4, 882-897 (2011).
7
A property tester for tree-likeness of quartet topologies. (English)
Theory Comput. Syst. 49, No. 3, 576-587 (2011).
8
Breaking the $2^{n}$-barrier for irredundance: two lines of attack. (English)
J. Discrete Algorithms 9, No. 3, 214-230 (2011).
9
Courcelle’s theorem - A game-theoretic approach. (English)
Comput. Res. Repos. 2011, Article No. 1104.3905 (2011).
10
Linear-time algorithms for graphs of bounded rankwidth: A fresh look using game theory (extended abstract). (English)
Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 505-516 (2011).
11
Fast exact algorithm for $L(2,1)$-labeling of graphs. (English)
Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 82-93 (2011).
12
Linear-time algorithms for graphs of bounded rankwidth: A fresh look using game theory. (English)
Comput. Res. Repos. 2011, Article No. 1102.0908 (2011).
13
Simulated annealing. (English)
Vöcking, Berthold (ed.) et al., Algorithms unplugged. Berlin: Springer (ISBN 978-3-642-15327-3/hbk; 978-3-642-15328-0/ebook). 393-400 (2011).
14
Simulated annealing (English)
Algorithms Unplugged, 393-400 (2011).
15
Fast exact algorithm for $L$(2, 1)-labeling of graphs (English)
TAMC, 82-93 (2011).
16
Linear-time algorithms for graphs of bounded rankwidth: A fresh look using game theory - (Extended abstract) (English)
TAMC, 505-516 (2011).
17
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).
18
New fixed-parameter algorithms for the minimum quartet inconsistency problem. (English)
Theory Comput. Syst. 47, No. 2, 342-367 (2010).
19
Are there any good digraph width measures? (English)
Comput. Res. Repos. 2010, Article No. 1004.1485 (2010).
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 121 total