| 2003 | SIROCCO | Broadcasting with Many Faulty Links. | Rastislav Kralovic, Richard Krlovic, Peter Ruzicka |
| 2002 | OPODIS | Black Hole Search by Mobile Agents in Hypercubes and Related Networks. | Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Giuseppe Prencipe, Peter Ruzicka, Nicola Santoro |
| 2002 | SIROCCO | Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks. | Rastislav Kralovic, Peter Ruzicka |
| 2001 | SIROCCO | On Immunity and Catastrophic Indices of Graphs. | Rastislav Kralovic, Peter Ruzicka |
| 2001 | SIROCCO | On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks. | Martin Makuch, Peter Ruzicka |
| 2000 | SIROCCO | On time versus size for monotone dynamic monopolies in regular topologies. | Paola Flocchini, Rastislav Kralovic, Alessandro Roncato, Peter Ruzicka, Nicola Santoro |
| 1999 | EuroPar | Interval Routing on Layered Cross Product of Trees and Cycles. | Rastislav Kralovic, Branislav Rovan, Peter Ruzicka |
| 1999 | SIROCCO | Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing. | Rastislav Kralovic, Peter Ruzicka |
| 1998 | SIROCCO | Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes. | Stefan Dobrev, Peter Ruzicka, Gerard Tel |
| 1998 | SOFSEM | Yet Another Modular Technique for Efficient Leader Election. | Stefan Dobrev, Peter Ruzicka |
| 1998 | SOFSEM | Efficient Communication Schemes. | Peter Ruzicka |
| 1998 | WG | Broadcasting on Anonymous Unoriented Tori. | Stefan Dobrev, Peter Ruzicka |
| 1997 | EuroPar | The Complexity of Shortest Path and Dilation Bounded Interval Routing. | Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic |
| 1997 | SIROCCO | Linear Broadcasting and N loglog N Election in Unoriented Hypercubes. | Stefan Dobrev, Peter Ruzicka |
| 1996 | SOFSEM | Efficient Tree Pattern Unification. | Peter Ruzicka |
| 1993 | FCT | On Tree Pattern Unification Problems. | Peter Ruzicka, Igor Prvara |
| 1993 | MFCS | On Time-Space Trade-Offs in Dynamic Graph Pebbling. | Peter Ruzicka, Juraj Waczulk |
| 1991 | MFCS | An Efficient Decision Algorithm for the Uniform Semi-Unification Problem. | Peter Ruzicka |
| 1988 | MFCS | On Efficiency of Interval Routing Algorithms. | Peter Ruzicka |
| 1988 | MFCS | An Almost Linear Robinson Unification ALgorithm. | Peter Ruzicka, Igor Prvara |
| 1980 | MFCS | Time and Space Bounds in Producing Certain Partial Orders. | Peter Ruzicka |
| 1979 | MFCS | Validity Test for Floyd's Operator-Precedence Parsing Algorithms. | Peter Ruzicka |
| 1977 | MFCS | How Good Is the Adversary Lower Bound? | Peter Ruzicka, Juraj Wiedermann |
| 1976 | MFCS | On the Lower Bound for Minimum Comparison Selection. | Peter Ruzicka, Juraj Wiedermann |
| 1975 | MFCS | Local Disambiguating Transformation. | Peter Ruzicka |