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 104 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
Generalized maneuvers in route planning. (English)
Kotásek, Zdeněk (ed.) et al., Mathematical and engineering methods in computer science. 7th international doctoral workshop, MEMICS 2011, Lednice, Czech Republic, October 14‒16, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25928-9/pbk). Lecture Notes in Computer Science 7119, 155-166 (2012).
3
Special issue: Mathematical foundations of computer science (MFCS 2010). Selected papers based on the presentations at the 35th international symposium, Brno, Czech Republic, August 23‒27, 2010. (English)
Theor. Comput. Sci. 417, 107~p. (2012).
4
Vertex insertion approximates the crossing number of apex graphs. (English)
Eur. J. Comb. 33, No. 3, 326-335 (2012).
5
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).
6
How not to characterize planar-emulable graphs. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20‒22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 106-120 (2011).
7
Scope-based route planning. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 445-456 (2011).
8
A tighter insertion-based approximation of the crossing number. (English)
Comput. Res. Repos. 2011, Article No. 1104.5039 (2011).
9
A tighter insertion-based approximation of the crossing number. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 122-134 (2011).
10
Multi-stage improved route planning approach: theoretical foundations. (English)
Comput. Res. Repos. 2011, Article No. 1101.3182 (2011).
11
Parameterized problems related to seidel’s switching (English)
Discrete Mathematics & Theoretical Computer Science 13, No. 2, 19-44 (2011).
12
Scope-based route planning (English)
ESA, 445-456 (2011).
13
A tighter insertion-based approximation of the crossing number (English)
ICALP (1), 122-134 (2011).
14
Clique-width: when hard does not mean impossible (English)
STACS, 404-415 (2011).
15
How not to characterize planar-emulable graphs (English)
IWOCA, 106-120 (2011).
16
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).
17
Stars and bonds in crossing-critical graphs. (English)
J. Graph Theory 65, No. 3, 198-215 (2010).
18
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).
19
20 years of Negami’s planar cover conjecture. (English)
Graphs Comb. 26, No. 4, 525-536 (2010).
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 104 total