Research/art/teacher profile of a person
Name and surname:
prof. RNDr. Rastislav Kráľovič, PhD.
Document type:
Research/art/teacher profile of a person
The name of the university:
Comenius University Bratislava
The seat of the university:
Šafárikovo námestie 6, 818 06 Bratislava

I. - Basic information

I.1 - Surname
Královič
I.2 - Name
Rastislav
I.3 - Degrees
Prof. RNDr., PhD.
I.4 - Year of birth
1974
I.5 - Name of the workplace
Faculty of Mathematics, Physics, and Informatics of the Comenius University in Bratislava
I.6 - Address of the workplace
FMFI UK, Mlynská dolina, 84248 Bratislava
I.7 - Position
professor
I.8 - E-mail address
kralovic@dcs.fmph.uniba.sk
I.9 - Hyperlink to the entry of a person in the Register of university staff
https://www.portalvs.sk/regzam/detail/4622
I.10 - Name of the study field in which a person works at the university
Computer Science
I.11 - ORCID iD
0000-0003-1121-1009

II. - Higher education and further qualification growth

II.1 - First degree of higher education
II.2 - Second degree of higher education
II.a - Name of the university or institution
Comenius University in Bratislava
II.b - Year
1998
II.c - Study field and programme
Computer Science
II.3 - Third degree of higher education
II.a - Name of the university or institution
Comenius University in Bratislava
II.b - Year
2002
II.c - Study field and programme
Computer Science
II.4 - Associate professor
II.a - Name of the university or institution
Comenius University in Bratislava
II.b - Year
2004
II.c - Study field and programme
Computer Science
II.5 - Professor
II.a - Name of the university or institution
Comenius University in Bratislava
II.b - Year
2013
II.c - Study field and programme
Computer Science
II.6 - Doctor of Science (DrSc.)

III. - Current and previous employment

III.a - Occupation-position III.b - Institution III.c - Duration
odborný asistent FMFI UK 1998-2002, 2003-2005
docent FMFI UK 2005-2014
profesor FMFI UK 2014 - .

IV. - Development of pedagogical, professional, language, digital and other skills

V. - Overview of activities within the teaching career at the university

V.1 - Overview of the profile courses taught in the current academic year according to study programmes
V.1.a - Name of the profile course V.1.b - Study programme V.1.c - Degree V.1.d - Field of study
2-INF-231/00 Efficient Parallel Algorithms Computer Science II Computer Science
2-INF-221/15 Approximation of Optimisation Problems Computer Science II Computer Science
3-INF-001/15 Theoretical Foundations of Informatics Computer Science III Computer Science
1-INF-220/00 Algorithms and Data Structures Computer Science I Computer Science
3-MDM-028/10 Algorithmics for Hard Problems Mathematics III Mathematics
V.2 - Overview of the responsibility for the delivery, development and quality assurance of the study programme or its part at the university in the current academic year
V.2.a - Name of the study programme V.2.b - Degree V.2.c - Field of study
Computer Science II Computer Science
Computer Science III Computer Science
Computer Science III Computer Science
V.3 - Overview of the responsibility for the development and quality of the field of habilitation procedure and inaugural procedure in the current academic year
V.4 - Overview of supervised final theses
V.4.1 - Number of currently supervised theses
V.4.a - Bachelor's (first degree)
3
V.4.b - Diploma (second degree)
2
V.4.c - Dissertation (third degree)
1
V.4.2 - Number of defended theses
V.4.a - Bachelor's (first degree)
17
V.4.b - Diploma (second degree)
35
V.4.c - Dissertation (third degree)
3
V.5 - Overview of other courses taught in the current academic year according to study programmes

VI. - Overview of the research/artistic/other outputs

VI.1 - Overview of the research/artistic/other outputs and the corresponding citations
VI.1.1 - Number of the research/artistic/other outputs
VI.1.a - Overall
74
VI.1.b - Over the last six years
9
VI.1.2 - Number of the research/artistic/other outputs registered in the Web of Science or Scopus databases
VI.1.a - Overall
66
VI.1.b - Over the last six years
10
VI.1.3 - Number of citations corresponding to the research/artistic/other outputs
VI.1.a - Overall
708
VI.1.b - Over the last six years
210
VI.1.4 - Number of citations registered in the Web of Science or Scopus databases
VI.1.a - Overall
708
VI.1.b - Over the last six years
210
VI.1.5 - Number of invited lectures at the international, national level
VI.1.a - Overall
3
VI.1.b - Over the last six years
0
VI.2 - The most significant research/artistic/other outputs
1

