Details
| Original language | English |
|---|---|
| Title of host publication | Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings |
| Editors | Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe |
| Pages | 549-560 |
| Number of pages | 12 |
| Volume | 8977 |
| Publication status | Published - 2015 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. / Lück, Martin; Meier, Arne; Schindler, Irina.
Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. ed. / Adrian-Horia Dediu; Enrico Formenti; Carlos Martín-Vide; Bianca Truthe. Vol. 8977 2015. p. 549-560 (Lecture Notes in Computer Science).
Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. ed. / Adrian-Horia Dediu; Enrico Formenti; Carlos Martín-Vide; Bianca Truthe. Vol. 8977 2015. p. 549-560 (Lecture Notes in Computer Science).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
Lück, M, Meier, A & Schindler, I 2015, Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. in A-H Dediu, E Formenti, C Martín-Vide & B Truthe (eds), Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. vol. 8977, Lecture Notes in Computer Science, pp. 549-560. https://doi.org/10.1007/978-3-319-15579-143
Lück, M., Meier, A., & Schindler, I. (2015). Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. In A.-H. Dediu, E. Formenti, C. Martín-Vide, & B. Truthe (Eds.), Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings (Vol. 8977, pp. 549-560). (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-15579-143
Lück M, Meier A, Schindler I. Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. In Dediu AH, Formenti E, Martín-Vide C, Truthe B, editors, Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. Vol. 8977. 2015. p. 549-560. (Lecture Notes in Computer Science). doi: 10.1007/978-3-319-15579-143
Download
@inproceedings{f017cd4c918448cf9b81708c9db6b269,
title = "Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem",
author = "Martin L{\"u}ck and Arne Meier and Irina Schindler",
year = "2015",
doi = "10.1007/978-3-319-15579-143",
language = "English",
volume = "8977",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "549--560",
editor = "Adrian-Horia Dediu and Enrico Formenti and Carlos Mart{\'i}n-Vide and Bianca Truthe",
booktitle = "Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings",
}
Download
TY - GEN
T1 - Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem
AU - Lück, Martin
AU - Meier, Arne
AU - Schindler, Irina
PY - 2015
Y1 - 2015
U2 - 10.1007/978-3-319-15579-143
DO - 10.1007/978-3-319-15579-143
M3 - Conference contribution
VL - 8977
T3 - Lecture Notes in Computer Science
SP - 549
EP - 560
BT - Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings
A2 - Dediu, Adrian-Horia
A2 - Formenti, Enrico
A2 - Martín-Vide, Carlos
A2 - Truthe, Bianca
ER -