Szymon Torunczyk

83 papers A* 27A 8B 5Journal 37Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Flips and Merge-Width in Sparse Graphs.
CoRR
Karolina Drabik, Maël Dumas, Nikolas Mählmann, Wojciech Przybyszewski, Szymon Torunczyk
2026 J jnl
Variants of Merge-Width and Applications.
CoRR
Karolina Drabik, Maël Dumas, Colin Geniet, Jakub Nowakowski, Michal Pilipczuk, Szymon Torunczyk
2025 A conf
Evaluating First-Order Formulas in Structured Graphs (Invited Talk).
ICDT
Szymon Torunczyk
2025 J jnl
First-order transducibility among classes of sparse graphs.
CoRR
Jakub Gajarský, Jeremi Gladkowski, Jan Jedelský, Michal Pilipczuk, Szymon Torunczyk
2025 A* conf
Flipping and Forking.
LICS
Wojciech Przybyszewski, Szymon Torunczyk
2025 J jnl
Flipping and Forking.
CoRR
Wojciech Przybyszewski, Szymon Torunczyk
2025 A* conf
Merge-Width and First-Order Model Checking.
STOC
Jan Dreier, Szymon Torunczyk
2025 J jnl
Merge-width and First-Order Model Checking.
CoRR
Jan Dreier, Szymon Torunczyk
2025 A* conf
Separability Properties of Monadically Dependent Graph Classes.
ICALP
Édouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mählmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2025 J jnl
Separability Properties of Monadically Dependent Graph Classes.
CoRR
Édouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mählmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2024 A* conf
Elementary first-order model checking for sparse graphs.
LICS
Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk
2024 J jnl
Elementary first-order model checking for sparse graphs.
CoRR
Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk
2024 A* conf
First-Order Model Checking on Monadically Stable Graph Classes.
FOCS
Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk
2024 A* conf
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes.
STOC
Jan Dreier, Nikolas Mählmann, Szymon Torunczyk
2024 J jnl
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes.
CoRR
Jan Dreier, Nikolas Mählmann, Szymon Torunczyk
2024 A conf
Structurally Tractable Graph Classes (Invited Talk).
STACS
Szymon Torunczyk
2024 J jnl
Twin-Width IV: Ordered Graphs and Matrices.
J. ACM
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk
2023 A* conf
Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes.
ICALP
Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2023 J jnl
Canonical decompositions in monadically stable and bounded shrubdepth graph classes.
CoRR
Pierre Ohlmann, Michal Pilipczuk, Szymon Torunczyk, Wojciech Przybyszewski
2023 J jnl
First-Order Model Checking on Monadically Stable Graph Classes.
CoRR
Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk
2023 A* conf
Flip-width: Cops and Robber on dense graphs.
FOCS
Szymon Torunczyk
2023 J jnl
Flip-width: Cops and Robber on dense graphs.
CoRR
Szymon Torunczyk
2023 A* conf
Flipper Games for Monadically Stable Graph Classes.
ICALP
Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk
2023 J jnl
Flipper games for monadically stable graph classes.
CoRR
Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk
2023 A* conf
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes.
ICALP
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk
2022 A* conf
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures.
ICALP
Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny
2022 J jnl
Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes.
CoRR
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk
2022 A* conf
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.
LICS
Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk
2022 J jnl
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.
CoRR
Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk
2022 J jnl
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic.
Log. Methods Comput. Sci.
Szymon Torunczyk, Thomas Zeume
2022 A* conf
Stable graphs of bounded twin-width.
LICS
Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk
2022 A* conf
Treelike Decompositions for Transductions of Sparse Graphs.
LICS
Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk
2022 J jnl
Treelike decompositions for transductions of sparse graphs.
CoRR
Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk
2022 A* conf
Twin-Width and Types.
ICALP
Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2022 A* conf
Twin-width IV: ordered graphs and matrices.
STOC
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk
2022 J jnl
Twin-width and types.
CoRR
Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2021 J jnl
Algorithms and data structures for first-order logic with connectivity under vertex failures.
CoRR
Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny
2021 B conf
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages.
FoSSaCS
Bartek Klin, Slawomir Lasota, Szymon Torunczyk
2021 J jnl
Ordered graphs of bounded twin-width.
CoRR
Pierre Simon, Szymon Torunczyk
2021 J jnl
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic.
CoRR
Szymon Torunczyk, Thomas Zeume
2021 J jnl
Stable graphs of bounded twin-width.
CoRR
Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk
2021 J jnl
Twin-width IV: ordered graphs and matrices.
CoRR
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk
2020 A* conf
Aggregate Queries on Sparse Databases.
PODS
Szymon Torunczyk
2020 J jnl
First-Order Interpretations of Bounded Expansion Classes.
ACM Trans. Comput. Log.
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2020 A* conf
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic.
LICS
Szymon Torunczyk, Thomas Zeume
2020 A* conf
Uniformisations of Regular Relations Over Bi-Infinite Words.
LICS
Grzegorz Fabianski, Michal Skrzypczak, Szymon Torunczyk
2019 J jnl
Aggregate Queries on Sparse Databases.
CoRR
Szymon Torunczyk
2019 J jnl
Definable isomorphism problem.
Log. Methods Comput. Sci.
Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
2019 A conf
Progressive Algorithms for Domination and Independence.
STACS
Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018 J jnl
Definable isomorphism problem.
CoRR
Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
2018 A* conf
First-Order Interpretations of Bounded Expansion Classes.
ICALP
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018 J jnl
First-order interpretations of bounded expansion classes.
CoRR
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018 A* conf
On computability and tractability for infinite sets.
LICS
Mikolaj Bojanczyk, Szymon Torunczyk
2018 A* conf
On the number of types in sparse graphs.
LICS
Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018 J jnl
Parameterized circuit complexity of model checking first-order logic on sparse structures.
CoRR
Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018 A* conf
Parameterized circuit complexity of model-checking on sparse structures.
LICS
Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018 J jnl
Progressive Algorithms for Domination and Independence.
CoRR
Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2017 A conf
Entropy Bounds for Conjunctive Queries with Functional Dependencies.
ICDT
Tomasz Gogacz, Szymon Torunczyk
2017 A* conf
LOIS: syntax and semantics.
POPL
Eryk Kopczynski, Szymon Torunczyk
2017 J jnl
On Wideness and Stability.
CoRR
Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2016 A conf
Cost Functions Definable by Min/Max Automata.
STACS
Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk
2016 — conf
Homomorphism Problems for First-Order Definable Structures.
FSTTCS
Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
2016 — conf
LOIS: an Application of SMT Solvers.
SMT@IJCAR
Eryk Kopczynski, Szymon Torunczyk
2016 B conf
Models of Lambda-Calculus and the Weak MSO Logic.
CSL
Pawel Parys, Szymon Torunczyk
2016 B conf
Non-Homogenizable Classes of Finite Structures.
CSL
Albert Atserias, Szymon Torunczyk
2016 J jnl
Non-Homogenizable Classes of Finite Structures.
CoRR
Albert Atserias, Szymon Torunczyk
2016 J jnl
On Ultralimits of Sparse Graph Classes.
Electron. J. Comb.
Michal Pilipczuk, Szymon Torunczyk
2016 A conf
The MSO+U Theory of (N, <) Is Undecidable.
STACS
Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk
2015 J jnl
Entropy bounds for conjunctive queries with functional dependencies.
CoRR
Tomasz Gogacz, Szymon Torunczyk
2015 A* conf
Locally Finite Constraint Satisfaction Problems.
LICS
Bartek Klin, Eryk Kopczynski, Joanna Ochremiak, Szymon Torunczyk
2015 J jnl
On ultralimits of sparse graph classes.
CoRR
Michal Pilipczuk, Szymon Torunczyk
2015 J jnl
The MSO+U theory of (N, <) is undecidable.
CoRR
Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk
2014 — conf
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity.
CSL-LICS
Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
2013 J jnl
Report on Highlights 2013.
Bull. EATCS
Szymon Torunczyk
2013 A* conf
Turing Machines with Atoms.
LICS
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk
2013 A* conf
Verification of database-driven systems via amalgamation.
PODS
Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk
2012 — conf
Imperative Programming in Sets with Atoms.
FSTTCS
Mikolaj Bojanczyk, Szymon Torunczyk
2012 — conf
Languages of Profinite Words and the Limitedness Problem.
ICALP (2)
Szymon Torunczyk
2012 A conf
Weak MSO+U over infinite trees.
STACS
Mikolaj Bojanczyk, Szymon Torunczyk
2011 A conf
Automata based verification over linearly ordered data domains.
STACS
Luc Segoufin, Szymon Torunczyk
2010 B conf
Energy and Mean-Payoff Games with Imperfect Information.
CSL
Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk
2010 B conf
On the Topological Complexity of MSO+U and Related Automata Models.
MFCS
Szczepan Hummel, Michal Skrzypczak, Szymon Torunczyk
2009 — conf
Deterministic Automata and Extensions of Weak MSO.
FSTTCS
Mikolaj Bojanczyk, Szymon Torunczyk