Feature Extraction Algorithm for Banknote Textures Based on Incomplete Shift Invariant Wavelet Packet Transform. - Stefan Glock; Eugen Gillich; Johannes Schaede; Volker Lohweg (DAGM-Symposium, 2009)

On the f-matching polytope and the fractional f-chromatic index. - Stefan Glock (Int. J. Comput. Math., 2015)

Optimal path and cycle decompositions of dense quasirandom graphs. - Stefan Glock; Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2016)

On the decomposition threshold of a given graph. - Stefan Glock; Daniela Kühn; Allan Lo; Richard Montgomery 001; Deryk Osthus (J. Comb. Theory B, 2019)

Euler Tours in Hypergraphs. - Stefan Glock; Felix Joos; Daniela Kühn; Deryk Osthus (Comb., 2020)

On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems. - Stefan Glock; Daniela Kühn; Allan Lo; Deryk Osthus (Comb., 2020)

Pseudorandom hypergraph matchings. - Stefan Ehard; Stefan Glock; Felix Joos (Comb. Probab. Comput., 2020)

Minimalist designs. - Ben Barber; Stefan Glock; Daniela Kühn; Allan Lo; Richard Montgomery 001; Deryk Osthus (Random Struct. Algorithms, 2020)

A rainbow blow-up lemma. - Stefan Glock; Felix Joos (Random Struct. Algorithms, 2020)

Extremal aspects of graph and hypergraph decomposition problems. - Stefan Glock; Daniela Kühn; Deryk Osthus (BCC, 2021)

The n-queens completion problem. - Stefan Glock; David Munhá Correia; Benny Sudakov (CoRR, 2021)

Counting Hamilton cycles in Dirac hypergraphs. - Stefan Glock; Stephen Gould; Felix Joos; Daniela Kühn; Deryk Osthus (Comb. Probab. Comput., 2021)

Decompositions into isomorphic rainbow spanning trees. - Stefan Glock; Daniela Kühn; Richard Montgomery 001; Deryk Osthus (J. Comb. Theory B, 2021)

Short proofs for long induced paths. - Nemanja Draganic; Stefan Glock; Michael Krivelevich (Comb. Probab. Comput., 2022)

An average degree condition for independent transversals. - Stefan Glock; Benny Sudakov (J. Comb. Theory B, 2022)

The largest hole in sparse random graphs. - Nemanja Draganic; Stefan Glock; Michael Krivelevich (Random Struct. Algorithms, 2022)

Conflict-free hypergraph matchings. - Stefan Glock; Felix Joos; Jaehoon Kim; Marcus Kühn; Lyuben Lichev (SODA, 2023)

Tight Hamilton cycles with high discrepancy. - Lior Gishboliner; Stefan Glock; Amedeo Sgueglia (Comb. Probab. Comput., 2025)