Richard Královič

907 total citations
21 papers, 134 citations indexed

About

Richard Královič is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Richard Královič has authored 21 papers receiving a total of 134 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 11 papers in Computer Networks and Communications and 7 papers in Artificial Intelligence. Recurrent topics in Richard Královič's work include Optimization and Search Problems (10 papers), Complexity and Algorithms in Graphs (7 papers) and semigroups and automata theory (6 papers). Richard Královič is often cited by papers focused on Optimization and Search Problems (10 papers), Complexity and Algorithms in Graphs (7 papers) and semigroups and automata theory (6 papers). Richard Královič collaborates with scholars based in Switzerland, Slovakia and Germany. Richard Královič's co-authors include Dennis Komm, Hans-Joachim Böckenhauer, Rastislav Kráľovič, Tobias Mömke, Peter Rossmanith, Juraj Hromkovič, Jan Vahrenhold, Stefan Dobrev, Peter Růžička and Sebastian Seibert and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Lecture notes in computer science.

In The Last Decade

Richard Královič

18 papers receiving 127 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Richard Královič Switzerland 8 94 61 29 26 22 21 134
Tobias Mömke Germany 7 56 0.6× 58 1.0× 46 1.6× 10 0.4× 20 0.9× 25 118
Irit Katriel Germany 8 71 0.8× 40 0.7× 32 1.1× 22 0.8× 31 1.4× 15 113
Frank Gurski Germany 9 72 0.8× 144 2.4× 26 0.9× 5 0.2× 14 0.6× 26 186
N. S. Narayanaswamy India 6 46 0.5× 115 1.9× 20 0.7× 6 0.2× 13 0.6× 39 149
Geevarghese Philip India 8 54 0.6× 158 2.6× 15 0.5× 3 0.1× 37 1.7× 32 193
Tınaz Ekim Türkiye 9 69 0.7× 178 2.9× 62 2.1× 49 1.9× 7 0.3× 50 245
Emir Demirović Netherlands 6 43 0.5× 15 0.2× 37 1.3× 27 1.0× 37 1.7× 15 103
Philipp Wanko Germany 7 39 0.4× 39 0.6× 16 0.6× 11 0.4× 128 5.8× 19 177
Frank Kammer Germany 7 51 0.5× 57 0.9× 3 0.1× 4 0.2× 13 0.6× 21 110
Sonia Schulenburg United Kingdom 4 16 0.2× 14 0.2× 60 2.1× 26 1.0× 58 2.6× 5 107

Countries citing papers authored by Richard Královič

Since Specialization
Citations

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

Fields of papers citing papers by Richard Královič

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Richard Královič

This figure shows the co-authorship network connecting the top 25 collaborators of Richard Královič. A scholar is included among the top collaborators of Richard Královič 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 Richard Královič. Richard Královič 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.
Ďuriš, Pavol, et al.. (2020). Randomization in Non-Uniform Finite Automata. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 13. 1 indexed citations
3.
Hromkovič, Juraj, et al.. (2018). Online Graph Coloring Against a Randomized Adversary. International Journal of Foundations of Computer Science. 29(4). 551–569. 1 indexed citations
4.
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
5.
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
6.
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
7.
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
8.
Böckenhauer, Hans-Joachim, Dennis Komm, Richard Královič, & Peter Rossmanith. (2014). The online knapsack problem: Advice and randomization. Theoretical Computer Science. 527. 61–72. 25 indexed citations
9.
Dobrev, Stefan, Rastislav Kráľovič, & Richard Královič. (2014). Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs. Theory of Computing Systems. 56(1). 197–219. 7 indexed citations
10.
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
11.
Hromkovič, Juraj, et al.. (2013). DETERMINISM VS. NONDETERMINISM FOR TWO-WAY AUTOMATA: Representing the Meaning of States by Logical Formulæ. International Journal of Foundations of Computer Science. 24(7). 955–978.
12.
Královič, Richard, et al.. (2011). Size complexity of rotating and sweeping automata. Journal of Computer and System Sciences. 78(2). 537–558. 9 indexed citations
13.
Bilò, Davide, Hans-Joachim Böckenhauer, Dennis Komm, et al.. (2010). Reoptimization of the Shortest Common Superstring Problem. Algorithmica. 61(2). 227–251. 6 indexed citations
14.
Hromkovič, Juraj, Richard Královič, & Jan Vahrenhold. (2009). Teaching Fundamentals Concepts of Informatics. Lecture notes in computer science. 8 indexed citations
15.
Královič, Richard. (2009). Infinite vs. Finite Space-Bounded Randomized Computations. 2. 316–325.
16.
Böckenhauer, Hans-Joachim, Juraj Hromkovič, Richard Královič, Tobias Mömke, & Peter Rossmanith. (2008). Reoptimization of Steiner trees: Changing the terminal set. Theoretical Computer Science. 410(36). 3428–3435. 12 indexed citations
17.
Kráľovič, Rastislav & Richard Královič. (2008). Rapid almost-complete broadcasting in faulty networks. Theoretical Computer Science. 410(14). 1377–1387. 1 indexed citations
18.
Královič, Richard & Tobias Mömke. (2007). Approximation hardness of the traveling salesman reoptimization problem. 109–116. 2 indexed citations
19.
Královič, Richard. (2004). Time and space complexity of reversible pebbling. RAIRO - Theoretical Informatics and Applications. 38(2). 137–161. 8 indexed citations
20.
Kráľovič, Rastislav, Richard Královič, & Peter Růžička. (2003). Broadcasting with Many Faulty Links.. 211–222. 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

Rankless by CCL
2026