Deterministic Automata and Extensions of Weak MSO. - Mikolaj Bojanczyk; Szymon Torunczyk (FSTTCS, 2009)

Energy and Mean-Payoff Games with Imperfect Information. - Aldric Degorre; Laurent Doyen 001; Raffaella Gentilini; Jean-François Raskin; Szymon Torunczyk (CSL, 2010)

On the Topological Complexity of MSO+U and Related Automata Models. - Szczepan Hummel; Michal Skrzypczak; Szymon Torunczyk (MFCS, 2010)

Automata based verification over linearly ordered data domains. - Luc Segoufin; Szymon Torunczyk (STACS, 2011)

Imperative Programming in Sets with Atoms. - Mikolaj Bojanczyk; Szymon Torunczyk (FSTTCS, 2012)

Languages of Profinite Words and the Limitedness Problem. - Szymon Torunczyk (ICALP (2), 2012)

Weak MSO+U over infinite trees. - Mikolaj Bojanczyk; Szymon Torunczyk (STACS, 2012)

Turing Machines with Atoms. - Mikolaj Bojanczyk; Bartek Klin; Slawomir Lasota 001; Szymon Torunczyk (LICS, 2013)

Verification of database-driven systems via amalgamation. - Mikolaj Bojanczyk; Luc Segoufin; Szymon Torunczyk (PODS, 2013)

Report on Highlights 2013. - Szymon Torunczyk (Bull. EATCS, 2013)

Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. - Bartek Klin; Slawomir Lasota 001; Joanna Ochremiak; Szymon Torunczyk (CSL-LICS, 2014)

Locally Finite Constraint Satisfaction Problems. - Bartek Klin; Eryk Kopczynski; Joanna Ochremiak; Szymon Torunczyk (LICS, 2015)

LOIS: an Application of SMT Solvers. - Eryk Kopczynski; Szymon Torunczyk (SMT@IJCAR, 2016)

Non-Homogenizable Classes of Finite Structures. - Albert Atserias; Szymon Torunczyk (CSL, 2016)

Models of Lambda-Calculus and the Weak MSO Logic. - Pawel Parys; Szymon Torunczyk (CSL, 2016)

Homomorphism Problems for First-Order Definable Structures. - Bartek Klin; Slawomir Lasota 001; Joanna Ochremiak; Szymon Torunczyk (FSTTCS, 2016)

The MSO+U Theory of (N, <) Is Undecidable. - Mikolaj Bojanczyk; Pawel Parys; Szymon Torunczyk (STACS, 2016)

Cost Functions Definable by Min/Max Automata. - Thomas Colcombet; Denis Kuperberg; Amaldev Manuel; Szymon Torunczyk (STACS, 2016)

On Ultralimits of Sparse Graph Classes. - Michal Pilipczuk; Szymon Torunczyk (Electron. J. Comb., 2016)

Entropy Bounds for Conjunctive Queries with Functional Dependencies. - Tomasz Gogacz; Szymon Torunczyk (ICDT, 2017)

LOIS: syntax and semantics. - Eryk Kopczynski; Szymon Torunczyk (POPL, 2017)

On Wideness and Stability. - Michal Pilipczuk; Sebastian Siebertz; Szymon Torunczyk (CoRR, 2017)

On computability and tractability for infinite sets. - Mikolaj Bojanczyk; Szymon Torunczyk (LICS, 2018)

Parameterized circuit complexity of model-checking on sparse structures. - Michal Pilipczuk; Sebastian Siebertz; Szymon Torunczyk (LICS, 2018)

On the number of types in sparse graphs. - Michal Pilipczuk; Sebastian Siebertz; Szymon Torunczyk (LICS, 2018)

Parameterized circuit complexity of model checking first-order logic on sparse structures. - Michal Pilipczuk; Sebastian Siebertz; Szymon Torunczyk (CoRR, 2018)

Progressive Algorithms for Domination and Independence. - Grzegorz Fabianski; Michal Pilipczuk; Sebastian Siebertz; Szymon Torunczyk (STACS, 2019)

Definable isomorphism problem. - Khadijeh Keshvardoost; Bartek Klin; Slawomir Lasota 001; Joanna Ochremiak; Szymon Torunczyk (Log. Methods Comput. Sci., 2019)

Uniformisations of Regular Relations Over Bi-Infinite Words. - Grzegorz Fabianski; Michal Skrzypczak; Szymon Torunczyk (LICS, 2020)

