Igor Walukiewicz

3.6k total citations
46 papers, 804 citations indexed

About

Igor Walukiewicz is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, Igor Walukiewicz has authored 46 papers receiving a total of 804 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computational Theory and Mathematics, 33 papers in Artificial Intelligence and 6 papers in Software. Recurrent topics in Igor Walukiewicz's work include Formal Methods in Verification (34 papers), Logic, programming, and type systems (30 papers) and semigroups and automata theory (17 papers). Igor Walukiewicz is often cited by papers focused on Formal Methods in Verification (34 papers), Logic, programming, and type systems (30 papers) and semigroups and automata theory (17 papers). Igor Walukiewicz collaborates with scholars based in France, Poland and Denmark. Igor Walukiewicz's co-authors include André Arnold, Damian Niwiński, Erich Grädel, David Janin, Marcin Jurdziński, Stefan Dziembowski, Bruno Courcelle, Sławomir Lasota, P. S. Thiagarajan and Mikołaj Bojańczyk and has published in prestigious journals such as Theoretical Computer Science, Lecture notes in computer science and Information and Computation.

In The Last Decade

Igor Walukiewicz

46 papers receiving 736 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Igor Walukiewicz France 15 699 602 109 64 31 46 804
James Worrell United Kingdom 15 596 0.9× 521 0.9× 131 1.2× 49 0.8× 37 1.2× 92 735
Anna Ingólfsdóttir Iceland 15 625 0.9× 625 1.0× 145 1.3× 107 1.7× 73 2.4× 120 842
Antonı́n Kučera Czechia 15 590 0.8× 471 0.8× 183 1.7× 93 1.5× 33 1.1× 77 736
Patricia Bouyer France 17 621 0.9× 345 0.6× 258 2.4× 74 1.2× 88 2.8× 75 779
Mark E. Stickel United States 18 422 0.6× 825 1.4× 61 0.6× 173 2.7× 38 1.2× 37 932
Ferenc Gécseg Hungary 6 411 0.6× 372 0.6× 33 0.3× 38 0.6× 17 0.5× 26 532
Rob J. van Glabbeek Australia 13 749 1.1× 602 1.0× 136 1.2× 172 2.7× 81 2.6× 33 946
Nicolas Markey France 14 338 0.5× 254 0.4× 119 1.1× 38 0.6× 55 1.8× 54 454
Pierre Castéran France 2 329 0.5× 432 0.7× 82 0.8× 96 1.5× 69 2.2× 2 551
Josée Desharnais Canada 14 492 0.7× 465 0.8× 145 1.3× 141 2.2× 33 1.1× 38 757

Countries citing papers authored by Igor Walukiewicz

Since Specialization
Citations

This map shows the geographic impact of Igor Walukiewicz'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 Igor Walukiewicz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Igor Walukiewicz more than expected).

Fields of papers citing papers by Igor Walukiewicz

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Igor Walukiewicz. 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 Igor Walukiewicz. The network helps show where Igor Walukiewicz may publish in the future.

Co-authorship network of co-authors of Igor Walukiewicz

This figure shows the co-authorship network connecting the top 25 collaborators of Igor Walukiewicz. A scholar is included among the top collaborators of Igor Walukiewicz 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 Igor Walukiewicz. Igor Walukiewicz 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.
Kosowski, Adrian & Igor Walukiewicz. (2015). Fundamentals of Computation Theory. Lecture notes in computer science. 1 indexed citations
2.
Salvati, Sylvain & Igor Walukiewicz. (2014). Krivine machines and higher-order schemes. Information and Computation. 239. 340–355. 5 indexed citations
3.
Bojańczyk, Mikołaj, Igor Walukiewicz, & Howard Straubing. (2012). Wreath Products of Forest Algebras, with Applications to Tree Logics. Logical Methods in Computer Science. Volume 8, Issue 3. 2 indexed citations
4.
Murawski, Andrzej S. & Igor Walukiewicz. (2007). Third-order Idealized Algol with iteration is decidable. Theoretical Computer Science. 390(2-3). 214–229. 9 indexed citations
5.
Parys, Paweł & Igor Walukiewicz. (2006). WEAK ALTERNATING TIMED AUTOMATA. 1 indexed citations
6.
Bojańczyk, Mikołaj & Igor Walukiewicz. (2006). Characterizing EF and EX tree logics. Theoretical Computer Science. 358(2-3). 255–272. 16 indexed citations
7.
Niwiński, Damian & Igor Walukiewicz. (2003). A gap property of deterministic tree languages. Theoretical Computer Science. 303(1). 215–231. 22 indexed citations
8.
Arnold, André, et al.. (2003). Games for synthesis of controllers with partial observation. Theoretical Computer Science. 303(1). 7–34. 109 indexed citations
9.
Grädel, Erich & Igor Walukiewicz. (2003). Guarded fixed point logic. 45–54. 44 indexed citations
10.
Thiagarajan, P. S. & Igor Walukiewicz. (2002). An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. Information and Computation. 179(2). 230–249. 20 indexed citations
11.
Walukiewicz, Igor. (2002). Monadic second-order logic on tree-like structures. Theoretical Computer Science. 275(1-2). 311–346. 41 indexed citations
12.
Szepietowski, Andrzej, et al.. (2002). Complexity of weak acceptance conditions in tree automata. Information Processing Letters. 84(4). 181–187. 5 indexed citations
13.
Walukiewicz, Igor. (2002). Deciding low levels of tree-automata hierarchy. Electronic Notes in Theoretical Computer Science. 67. 61–75. 4 indexed citations
14.
Walukiewicz, Igor. (2002). Completeness of Kozen's axiomatisation of the propositional μ-calculus. 19 indexed citations
15.
Dziembowski, Stefan, Marcin Jurdziński, & Igor Walukiewicz. (2002). How much memory is needed to win infinite games?. 99–110. 48 indexed citations
16.
Walukiewicz, Igor. (2001). Pushdown Processes: Games and Model-Checking. Information and Computation. 164(2). 234–263. 81 indexed citations
17.
Walukiewicz, Igor. (2000). Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus. Information and Computation. 157(1-2). 142–182. 68 indexed citations
18.
Courcelle, Bruno & Igor Walukiewicz. (1998). Monadic second-order logic, graph coverings and unfoldings of transition systems. Annals of Pure and Applied Logic. 92(1). 35–62. 20 indexed citations
19.
Niwiński, Damian & Igor Walukiewicz. (1996). Games for the μ-calculus. Theoretical Computer Science. 163(1-2). 99–116. 26 indexed citations
20.
Courcelle, Bruno & Igor Walukiewicz. (1995). Monadic Second-Order Logic, Graphs and Unfoldings of Transition Systems. BRICS Report Series. 2(44). 12 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

Rankless by CCL
2026