David Ilcinkas

1.8k total citations
30 papers, 371 citations indexed

About

David Ilcinkas is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Management Science and Operations Research. According to data from OpenAlex, David Ilcinkas has authored 30 papers receiving a total of 371 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computer Networks and Communications, 12 papers in Computational Theory and Mathematics and 5 papers in Management Science and Operations Research. Recurrent topics in David Ilcinkas's work include Optimization and Search Problems (23 papers), Distributed systems and fault tolerance (10 papers) and Complexity and Algorithms in Graphs (7 papers). David Ilcinkas is often cited by papers focused on Optimization and Search Problems (23 papers), Distributed systems and fault tolerance (10 papers) and Complexity and Algorithms in Graphs (7 papers). David Ilcinkas collaborates with scholars based in France, Canada and United States. David Ilcinkas's co-authors include Andrzej Pelc, Pierre Fraigniaud, Nicola Santoro, Paola Flocchini, David Peleg, Cyril Gavoille, Amos Korman, Reuven Cohen, Dariusz R. Kowalski and Arnaud Labourel and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Journal of Parallel and Distributed Computing.

In The Last Decade

David Ilcinkas

25 papers receiving 357 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
David Ilcinkas France 11 334 111 89 72 49 30 371
Annalisa Massini Italy 11 137 0.4× 111 1.0× 24 0.3× 13 0.2× 48 1.0× 47 275
Othon Michail Greece 11 302 0.9× 62 0.6× 78 0.9× 44 0.6× 5 0.1× 33 382
V. K. Prasanna-Kumar United States 5 169 0.5× 51 0.5× 25 0.3× 31 0.4× 6 0.1× 9 265
Qin Xin Norway 10 253 0.8× 29 0.3× 4 0.0× 50 0.7× 18 0.4× 39 331
Jay K. Adams United States 5 114 0.3× 44 0.4× 8 0.1× 39 0.5× 10 0.2× 6 342
R. Wattenhofer Switzerland 10 665 2.0× 28 0.3× 12 0.1× 46 0.6× 4 0.1× 11 705
Aubin Jarry Switzerland 6 226 0.7× 18 0.2× 9 0.1× 21 0.3× 4 0.1× 11 270
Janusz Kusyk United States 9 157 0.5× 21 0.2× 13 0.1× 65 0.9× 3 0.1× 32 269
Alejandro Rico Spain 12 449 1.3× 20 0.2× 8 0.1× 55 0.8× 6 0.1× 30 607
Yifeng Zheng China 10 181 0.5× 14 0.1× 16 0.2× 213 3.0× 8 0.2× 46 326

Countries citing papers authored by David Ilcinkas

Since Specialization
Citations

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

Fields of papers citing papers by David Ilcinkas

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of David Ilcinkas

This figure shows the co-authorship network connecting the top 25 collaborators of David Ilcinkas. A scholar is included among the top collaborators of David Ilcinkas 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 David Ilcinkas. David Ilcinkas 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.
Ilcinkas, David, et al.. (2021). Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. Algorithmica. 84(1). 85–123.
2.
Ilcinkas, David, et al.. (2020). Exploration of carrier-based time-varying networks: The power of waiting. Theoretical Computer Science. 841. 50–61.
3.
Ilcinkas, David, et al.. (2020). Exploration of Dynamic Cactuses with Sub-logarithmic Overhead. Theory of Computing Systems. 65(2). 257–273.
4.
Czyzowicz, Jurek, et al.. (2019). Beachcombing on strips and islands. Theoretical Computer Science. 806. 236–255.
5.
Fraigniaud, Pierre, et al.. (2019). Deciding and verifying network properties locally with few output bits. Distributed Computing. 33(2). 169–187. 2 indexed citations
6.
Blin, Lélia, Jurek Czyzowicz, David Ilcinkas, et al.. (2018). On asynchronous rendezvous in general graphs. Theoretical Computer Science. 753. 80–90. 2 indexed citations
7.
Czyzowicz, Jurek, Leszek Gąsieniec, David Ilcinkas, et al.. (2018). Linear Search by a Pair of Distinct-Speed Robots. Algorithmica. 81(1). 317–342.
8.
Czyzowicz, Jurek, David Ilcinkas, Arnaud Labourel, & Andrzej Pelc. (2013). Worst-case optimal exploration of terrains with obstacles. Information and Computation. 225. 16–28. 6 indexed citations
9.
Czyzowicz, Jurek, Stefan Dobrev, Leszek Gąsieniec, et al.. (2012). More efficient periodic traversal in anonymous undirected graphs. Theoretical Computer Science. 444. 60–76. 2 indexed citations
10.
Czyzowicz, Jurek, David Ilcinkas, Arnaud Labourel, & Andrzej Pelc. (2011). Asynchronous deterministic rendezvous in bounded terrains. Theoretical Computer Science. 412(50). 6926–6937. 7 indexed citations
11.
Cooper, Colin, David Ilcinkas, Ralf Klasing, & Adrian Kosowski. (2011). Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Computing. 24(2). 91–99. 9 indexed citations
12.
Flocchini, Paola, David Ilcinkas, Andrzej Pelc, & Nicola Santoro. (2010). Remembering without memory: Tree exploration by asynchronous oblivious robots. Theoretical Computer Science. 411(14-15). 1583–1598. 35 indexed citations
13.
Ilcinkas, David, Dariusz R. Kowalski, & Andrzej Pelc. (2010). Fast radio broadcasting with advice. Theoretical Computer Science. 411(14-15). 1544–1557. 17 indexed citations
14.
Fraigniaud, Pierre, David Ilcinkas, & Andrzej Pelc. (2009). Communication algorithms with advice. Journal of Computer and System Sciences. 76(3-4). 222–232. 21 indexed citations
15.
Fraigniaud, Pierre, Cyril Gavoille, David Ilcinkas, & Andrzej Pelc. (2009). Distributed computing with advice: information sensitivity of graph coloring. Distributed Computing. 21(6). 395–403. 23 indexed citations
16.
Fraigniaud, Pierre, David Ilcinkas, & Andrzej Pelc. (2008). Tree exploration with advice. Information and Computation. 206(11). 1276–1287. 24 indexed citations
17.
Ilcinkas, David. (2008). Setting port numbers for fast graph exploration. Theoretical Computer Science. 401(1-3). 236–242. 7 indexed citations
18.
Fraigniaud, Pierre, David Ilcinkas, & Andrzej Pelc. (2008). Impact of memory size on graph exploration capability. Discrete Applied Mathematics. 156(12). 2310–2319. 4 indexed citations
19.
Ilcinkas, David & Andrzej Pelc. (2008). Impact of Asynchrony on the Behavior of Rational Selfish Agents. Fundamenta Informaticae. 82(1-2). 113–125. 3 indexed citations
20.
Fraigniaud, Pierre, et al.. (2005). Graph exploration by a finite automaton. Theoretical Computer Science. 345(2-3). 331–344. 73 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