Szymon Toruńczyk

From MaRDI portal
Person:286117

Available identifiers

zbMath Open torunczyk.szymonMaRDI QIDQ286117

List of research outcomes





PublicationDate of PublicationType
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
Indiscernibles and flatness in monadically stable and monadically NIP classes2024-11-14Paper
Flipper games for monadically stable graph classes2024-11-14Paper
Canonical decompositions in monadically stable and bounded shrubdepth graph classes2024-11-14Paper
Algorithms and data structures for first-order logic with connectivity under vertex failures2024-06-24Paper
Twin-width and types2024-06-24Paper
Twin-width IV: ordered graphs and matrices2023-12-08Paper
First-Order Model Checking on Monadically Stable Graph Classes2023-11-30Paper
Flipper games for monadically stable graph classes2023-01-31Paper
https://portal.mardi4nfdi.de/entity/Q50941272022-08-02Paper
https://portal.mardi4nfdi.de/entity/Q50904762022-07-18Paper
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes2022-06-28Paper
Twin-width and types2022-06-16Paper
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth2022-02-25Paper
Treelike decompositions for transductions of sparse graphs2022-01-26Paper
Algorithms and data structures for first-order logic with connectivity under vertex failures2021-11-05Paper
Nondeterministic and co-nondeterministic implies deterministic, for data languages2021-10-18Paper
First-order interpretations of bounded expansion classes2021-07-28Paper
Stable graphs of bounded twin-width2021-07-08Paper
Ordered graphs of bounded twin-width2021-02-13Paper
Uniformisations of regular relations over bi-infinite words2021-01-21Paper
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic2021-01-21Paper
On computability and tractability for infinite sets2021-01-20Paper
On the number of types in sparse graphs2021-01-20Paper
Parameterized circuit complexity of model-checking on sparse structures2021-01-20Paper
First-order interpretations of bounded expansion classes2020-09-11Paper
https://portal.mardi4nfdi.de/entity/Q52070512020-01-03Paper
Progressive Algorithms for Domination and Independence2018-11-16Paper
Entropy bounds for conjunctive queries with functional dependencies2018-07-18Paper
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity2018-04-23Paper
Locally finite constraint satisfaction problems2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46365612018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46018732018-01-24Paper
Cost functions definable by min/max automata2018-01-24Paper
LOIS: syntax and semantics2017-10-20Paper
Models of \(\lambda\)-calculus and the weak MSO logic2017-07-19Paper
Non-homogenizable classes of finite structures2017-07-19Paper
Turing machines with atoms2017-07-03Paper
Imperative programming in sets with atoms2017-01-26Paper
On ultralimits of sparse graph classes2016-05-20Paper
Ramsey's theorem for colors from a metric space2012-11-08Paper
Languages of profinite words and the limitedness problem2012-11-01Paper
Deterministic automata and extensions of weak MSO2012-10-24Paper
Weak \(\text{MSO}+U\) over infinite trees2012-08-23Paper
Automata based verification over linearly ordered data domains2012-01-23Paper
Energy and mean-payoff games with imperfect information2010-09-03Paper
On the topological complexity of MSO+U and related automata models2010-09-03Paper
Flip-width: Cops and Robber on dense graphsN/APaper
Elementary first-order model checking for sparse graphsN/APaper
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph ClassesN/APaper

Research outcomes over time

This page was built for person: Szymon Toruńczyk