On the advice complexity of online problems HJ Böckenhauer, D Komm, R Královič, R Královič, T Mömke Algorithms and Computation: 20th International Symposium, ISAAC 2009 …, 2009 | 159 | 2009 |

Information complexity of online problems J Hromkovič, R Královič, R Královič International Symposium on Mathematical Foundations of Computer Science, 24-36, 2010 | 111 | 2010 |

Applied computer science S Torbert Springer, 2016 | 105 | 2016 |

On the advice complexity of the k-server problem HJ Böckenhauer, D Komm, R Královič, R Královič International Colloquium on Automata, Languages, and Programming, 207-218, 2011 | 105* | 2011 |

On time versus size for monotone dynamic monopolies in regular topologies P Flocchini, R Královič, P Ružička, A Roncato, N Santoro Journal of Discrete Algorithms 1 (2), 129-150, 2003 | 99 | 2003 |

On time versus size for monotone dynamic monopolies in regular topologies P Flocchini, R Královič, P Ružička, A Roncato, N Santoro Journal of Discrete Algorithms 1 (2), 129-150, 2003 | 99 | 2003 |

Measuring the problem-relevant information in input S Dobrev, R Královič, D Pardubská RAIRO-Theoretical Informatics and Applications 43 (3), 585-613, 2009 | 97 | 2009 |

How much information about the future is needed? S Dobrev, R Královič, D Pardubská International Conference on Current Trends in Theory and Practice of …, 2008 | 76 | 2008 |

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

Online graph exploration with advice S Dobrev, R Královič, E Markou International Colloquium on Structural Information and Communication …, 2012 | 68 | 2012 |

Black hole search in asynchronous rings using tokens S Dobrev, R Královič, N Santoro, W Shi Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy …, 2006 | 45 | 2006 |

Black hole search in directed graphs J Czyzowicz, S Dobrev, R Královič, S Miklík, D Pardubská Structural Information and Communication Complexity: 16th International …, 2010 | 43 | 2010 |

The complexity of shortest path and dilation bounded interval routing R Kráľovič, P Ružička, D Štefankovič Euro-Par'97 Parallel Processing: Third International Euro-Par Conference …, 1997 | 40 | 1997 |

Exploring an unknown dangerous graph using tokens S Dobrev, P Flocchini, R Královič, N Santoro Theoretical Computer Science 472, 28-45, 2013 | 36 | 2013 |

Treasure hunt with advice D Komm, R Královič, R Královič, J Smula Structural Information and Communication Complexity: 22nd International …, 2015 | 33 | 2015 |

Minimum feedback vertex sets in shuffle-based interconnection networks R Královič, P Ružička Information Processing Letters 86 (4), 191-196, 2003 | 33 | 2003 |

Online algorithms with advice: The tape model HJ Böckenhauer, D Komm, R Královič, R Královič, T Mömke Information and Computation 254, 59-83, 2017 | 30 | 2017 |

Periodic data retrieval problem in rings containing a malicious host R Královič, S Miklík Structural Information and Communication Complexity: 17th International …, 2010 | 28 | 2010 |

Black Hole Search by Mobile Agents in Hypercubes and Related Networks. S Dobrev, P Flocchini, R Kralovic, G Prencipe, P Ruzicka, N Santoro OPODIS, 169-180, 2002 | 27 | 2002 |

Exploring an unknown graph to locate a black hole using tokens S Dobrev, P Flocchini, R Královič, N Santoro Fourth IFIP International Conference on Theoretical Computer Science-TCS …, 2006 | 26 | 2006 |