Szymon Torunczyk

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 60

Top Topics

Aggregate Queries

Constraint Satisfaction Problems

Top Venues

Publications

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