Olaf Parczyk

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 19

Top Topics

Maximally Stable

Top Venues

Random Struct. Algorithms

Electron. J. Comb.

Electron. Notes Discret. Math.

Publications

Max Hahn-Klimroth, Olaf Parczyk, Yury Person
Minimum degree conditions for containing an r-regular r-connected spanning subgraph. Eur. J. Comb. 118 (2024)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Olaf Parczyk, Jakob Schnitzer
The anti-Ramsey threshold of complete graphs. Discret. Math. 346 (5) (2023)
Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel, Tibor Szabó
Fully Computer-Assisted Proofs in Extremal Combinatorics. AAAI (2023)
Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan
Triangles in randomly perturbed graphs. Comb. Probab. Comput. 32 (1) (2023)
Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Guilherme Oliveira Mota, Olaf Parczyk
Anti-Ramsey threshold of cycles. Discret. Appl. Math. 323 (2022)
Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk, Manuel Penschuck, Maurice Rolvien, Jonathan Scarlett, Nelvin Tan
Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms. IEEE Trans. Inf. Theory 68 (5) (2022)
Dennis Clemens, Fabian Hamann, Yannick Mogge, Olaf Parczyk
Maker-Breaker Games on Randomly Perturbed Graphs. SIAM J. Discret. Math. 35 (4) (2021)
Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan
Cycle factors in randomly perturbed graphs. LAGOS (2021)
Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge, Samuel Mohr, Olaf Parczyk
Random Perturbation of Sparse Graphs. Electron. J. Comb. 28 (2) (2021)
Max Hahn-Klimroth, Olaf Parczyk, Yury Person
Minimum degree conditions for containing an r-regular r-connected subgraph. CoRR (2021)
Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk, Manuel Penschuck, Maurice Rolvien
Optimal group testing under real world restrictions. CoRR (2020)
Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg, Olaf Parczyk, Clara Shikhelman, Milos Stojakovic
Semi-random graph process. Random Struct. Algorithms 56 (3) (2020)
Olaf Parczyk
2-universality in randomly perturbed graphs. Eur. J. Comb. 87 (2020)
Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk, Yury Person
Universality for bounded degree spanning trees in randomly perturbed graphs. Random Struct. Algorithms 55 (4) (2019)
Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Guilherme Oliveira Mota, Olaf Parczyk
Anti-Ramsey Threshold of Cycles for Sparse Graphs. LAGOS (2019)
Peter Allen, Christoph Koch, Olaf Parczyk, Yury Person
Finding Tight Hamilton Cycles in Random Hypergraphs Faster. LATIN (2018)
Julia Böttcher, Richard Montgomery, Olaf Parczyk, Yury Person
Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Electron. Notes Discret. Math. 61 (2017)
Samuel Hetterich, Olaf Parczyk, Yury Person
On Universal Hypergraphs. Electron. J. Comb. 23 (4) (2016)
Olaf Parczyk, Yury Person
Spanning structures and universality in sparse hypergraphs. Random Struct. Algorithms 49 (4) (2016)
Olaf Parczyk, Yury Person
On Spanning Structures in Random Hypergraphs. Electron. Notes Discret. Math. 49 (2015)