Výpis publikací

GAJARSKÝ, Jakub; Michal PILIPCZUK a Filip POKRÝVKA. 3D-grids are not transducible from planar graphs. IEEE, 2025. Dostupné z: https://doi.org/10.1109/LICS65433.2025.00068.

GAJARSKÝ, Jakub; Michal PILIPCZUK; Marek SOKOLOWSKI; Giannos STAMOULIS a Szymon TORUNCZYK. Elementary first-order model checking for sparse graphs. Online. ACM, 2024. Dostupné z: https://doi.org/10.1145/3661814.3662094.

GAJARSKÝ, Jakub a Rose MCCARTY. On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification. Online. In Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson. 51st International Colloquium on Automata, Languages, and Programming, {ICALP} 2024, Tallinn, Estonia, July 8-12, 2024. LIPIcs, 2024, s. 137:1--137:20. Dostupné z: https://doi.org/10.4230/LIPICS.ICALP.2024.137.

BERGOUGNOUX, Benjamin; Jakub GAJARSKÝ; Grzegorz Jan GUSPIEL; Petr HLINĚNÝ; Filip POKRÝVKA a Marek SOKOŁOWSKI. Sparse Graphs of Twin-width 2 Have Bounded Tree-width. Online. In ISAAC 2023. 283. vyd. Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2023, s. "11:1"-"11:13", 13 s. ISBN 978-3-95977-289-1. Dostupné z: https://doi.org/10.4230/LIPICS.ISAAC.2023.11.

GAJARSKÝ, Jakub; Michal PILIPCZUK a Szymon TORUNCZYK. Stable graphs of bounded twin-width. In Christel Baier, Dana Fisman. {LICS} '22: 37th Annual {ACM/IEEE} Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022. ACM, 2022, s. 39:1--39:12. Dostupné z: https://doi.org/10.1145/3531130.3533356.

GAJARSKÝ, Jakub; Michal PILIPCZUK; Wojciech PRZYBYSZEWSKI a Szymon TORUNCZYK. Twin-Width and Types. Online. In Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff. 49th International Colloquium on Automata, Languages, and Programming, {ICALP} 2022, Paris, France, July 4-8, 2022. LIPIcs, 2022, s. 123:1--123:21. Dostupné z: https://doi.org/10.4230/LIPICS.ICALP.2022.123.

GAJARSKÝ, Jakub; Petr HLINĚNÝ; Daniel LOKSHTANOV; Jan OBDRŽÁLEK a M S RAMANUJAN. A New Perspective on FO Model Checking of Dense Graph Classes. ACM Transactions on Computational Logic. New York, NY, USA: Association for Computing Machinery, 2020, roč. 21, č. 4, s. "28:1"-"28:23", 23 s. ISSN 1529-3785. Dostupné z: https://doi.org/10.1145/3383206.

GAJARSKÝ, Jakub; Petr HLINĚNÝ; Martin KOUTECKÝ a Shmuel ONN. Parameterized shifted combinatorial optimization. Journal of Computer and System Sciences. SAN DIEGO: Academic Press, 2019, roč. 99, č. 1, s. 53-71. ISSN 0022-0000. Dostupné z: https://doi.org/10.1016/j.jcss.2018.06.002.

GAJARSKÝ, Jakub; Petr HLINĚNÝ a Hans Raj TIWARY. Parameterized Extension Complexity of Independent Set and Related Problems. Discrete Applied Mathematics. Elsevier Science, 2018, roč. 248, SI, s. 56-67. ISSN 0166-218X. Dostupné z: https://doi.org/10.1016/j.dam.2017.04.042.

GAJARSKÝ, Jakub; Petr HLINĚNÝ; Tomáš KAISER; Daniel KRÁĽ; Martin KUPEC; Jan OBDRŽÁLEK; Sebastian ORDYNIAK a Vojtěch TŮMA. First order limits of sparse graphs: Plane trees and path-width. Random Structures & Algorithms. Wiley, 2017, roč. 50, č. 4, s. 612-635. ISSN 1042-9832. Dostupné z: https://doi.org/10.1002/rsa.20676.

GAJARSKÝ, Jakub; Petr HLINĚNÝ; Jan OBDRŽÁLEK; Sebastian ORDYNIAK; Felix REIDL; Peter ROSSMANITH; Fernando VILLAAMIL a Somnath SIKDAR. Kernelization using structural parameters on sparse graph classes. Journal of Computer and System Sciences. SAN DIEGO: Elsevier, 2017, roč. 84, č. 1, s. 219-242. ISSN 0022-0000. Dostupné z: https://doi.org/10.1016/j.jcss.2016.09.002.

GAJARSKÝ, Jakub; Petr HLINĚNÝ; Martin KOUTECKÝ a Shmuel ONN. Parameterized Shifted Combinatorial Optimization. In Y. Cao and J. Chen. International Computing and Combinatorics Conference COCOON 2017 (LNCS, volume 10392). Hong Kong: Springer International Publishing AG, 2017, s. 224-236. ISBN 978-3-319-62388-7. Dostupné z: https://doi.org/10.1007/978-3-319-62389-4_19.

