Szymon Torunczyk
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
43
Venues
12
Active years
2010–2025
Best venue rank
A*
Where they publish
Papers
43 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | ICALP | Separability Properties of Monadically Dependent Graph Classes. | douard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mhlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2025 | ICDT | Evaluating First-Order Formulas in Structured Graphs (Invited Talk). | Szymon Torunczyk |
| 2025 | LICS | Flipping and Forking. | Wojciech Przybyszewski, Szymon Torunczyk |
| 2025 | STOC | Merge-Width and First-Order Model Checking. | Jan Dreier, Szymon Torunczyk |
| 2024 | FOCS | First-Order Model Checking on Monadically Stable Graph Classes. | Jan Dreier, Ioannis Eleftheriadis, Nikolas Mhlmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk |
| 2024 | LICS | Elementary first-order model checking for sparse graphs. | Jakub Gajarsk, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk |
| 2024 | STOC | Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes. | Jan Dreier, Nikolas Mhlmann, Szymon Torunczyk |
| 2024 | STACS | Structurally Tractable Graph Classes (Invited Talk). | Szymon Torunczyk |
| 2023 | FOCS | Flip-width: Cops and Robber on dense graphs. | Szymon Torunczyk |
| 2023 | ICALP | Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes. | Jan Dreier, Nikolas Mhlmann, Sebastian Siebertz, Szymon Torunczyk |
| 2023 | ICALP | Flipper Games for Monadically Stable Graph Classes. | Jakub Gajarsk, Nikolas Mhlmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk |
| 2023 | ICALP | Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. | Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2022 | ICALP | Twin-Width and Types. | Jakub Gajarsk, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2022 | ICALP | Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures. | Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny |
| 2022 | LICS | Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. | douard Bonnet, Jan Dreier, Jakub Gajarsk, Stephan Kreutzer, Nikolas Mhlmann, Pierre Simon, Szymon Torunczyk |
| 2022 | LICS | Treelike Decompositions for Transductions of Sparse Graphs. | Jan Dreier, Jakub Gajarsk, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk |
| 2022 | LICS | Stable graphs of bounded twin-width. | Jakub Gajarsk, Michal Pilipczuk, Szymon Torunczyk |
| 2022 | STOC | Twin-width IV: ordered graphs and matrices. | douard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stphan Thomass, Szymon Torunczyk |
| 2021 | FOSSACS | Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages. | Bartek Klin, Slawomir Lasota, Szymon Torunczyk |
| 2020 | LICS | Uniformisations of Regular Relations Over Bi-Infinite Words. | Grzegorz Fabianski, Michal Skrzypczak, Szymon Torunczyk |
| 2020 | LICS | Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. | Szymon Torunczyk, Thomas Zeume |
| 2020 | PODS | Aggregate Queries on Sparse Databases. | Szymon Torunczyk |
| 2019 | STACS | Progressive Algorithms for Domination and Independence. | Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2018 | ICALP | First-Order Interpretations of Bounded Expansion Classes. | Jakub Gajarsk, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2018 | LICS | On computability and tractability for infinite sets. | Mikolaj Bojanczyk, Szymon Torunczyk |
| 2018 | LICS | Parameterized circuit complexity of model-checking on sparse structures. | Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2018 | LICS | On the number of types in sparse graphs. | Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2017 | ICDT | Entropy Bounds for Conjunctive Queries with Functional Dependencies. | Tomasz Gogacz, Szymon Torunczyk |
| 2017 | POPL | LOIS: syntax and semantics. | Eryk Kopczynski, Szymon Torunczyk |
| 2016 | CADE | LOIS: an Application of SMT Solvers. | Eryk Kopczynski, Szymon Torunczyk |
| 2016 | CSL | Non-Homogenizable Classes of Finite Structures. | Albert Atserias, Szymon Torunczyk |
| 2016 | CSL | Models of Lambda-Calculus and the Weak MSO Logic. | Pawel Parys, Szymon Torunczyk |
| 2016 | STACS | The MSO+U Theory of (N, <) Is Undecidable. | Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk |
| 2016 | STACS | Cost Functions Definable by Min/Max Automata. | Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk |
| 2015 | LICS | Locally Finite Constraint Satisfaction Problems. | Bartek Klin, Eryk Kopczynski, Joanna Ochremiak, Szymon Torunczyk |
| 2014 | CSL | Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. | Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk |
| 2013 | LICS | Turing Machines with Atoms. | Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk |
| 2013 | PODS | Verification of database-driven systems via amalgamation. | Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk |
| 2012 | ICALP | Languages of Profinite Words and the Limitedness Problem. | Szymon Torunczyk |
| 2012 | STACS | Weak MSO+U over infinite trees. | Mikolaj Bojanczyk, Szymon Torunczyk |
| 2011 | STACS | Automata based verification over linearly ordered data domains. | Luc Segoufin, Szymon Torunczyk |
| 2010 | CSL | Energy and Mean-Payoff Games with Imperfect Information. | Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-Franois Raskin, Szymon Torunczyk |
| 2010 | MFCS | On the Topological Complexity of MSO+U and Related Automata Models. | Szczepan Hummel, Michal Skrzypczak, Szymon Torunczyk |