Aggregate Queries on Sparse Databases. - Szymon Torunczyk (PODS, 2020)

First-Order Interpretations of Bounded Expansion Classes. - Jakub Gajarský; Stephan Kreutzer; Jaroslav Nesetril; Patrice Ossona de Mendez; Michal Pilipczuk; Sebastian Siebertz; Szymon Torunczyk (ACM Trans. Comput. Log., 2020)

Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages. - Bartek Klin; Slawomir Lasota 001; Szymon Torunczyk (FoSSaCS, 2021)

Ordered graphs of bounded twin-width. - Pierre Simon; Szymon Torunczyk (CoRR, 2021)

Twin-Width and Types. - Jakub Gajarský; Michal Pilipczuk; Wojciech Przybyszewski; Szymon Torunczyk (ICALP, 2022)

Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures. - Michal Pilipczuk; Nicole Schirrmacher; Sebastian Siebertz; Szymon Torunczyk; Alexandre Vigny (ICALP, 2022)

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. - Édouard Bonnet; Jan Dreier; Jakub Gajarský; Stephan Kreutzer; Nikolas Mählmann; Pierre Simon; Szymon Torunczyk (LICS, 2022)

Treelike Decompositions for Transductions of Sparse Graphs. - Jan Dreier; Jakub Gajarský; Sandra Kiefer; Michal Pilipczuk; Szymon Torunczyk (LICS, 2022)

Stable graphs of bounded twin-width. - Jakub Gajarský; Michal Pilipczuk; Szymon Torunczyk (LICS, 2022)

Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes. - Jan Dreier; Nikolas Mählmann; Sebastian Siebertz; Szymon Torunczyk (CoRR, 2022)

Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. - Szymon Torunczyk; Thomas Zeume (Log. Methods Comput. Sci., 2022)

Flip-width: Cops and Robber on dense graphs. - Szymon Torunczyk (FOCS, 2023)

Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes. - Jan Dreier; Nikolas Mählmann; Sebastian Siebertz; Szymon Torunczyk (ICALP, 2023)

Flipper Games for Monadically Stable Graph Classes. - Jakub Gajarský; Nikolas Mählmann; Rose McCarty; Pierre Ohlmann; Michal Pilipczuk; Wojciech Przybyszewski; Sebastian Siebertz; Marek Sokolowski 001; Szymon Torunczyk (ICALP, 2023)

Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. - Pierre Ohlmann; Michal Pilipczuk; Wojciech Przybyszewski; Szymon Torunczyk (ICALP, 2023)

First-Order Model Checking on Monadically Stable Graph Classes. - Jan Dreier; Ioannis Eleftheriadis; Nikolas Mählmann; Rose McCarty; Michal Pilipczuk; Szymon Torunczyk (FOCS, 2024)

Elementary first-order model checking for sparse graphs. - Jakub Gajarský; Michal Pilipczuk; Marek Sokolowski 001; Giannos Stamoulis; Szymon Torunczyk (LICS, 2024)

Structurally Tractable Graph Classes (Invited Talk). - Szymon Torunczyk (STACS, 2024)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes. - Jan Dreier; Nikolas Mählmann; Szymon Torunczyk (STOC, 2024)

Twin-Width IV: Ordered Graphs and Matrices. - Édouard Bonnet; Ugo Giocanti; Patrice Ossona de Mendez; Pierre Simon; Stéphan Thomassé; Szymon Torunczyk (J. ACM, 2024)

Separability Properties of Monadically Dependent Graph Classes. - Édouard Bonnet; Samuel Braunfeld; Ioannis Eleftheriadis; Colin Geniet; Nikolas Mählmann; Michal Pilipczuk; Wojciech Przybyszewski; Szymon Torunczyk (ICALP, 2025)

Evaluating First-Order Formulas in Structured Graphs (Invited Talk). - Szymon Torunczyk (ICDT, 2025)

Merge-Width and First-Order Model Checking. - Jan Dreier; Szymon Torunczyk (STOC, 2025)

First-order transducibility among classes of sparse graphs. - Jakub Gajarský; Jeremi Gladkowski; Jan Jedelský; Michal Pilipczuk; Szymon Torunczyk (CoRR, 2025)

Flipping and Forking. - Wojciech Przybyszewski; Szymon Torunczyk (CoRR, 2025)