History

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

Result 1 to 20 of 26 total

When trees grow low: shrubs and fast MSO$_{1}$. (English)
Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2012. 37th international symposium, MFCS 2012, Bratislava, Slovakia, August 27‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32588-5/pbk). Lecture Notes in Computer Science 7464, 419-430 (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
Twin-cover: Beyond vertex cover in parameterized algorithmics. (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, 259-271 (2012).
3
Clique-width: when hard does not mean impossible. (English)
Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10‒12, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPICS ‒ Leibniz International Proceedings in Informatics 9, 404-415, electronic only (2011).
4
Thread graphs, linear rank-width and their algorithmic applications. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 38-42 (2011).
5
New results on the complexity of the Max- and Min-Rep problems. (English)
Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22‒28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 238-247 (2011).
6
Clique-width: when hard does not mean impossible (English)
STACS, 404-415 (2011).
7
New results on the complexity of the Max- and min-rep problems (English)
SOFSEM, 238-247 (2011).
8
Better algorithms for satisfiability problems for formulas of bounded rank-width. (English)
Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15‒18, 2010, Chennai, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPICS ‒ Leibniz International Proceedings in Informatics 8, 73-83, electronic only (2010).
9
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).
10
Better algorithms for satisfiability problems for formulas of bounded rank-width. (English)
Comput. Res. Repos. 2010, Article No. 1006.5621 (2010).
11
Are there any good digraph width measures? (English)
Comput. Res. Repos. 2010, Article No. 1004.1485 (2010).
12
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. (English)
Discrete Appl. Math. 158, No. 7, 851-867 (2010).
13
New results on the complexity of oriented colouring on restricted digraph classes. (English)
van Leeuwen, Jan (ed.) et al., SOFSEM 2010: Theory and practice of computer science. 36th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 23‒29, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11265-2/pbk). Lecture Notes in Computer Science 5901, 428-439 (2010).
14
Are there any good digraph width measures? (English)
IPEC, 135-146 (2010).
15
New results on the complexity of oriented colouring on restricted digraph classes (English)
SOFSEM, 428-439 (2010).
16
Thread graphs, linear rank-width and their algorithmic applications (English)
IWOCA, 38-42 (2010).
17
Better algorithms for satisfiability problems for formulas of bounded rank-width (English)
FSTTCS, 73-83 (2010).
18
The parameterized complexity of oriented colouring. (English)
Hlinený, Petr (ed.) et al., Annual doctoral workshop on mathematical and engineering methods in computer science (MEMICS’09). Selected papers based on the presentations at the workshop, November 13-15, 2009, Znojmo, Czech Republic. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-15-6). OASIcs ‒ OpenAccess Series in Informatics 13, 86-93, electronic only (2009).
19
Automata approach to graphs of bounded rank-width. (English)
Miller, Mirka (ed.) et al., Proceedings of the 19th international workshop on combinatorial algorithms, IWOCA 2008, Nagoya, Japan, September 12‒15, 2008. London: College Publications (ISBN 978-1-904987-74-1/pbk). Texts in Algorithmics 12, 4-14 (2009).
20
first | previous | 1 21 | next | last

Result 1 to 20 of 26 total