default search action
Olaf Parczyk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Peter Allen
, Olaf Parczyk, Vincent Pfenninger
Resilience for tight Hamiltonicity. Comb. Theory 4(1) (2024) - [j15]Max Hahn-Klimroth, Olaf Parczyk, Yury Person:
Minimum degree conditions for containing an r-regular r-connected spanning subgraph. Eur. J. Comb. 118: 103940 (2024) - [j14]Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan:
The square of a Hamilton cycle in randomly perturbed graphs. Random Struct. Algorithms 65(2): 342-386 (2024) - 2023
- [j13]Julia Böttcher
Triangles in randomly perturbed graphs. Comb. Probab. Comput. 32(1): 91-121 (2023) - [j12]Yoshiharu Kohayakawa
The anti-Ramsey threshold of complete graphs. Discret. Math. 346(5): 113343 (2023) - [c4]Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel, Tibor Szabó:
Fully Computer-Assisted Proofs in Extremal Combinatorics. AAAI 2023: 12482-12490 - 2022
- [j11]Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar
Anti-Ramsey threshold of cycles. Discret. Appl. Math. 323: 228-235 (2022) - [j10]Oliver Gebhard
Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms. IEEE Trans. Inf. Theory 68(5): 3253-3280 (2022) - 2021
- [j9]Max Hahn-Klimroth
Random Perturbation of Sparse Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j8]Dennis Clemens
Maker-Breaker Games on Randomly Perturbed Graphs. SIAM J. Discret. Math. 35(4): 2723-2748 (2021) - [c3]Julia Böttcher
Cycle factors in randomly perturbed graphs. LAGOS 2021: 404-411 - [i2]Max Hahn-Klimroth, Olaf Parczyk, Yury Person:
Minimum degree conditions for containing an r-regular r-connected subgraph. CoRR abs/2108.07601 (2021) - 2020
- [j7]Olaf Parczyk
2-universality in randomly perturbed graphs. Eur. J. Comb. 87: 103118 (2020) - [j6]Omri Ben-Eliezer, Dan Hefetz
Semi-random graph process. Random Struct. Algorithms 56(3): 648-675 (2020) - [i1]Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk, Manuel Penschuck
Optimal group testing under real world restrictions. CoRR abs/2004.11860 (2020)
2010 – 2019
- 2019
- [j5]Julia Böttcher
Universality for bounded degree spanning trees in randomly perturbed graphs. Random Struct. Algorithms 55(4): 854-864 (2019) - [c2]Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar
Anti-Ramsey Threshold of Cycles for Sparse Graphs. LAGOS 2019: 89-98 - 2018
- [b1]Olaf Parczyk:
Spanning structures in random graphs and hypergraphs. Frankfurt University, Germany, 2018 - [c1]Peter Allen
Finding Tight Hamilton Cycles in Random Hypergraphs Faster. LATIN 2018: 28-36 - 2017
- [j4]Julia Böttcher
Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Electron. Notes Discret. Math. 61: 155-161 (2017) - 2016
- [j3]Samuel Hetterich, Olaf Parczyk, Yury Person:
On Universal Hypergraphs. Electron. J. Comb. 23(4): 4 (2016) - [j2]Olaf Parczyk
Spanning structures and universality in sparse hypergraphs. Random Struct. Algorithms 49(4): 819-844 (2016) - 2015
- [j1]Olaf Parczyk
On Spanning Structures in Random Hypergraphs. Electron. Notes Discret. Math. 49: 611-619 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-05 20:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: