Igor Walukiewicz
Impact in
- Computational Theory and Mathematics top 0.5%
- Formal Methods in Verification
- semigroups and automata theory
- Petri Nets in System Modeling
- Advanced Algebra and Logic
- Computability, Logic, AI Algorithms
- Software top 5%
- Software Testing and Debugging Techniques
Papers in ⓘ
-
- Formal Methods in Verification 34
- semigroups and automata theory 17
- Computability, Logic, AI Algorithms 5
- Petri Nets in System Modeling 3
-
- Logic, programming, and type systems 30
- Logic, Reasoning, and Knowledge 13
- Co-authors
- André Arnold (1 shared paper)Damian Niwiński (4 shared papers)Erich Grädel (1 shared paper)David Janin (2 shared papers)Marcin Jurdziński (1 shared paper)Bruno Courcelle (2 shared papers)Stefan Dziembowski (1 shared paper)P. S. Thiagarajan (2 shared papers)
In The Last Decade
Igor Walukiewicz
46 papers receiving 736 citations
Peers
Comparison fields: 5 of 38
- Computational Theory and Mathematics 699
- Software 109
- Artificial Intelligence 602
- Hardware and Architecture 31
- Computer Networks and Communications 64
Countries citing papers authored by Igor Walukiewicz
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
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-authors
The 25 scholars most cited alongside Igor Walukiewicz, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 46 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2003 | 109 | |
| 2 | 2001 | 81 | |
| 3 | 2000 | 68 | |
| 4 | 2002 | 48 | |
| 5 | 1996 | 47 | |
| 6 | 2003 | 44 | |
| 7 | 2002 | 41 | |
| 8 | 2002 | 35 | |
| 9 | 2008 | 27 | |
| 10 | 1996 | 26 | |
| 11 | 2003 | 22 | |
| 12 | 2002 | 20 | |
| 13 | 1998 | 20 | |
| 14 | 2002 | 19 | |
| 15 | 2006 | 16 | |
| 16 | 2008 | 14 | |
| 17 | 1995 | 12 | |
| 18 | POSITIONAL DETERMINACY OF GAMES WITH INFINITELY MANY PRIORITIES ∗ | 2004 | 11 |
| 19 | 1995 | 11 | |
| 20 | 2005 | 11 |
About Igor Walukiewicz
Igor Walukiewicz is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Software, Computer Networks and Communications and Discrete Mathematics and Combinatorics, having authored 46 papers that have together received 804 indexed citations. Recurring topics across this work include Formal Methods in Verification (34 papers), Logic, programming, and type systems (30 papers), semigroups and automata theory (17 papers), Logic, Reasoning, and Knowledge (13 papers), Computability, Logic, AI Algorithms (5 papers), Model-Driven Software Engineering Techniques (4 papers), Software Testing and Debugging Techniques (3 papers) and Petri Nets in System Modeling (3 papers). The work is most often cited by research in Computational Theory and Mathematics (699 citations), Software (109 citations), Artificial Intelligence (602 citations), Hardware and Architecture (31 citations) and Computer Networks and Communications (64 citations). Igor Walukiewicz has collaborated with scholars based in France, Poland and Denmark. Frequent co-authors include André Arnold, Damian Niwiński, Erich Grädel, David Janin, Marcin Jurdziński, Bruno Courcelle, Stefan Dziembowski, P. S. Thiagarajan, Sławomir Lasota and Mikołaj Bojańczyk. Their work appears in journals such as Theoretical Computer Science, Information and Computation, Formal Methods in System Design, ACM Transactions on Computational Logic and Mathematical Structures in Computer Science.
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.