Rastislav Královic

50 papers A 1B 20C 2Misc 1Journal 22Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Busy agents on a line. Discret. Appl. Math. Stefan Dobrev, Rastislav Královic, Dana Pardubská
2026	J	`jnl`	Tree coloring with predictions. Discret. Appl. Math. Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Královic, Richard Královic, Peter Rossmanith, Moritz Stocker
2025	—	`ed.`	SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025, Proceedings, Part I SOFSEM (1) Rastislav Královic, Vera Kurková
2025	—	`ed.`	SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025, Proceedings, Part II SOFSEM (2) Rastislav Královic, Vera Kurková
2024	B	`ed.`	49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, August 26-30, 2024 MFCS Rastislav Královic, Antonín Kucera
2024	J	`jnl`	Tree Coloring: Random Order and Predictions. CoRR Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Královic, Richard Královic, Peter Rossmanith, Moritz Stocker
2023	J	`jnl`	Two-Way Non-Uniform Finite Automata. Int. J. Found. Comput. Sci. Fabian Frei, Juraj Hromkovic, Rastislav Královic, Richard Královic
2022	J	`jnl`	Randomized Online Computation with High Probability Guarantees. Algorithmica Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
2021	C	`conf`	Two-Way Non-uniform Finite Automata. DLT Fabian Frei, Juraj Hromkovic, Richard Královic, Rastislav Královic
2020	J	`jnl`	A Linear-Time Algorithm for the Isometric Reconciliation of Unrooted Trees. Algorithms Brona Brejová, Rastislav Královic
2020	B	`conf`	Exploration of Time-Varying Connected Graphs with Silent Agents. SIROCCO Stefan Dobrev, Rastislav Královic, Dana Pardubská
2020	B	`conf`	Improved Lower Bounds for Shoreline Search. SIROCCO Stefan Dobrev, Rastislav Královic, Dana Pardubská
2020	B	`conf`	Randomization in Non-Uniform Finite Automata. MFCS Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith
2020	J	`jnl`	Tight hierarchy of data-independent multi-head automata. J. Comput. Syst. Sci. Pavol Duris, Rastislav Královic, Dana Pardubská
2019	B	`ed.`	SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings SOFSEM Barbara Catania, Rastislav Královic, Jerzy R. Nawrocki, Giovanni Pighizzini
2018	—	`conf`	Determinism and Nondeterminism in Finite Automata with Advice. Adventures Between Lower Bounds and Higher Altitudes Pavol Duris, Rafael Korbas, Rastislav Královic, Richard Královic
2018	J	`jnl`	Online Graph Coloring Against a Randomized Adversary. Int. J. Found. Comput. Sci. Elisabet Burjons, Juraj Hromkovic, Rastislav Královic, Richard Královic, Xavier Muñoz, Walter Unger
2017	J	`jnl`	Improved analysis of the online set cover problem with advice. Theor. Comput. Sci. Stefan Dobrev, Jeff Edmonds, Dennis Komm, Rastislav Královic, Richard Královic, Sacha Krug, Tobias Mömke
2017	J	`jnl`	On the Cost of Waking Up. Int. J. Netw. Comput. Stefan Dobrev, Rastislav Královic, Nicola Santoro
2017	J	`jnl`	On the advice complexity of the k-server problem. J. Comput. Syst. Sci. Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic
2017	J	`jnl`	Online algorithms with advice: The tape model. Inf. Comput. Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
2017	B	`conf`	Treasure Hunt with Barely Communicating Agents. OPODIS Stefan Dobrev, Rastislav Královic, Dana Pardubská
2016	B	`conf`	Advice Complexity of the Online Induced Subgraph Problem. MFCS Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl
2016	B	`conf`	Edge-Editing to a Dense and a Sparse Graph Class. LATIN Michal Kotrbcík, Rastislav Královic, Sebastian Ordyniak
2016	B	`conf`	The Complexity of Paging Against a Probabilistic Adversary. SOFSEM Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke
2015	J	`jnl`	Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs. Theory Comput. Syst. Stefan Dobrev, Rastislav Královic, Richard Královic
2015	J	`jnl`	Advice Complexity of the Online Induced Subgraph Problem. CoRR Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl
2015	Misc	`conf`	Disjoint Path Allocation with Sublinear Advice. COCOON Heidi Gebauer, Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula
2015	B	`conf`	Treasure Hunt with Advice. SIROCCO Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula
2014	B	`conf`	Advice Complexity: Quantitative Approach to A-Priori Information - (Extended Abstract). SOFSEM Rastislav Královic
2014	A	`conf`	Randomized Online Algorithms with High Probability Guarantees. STACS Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
2013	J	`jnl`	Antibandwidth and cyclic antibandwidth of Hamming graphs. Discret. Appl. Math. Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrt'o
2013	J	`jnl`	Computing with Advice: when Knowledge Helps. Bull. EATCS Stefan Dobrev, Rastislav Královic, Richard Královic
2013	J	`jnl`	Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ. Int. J. Found. Comput. Sci. Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec
2013	J	`jnl`	Efficient routing in carrier-based mobile networks. Theor. Comput. Sci. Brona Brejová, Stefan Dobrev, Rastislav Královic, Tomás Vinar
2013	J	`jnl`	Exploring an unknown dangerous graph using tokens. Theor. Comput. Sci. Stefan Dobrev, Paola Flocchini, Rastislav Královic, Nicola Santoro
2013	J	`jnl`	Randomized online computation with high probability guarantees CoRR Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
2012	C	`conf`	Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical Formulæ. Developments in Language Theory Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec
2012	B	`conf`	Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract). WAOA Stefan Dobrev, Rastislav Královic, Richard Královic
2012	B	`conf`	Online Graph Exploration with Advice. SIROCCO Stefan Dobrev, Rastislav Královic, Euripides Markou
2011	—	`conf`	On the Advice Complexity of the k-Server Problem. ICALP (1) Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic
2011	B	`conf`	Routing in Carrier-Based Mobile Networks. SIROCCO Bronislava Brejová, Stefan Dobrev, Rastislav Královic, Tomás Vinar
2011	B	`ed.`	SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings SOFSEM Ivana Cerná, Tibor Gyimóthy, Juraj Hromkovic, Keith G. Jeffery, Rastislav Královic, Marko Vukolic, Stefan Wolf
2010	B	`conf`	Information Complexity of Online Problems. MFCS Juraj Hromkovic, Rastislav Královic, Richard Královic
2010	B	`conf`	Periodic Data Retrieval Problem in Rings Containing a Malicious Host. SIROCCO Rastislav Královic, Stanislav Miklík
2009	J	`jnl`	Antibandwidth and Cyclic Antibandwidth of Hamming Graphs. Electron. Notes Discret. Math. Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrto
2009	B	`conf`	Black Hole Search in Directed Graphs. SIROCCO Jurek Czyzowicz, Stefan Dobrev, Rastislav Královic, Stanislav Miklík, Dana Pardubská
2009	B	`ed.`	Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings MFCS Rastislav Královic, Damian Niwinski
2009	J	`jnl`	Measuring the problem-relevant information in input. RAIRO Theor. Informatics Appl. Stefan Dobrev, Rastislav Královic, Dana Pardubská
2009	B	`conf`	On the Advice Complexity of Online Problems. ISAAC Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke