On the advice complexity of online problems HJ Böckenhauer, D Komm, R Královič, R Královič, T Mömke International Symposium on Algorithms and Computation, 331-340, 2009 | 142 | 2009 |

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 | 97* | 2011 |

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

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 | 92 | 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 | 92 | 2003 |

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

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

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 | 73 | 2006 |

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 | 72 | 2008 |

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

Black hole search in asynchronous rings using tokens S Dobrev, R Královič, N Santoro, W Shi Italian Conference on Algorithms and Complexity, 139-150, 2006 | 43 | 2006 |

Black hole search in directed graphs J Czyzowicz, S Dobrev, R Královič, S Miklík, D Pardubská International Colloquium on Structural Information and Communication …, 2009 | 40 | 2009 |

The complexity of shortest path and dilation bounded interval routing R Kráľovič, P Ružička, D Štefankovič European Conference on Parallel Processing, 258-265, 1997 | 39 | 1997 |

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

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

Periodic data retrieval problem in rings containing a malicious host R Královič, S Miklík International Colloquium on Structural Information and Communication …, 2010 | 27 | 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 |

Treasure hunt with advice D Komm, R Královič, R Královič, J Smula International Colloquium on Structural Information and Communication …, 2015 | 22 | 2015 |

Exploring a dangerous unknown graph using tokens S Dobrev, P Flocchini, R Kralovic, N Santoro Proceedings of 5th IFIP International Conference on Theoretical Computer …, 2006 | 21 | 2006 |