default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSzymon Torunczyk
Person information
- unicode name: Szymon Toruńczyk
- affiliation: University of Warsaw, Institute of Informatics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]É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): 21 (2024)- [c42]Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk:
First-Order Model Checking on Monadically Stable Graph Classes. FOCS 2024: 21-30 - [c41]Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk:
Elementary first-order model checking for sparse graphs. LICS 2024: 36:1-36:14 - [c40]Szymon Torunczyk:
Structurally Tractable Graph Classes (Invited Talk). STACS 2024: 3:1-3:1 - [c39]Jan Dreier, Nikolas Mählmann, Szymon Torunczyk:
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes. STOC 2024: 1550-1560 - [i25]Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk:
Elementary first-order model checking for sparse graphs. CoRR abs/2401.16230 (2024) - [i24]Jan Dreier, Nikolas Mählmann, Szymon Torunczyk:
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes. CoRR abs/2403.15201 (2024) - 2023
- [c38]Szymon Torunczyk:
Flip-width: Cops and Robber on dense graphs. FOCS 2023: 663-700 - [c37]Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk:
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes. ICALP 2023: 125:1-125:18 - [c36]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: 128:1-128:16 - [c35]Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk:
Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. ICALP 2023: 135:1-135:17 - [i23]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 abs/2301.13735 (2023) - [i22]Szymon Torunczyk:
Flip-width: Cops and Robber on dense graphs. CoRR abs/2302.00352 (2023) - [i21]Pierre Ohlmann, Michal Pilipczuk, Szymon Torunczyk, Wojciech Przybyszewski:
Canonical decompositions in monadically stable and bounded shrubdepth graph classes. CoRR abs/2303.01473 (2023) - [i20]Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk:
First-Order Model Checking on Monadically Stable Graph Classes. CoRR abs/2311.18740 (2023) - 2022
- [j5]Szymon Torunczyk, Thomas Zeume:
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. Log. Methods Comput. Sci. 18(1) (2022) - [c34]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: 102:1-102:18 - [c33]Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk:
Twin-Width and Types. ICALP 2022: 123:1-123:21 - [c32]Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk:
Treelike Decompositions for Transductions of Sparse Graphs. LICS 2022: 31:1-31:14 - [c31]Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk:
Stable graphs of bounded twin-width. LICS 2022: 39:1-39:12 - [c30]É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: 54:1-54:13 - [c29]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk:
Twin-width IV: ordered graphs and matrices. STOC 2022: 924-937 - [i19]Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk:
Treelike decompositions for transductions of sparse graphs. CoRR abs/2201.11082 (2022) - [i18]É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 abs/2202.13014 (2022) - [i17]Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk:
Twin-width and types. CoRR abs/2206.08248 (2022) - [i16]Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk:
Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes. CoRR abs/2206.13765 (2022) - 2021
- [c28]Bartek Klin, Slawomir Lasota, Szymon Torunczyk:
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages. FoSSaCS 2021: 365-384 - [i15]Szymon Torunczyk, Thomas Zeume:
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. CoRR abs/2101.03866 (2021) - [i14]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk:
Twin-width IV: ordered graphs and matrices. CoRR abs/2102.03117 (2021) - [i13]Pierre Simon, Szymon Torunczyk:
Ordered graphs of bounded twin-width. CoRR abs/2102.06881 (2021) - [i12]Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk:
Stable graphs of bounded twin-width. CoRR abs/2107.03711 (2021) - [i11]Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny:
Algorithms and data structures for first-order logic with connectivity under vertex failures. CoRR abs/2111.03725 (2021) - 2020
- [j4]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): 29:1-29:41 (2020) - [c27]Grzegorz Fabianski, Michal Skrzypczak, Szymon Torunczyk:
Uniformisations of Regular Relations Over Bi-Infinite Words. LICS 2020: 384-396 - [c26]Szymon Torunczyk, Thomas Zeume:
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. LICS 2020: 873-885 - [c25]Szymon Torunczyk:
Aggregate Queries on Sparse Databases. PODS 2020: 427-443
2010 – 2019
- 2019
- [j3]Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Definable isomorphism problem. Log. Methods Comput. Sci. 15(4) (2019) - [c24]Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
Progressive Algorithms for Domination and Independence. STACS 2019: 27:1-27:16 - [i10]Szymon Torunczyk:
Aggregate Queries on Sparse Databases. CoRR abs/1912.12338 (2019) - 2018
- [c23]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: 126:1-126:14 - [c22]Mikolaj Bojanczyk, Szymon Torunczyk:
On computability and tractability for infinite sets. LICS 2018: 145-154 - [c21]Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
Parameterized circuit complexity of model-checking on sparse structures. LICS 2018: 789-798 - [c20]Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
On the number of types in sparse graphs. LICS 2018: 799-808 - [i9]Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Definable isomorphism problem. CoRR abs/1802.08500 (2018) - [i8]Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
Parameterized circuit complexity of model checking first-order logic on sparse structures. CoRR abs/1805.03488 (2018) - [i7]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-order interpretations of bounded expansion classes. CoRR abs/1810.02389 (2018) - [i6]Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
Progressive Algorithms for Domination and Independence. CoRR abs/1811.06799 (2018) - 2017
- [c19]Tomasz Gogacz, Szymon Torunczyk:
Entropy Bounds for Conjunctive Queries with Functional Dependencies. ICDT 2017: 15:1-15:17 - [c18]Eryk Kopczynski, Szymon Torunczyk:
LOIS: syntax and semantics. POPL 2017: 586-598 - [i5]Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
On Wideness and Stability. CoRR abs/1705.09336 (2017) - 2016
- [j2]Michal Pilipczuk, Szymon Torunczyk:
On Ultralimits of Sparse Graph Classes. Electron. J. Comb. 23(2): 2 (2016) - [c17]Eryk Kopczynski, Szymon Torunczyk:
LOIS: an Application of SMT Solvers. SMT@IJCAR 2016: 51-60 - [c16]Pawel Parys, Szymon Torunczyk:
Models of Lambda-Calculus and the Weak MSO Logic. CSL 2016: 11:1-11:12 - [c15]Albert Atserias, Szymon Torunczyk:
Non-Homogenizable Classes of Finite Structures. CSL 2016: 16:1-16:16 - [c14]Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Homomorphism Problems for First-Order Definable Structures. FSTTCS 2016: 14:1-14:15 - [c13]Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk:
The MSO+U Theory of (N, <) Is Undecidable. STACS 2016: 21:1-21:8 - [c12]Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk:
Cost Functions Definable by Min/Max Automata. STACS 2016: 29:1-29:13 - [i4]Albert Atserias, Szymon Torunczyk:
Non-Homogenizable Classes of Finite Structures. CoRR abs/1605.01199 (2016) - 2015
- [c11]Bartek Klin, Eryk Kopczynski, Joanna Ochremiak, Szymon Torunczyk:
Locally Finite Constraint Satisfaction Problems. LICS 2015: 475-486 - [i3]Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk:
The MSO+U theory of (N, <) is undecidable. CoRR abs/1502.04578 (2015) - [i2]Michal Pilipczuk, Szymon Torunczyk:
On ultralimits of sparse graph classes. CoRR abs/1508.07256 (2015) - [i1]Tomasz Gogacz, Szymon Torunczyk:
Entropy bounds for conjunctive queries with functional dependencies. CoRR abs/1512.01808 (2015) - 2014
- [c10]Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. CSL-LICS 2014: 58:1-58:10 - 2013
- [j1]Szymon Torunczyk:
Report on Highlights 2013. Bull. EATCS 111 (2013) - [c9]Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk:
Turing Machines with Atoms. LICS 2013: 183-192 - [c8]Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk:
Verification of database-driven systems via amalgamation. PODS 2013: 63-74 - 2012
- [c7]Mikolaj Bojanczyk, Szymon Torunczyk:
Imperative Programming in Sets with Atoms. FSTTCS 2012: 4-15 - [c6]Szymon Torunczyk:
Languages of Profinite Words and the Limitedness Problem. ICALP (2) 2012: 377-389 - [c5]Mikolaj Bojanczyk, Szymon Torunczyk:
Weak MSO+U over infinite trees. STACS 2012: 648-660 - 2011
- [c4]Luc Segoufin, Szymon Torunczyk:
Automata based verification over linearly ordered data domains. STACS 2011: 81-92 - 2010
- [c3]Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk:
Energy and Mean-Payoff Games with Imperfect Information. CSL 2010: 260-274 - [c2]Szczepan Hummel, Michal Skrzypczak, Szymon Torunczyk:
On the Topological Complexity of MSO+U and Related Automata Models. MFCS 2010: 429-440
2000 – 2009
- 2009
- [c1]Mikolaj Bojanczyk, Szymon Torunczyk:
Deterministic Automata and Extensions of Weak MSO. FSTTCS 2009: 73-84
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
