Rastislav Kráľovič

1.2k total citations
32 papers, 255 citations indexed

About

Rastislav Kráľovič is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Rastislav Kráľovič has authored 32 papers receiving a total of 255 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computer Networks and Communications, 13 papers in Computational Theory and Mathematics and 5 papers in Artificial Intelligence. Recurrent topics in Rastislav Kráľovič's work include Optimization and Search Problems (13 papers), Caching and Content Delivery (6 papers) and Advanced Graph Theory Research (6 papers). Rastislav Kráľovič is often cited by papers focused on Optimization and Search Problems (13 papers), Caching and Content Delivery (6 papers) and Advanced Graph Theory Research (6 papers). Rastislav Kráľovič collaborates with scholars based in Slovakia, Switzerland and Germany. Rastislav Kráľovič's co-authors include Damian Niwiński, Stefan Dobrev, Peter Růžička, Nicola Santoro, Paola Flocchini, Richard Královič, Alessandro Roncato, Dennis Komm, Hans-Joachim Böckenhauer and Giuseppe Prencipe and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Networks.

In The Last Decade

Rastislav Kráľovič

29 papers receiving 243 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Rastislav Kráľovič Slovakia 9 154 113 49 49 38 32 255
Janka Chlebı́ková Slovakia 8 138 0.9× 241 2.1× 32 0.7× 12 0.2× 11 0.3× 25 327
Darren Strash United States 7 72 0.5× 69 0.6× 83 1.7× 10 0.2× 67 1.8× 18 200
Claire Kenyon-Mathieu United States 6 72 0.5× 98 0.9× 65 1.3× 59 1.2× 7 0.2× 9 196
A. V. Karzanov Russia 7 68 0.4× 143 1.3× 31 0.6× 33 0.7× 6 0.2× 19 213
Bruno Escoffier France 9 91 0.6× 144 1.3× 29 0.6× 17 0.3× 8 0.2× 21 214
Sundar Vishwanathan India 10 156 1.0× 186 1.6× 38 0.8× 26 0.5× 4 0.1× 30 282
Ignasi Sau France 9 87 0.6× 222 2.0× 31 0.6× 12 0.2× 8 0.2× 77 294
Thomas Andreae Germany 10 78 0.5× 275 2.4× 32 0.7× 18 0.4× 11 0.3× 39 365
Tasuku Soma Japan 7 62 0.4× 100 0.9× 62 1.3× 21 0.4× 21 0.6× 15 169
Léonardo Brenner France 9 85 0.6× 86 0.8× 47 1.0× 26 0.5× 27 0.7× 27 216

Countries citing papers authored by Rastislav Kráľovič

Since Specialization
Citations

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

Fields of papers citing papers by Rastislav Kráľovič

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Rastislav Kráľovič. 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 Rastislav Kráľovič. The network helps show where Rastislav Kráľovič may publish in the future.

Co-authorship network of co-authors of Rastislav Kráľovič

This figure shows the co-authorship network connecting the top 25 collaborators of Rastislav Kráľovič. A scholar is included among the top collaborators of Rastislav Kráľovič 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 Rastislav Kráľovič. Rastislav Kráľovič 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.
Hromkovič, Juraj, et al.. (2022). Two-Way Non-Uniform Finite Automata. International Journal of Foundations of Computer Science. 34(02n03). 145–162.
2.
Dobrev, Stefan, et al.. (2018). Treasure Hunt with Barely Communicating Agents. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 95. 16. 1 indexed citations
3.
Böckenhauer, Hans-Joachim, Dennis Komm, Rastislav Kráľovič, Richard Královič, & Tobias Mömke. (2017). Online algorithms with advice: The tape model. Information and Computation. 254. 59–83. 15 indexed citations
4.
Böckenhauer, Hans-Joachim, Dennis Komm, Rastislav Kráľovič, & Richard Královič. (2017). On the advice complexity of the k-server problem. Journal of Computer and System Sciences. 86. 159–170. 9 indexed citations
5.
Dobrev, Stefan, Jeff Edmonds, Dennis Komm, et al.. (2017). Improved analysis of the online set cover problem with advice. Theoretical Computer Science. 689. 96–107. 2 indexed citations
6.
Komm, Dennis, Rastislav Kráľovič, Richard Královič, & Tobias Mömke. (2014). Randomized Online Algorithms with High Probability Guarantees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
7.
Dobrev, Stefan, Rastislav Kráľovič, & Richard Královič. (2013). Computing with Advice: when Knowledge Helps. Bulletin of the European Association for Theoretical Computer Science. 2(110). 35–51. 1 indexed citations
8.
Dobrev, Stefan, et al.. (2013). Antibandwidth and cyclic antibandwidth of Hamming graphs. Discrete Applied Mathematics. 161(10-11). 1402–1408. 5 indexed citations
9.
Brejová, Broňa, Stefan Dobrev, Rastislav Kráľovič, & Tomáš Vinař. (2013). Efficient routing in carrier-based mobile networks. Theoretical Computer Science. 509. 113–121. 3 indexed citations
10.
Dobrev, Stefan, Paola Flocchini, Rastislav Kráľovič, & Nicola Santoro. (2012). Exploring an unknown dangerous graph using tokens. Theoretical Computer Science. 472. 28–45. 14 indexed citations
11.
Dobrev, Stefan, et al.. (2009). Antibandwidth and Cyclic Antibandwidth of Hamming Graphs. Electronic Notes in Discrete Mathematics. 34. 295–300. 6 indexed citations
12.
Kráľovič, Rastislav & Richard Královič. (2008). Rapid almost-complete broadcasting in faulty networks. Theoretical Computer Science. 410(14). 1377–1387. 1 indexed citations
13.
Kráľovič, Rastislav & Peter Růžička. (2007). Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing. Theoretical Computer Science. 374(1-3). 203–213. 2 indexed citations
14.
Dobrev, Stefan, Rastislav Kráľovič, Nicola Santoro, & Wei Shi. (2006). Black hole search in asynchronous rings using tokens.
15.
Broersma, Hajo, Fedor V. Fomin, Rastislav Kráľovič, & Gerhard J. Woeginger. (2006). Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics. 155(2). 92–102. 4 indexed citations
16.
Kráľovič, Rastislav, Richard Královič, & Peter Růžička. (2003). Broadcasting with Many Faulty Links.. 211–222. 4 indexed citations
17.
Flocchini, Paola, Rastislav Kráľovič, Peter Růžička, Alessandro Roncato, & Nicola Santoro. (2003). On time versus size for monotone dynamic monopolies in regular topologies. Journal of Discrete Algorithms. 1(2). 129–150. 38 indexed citations
18.
Dobrev, Stefan, Paola Flocchini, Rastislav Kráľovič, et al.. (2002). BLACK HOLE SEARCH BY MOBILE AGENTS IN HYPERCUBES AND RELATED NETWORKS. 169–180. 4 indexed citations
19.
Kráľovič, Rastislav & Peter Růžička. (2001). On Immunity and Catastrophic Indices of Graphs.. 231–242. 3 indexed citations
20.
Kráľovič, Rastislav, Peter Růžička, & Daniel Štefankovič. (2000). The complexity of shortest path and dilation bounded interval routing. Theoretical Computer Science. 234(1-2). 85–107. 8 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