![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Jakub Gajarský
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Jan Dreier
, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez
, Jean-Florent Raymond:
Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746]. Discret. Math. 347(1): 113750 (2024) - [c22]Jakub Gajarský, Rose McCarty:
On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification. ICALP 2024: 137:1-137:20 - [c21]Jakub Gajarský
, Michal Pilipczuk
, Marek Sokolowski
, Giannos Stamoulis
, Szymon Torunczyk
:
Elementary first-order model checking for sparse graphs. LICS 2024: 36:1-36:14 - [i18]Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk:
Elementary first-order model checking for sparse graphs. CoRR abs/2401.16230 (2024) - [i17]Jakub Gajarský, Rose McCarty
:
On classes of bounded tree rank, their interpretations, and efficient sparsification. CoRR abs/2404.18904 (2024) - 2023
- [c20]Jakub Gajarský, Nikolas Mählmann, Rose McCarty
, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk:
Flipper Games for Monadically Stable Graph Classes. ICALP 2023: 128:1-128:16 - [c19]Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski:
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. ISAAC 2023: 11:1-11:13 - [i16]Jakub Gajarský, Nikolas Mählmann, Rose McCarty
, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk:
Flipper games for monadically stable graph classes. CoRR abs/2301.13735 (2023) - [i15]Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski:
Sparse Graphs of Twin-width 2 Have Bounded Tree-width. CoRR abs/2307.01732 (2023) - 2022
- [j9]Jan Dreier
, Jakub Gajarský
, Yiting Jiang
, Patrice Ossona de Mendez
, Jean-Florent Raymond
:
Twin-width and generalized coloring numbers. Discret. Math. 345(3): 112746 (2022) - [c18]Jakub Gajarský
, Maximilian Gorsky, Stephan Kreutzer:
Differential Games, Locality, and Model Checking for FO Logic of Graphs. CSL 2022: 22:1-22:18 - [c17]Jakub Gajarský
, Lars Jaffke, Paloma T. Lima, Jana Novotná
, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza:
Taming Graphs with No Large Creatures and Skinny Ladders. ESA 2022: 58:1-58:8 - [c16]Jakub Gajarský
, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk:
Twin-Width and Types. ICALP 2022: 123:1-123:21 - [c15]Jan Dreier
, Jakub Gajarský
, Sandra Kiefer
, Michal Pilipczuk, Szymon Torunczyk:
Treelike Decompositions for Transductions of Sparse Graphs. LICS 2022: 31:1-31:14 - [c14]Jakub Gajarský
, Michal Pilipczuk, Szymon Torunczyk:
Stable graphs of bounded twin-width. LICS 2022: 39:1-39:12 - [c13]Édouard Bonnet, Jan Dreier
, Jakub Gajarský
, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk:
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. LICS 2022: 54:1-54:13 - [i14]Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk:
Treelike decompositions for transductions of sparse graphs. CoRR abs/2201.11082 (2022) - [i13]Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk:
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. CoRR abs/2202.13014 (2022) - [i12]Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza:
Taming graphs with no large creatures and skinny ladders. CoRR abs/2205.01191 (2022) - [i11]Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk:
Twin-width and types. CoRR abs/2206.08248 (2022) - 2021
- [i10]Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk:
Stable graphs of bounded twin-width. CoRR abs/2107.03711 (2021) - 2020
- [j8]Jakub Gajarský
, Petr Hlinený
, Jan Obdrzálek
, Daniel Lokshtanov, M. S. Ramanujan:
A New Perspective on FO Model Checking of Dense Graph Classes. ACM Trans. Comput. Log. 21(4): 28:1-28:23 (2020) - [j7]Jakub Gajarský
, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez
, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
:
First-Order Interpretations of Bounded Expansion Classes. ACM Trans. Comput. Log. 21(4): 29:1-29:41 (2020) - [c12]Jakub Gajarský
, Stephan Kreutzer:
Computing Shrub-Depth Decompositions. STACS 2020: 56:1-56:17 - [i9]Jakub Gajarský, Maximilian Gorsky, Stephan Kreutzer:
Differential games, locality and model checking for FO logic of graphs. CoRR abs/2007.11345 (2020)
2010 – 2019
- 2019
- [j6]Jakub Gajarský
, Petr Hlinený
, Martin Koutecký
, Shmuel Onn
:
Parameterized shifted combinatorial optimization. J. Comput. Syst. Sci. 99: 53-71 (2019) - 2018
- [j5]Jakub Gajarský, Petr Hlinený
, Hans Raj Tiwary
:
Parameterized extension complexity of independent set and related problems. Discret. Appl. Math. 248: 56-67 (2018) - [c11]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez
, Michal Pilipczuk
, Sebastian Siebertz
, Szymon Torunczyk
:
First-Order Interpretations of Bounded Expansion Classes. ICALP 2018: 126:1-126:14 - [c10]Jakub Gajarský, Daniel Král
:
Recovering Sparse Graphs. MFCS 2018: 29:1-29:15 - [i8]Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan:
A New Perspective on FO Model Checking of Dense Graph Classes. CoRR abs/1805.01823 (2018) - [i7]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-order interpretations of bounded expansion classes. CoRR abs/1810.02389 (2018) - 2017
- [j4]Jakub Gajarský, Petr Hlinený
, Jan Obdrzálek, Sebastian Ordyniak
, Felix Reidl
, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization using structural parameters on sparse graph classes. J. Comput. Syst. Sci. 84: 219-242 (2017) - [j3]Jakub Gajarský, Petr Hlinený
, Tomás Kaiser
, Daniel Král'
, Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak
, Vojtech Tuma:
First order limits of sparse graphs: Plane trees and path-width. Random Struct. Algorithms 50(4): 612-635 (2017) - [c9]Jakub Gajarský, Petr Hlinený
, Martin Koutecký
, Shmuel Onn
:
Parameterized Shifted Combinatorial Optimization. COCOON 2017: 224-236 - [i6]Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn:
Parameterized Shifted Combinatorial Optimization. CoRR abs/1702.06844 (2017) - [i5]Jakub Gajarský, Daniel Král:
Deobfuscating sparse graphs. CoRR abs/1709.09985 (2017) - 2016
- [c8]Jakub Gajarský, Petr Hlinený
, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan:
A New Perspective on FO Model Checking of Dense Graph Classes. LICS 2016: 176-184 - 2015
- [j2]Jakub Gajarský, Petr Hlinený
:
Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences. Log. Methods Comput. Sci. 11(1) (2015) - [j1]Jakub Gajarský, Petr Hlinený
, Jan Obdrzálek, Sebastian Ordyniak
:
Faster Existential FO Model Checking on Posets. Log. Methods Comput. Sci. 11(4) (2015) - [c7]Jakub Gajarský, Petr Hlinený
, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak
, M. S. Ramanujan, Saket Saurabh:
FO Model Checking on Posets of Bounded Width. FOCS 2015: 963-974 - [c6]Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak:
Parameterized Algorithms for Parity Games. MFCS (2) 2015: 336-347 - [i4]Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh:
FO Model Checking on Posets of Bounded Width. CoRR abs/1504.04115 (2015) - [i3]Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary:
Parameterized Extension Complexity of Independent Set and Related Problems. CoRR abs/1511.08841 (2015) - 2014
- [c5]Jakub Gajarský, Petr Hlinený
, Jan Obdrzálek, Sebastian Ordyniak:
Faster Existential FO Model Checking on Posets. ISAAC 2014: 441-451 - [c4]Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl
, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Finite Integer Index of Pathwidth and Treewidth. IPEC 2014: 258-269 - 2013
- [c3]Jakub Gajarský, Petr Hlinený
, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl
, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization Using Structural Parameters on Sparse Graph Classes. ESA 2013: 529-540 - [c2]Jakub Gajarský, Michael Lampis, Sebastian Ordyniak:
Parameterized Algorithms for Modular-Width. IPEC 2013: 163-176 - [i2]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization Using Structural Parameters on Sparse Graph Classes. CoRR abs/1302.6863 (2013) - [i1]Jakub Gajarský, Michael Lampis, Sebastian Ordyniak:
Parameterized Algorithms for Modular-Width. CoRR abs/1308.2858 (2013) - 2012
- [c1]Jakub Gajarský, Petr Hlinený
:
Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. FSTTCS 2012: 112-123
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint