|
Search the dblp DataBase
Rastislav Kralovic:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Stefan Dobrev, Rastislav Kralovic, Nicola Santoro, Wei Shi
Black Hole Search in Asynchronous Rings Using Tokens. [Citation Graph (0, 0)][DBLP] CIAC, 2006, pp:139-150 [Conf]
- Rastislav Kralovic, Branislav Rovan, Peter Ruzicka
Interval Routing on Layered Cross Product of Trees and Cycles. [Citation Graph (0, 0)][DBLP] Euro-Par, 1999, pp:1231-1239 [Conf]
- Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic
The Complexity of Shortest Path and Dilation Bounded Interval Routing. [Citation Graph (0, 0)][DBLP] Euro-Par, 1997, pp:258-265 [Conf]
- Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Giuseppe Prencipe, Peter Ruzicka, Nicola Santoro
Black Hole Search by Mobile Agents in Hypercubes and Related Networks. [Citation Graph (0, 0)][DBLP] OPODIS, 2002, pp:169-180 [Conf]
- Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro
On Fractional Dynamic Faults with Threshold. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:197-211 [Conf]
- Paola Flocchini, Rastislav Kralovic, Alessandro Roncato, Peter Ruzicka, Nicola Santoro
On time versus size for monotone dynamic monopolies in regular topologies. [Citation Graph (0, 0)][DBLP] SIROCCO, 2000, pp:111-125 [Conf]
- Rastislav Kralovic, Richard Královic
On Semi-perfect 1-Factorizations. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:216-230 [Conf]
- Rastislav Kralovic, Richard Královic, Peter Ruzicka
Broadcasting with Many Faulty Links. [Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:211-222 [Conf]
- Rastislav Kralovic, Peter Ruzicka
On Immunity and Catastrophic Indices of Graphs. [Citation Graph (0, 0)][DBLP] SIROCCO, 2001, pp:231-242 [Conf]
- Rastislav Kralovic, Peter Ruzicka
Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks. [Citation Graph (0, 0)][DBLP] SIROCCO, 2002, pp:237-245 [Conf]
- Rastislav Kralovic, Peter Ruzicka
Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing. [Citation Graph (0, 0)][DBLP] SIROCCO, 1999, pp:181-193 [Conf]
- Rastislav Kralovic
Time Optimal Self-Stabilizing Algorithms. [Citation Graph (0, 0)][DBLP] SOFSEM, 1997, pp:464-472 [Conf]
- Rastislav Kralovic
On Majority Voting Games in Trees. [Citation Graph (0, 0)][DBLP] SOFSEM, 2001, pp:282-291 [Conf]
- Robert Elsässer, Rastislav Kralovic, Burkhard Monien
Scalable Sparse Topologies with Small Spectrum. [Citation Graph (0, 0)][DBLP] STACS, 2001, pp:218-229 [Conf]
- Rastislav Kralovic, Branislav Rovan, Peter Ruzicka, Daniel Stefankovic
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks. [Citation Graph (0, 0)][DBLP] DISC, 1998, pp:273-287 [Conf]
- Rastislav Kralovic
Efficient Deadlock-free Multidimensional Interval Routing in Hypercube-like Networks. [Citation Graph (0, 0)][DBLP] Computers and Artificial Intelligence, 2002, v:21, n:3, pp:- [Journal]
- Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger
Eliminating graphs by means of parallel knock-out schemes. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:92-102 [Journal]
- Rastislav Kralovic, Peter Ruzicka
Minimum feedback vertex sets in shuffle-based interconnection networks. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:86, n:4, pp:191-196 [Journal]
- Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Alessandro Roncato, Nicola Santoro
On time versus size for monotone dynamic monopolies in regular topologies. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2003, v:1, n:2, pp:129-150 [Journal]
- Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Giuseppe Prencipe, Nicola Santoro
Black hole search in common interconnection networks. [Citation Graph (0, 0)][DBLP] Networks, 2006, v:47, n:2, pp:61-71 [Journal]
- Robert Elsässer, Rastislav Kralovic, Burkhard Monien
Sparse topologies with small spectrum size. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:307, n:3, pp:549-565 [Journal]
- Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic
The complexity of shortest path and dilation bounded interval routing. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:234, n:1-2, pp:85-107 [Journal]
- Rastislav Kralovic, Peter Ruzicka
Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:374, n:1-3, pp:203-213 [Journal]
- Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan
Online Bandwidth Allocation. [Citation Graph (0, 0)][DBLP] ESA, 2007, pp:546-557 [Conf]
- Rastislav Kralovic, Richard Královic
Rapid Almost-Complete Broadcasting in Faulty Networks. [Citation Graph (0, 0)][DBLP] SIROCCO, 2007, pp:246-260 [Conf]
- Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan
Online Bandwidth Allocation [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Rastislav Kralovic, Richard Královic
Rapid Almost-Complete Broadcasting in Faulty Networks [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Rastislav Kralovic
Preface. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:383, n:1, pp:1- [Journal]
Exploring an Unknown Graph to Locate a Black Hole Using Tokens. [Citation Graph (, )][DBLP]
Deterministic Models of Communication Faults. [Citation Graph (, )][DBLP]
Leader Election in Extremely Unreliable Rings and Complete Networks. [Citation Graph (, )][DBLP]
How Much Information about the Future Is Needed? [Citation Graph (, )][DBLP]
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.302secs
|