Dobrev, S., Flocchini, P., Královič, R., Ružička, P., Prencipe, G., Santoro, N.: Black hole search in common interconnection networks. (2006) Networks, 47 (2), pp. 61-71.

https://www.scopus.com/inward/record.uri?eid=2-s2.0-33645140802&doi=10.1002%2fnet.20095&partnerID=40&md5=a927ce09dfb1b3dacd98bbae354fa06d

DOI: 10.1002/net.20095

2

Dobrev, S., Flocchini, P., Královič, R., Santoro, N.: Exploring an unknown dangerous graph using tokens. (2013) Theoretical Computer Science, 472, pp. 28-45

https://www.scopus.com/inward/record.uri?eid=2-s2.0-84873208220&doi=10.1016%2fj.tcs.2012.11.022&partnerID=40&md5=e4dbe702fda9ce7df18280dda5c20955

DOI: 10.1016/j.tcs.2012.11.022

3

Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R., Mömke, T.: Online algorithms with advice: The tape model. (2017) Information and Computation, 254, pp. 59-83. 

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016596357&doi=10.1016%2fj.ic.2017.03.001&partnerID=40&md5=36e621bc0dd5e390c40a94040c97bf91

DOI: 10.1016/j.ic.2017.03.001

4

Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R.: On the advice complexity of the k-server problem. (2017) Journal of Computer and System Sciences, 86, pp. 159-170.

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85009788805&doi=10.1016%2fj.jcss.2017.01.001&partnerID=40&md5=2342fb77aa20375164f5d15eb429f015

DOI: 10.1016/j.jcss.2017.01.001

5

Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R., Mömke, T. On the advice complexity of online problems (2009) Lecture Notes in Computer Science, 5878 LNCS, pp. 331-340

https://www.scopus.com/inward/record.uri?eid=2-s2.0-75649117424&doi=10.1007%2f978-3-642-10631-6_35&partnerID=40&md5=619d325b28f16cbec99d3cd3b20be5fa 

DOI: 10.1007/978-3-642-10631-6_35

VI.3 - The most significant research/artistic/other outputs over the last six years
1

Frei F., Hromkovič J., Královič R., Královič R. Two-Way Non-Uniform Finite Automata (2023) International Journal of Foundations of Computer Science, 34 (2-3), pp. 145 - 162

https://www.worldscientific.com/doi/10.1142/S0129054122440063?srsltid=AfmBOorZOuTKwiFzvLGVQOU69PyTjj5zxxXioH2Do8FxMImc3BKBRhjm

DOI: 10.1142/S0129054122440063

2

Komm D., Královič R., Královič R., Mömke T. Randomized Online Computation with High Probability Guarantees (2022) Algorithmica, 84 (5), pp. 1357 - 1384

https://link.springer.com/article/10.1007/s00453-022-00925-z

DOI: 10.1007/s00453-022-00925-z

3

Ďuriš, P., Královič, R., Pardubská, D.: Tight hierarchy of data-independent multi-head automata. (2020) Journal of Computer and System Sciences, 114, pp. 126-136. 

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85087405144&doi=10.1016%2fj.jcss.2020.06.005&partnerID=40&md5=4bef676b68a4ed751f2677e7a28edad1

DOI: 10.1016/j.jcss.2020.06.005

4

Ďuriš P., Královič R., Královič R., Pardubská D., Pašen M., Rossmanith P. Randomization in non-uniform finite automata (2020) Leibniz International Proceedings in Informatics, LIPIcs, 170, art. no. MFCS-2020-30

https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.30

DOI: 10.4230/LIPIcs.MFCS.2020.30

5

Frei F., Hromkovič J., Královič R., Královič R. Two-Way Non-Uniform Finite Automata (2023) International Journal of Foundations of Computer Science, 34 (2-3), pp. 145 - 162

https://www.worldscientific.com/doi/10.1142/S0129054122440063?srsltid=AfmBOorZOuTKwiFzvLGVQOU69PyTjj5zxxXioH2Do8FxMImc3BKBRhjm