GAJARSKÝ, Jakub; Petr HLINĚNÝ; Daniel LOKSHTANOV; Jan OBDRŽÁLEK a M S RAMANUJAN. A New Perspective on FO Model Checking of Dense Graph Classes. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science LICS2016. New York, NY, USA: ACM, 2016, s. 176-184. ISBN 978-1-4503-4391-6. Dostupné z: https://doi.org/10.1145/2933575.2935314.

GAJARSKÝ, Jakub; Petr HLINĚNÝ; Jan OBDRŽÁLEK a Sebastian ORDYNIAK. Faster Existential FO Model Checking on Posets. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, roč. 11, č. 4, s. 1-13. ISSN 1860-5974. Dostupné z: https://doi.org/10.2168/LMCS-11(4:8)2015.

GAJARSKÝ, Jakub; Petr HLINĚNÝ; Jan OBDRŽÁLEK; Sebastian ORDYNIAK; M.S. RAMANUJAN; Daniel LOKSHTANOV a Saket SAURABH. FO Model Checking on Posets of Bounded Width. Online. In Venkatesan Guruswami. 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. Berkeley, CA, USA: IEEE Computer Society, 2015, s. 963-974. ISBN 978-1-4673-8191-8. Dostupné z: https://doi.org/10.1109/FOCS.2015.63.

GAJARSKÝ, Jakub a Petr HLINĚNÝ. Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, roč. 11, č. 1, s. 1-26. ISSN 1860-5974. Dostupné z: https://doi.org/10.2168/LMCS-11(1:19)2015.

GAJARSKÝ, Jakub; Sebastian ORDYNIAK; Michael LAMPIS; Valia MITSOU a Kazuhisa MAKINO. Parameterized Algorithms for Parity Games. Online. In Italiano, Giuseppe F. , Pighizzini, Giovanni, Sannella, Donald T. MFCS 2015, LNCS 9235. 9235. vyd. Berlin: Springer, 2015, s. 336-347. ISBN 978-3-662-48053-3. Dostupné z: https://doi.org/10.1007/978-3-662-48054-0_28.

GAJARSKÝ, Jakub; Petr HLINĚNÝ; Jan OBDRŽÁLEK a Sebastian ORDYNIAK. Faster Existential FO Model Checking on Posets. In Hee-Kap Ahn, Chan-Su Shin. ISAAC 2014, LNCS 8889. Berlin: Springer International Publishing, 2014, s. 441-451. ISBN 978-3-319-13074-3. Dostupné z: https://doi.org/10.1007/978-3-319-13075-0_35.

ORDYNIAK, Sebastian; Jakub GAJARSKÝ; Felix REIDL; Peter ROSSMANITH; Jan OBDRŽÁLEK a Fernando SÁNCHEZ VILAAMIL. Finite Integer Index of Pathwidth and Treewidth. In Marek Cygan and Pinar Heggernes. IPEC 2014, LNCS 8246. Wroclaw: Springer, 2014, s. 258-269. ISBN 978-3-319-13523-6. Dostupné z: https://doi.org/10.1007/978-3-319-13524-3_22.

GAJARSKÝ, Jakub; Petr HLINĚNÝ; Jan OBDRŽÁLEK; Sebastian ORDYNIAK; Felix REIDL; Peter ROSSMANITH; Fernando Sanchez VILLAAMIL a Somnath SIKDAR. Kernelization Using Structural Parameters on Sparse Graph Classes. In Hans L. Bodlaender a Giuseppe F. Italiano. ESA 2013. Berlin Heidelberg: Springer, 2013, s. 529-540. ISBN 978-3-642-40449-8. Dostupné z: https://doi.org/10.1007/978-3-642-40450-4_45.

GAJARSKÝ, Jakub; Michael LAMPIS a Sebastian ORDYNIAK. Parameterized Algorithms for Modular-Width. In Gutin, Gregory and Szeider, Stefan. Parameterized and Exact Computation. Berlin Heidelberg: Springer International Publishing, 2013, s. 163-176. ISBN 978-3-319-03897-1. Dostupné z: https://doi.org/10.1007/978-3-319-03898-8_15.

GAJARSKÝ, Jakub a Petr HLINĚNÝ. Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. Online. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). 2012. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2012, s. 112-123. ISBN 978-3-939897-47-7. Dostupné z: https://doi.org/10.4230/LIPIcs.FSTTCS.2012.112.

HLINĚNÝ, Petr a Jakub GAJARSKÝ. Faster than Courcelle's theorem on shrubs. In Seminar 12241: Data Reduction and Problem Kernels, Schloss Dagstuhl. 2012.

HLINĚNÝ, Petr a Jakub GAJARSKÝ. Testing Graph MSO Properties: A Fresh View. 2012.