Universality for bounded degree spanning trees in randomly perturbed graphs J Böttcher, J Han, Y Kohayakawa, R Montgomery, O Parczyk, Y Person Random Structures & Algorithms 55 (4), 854-864, 2019 | 61 | 2019 |

Embedding spanning bounded degree graphs in randomly perturbed graphs J Böttcher, R Montgomery, O Parczyk, Y Person Mathematika 66 (2), 422-447, 2020 | 56 | 2020 |

The size‐Ramsey number of powers of bounded degree trees S Berger, Y Kohayakawa, GS Maesaka, T Martins, W Mendonça, GO Mota, ... Journal of the London Mathematical Society 103 (4), 1314-1332, 2021 | 22 | 2021 |

Semi‐random graph process O Ben‐Eliezer, D Hefetz, G Kronenberg, O Parczyk, C Shikhelman, ... Random Structures & Algorithms 56 (3), 648-675, 2020 | 22 | 2020 |

Spanning structures and universality in sparse hypergraphs O Parczyk, Y Person Random Structures & Algorithms 49 (4), 819-844, 2016 | 20 | 2016 |

Random perturbation of sparse graphs M Hahn-Klimroth, GS Maesaka, Y Mogge, S Mohr, O Parczyk arXiv preprint arXiv:2004.04672, 2020 | 19 | 2020 |

A general approach to transversal versions of Dirac‐type theorems P Gupta, F Hamann, A Müyesser, O Parczyk, A Sgueglia Bulletin of the London Mathematical Society 55 (6), 2817-2839, 2023 | 14 | 2023 |

Near-optimal sparsity-constrained group testing: Improved bounds and algorithms O Gebhard, M Hahn-Klimroth, O Parczyk, M Penschuck, M Rolvien, ... IEEE Transactions on Information Theory 68 (5), 3253-3280, 2022 | 14 | 2022 |

Triangles in randomly perturbed graphs J Böttcher, O Parczyk, A Sgueglia, J Skokan Combinatorics, Probability and Computing 32 (1), 91-121, 2023 | 13 | 2023 |

Cycle factors in randomly perturbed graphs J Böttcher, O Parczyk, A Sgueglia, J Skokan Procedia Computer Science 195, 404-411, 2021 | 12 | 2021 |

2-universality in randomly perturbed graphs O Parczyk European Journal of Combinatorics 87, 103118, 2020 | 12 | 2020 |

The size-Ramsey number of 3-uniform tight paths J Han, Y Kohayakawa, S Letzter, GO Mota, O Parczyk arXiv preprint arXiv:1907.08086, 2019 | 12 | 2019 |

Embedding spanning bounded degree subgraphs in randomly perturbed graphs J Böttcher, R Montgomery, O Parczyk, Y Person Electronic Notes in Discrete Mathematics 61, 155-161, 2017 | 9 | 2017 |

New Ramsey multiplicity bounds and search heuristics O Parczyk, S Pokutta, C Spiegel, T Szabó Discrete Mathematics Days 2022 263, 224, 2022 | 7 | 2022 |

On spanning structures in random hypergraphs O Parczyk, Y Person Electronic Notes in Discrete Mathematics 49, 611-619, 2015 | 7 | 2015 |

Anti-Ramsey threshold of cycles GF Barros, BP Cavalar, GO Mota, O Parczyk Discrete Applied Mathematics 323, 228-235, 2022 | 6 | 2022 |

Resilience for tight Hamiltonicity P Allen, O Parczyk, V Pfenninger arXiv preprint arXiv:2105.04513, 2021 | 6 | 2021 |

The square of a Hamilton cycle in randomly perturbed graphs J Böttcher, O Parczyk, A Sgueglia, J Skokan Random Structures & Algorithms 65 (2), 342-386, 2024 | 5 | 2024 |

The anti-Ramsey threshold of complete graphs Y Kohayakawa, GO Mota, O Parczyk, J Schnitzer Discrete Mathematics 346 (5), 113343, 2023 | 5 | 2023 |

The anti-Ramsey threshold of complete graphs Y Kohayakawa, GO Mota, O Parczyk, J Schnitzer arXiv preprint arXiv:1902.00306, 2019 | 5 | 2019 |