Szymon Toruńczyk

538 total citations
29 papers, 117 citations indexed

About

Szymon Toruńczyk is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Szymon Toruńczyk has authored 29 papers receiving a total of 117 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 12 papers in Artificial Intelligence and 7 papers in Geometry and Topology. Recurrent topics in Szymon Toruńczyk's work include Formal Methods in Verification (11 papers), Complexity and Algorithms in Graphs (10 papers) and semigroups and automata theory (9 papers). Szymon Toruńczyk is often cited by papers focused on Formal Methods in Verification (11 papers), Complexity and Algorithms in Graphs (10 papers) and semigroups and automata theory (9 papers). Szymon Toruńczyk collaborates with scholars based in Poland, Germany and Austria. Szymon Toruńczyk's co-authors include Mikołaj Bojańczyk, Michał Pilipczuk, Sebastian Siebertz, Bartek Klin, Sławomir Lasota, Paweł Parys, Stephan Kreutzer, Jaroslav Nešetřil, Pierre Simon and Stéphan Thomassé and has published in prestigious journals such as Journal of the ACM, ACM SIGPLAN Notices and Semigroup Forum.

In The Last Decade

Szymon Toruńczyk

24 papers receiving 114 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Szymon Toruńczyk Poland 7 100 42 22 18 15 29 117
Aline Parreau France 7 121 1.2× 27 0.6× 25 1.1× 44 2.4× 29 1.9× 25 151
Bartosz Walczak Poland 7 87 0.9× 15 0.4× 25 1.1× 42 2.3× 9 0.6× 27 110
Dor Minzer United States 5 70 0.7× 30 0.7× 9 0.4× 27 1.5× 23 1.5× 31 86
Édouard Bonnet France 6 62 0.6× 15 0.4× 9 0.4× 19 1.1× 15 1.0× 27 82
Neil Thapen Czechia 8 153 1.5× 116 2.8× 9 0.4× 16 0.9× 14 0.9× 38 174
Barnaby Martin United Kingdom 7 119 1.2× 36 0.9× 16 0.7× 30 1.7× 56 3.7× 39 148
Mamadou Moustapha Kanté France 7 115 1.1× 10 0.2× 23 1.0× 20 1.1× 29 1.9× 19 121
Paweł Rzążewski Poland 6 91 0.9× 12 0.3× 16 0.7× 41 2.3× 16 1.1× 49 103
Shai Gutner Israel 6 111 1.1× 10 0.2× 7 0.3× 23 1.3× 44 2.9× 10 130
O‐joung Kwon South Korea 7 120 1.2× 7 0.2× 35 1.6× 33 1.8× 30 2.0× 30 126

Countries citing papers authored by Szymon Toruńczyk

Since Specialization
Citations

This map shows the geographic impact of Szymon Toruńczyk's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Szymon Toruńczyk with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Szymon Toruńczyk more than expected).

Fields of papers citing papers by Szymon Toruńczyk

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Szymon Toruńczyk. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Szymon Toruńczyk. The network helps show where Szymon Toruńczyk may publish in the future.

Co-authorship network of co-authors of Szymon Toruńczyk

This figure shows the co-authorship network connecting the top 25 collaborators of Szymon Toruńczyk. A scholar is included among the top collaborators of Szymon Toruńczyk based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Szymon Toruńczyk. Szymon Toruńczyk is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Toruńczyk, Szymon, et al.. (2025). Merge-Width and First-Order Model Checking. 1944–1955. 1 indexed citations
2.
Pilipczuk, Michał, et al.. (2024). Elementary first-order model checking for sparse graphs. 1–14. 1 indexed citations
3.
Eleftheriadis, Ioannis, et al.. (2024). First-Order Model Checking on Monadically Stable Graph Classes. 21–30. 3 indexed citations
4.
Toruńczyk, Szymon. (2023). Flip-width: Cops and Robber on dense graphs. 663–700. 5 indexed citations
5.
Pilipczuk, Michał, et al.. (2022). Treelike Decompositions for Transductions of Sparse Graphs. 1–14. 6 indexed citations
6.
Toruńczyk, Szymon, et al.. (2022). Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. Logical Methods in Computer Science. Volume 18, Issue 1.
7.
Pilipczuk, Michał, et al.. (2022). Twin-Width and Types. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
8.
Kreutzer, Stephan, et al.. (2018). First-Order Interpretations of Bounded Expansion Classes. arXiv (Cornell University). 18 indexed citations
9.
Pilipczuk, Michał, Sebastian Siebertz, & Szymon Toruńczyk. (2018). On the number of types in sparse graphs. 799–808. 10 indexed citations
10.
Pilipczuk, Michał, Sebastian Siebertz, & Szymon Toruńczyk. (2018). Parameterized circuit complexity of model-checking on sparse structures. Zenodo (CERN European Organization for Nuclear Research). 789–798. 3 indexed citations
11.
Toruńczyk, Szymon, et al.. (2017). Entropy Bounds for Conjunctive Queries with Functional Dependencies. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 68. 17. 1 indexed citations
12.
Bojańczyk, Mikołaj, Paweł Parys, & Szymon Toruńczyk. (2016). The MSO+U Theory of (N,<) Is Undecidable. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6 indexed citations
13.
Parys, Paweł & Szymon Toruńczyk. (2016). Models of Lambda-Calculus and the Weak MSO Logic. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 12. 1 indexed citations
14.
Klin, Bartek, et al.. (2016). Homomorphism Problems for First-Order Definable Structures. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
15.
Toruńczyk, Szymon, et al.. (2016). LOIS: syntax and semantics. 586–598. 3 indexed citations
16.
Toruńczyk, Szymon, et al.. (2016). LOIS: an Application of SMT Solvers.. 51–60.
17.
Klin, Bartek, et al.. (2014). Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. 1–10. 4 indexed citations
18.
Bojańczyk, Mikołaj, Bartek Klin, Sławomir Lasota, & Szymon Toruńczyk. (2013). Turing Machines with Atoms. 17 indexed citations
19.
Bojańczyk, Mikołaj, et al.. (2012). Ramsey’s theorem for colors from a metric space. Semigroup Forum. 85(1). 182–184. 6 indexed citations
20.
Bojańczyk, Mikołaj & Szymon Toruńczyk. (2009). Deterministic Automata and Extensions of Weak MSO. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4. 73–84. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Aline Parreau Breakdown of academic impact, for papers by Bartosz Walczak Breakdown of academic impact, for papers by Dor Minzer Breakdown of academic impact, for papers by Édouard Bonnet Breakdown of academic impact, for papers by Neil Thapen Breakdown of academic impact, for papers by Barnaby Martin Breakdown of academic impact, for papers by Mamadou Moustapha Kanté Breakdown of academic impact, for papers by Paweł Rzążewski Breakdown of academic impact, for papers by Shai Gutner Breakdown of academic impact, for papers by O‐joung Kwon
Rankless by CCL
2026