Olaf Parczyk

According to our database, Olaf Parczyk authored at least 21 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Minimum degree conditions for containing an r-regular r-connected spanning subgraph.

Max Hahn-Klimroth, Olaf Parczyk, Yury Person

Eur. J. Comb., 2024

2023

The anti-Ramsey threshold of complete graphs.

Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Olaf Parczyk, Jakob Schnitzer

Discret. Math., May, 2023

Triangles in randomly perturbed graphs.

Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan

Comb. Probab. Comput., January, 2023

Fully Computer-Assisted Proofs in Extremal Combinatorics.

Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel, Tibor Szabó

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

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

Anti-Ramsey threshold of cycles.

Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Guilherme Oliveira Mota, Olaf Parczyk

Discret. Appl. Math., 2022

2021

Maker-Breaker Games on Randomly Perturbed Graphs.

Dennis Clemens, Fabian Hamann, Yannick Mogge, Olaf Parczyk

SIAM J. Discret. Math., 2021

Minimum degree conditions for containing an r-regular r-connected subgraph.

Max Hahn-Klimroth, Olaf Parczyk, Yury Person

CoRR, 2021

Random Perturbation of Sparse Graphs.

Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge, Samuel Mohr, Olaf Parczyk

Electron. J. Comb., 2021

Cycle factors in randomly perturbed graphs.

Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Semi-random graph process.

Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg, Olaf Parczyk, Clara Shikhelman, Milos Stojakovic

Random Struct. Algorithms, 2020

2-universality in randomly perturbed graphs.

Olaf Parczyk

Eur. J. Comb., 2020

Optimal group testing under real world restrictions.

Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk, Manuel Penschuck, Maurice Rolvien

CoRR, 2020

2019

Universality for bounded degree spanning trees in randomly perturbed graphs.

Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk, Yury Person

Random Struct. Algorithms, 2019

Anti-Ramsey Threshold of Cycles for Sparse Graphs.

Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Guilherme Oliveira Mota, Olaf Parczyk

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018

Spanning structures in random graphs and hypergraphs

Olaf Parczyk

PhD thesis, 2018

Finding Tight Hamilton Cycles in Random Hypergraphs Faster.

Peter Allen, Christoph Koch, Olaf Parczyk, Yury Person

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Embedding spanning bounded degree subgraphs in randomly perturbed graphs.

Julia Böttcher, Richard Montgomery, Olaf Parczyk, Yury Person

Electron. Notes Discret. Math., 2017

2016

Spanning structures and universality in sparse hypergraphs.

Olaf Parczyk, Yury Person

Random Struct. Algorithms, 2016

On Universal Hypergraphs.

Samuel Hetterich, Olaf Parczyk, Yury Person

Electron. J. Comb., 2016

2015

On Spanning Structures in Random Hypergraphs.

Olaf Parczyk, Yury Person

Electron. Notes Discret. Math., 2015