default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Glock
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c3]Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev:
Conflict-free hypergraph matchings. SODA 2023: 2991-3005- 2022
- [j14]Nemanja Draganic
, Stefan Glock, Michael Krivelevich:
Short proofs for long induced paths. Comb. Probab. Comput. 31(5): 870-878 (2022) - [j13]Stefan Glock, Benny Sudakov:
An average degree condition for independent transversals. J. Comb. Theory B 154: 370-391 (2022) - [j12]Nemanja Draganic, Stefan Glock, Michael Krivelevich:
The largest hole in sparse random graphs. Random Struct. Algorithms 61(4): 666-677 (2022) - 2021
- [j11]Stefan Glock, Stephen Gould, Felix Joos, Daniela Kühn, Deryk Osthus:
Counting Hamilton cycles in Dirac hypergraphs. Comb. Probab. Comput. 30(4): 631-653 (2021) - [j10]Stefan Glock, Daniela Kühn, Richard Montgomery, Deryk Osthus:
Decompositions into isomorphic rainbow spanning trees. J. Comb. Theory B 146: 439-484 (2021) - [c2]Stefan Glock, Daniela Kühn, Deryk Osthus:
Extremal aspects of graph and hypergraph decomposition problems. BCC 2021: 235-266 - [i1]Stefan Glock, David Munhá Correia, Benny Sudakov:
The n-queens completion problem. CoRR abs/2111.11402 (2021) - 2020
- [j9]Stefan Glock, Daniela Kühn, Allan Lo, Deryk Osthus:
On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems. Comb. 40(3): 363-403 (2020) - [j8]Stefan Glock, Felix Joos, Daniela Kühn, Deryk Osthus:
Euler Tours in Hypergraphs. Comb. 40(5): 679-690 (2020) - [j7]Stefan Ehard, Stefan Glock, Felix Joos:
Pseudorandom hypergraph matchings. Comb. Probab. Comput. 29(6): 868-885 (2020) - [j6]Stefan Glock, Felix Joos:
A rainbow blow-up lemma. Random Struct. Algorithms 56(4): 1031-1069 (2020) - [j5]Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus:
Minimalist designs. Random Struct. Algorithms 57(1): 47-63 (2020)
2010 – 2019
- 2019
- [j4]Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus:
On the decomposition threshold of a given graph. J. Comb. Theory B 139: 47-127 (2019) - 2016
- [j3]Stefan Glock, Daniela Kühn, Deryk Osthus:
Optimal path and cycle decompositions of dense quasirandom graphs. J. Comb. Theory B 118: 88-108 (2016) - 2015
- [j2]Stefan Glock, Daniela Kühn, Deryk Osthus:
Optimal path and cycle decompositions of dense quasirandom graphs. Electron. Notes Discret. Math. 49: 65-72 (2015) - [j1]Stefan Glock:
On the f-matching polytope and the fractional f-chromatic index. Int. J. Comput. Math. 92(6): 1135-1142 (2015)
2000 – 2009
- 2009
- [c1]Stefan Glock, Eugen Gillich, Johannes Schaede, Volker Lohweg:
Feature Extraction Algorithm for Banknote Textures Based on Incomplete Shift Invariant Wavelet Packet Transform. DAGM-Symposium 2009: 422-431
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 2024-06-10 20:31 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:
