Jakub Gajarský

From MaRDI portal
Person:340578

Available identifiers

zbMath Open gajarsky.jakubMaRDI QIDQ340578

List of research outcomes





PublicationDate of PublicationType
Taming graphs with no large creatures and skinny ladders2024-12-18Paper
Treelike decompositions for transductions of sparse graphs2024-12-06Paper
Stable graphs of bounded twin-width2024-12-06Paper
Model checking on interpretations of classes of bounded local cliquewidth2024-12-06Paper
Flipper games for monadically stable graph classes2024-11-14Paper
Twin-width and types2024-06-24Paper
Differential games, locality, and model checking for FO logic of graphs2024-04-10Paper
Corrigendum to: ``Twin-width and generalized coloring numbers2023-10-30Paper
Sparse Graphs of Twin-width 2 Have Bounded Tree-width2023-07-04Paper
https://portal.mardi4nfdi.de/entity/Q58743332023-02-07Paper
Flipper games for monadically stable graph classes2023-01-31Paper
Twin-width and types2022-06-16Paper
Taming graphs with no large creatures and skinny ladders2022-05-02Paper
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth2022-02-25Paper
Treelike decompositions for transductions of sparse graphs2022-01-26Paper
Twin-width and generalized coloring numbers2022-01-13Paper
Recovering sparse graphs2021-08-04Paper
First-order interpretations of bounded expansion classes2021-07-28Paper
Stable graphs of bounded twin-width2021-07-08Paper
First-order interpretations of bounded expansion classes2020-09-11Paper
A new perspective on FO model checking of dense graph classes2020-09-11Paper
Parameterized shifted combinatorial optimization2018-12-10Paper
Parameterized extension complexity of independent set and related problems2018-09-17Paper
A new perspective on FO model checking of dense graph classes2018-04-23Paper
Parameterized shifted combinatorial optimization2017-10-23Paper
Recovering sparse graphs2017-09-28Paper
First order limits of sparse graphs: plane trees and path-width2017-08-10Paper
https://portal.mardi4nfdi.de/entity/Q29574852017-01-26Paper
Kernelization using structural parameters on sparse graph classes2016-11-14Paper
Faster existential FO model checking on posets2016-01-07Paper
Parameterized Algorithms for Parity Games2015-09-16Paper
Finite integer index of pathwidth and treewidth2015-09-15Paper
Faster existential FO model checking on posets2015-09-11Paper
Kernelizing MSO properties of trees of fixed height, and some consequences2015-04-22Paper
Parameterized Algorithms for Modular-Width2013-12-10Paper
Kernelization using structural parameters on sparse graph classes2013-09-17Paper
Elementary first-order model checking for sparse graphsN/APaper

Research outcomes over time

This page was built for person: Jakub Gajarský