DOI: 10.1142/S0129054122440063

VI.4 - The most significant citations corresponding to the research/artistic/other outputs
1

Boyar, J., Favrholdt, L.M., Kamali, S., Larsen, K.S. Online Bin Covering with Advice (2021) Algorithmica, 83 (3), pp. 795-821. https://www.scopus.com/inward/record.uri?eid=2-s2.0-85086575973&doi=10.1007%2fs00453-020-00728-0&partnerID=40&md5=1ee4d13770992b68695263cda841f3c1 DOI: 10.1007/s00453-020-00728-0 


Cites: Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R. On the advice complexity of the k-server problem (2017) Journal of Computer and System Sciences, 86, pp. 159-170.  

2

Chen, L.-H., Hung, L.-J., Lotze, H., Rossmanith, P. Online Node- and Edge-Deletion Problems with Advice (2021) Algorithmica, 83 (9), pp. 2719-2753. 

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85111970685&doi=10.1007%2fs00453-021-00840-9&partnerID=40&md5=e9db86e59433da3031d015ae53b4e2ea DOI: 10.1007/s00453-021-00840-9


Cites: Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R., Mömke, T. Online algorithms with advice: The tape model (2017) Information and Computation, 254, pp. 59-83. 

3

Borodin, A., Pankratov, D., Salehi-Abari, A. On Conceptually Simple Algorithms for Variants of Online Bipartite Matching (2019) Theory of Computing Systems, 63 (8), pp. 1781-1818. https://www.scopus.com/inward/record.uri?eid=2-s2.0-85064160686&doi=10.1007%2fs00224-019-09916-0&partnerID=40&md5=533aae05b65aae9b5c391474544fe400 DOI: 10.1007/s00224-019-09916-0 


Cites: Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R. On the advice complexity of the k-server problem (2017) Journal of Computer and System Sciences, 86, pp. 159-170.  

4

Feldkord, B., Der Heide, F.M.A. The mobile server problem (2019) ACM Transactions on Parallel Computing, 6 (3), art. no. A14, . https://www.scopus.com/inward/record.uri?eid=2-s2.0-85073751869&doi=10.1145%2f3364204&partnerID=40&md5=d75c145742d5cb8ddb9a56cef061007a DOI: 10.1145/3364204 


Cites: Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R. On the advice complexity of the k-server problem (2017) Journal of Computer and System Sciences, 86, pp. 159-170.  

5

Boyar, J., Favrholdt, L.M., Larsen, K.S. Relative Worst-order Analysis (2021) ACM Computing Surveys, 54 (1), art. no. 8,  

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85105397520&partnerID=40&md5=f514168e3a8fe3fa7e6d26f8c3cd213b


Cites: Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R., Mömke, T. Online algorithms with advice: The tape model (2017) Information and Computation, 254, pp. 59-83. 

VI.5 - Participation in conducting (leading) the most important research projects or art projects over the last six years
1

VEGA 1/0601/20

VII. - Overview of organizational experience related to higher education and research/artistic/other activities

VII.a - Activity, position VII.b - Name of the institution, board VII.c - Duration
chair of the Section of informatics FMFI UK 2019 - 2022
member of the Scientific Board FMFI UK 2015 - .
člen Komisie SAV pre posudzovanie vedeckej kvalifikácie zamestnancov SAV 2018 - .
editor of the Journal of Interconnection Networks World Scientific 2020-2024
member of the Steering Committee and Honorary Board of the conference SIROCCO
PC chair of conferences SIROCCO, MFCS, SOFSEM 2004,2006,2009,2011,2019,2024,2025
member of the Steering Committee of the conference MFCS 2026-.

VIII. - Overview of international mobilities and visits oriented on education and research/artistic/other activities in the given field of study

VIII.a - Name of the institution VIII.b - Address of the institution VIII.c - Duration (indicate the duration of stay) VIII.d - Mobility scheme, employment contract, other (describe)
University of Ottawa Ottawa, Canada January-September 2005 stay invited by prof. Flocchini
ETH Zürich Zürich, Switzerland several 1-2 months invited stays (Gastdozent) during the years 2007-2014

IX. - Other relevant facts

Date of last update
2026-02-27