On Spanning Structures in Random Hypergraphs. - Olaf Parczyk; Yury Person (Electron. Notes Discret. Math., 2015)

On Universal Hypergraphs. - Samuel Hetterich; Olaf Parczyk; Yury Person (Electron. J. Comb., 2016)

Spanning structures and universality in sparse hypergraphs. - Olaf Parczyk; Yury Person (Random Struct. Algorithms, 2016)

Embedding spanning bounded degree subgraphs in randomly perturbed graphs. - Julia Böttcher; Richard Montgomery 001; Olaf Parczyk; Yury Person (Electron. Notes Discret. Math., 2017)

Finding Tight Hamilton Cycles in Random Hypergraphs Faster. - Peter Allen 001; Christoph Koch 008; Olaf Parczyk; Yury Person (LATIN, 2018)

Spanning structures in random graphs and hypergraphs - Olaf Parczyk (2018)

Anti-Ramsey Threshold of Cycles for Sparse Graphs. - Gabriel Ferreira Barros; Bruno Pasqualotto Cavalar; Guilherme Oliveira Mota; Olaf Parczyk (LAGOS, 2019)

Universality for bounded degree spanning trees in randomly perturbed graphs. - Julia Böttcher; Jie Han 002; Yoshiharu Kohayakawa; Richard Montgomery 001; Olaf Parczyk; Yury Person (Random Struct. Algorithms, 2019)

Optimal group testing under real world restrictions. - Oliver Gebhard; Max Hahn-Klimroth; Olaf Parczyk; Manuel Penschuck; Maurice Rolvien (CoRR, 2020)

2-universality in randomly perturbed graphs. - Olaf Parczyk (Eur. J. Comb., 2020)

Semi-random graph process. - Omri Ben-Eliezer; Dan Hefetz; Gal Kronenberg; Olaf Parczyk; Clara Shikhelman; Milos Stojakovic (Random Struct. Algorithms, 2020)

Cycle factors in randomly perturbed graphs. - Julia Böttcher; Olaf Parczyk; Amedeo Sgueglia; Jozef Skokan (LAGOS, 2021)

Random Perturbation of Sparse Graphs. - Max Hahn-Klimroth; Giulia S. Maesaka; Yannick Mogge; Samuel Mohr; Olaf Parczyk (Electron. J. Comb., 2021)

Minimum degree conditions for containing an r-regular r-connected subgraph. - Max Hahn-Klimroth; Olaf Parczyk; Yury Person (CoRR, 2021)

Maker-Breaker Games on Randomly Perturbed Graphs. - Dennis Clemens; Fabian Hamann; Yannick Mogge; Olaf Parczyk (SIAM J. Discret. Math., 2021)

Anti-Ramsey threshold of cycles. - Gabriel Ferreira Barros; Bruno Pasqualotto Cavalar; Guilherme Oliveira Mota; Olaf Parczyk (Discret. Appl. Math., 2022)

Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms. - Oliver Gebhard; Max Hahn-Klimroth; Olaf Parczyk; Manuel Penschuck; Maurice Rolvien; Jonathan Scarlett; Nelvin Tan (IEEE Trans. Inf. Theory, 2022)

Fully Computer-Assisted Proofs in Extremal Combinatorics. - Olaf Parczyk; Sebastian Pokutta; Christoph Spiegel 002; Tibor Szabó (AAAI, 2023)

Triangles in randomly perturbed graphs. - Julia Böttcher; Olaf Parczyk; Amedeo Sgueglia; Jozef Skokan (Comb. Probab. Comput., 2023)

The anti-Ramsey threshold of complete graphs. - Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Olaf Parczyk; Jakob Schnitzer (Discret. Math., 2023)

Resilience for tight Hamiltonicity. - Peter Allen 001; Olaf Parczyk; Vincent Pfenninger (Comb. Theory, 2024)

Minimum degree conditions for containing an r-regular r-connected spanning subgraph. - Max Hahn-Klimroth; Olaf Parczyk; Yury Person (Eur. J. Comb., 2024)

The square of a Hamilton cycle in randomly perturbed graphs. - Julia Böttcher; Olaf Parczyk; Amedeo Sgueglia; Jozef Skokan (Random Struct. Algorithms, 2024)

On Product Schur Triples in the Integers. - Letícia Mattos; Domenico Mergoni Cecchelli; Olaf Parczyk (SIAM J. Discret. Math., 2025)