| 2026 | MFCS | A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs. | Babak Ghanbari, Robert Smal |
| 2025 | WG | On the Time Complexity of Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs. | Babak Ghanbari, Robert Smal |
| 2024 | IWOCA | Approximate Cycle Double Cover. | Babak Ghanbari, Robert Smal |
| 2024 | SODA | Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. | Jesse Campion Loth, Kevin Halasz, Toms Masark, Bojan Mohar, Robert Smal |
| 2023 | COCOON | Improved Bounds for the Binary Paint Shop Problem. | Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Smal, Pavel Valtr |
| 2023 | WG | Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. | Pavel Dvork, Luks Folwarczn, Michal Opler, Pavel Pudlk, Robert Smal, Tung Anh Vu |
| 2017 | ICALP | Relaxations of Graph Isomorphism. | Laura Mancinska, David E. Roberson, Robert Smal, Simone Severini, Antonios Varvitsiotis |
| 2011 | IWOCA | Complexity of the Cop and Robber Guarding Game. | Robert Smal, Rudolf Stolar, Toms Valla |