Langer, Alexander; Reidl, Felix; Rossmanith, Peter; Sikdar, Somnath Practical algorithms for MSO model-checking on tree-decomposable graphs. (English) Zbl 1302.68184 Comput. Sci. Rev. 13-14, 39-74 (2014). MSC: 68Q60 03B70 03B15 05C70 05C85 68R10 68-02 PDFBibTeX XMLCite \textit{A. Langer} et al., Comput. Sci. Rev. 13--14, 39--74 (2014; Zbl 1302.68184) Full Text: DOI
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter Digraph width measures in parameterized algorithmics. (English) Zbl 1285.05077 Discrete Appl. Math. 168, 88-107 (2014). MSC: 05C20 05C12 05C69 PDFBibTeX XMLCite \textit{R. Ganian} et al., Discrete Appl. Math. 168, 88--107 (2014; Zbl 1285.05077) Full Text: DOI
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking. (English) Zbl 1311.68087 J. Comput. Syst. Sci. 80, No. 1, 180-194 (2014). MSC: 68Q60 05C85 68Q17 PDFBibTeX XMLCite \textit{R. Ganian} et al., J. Comput. Syst. Sci. 80, No. 1, 180--194 (2014; Zbl 1311.68087) Full Text: DOI arXiv
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter Courcelle’s theorem – a game-theoretic approach. (English) Zbl 1235.68103 Discrete Optim. 8, No. 4, 568-594 (2011). MSC: 68Q60 03B15 91A80 PDFBibTeX XMLCite \textit{J. Kneis} et al., Discrete Optim. 8, No. 4, 568--594 (2011; Zbl 1235.68103) Full Text: DOI
Langer, Alexander; Rossmanith, Peter; Sikdar, Somnath Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract). (English) Zbl 1331.68111 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). MSC: 68Q25 05C85 68R10 91A43 PDFBibTeX XMLCite \textit{A. Langer} et al., Lect. Notes Comput. Sci. 6648, 505--516 (2011; Zbl 1331.68111) Full Text: DOI
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter On digraph width measures in parameterized algorithmics. (English) Zbl 1273.68276 Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 185-197 (2009). MSC: 68R10 68Q17 PDFBibTeX XMLCite \textit{R. Ganian} et al., Lect. Notes Comput. Sci. 5917, 185--197 (2009; Zbl 1273.68276) Full Text: DOI