Dreier, Jan; Gajarský, Jakub; Jiang, Yiting; Ossona de Mendez, Patrice; Raymond, Jean-Florent Corrigendum to: “Twin-width and generalized coloring numbers”. (English) Zbl 07756994 Discrete Math. 347, No. 1, Article ID 113750, 2 p. (2024). MSC: 05C15 PDFBibTeX XMLCite \textit{J. Dreier} et al., Discrete Math. 347, No. 1, Article ID 113750, 2 p. (2024; Zbl 07756994) Full Text: DOI
Gajarský, Jakub; Pilipczuk, Michał; Sokołowski, Marek; Stamoulis, Giannos; Toruńczyk, Szymon Elementary first-order model checking for sparse graphs. arXiv:2401.16230 Preprint, arXiv:2401.16230 [cs.LO] (2024). BibTeX Cite \textit{J. Gajarský} et al., ``Elementary first-order model checking for sparse graphs'', Preprint, arXiv:2401.16230 [cs.LO] (2024) Full Text: arXiv OA License
Bergougnoux, Benjamin; Gajarský, Jakub; Guśpiel, Grzegorz; Hliněný, Petr; Pokrývka, Filip; Sokołowski, Marek Sparse Graphs of Twin-width 2 Have Bounded Tree-width. arXiv:2307.01732 Preprint, arXiv:2307.01732 [math.CO] (2023). MSC: 05C75 68R10 BibTeX Cite \textit{B. Bergougnoux} et al., ``Sparse Graphs of Twin-width 2 Have Bounded Tree-width'', Preprint, arXiv:2307.01732 [math.CO] (2023) Full Text: arXiv OA License
Gajarský, Jakub; Mählmann, Nikolas; McCarty, Rose; Ohlmann, Pierre; Pilipczuk, Michał; Przybyszewski, Wojciech; Siebertz, Sebastian; Sokołowski, Marek; Toruńczyk, Szymon Flipper games for monadically stable graph classes. arXiv:2301.13735 Preprint, arXiv:2301.13735 [cs.LO] (2023). BibTeX Cite \textit{J. Gajarský} et al., ``Flipper games for monadically stable graph classes'', Preprint, arXiv:2301.13735 [cs.LO] (2023) Full Text: arXiv OA License
Dreier, Jan; Gajarský, Jakub; Jiang, Yiting; Ossona de Mendez, Patrice; Raymond, Jean-Florent Twin-width and generalized coloring numbers. (English) Zbl 1480.05055 Discrete Math. 345, No. 3, Article ID 112746, 8 p. (2022); corrigendum ibid. 347. No. 1, Article ID 113750, 2 p. (2024). MSC: 05C15 PDFBibTeX XMLCite \textit{J. Dreier} et al., Discrete Math. 345, No. 3, Article ID 112746, 8 p. (2022; Zbl 1480.05055) Full Text: DOI arXiv
Gajarský, Jakub; Pilipczuk, Michał; Przybyszewski, Wojciech; Toruńczyk, Szymon Twin-width and types. arXiv:2206.08248 Preprint, arXiv:2206.08248 [cs.LO] (2022). BibTeX Cite \textit{J. Gajarský} et al., ``Twin-width and types'', Preprint, arXiv:2206.08248 [cs.LO] (2022) Full Text: arXiv OA License
Gajarský, Jakub; Jaffke, Lars; Lima, Paloma T.; Novotná, Jana; Pilipczuk, Marcin; Rzążewski, Paweł; Souza, Uéverton S. Taming graphs with no large creatures and skinny ladders. arXiv:2205.01191 Preprint, arXiv:2205.01191 [math.CO] (2022). BibTeX Cite \textit{J. Gajarský} et al., ``Taming graphs with no large creatures and skinny ladders'', Preprint, arXiv:2205.01191 [math.CO] (2022) Full Text: arXiv OA License
Bonnet, Édouard; Dreier, Jan; Gajarský, Jakub; Kreutzer, Stephan; Mählmann, Nikolas; Simon, Pierre; Toruńczyk, Szymon Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. arXiv:2202.13014 Preprint, arXiv:2202.13014 [cs.DS] (2022). MSC: 05C85 BibTeX Cite \textit{É. Bonnet} et al., ``Model Checking on Interpretations of Classes of Bounded Local Cliquewidth'', Preprint, arXiv:2202.13014 [cs.DS] (2022) Full Text: arXiv OA License
Dreier, Jan; Gajarský, Jakub; Kiefer, Sandra; Pilipczuk, Michał; Toruńczyk, Szymon Treelike decompositions for transductions of sparse graphs. arXiv:2201.11082 Preprint, arXiv:2201.11082 [cs.LO] (2022). BibTeX Cite \textit{J. Dreier} et al., ``Treelike decompositions for transductions of sparse graphs'', Preprint, arXiv:2201.11082 [cs.LO] (2022) Full Text: arXiv OA License
Gajarský, Jakub; Pilipczuk, Michał; Toruńczyk, Szymon Stable graphs of bounded twin-width. arXiv:2107.03711 Preprint, arXiv:2107.03711 [cs.LO] (2021). BibTeX Cite \textit{J. Gajarský} et al., ``Stable graphs of bounded twin-width'', Preprint, arXiv:2107.03711 [cs.LO] (2021) Full Text: arXiv OA License
Gajarský, Jakub; Kreutzer, Stephan Computing shrub-depth decompositions. (English) Zbl 07650941 Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 56, 17 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Gajarský} and \textit{S. Kreutzer}, LIPIcs -- Leibniz Int. Proc. Inform. 154, Article 56, 17 p. (2020; Zbl 07650941) Full Text: DOI
Gajarský, Jakub; Kreutzer, Stephan; Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Pilipczuk, Michał; Siebertz, Sebastian; Toruńczyk, Szymon First-order interpretations of bounded expansion classes. (English) Zbl 1446.68094 ACM Trans. Comput. Log. 21, No. 4, Article No. 29, 41 p. (2020). MSC: 68Q60 03B70 05C75 PDFBibTeX XMLCite \textit{J. Gajarský} et al., ACM Trans. Comput. Log. 21, No. 4, Article No. 29, 41 p. (2020; Zbl 1446.68094) Full Text: DOI arXiv Link
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Lokshtanov, Daniel; Ramanujan, M. S. A new perspective on FO model checking of dense graph classes. (English) Zbl 1446.68093 ACM Trans. Comput. Log. 21, No. 4, Article No. 28, 23 p. (2020). MSC: 68Q60 03B70 05C75 68Q25 PDFBibTeX XMLCite \textit{J. Gajarský} et al., ACM Trans. Comput. Log. 21, No. 4, Article No. 28, 23 p. (2020; Zbl 1446.68093) Full Text: DOI arXiv
Gajarský, Jakub; Gorsky, Maximilian; Kreutzer, Stephan Differential games, locality and model checking for FO logic of graphs. arXiv:2007.11345 Preprint, arXiv:2007.11345 [cs.LO] (2020). BibTeX Cite \textit{J. Gajarský} et al., ``Differential games, locality and model checking for FO logic of graphs'', Preprint, arXiv:2007.11345 [cs.LO] (2020) Full Text: arXiv OA License
Gajarský, Jakub; Hliněný, Petr; Koutecký, Martin; Onn, Shmuel Parameterized shifted combinatorial optimization. (English) Zbl 1408.68075 J. Comput. Syst. Sci. 99, 53-71 (2019). MSC: 68Q25 90C27 PDFBibTeX XMLCite \textit{J. Gajarský} et al., J. Comput. Syst. Sci. 99, 53--71 (2019; Zbl 1408.68075) Full Text: DOI arXiv
Gajarský, Jakub; Král’, Daniel Recovering sparse graphs. (English) Zbl 1512.68152 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 29, 15 p. (2018). MSC: 68Q60 68Q27 68R10 68W05 PDFBibTeX XMLCite \textit{J. Gajarský} and \textit{D. Král'}, LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 29, 15 p. (2018; Zbl 1512.68152) Full Text: DOI arXiv
Gajarský, Jakub; Kreutzer, Stephan; Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Pilipczuk, Michal; Siebertz, Sebastian; Toruńczyk, Szymon First-order interpretations of bounded expansion classes. (English) Zbl 1499.68202 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 126, 14 p. (2018). MSC: 68Q60 03B70 05C75 PDFBibTeX XMLCite \textit{J. Gajarský} et al., LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 126, 14 p. (2018; Zbl 1499.68202) Full Text: DOI
Gajarský, Jakub; Hliněný, Petr; Tiwary, Hans Raj Parameterized extension complexity of independent set and related problems. (English) Zbl 1395.05125 Discrete Appl. Math. 248, 56-67 (2018). MSC: 05C69 PDFBibTeX XMLCite \textit{J. Gajarský} et al., Discrete Appl. Math. 248, 56--67 (2018; Zbl 1395.05125) Full Text: DOI arXiv
Gajarský, Jakub; Hliněný, Petr; Koutecký, Martin; Onn, Shmuel Parameterized shifted combinatorial optimization. (English) Zbl 1434.90167 Cao, Yixin (ed.) et al., Computing and combinatorics. 23rd international conference, COCOON 2017, Hong Kong, China, August 3–5, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10392, 224-236 (2017). MSC: 90C27 03B70 68Q19 68Q25 PDFBibTeX XMLCite \textit{J. Gajarský} et al., Lect. Notes Comput. Sci. 10392, 224--236 (2017; Zbl 1434.90167) Full Text: DOI arXiv
Gajarský, Jakub; Hliněný, Petr; Kaiser, Tomáš; Král’, Daniel; Kupec, Martin; Obdržálek, Jan; Ordyniak, Sebastian; Tůma, Vojtěch First order limits of sparse graphs: plane trees and path-width. (English) Zbl 1368.05088 Random Struct. Algorithms 50, No. 4, 612-635 (2017). MSC: 05C42 05C05 05C10 05C12 PDFBibTeX XMLCite \textit{J. Gajarský} et al., Random Struct. Algorithms 50, No. 4, 612--635 (2017; Zbl 1368.05088) Full Text: DOI arXiv Link
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando; Sikdar, Somnath Kernelization using structural parameters on sparse graph classes. (English) Zbl 1353.68127 J. Comput. Syst. Sci. 84, 219-242 (2017). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{J. Gajarský} et al., J. Comput. Syst. Sci. 84, 219--242 (2017; Zbl 1353.68127) Full Text: DOI arXiv Link
Gajarský, J.; Hliněný, P.; Obdržálek, J.; Lokshtanov, D.; Ramanujan, M. S. A new perspective on FO model checking of dense graph classes. (English) Zbl 1401.68196 Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 176-184 (2016). MSC: 68Q60 03B70 05C75 68Q25 PDFBibTeX XMLCite \textit{J. Gajarský} et al., in: Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5--8, 2016. New York, NY: Association for Computing Machinery (ACM). 176--184 (2016; Zbl 1401.68196) Full Text: DOI arXiv
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian Faster existential FO model checking on posets. (English) Zbl 1448.68298 Log. Methods Comput. Sci. 11, No. 4, Paper No. 8, 13 p. (2015). MSC: 68Q60 03B70 06A06 68Q25 PDFBibTeX XMLCite \textit{J. Gajarský} et al., Log. Methods Comput. Sci. 11, No. 4, Paper No. 8, 13 p. (2015; Zbl 1448.68298) Full Text: DOI
Gajarský, Jakub; Lampis, Michael; Makino, Kazuhisa; Mitsou, Valia; Ordyniak, Sebastian Parameterized algorithms for parity games. (English) Zbl 1465.68112 Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part II. Berlin: Springer. Lect. Notes Comput. Sci. 9235, 336-347 (2015). MSC: 68Q27 68Q17 68R10 91A43 PDFBibTeX XMLCite \textit{J. Gajarský} et al., Lect. Notes Comput. Sci. 9235, 336--347 (2015; Zbl 1465.68112) Full Text: DOI Link
Gajarský, Jakub; Hliněný, Petr Kernelizing MSO properties of trees of fixed height, and some consequences. (English) Zbl 1392.03022 Log. Methods Comput. Sci. 11, No. 1, Paper No. 19, 26 p. (2015). MSC: 03B25 03B15 03D05 05C05 68Q60 PDFBibTeX XMLCite \textit{J. Gajarský} and \textit{P. Hliněný}, Log. Methods Comput. Sci. 11, No. 1, Paper No. 19, 26 p. (2015; Zbl 1392.03022) Full Text: DOI arXiv
Gajarský, Jakub; Obdržálek, Jan; Ordyniak, Sebastian; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando; Sikdar, Somnath Finite integer index of pathwidth and treewidth. (English) Zbl 1456.68129 Cygan, Marek (ed.) et al., Parameterized and exact computation. 9th international symposium, IPEC 2014, Wroclaw, Poland, September 10–12, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8894, 258-269 (2014). MSC: 68R10 05C12 68Q27 PDFBibTeX XMLCite \textit{J. Gajarský} et al., Lect. Notes Comput. Sci. 8894, 258--269 (2014; Zbl 1456.68129) Full Text: DOI
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian Faster existential FO model checking on posets. (English) Zbl 1433.68216 Ahn, Hee-Kap (ed.) et al., Algorithms and computation. 25th international symposium, ISAAC 2014, Jeonju, Korea, December 15–17, 2014. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8889, 441-451 (2014). MSC: 68Q60 68Q27 PDFBibTeX XMLCite \textit{J. Gajarský} et al., Lect. Notes Comput. Sci. 8889, 441--451 (2014; Zbl 1433.68216) Full Text: DOI arXiv
Gajarský, Jakub; Lampis, Michael; Ordyniak, Sebastian Parameterized algorithms for modular-width. (English) Zbl 1406.68080 Gutin, Gregory (ed.) et al., Parameterized and exact computation. 8th international symposium, IPEC 2013, Sophia Antipolis, France, September 4–6, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03897-1/pbk). Lecture Notes in Computer Science 8246, 163-176 (2013). MSC: 68R10 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{J. Gajarský} et al., Lect. Notes Comput. Sci. 8246, 163--176 (2013; Zbl 1406.68080) Full Text: DOI arXiv
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando; Sikdar, Somnath Kernelization using structural parameters on sparse graph classes. (English) Zbl 1353.68126 Bodlaender, Hans L. (ed.) et al., Algorithms – ESA 2013. 21st annual European symposium, Sophia Antipolis, France, September 2–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40449-8/pbk). Lecture Notes in Computer Science 8125, 529-540 (2013). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{J. Gajarský} et al., Lect. Notes Comput. Sci. 8125, 529--540 (2013; Zbl 1353.68126) Full Text: DOI Link
Gajarský, Jakub; Hliněný, Petr Faster deciding MSO properties of trees of fixed height, and some consequences. (English) Zbl 1354.68122 D’Souza, Deepak (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2012). Selected papers based on the presentations at the 32nd conference, Hyderabad, India, December 15–17, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-47-7). LIPIcs – Leibniz International Proceedings in Informatics 18, 112-123 (2012). MSC: 68Q25 03B25 03B70 05C75 68Q60 PDFBibTeX XMLCite \textit{J. Gajarský} and \textit{P. Hliněný}, LIPIcs -- Leibniz Int. Proc. Inform. 18, 112--123 (2012; Zbl 1354.68122) Full Text: DOI