Rastislav Kralovic
Rastislav Královic
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2017
- [j24]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Online algorithms with advice: The tape model. Inf. Comput. 254: 59-83 (2017) - [j23]Stefan Dobrev, Rastislav Královic, Nicola Santoro:
On the Cost of Waking Up. IJNC 7(2): 336-348 (2017) - [j22]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic:
On the advice complexity of the k-server problem. J. Comput. Syst. Sci. 86: 159-170 (2017) - [j21]Stefan Dobrev, Jeff Edmonds, Dennis Komm, Rastislav Královic, Richard Královic, Sacha Krug, Tobias Mömke:
Improved analysis of the online set cover problem with advice. Theor. Comput. Sci. 689: 96-107 (2017) - [c40]Stefan Dobrev, Rastislav Královic, Dana Pardubská:
Treasure Hunt with Barely Communicating Agents. OPODIS 2017: 14:1-14:16 - 2016
- [c39]Stefan Dobrev, Rastislav Kralovic, Nicola Santoro:
On the Complexity of Distributed Wake-Up. CANDAR 2016: 559-564 - [c38]Michal Kotrbcík, Rastislav Královic, Sebastian Ordyniak:
Edge-Editing to a Dense and a Sparse Graph Class. LATIN 2016: 562-575 - [c37]Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl:
Advice Complexity of the Online Induced Subgraph Problem. MFCS 2016: 59:1-59:13 - [c36]Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke:
The Complexity of Paging Against a Probabilistic Adversary. SOFSEM 2016: 265-276 - 2015
- [j20]Stefan Dobrev, Rastislav Královic, Richard Královic:
Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs. Theory Comput. Syst. 56(1): 197-219 (2015) - [c35]Heidi Gebauer, Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula:
Disjoint Path Allocation with Sublinear Advice. COCOON 2015: 417-429 - [c34]Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula:
Treasure Hunt with Advice. SIROCCO 2015: 328-341 - [i4]Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl:
Advice Complexity of the Online Induced Subgraph Problem. CoRR abs/1512.05996 (2015) - 2014
- [c33]Rastislav Královic:
Advice Complexity: Quantitative Approach to A-Priori Information - (Extended Abstract). SOFSEM 2014: 21-29 - [c32]Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized Online Algorithms with High Probability Guarantees. STACS 2014: 470-481 - 2013
- [j19]Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrt'o:
Antibandwidth and cyclic antibandwidth of Hamming graphs. Discrete Applied Mathematics 161(10-11): 1402-1408 (2013) - [j18]Stefan Dobrev, Rastislav Královic, Richard Královic:
Computing with Advice: when Knowledge Helps. Bulletin of the EATCS 110: 35-51 (2013) - [j17]Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec:
Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ. Int. J. Found. Comput. Sci. 24(7): 955-978 (2013) - [j16]Stefan Dobrev, Paola Flocchini, Rastislav Královic, Nicola Santoro:
Exploring an unknown dangerous graph using tokens. Theor. Comput. Sci. 472: 28-45 (2013) - [j15]Brona Brejová, Stefan Dobrev, Rastislav Královic, Tomás Vinar:
Efficient routing in carrier-based mobile networks. Theor. Comput. Sci. 509: 113-121 (2013) - [i3]Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized online computation with high probability guarantees. CoRR abs/1302.2805 (2013) - 2012
- [c31]Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec:
Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical Formulæ. Developments in Language Theory 2012: 24-39 - [c30]Stefan Dobrev, Rastislav Královic, Euripides Markou:
Online Graph Exploration with Advice. SIROCCO 2012: 267-278 - [c29]Stefan Dobrev, Rastislav Královic, Richard Královic:
Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract). WAOA 2012: 2-15 - 2011
- [j14]Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Local 7-coloring for planar subgraphs of unit disk graphs. Theor. Comput. Sci. 412(18): 1696-1704 (2011) - [c28]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic:
On the Advice Complexity of the k-Server Problem. ICALP (1) 2011: 207-218 - [c27]Bronislava Brejová, Stefan Dobrev, Rastislav Královic, Tomás Vinar:
Routing in Carrier-Based Mobile Networks. SIROCCO 2011: 222-233 - [e4]Ivana Cerná, Tibor Gyimóthy, Juraj Hromkovic, Keith G. Jeffery, Rastislav Královic, Marko Vukolic, Stefan Wolf:
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. Lecture Notes in Computer Science 6543, Springer 2011, ISBN 978-3-642-18380-5 [contents] - 2010
- [c26]Juraj Hromkovic, Rastislav Královic, Richard Královic:
Information Complexity of Online Problems. MFCS 2010: 24-36 - [c25]Rastislav Královic, Stanislav Miklík:
Periodic Data Retrieval Problem in Rings Containing a Malicious Host. SIROCCO 2010: 157-167
2000 – 2009
- 2009
- [j13]Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrto:
Antibandwidth and Cyclic Antibandwidth of Hamming Graphs. Electronic Notes in Discrete Mathematics 34: 295-300 (2009) - [j12]Stefan Dobrev, Rastislav Královic, Dana Pardubská:
Measuring the problem-relevant information in input. ITA 43(3): 585-613 (2009) - [j11]Rastislav Kralovic, Richard Královic:
Rapid almost-complete broadcasting in faulty networks. Theor. Comput. Sci. 410(14): 1377-1387 (2009) - [c24]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
On the Advice Complexity of Online Problems. ISAAC 2009: 331-340 - [c23]Jurek Czyzowicz, Stefan Dobrev, Rastislav Královic, Stanislav Miklík, Dana Pardubská:
Black Hole Search in Directed Graphs. SIROCCO 2009: 182-194 - [e3]Rastislav Královic, Damian Niwinski:
Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings. Lecture Notes in Computer Science 5734, Springer 2009, ISBN 978-3-642-03815-0 [contents] - 2008
- [j10]Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro:
On fractional dynamic faults with thresholds. Theor. Comput. Sci. 399(1-2): 101-117 (2008) - [c22]Rastislav Kralovic, Richard Královic:
Deterministic Models of Communication Faults. MFCS 2008: 52-67 - [c21]Stefan Dobrev, Rastislav Kralovic, Dana Pardubská:
Leader Election in Extremely Unreliable Rings and Complete Networks. OPODIS 2008: 512-526 - [c20]Stefan Dobrev, Rastislav Kralovic, Dana Pardubská:
How Much Information about the Future Is Needed? SOFSEM 2008: 247-258 - [c19]Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. TAMC 2008: 170-181 - 2007
- [j9]Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger:
Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics 155(2): 92-102 (2007) - [j8]Rastislav Kralovic, Peter Ruzicka:
Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing. Theor. Comput. Sci. 374(1-3): 203-213 (2007) - [j7]
- [c18]Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan:
Online Bandwidth Allocation. ESA 2007: 546-557 - [c17]Rastislav Kralovic, Richard Královic:
Rapid Almost-Complete Broadcasting in Faulty Networks. SIROCCO 2007: 246-260 - [i2]Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan:
Online Bandwidth Allocation. CoRR abs/cs/0701153 (2007) - [i1]Rastislav Kralovic, Richard Královic:
Rapid Almost-Complete Broadcasting in Faulty Networks. CoRR abs/cs/0703122 (2007) - 2006
- [j6]Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Giuseppe Prencipe, Nicola Santoro:
Black hole search in common interconnection networks. Networks 47(2): 61-71 (2006) - [c16]Stefan Dobrev, Rastislav Kralovic, Nicola Santoro, Wei Shi:
Black Hole Search in Asynchronous Rings Using Tokens. CIAC 2006: 139-150 - [c15]Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Nicola Santoro:
Exploring an Unknown Graph to Locate a Black Hole Using Tokens. IFIP TCS 2006: 131-150 - [c14]Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro:
On Fractional Dynamic Faults with Threshold. SIROCCO 2006: 197-211 - [e2]Rastislav Kralovic, Pawel Urzyczyn:
Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings. Lecture Notes in Computer Science 4162, Springer 2006, ISBN 3-540-37791-3 [contents] - 2005
- [c13]
- 2004
- [e1]Rastislav Kralovic, Ondrej Sýkora:
Structural Information and Communication Complexity, 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Proceedings. Lecture Notes in Computer Science 3104, Springer 2004, ISBN 3-540-22230-8 [contents] - 2003
- [j5]Rastislav Kralovic, Peter Ruzicka:
Minimum feedback vertex sets in shuffle-based interconnection networks. Inf. Process. Lett. 86(4): 191-196 (2003) - [j4]Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Alessandro Roncato, Nicola Santoro:
On time versus size for monotone dynamic monopolies in regular topologies. J. Discrete Algorithms 1(2): 129-150 (2003) - [j3]Robert Elsässer, Rastislav Kralovic, Burkhard Monien:
Sparse topologies with small spectrum size. Theor. Comput. Sci. 307(3): 549-565 (2003) - [c12]Rastislav Kralovic, Richard Královic, Peter Ruzicka:
Broadcasting with Many Faulty Links. SIROCCO 2003: 211-222 - 2002
- [j2]Rastislav Kralovic:
Efficient Deadlock-free Multidimensional Interval Routing in Hypercube-like Networks. Computers and Artificial Intelligence 21(3) (2002) - [c11]Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Giuseppe Prencipe, Peter Ruzicka, Nicola Santoro:
Black Hole Search by Mobile Agents in Hypercubes and Related Networks. OPODIS 2002: 169-180 - [c10]Rastislav Kralovic, Peter Ruzicka:
Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks. SIROCCO 2002: 237-245 - 2001
- [c9]Rastislav Kralovic, Peter Ruzicka:
On Immunity and Catastrophic Indices of Graphs. SIROCCO 2001: 231-242 - [c8]
- [c7]Robert Elsässer, Rastislav Kralovic, Burkhard Monien:
Scalable Sparse Topologies with Small Spectrum. STACS 2001: 218-229 - 2000
- [j1]Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic:
The complexity of shortest path and dilation bounded interval routing. Theor. Comput. Sci. 234(1-2): 85-107 (2000) - [c6]Paola Flocchini, Rastislav Kralovic, Alessandro Roncato, Peter Ruzicka, Nicola Santoro:
On time versus size for monotone dynamic monopolies in regular topologies. SIROCCO 2000: 111-125
1990 – 1999
- 1999
- [c5]Rastislav Kralovic, Branislav Rovan, Peter Ruzicka:
Interval Routing on Layered Cross Product of Trees and Cycles. Euro-Par 1999: 1231-1239 - [c4]Rastislav Kralovic, Peter Ruzicka:
Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing. SIROCCO 1999: 181-193 - 1998
- [c3]Rastislav Kralovic, Branislav Rovan, Peter Ruzicka, Daniel Stefankovic:
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks. DISC 1998: 273-287 - 1997
- [c2]Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic:
The Complexity of Shortest Path and Dilation Bounded Interval Routing. Euro-Par 1997: 258-265 - [c1]
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-13 20:35 CEST by the dblp team