Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

First order limits of sparse graphs: Plane trees and path-width.

J. Gajarský, P. Hlinený, T. Kaiser, D. Král', M. Kupec, J. Obdrzálek, S. Ordyniak, and V. Tuma. Random Struct. Algorithms, 50 (4): 612-635 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jakub Mácha

Analytische Theorien der Metapher: Untersuchungen zum Konzept der metaphorischen BedeutungJ. Mácha. Uni Hannover, (2009)

Jakub Kopycki

Jakub Novák

Jakub Limanowski

Jakub Hodek

Other publications of authors with the same name

Deobfuscating sparse graphs.J. Gajarský, and D. Král. CoRR, (2017)Faster Existential FO Model Checking on Posets.J. Gajarský, P. Hlinený, J. Obdrzálek, and S. Ordyniak. ISAAC, volume 8889 of Lecture Notes in Computer Science, page 441-451. Springer, (2014)First order limits of sparse graphs: Plane trees and path-width.J. Gajarský, P. Hlinený, T. Kaiser, D. Král', M. Kupec, J. Obdrzálek, S. Ordyniak, and V. Tuma. Random Struct. Algorithms, 50 (4): 612-635 (2017)Stable graphs of bounded twin-width.J. Gajarský, M. Pilipczuk, and S. Torunczyk. CoRR, (2021)Flipper Games for Monadically Stable Graph Classes.J. Gajarský, N. Mählmann, R. McCarty, P. Ohlmann, M. Pilipczuk, W. Przybyszewski, S. Siebertz, M. Sokolowski, and S. Torunczyk. ICALP, volume 261 of LIPIcs, page 128:1-128:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Differential Games, Locality, and Model Checking for FO Logic of Graphs.J. Gajarský, M. Gorsky, and S. Kreutzer. CSL, volume 216 of LIPIcs, page 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Computing Shrub-Depth Decompositions.J. Gajarský, and S. Kreutzer. STACS, volume 154 of LIPIcs, page 56:1-56:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.É. Bonnet, J. Dreier, J. Gajarský, S. Kreutzer, N. Mählmann, P. Simon, and S. Torunczyk. LICS, page 54:1-54:13. ACM, (2022)Parameterized Algorithms for Modular-Width.J. Gajarský, M. Lampis, and S. Ordyniak. IPEC, volume 8246 of Lecture Notes in Computer Science, page 163-176. Springer, (2013)Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences.J. Gajarský, and P. Hlinený. FSTTCS, volume 18 of LIPIcs, page 112-123. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)

BibSonomy

Disambiguation of "Gajarský, Jakub"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

First order limits of sparse graphs: Plane trees and path-width.

Please choose a person to relate this publication to

Jakub Mácha

Jakub Kopycki

Jakub Novák

Jakub Limanowski

Jakub Hodek

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Gajarský, Jakub"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML First order limits of sparse graphs: Plane trees and path-width.

Please choose a person to relate this publication to

Jakub Mácha

Jakub Kopycki

Jakub Novák

Jakub Limanowski

Jakub Hodek

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

First order limits of sparse graphs: Plane trees and path-width.