Stefan Glock

According to our database1, Stefan Glock authored at least 17 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Conflict-free hypergraph matchings.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
The largest hole in sparse random graphs.
Random Struct. Algorithms, 2022

An average degree condition for independent transversals.
J. Comb. Theory B, 2022

Short proofs for long induced paths.
Comb. Probab. Comput., 2022

2021
Decompositions into isomorphic rainbow spanning trees.
J. Comb. Theory B, 2021

Counting Hamilton cycles in Dirac hypergraphs.
Comb. Probab. Comput., 2021

The n-queens completion problem.
CoRR, 2021

Extremal aspects of graph and hypergraph decomposition problems.
Proceedings of the Surveys in Combinatorics, 2021

2020
A rainbow blow-up lemma.
Random Struct. Algorithms, July, 2020

Minimalist designs.
Random Struct. Algorithms, 2020

Pseudorandom hypergraph matchings.
Comb. Probab. Comput., 2020

On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems.
Comb., 2020

Euler Tours in Hypergraphs.
Comb., 2020

2019
On the decomposition threshold of a given graph.
J. Comb. Theory B, 2019

2016
Optimal path and cycle decompositions of dense quasirandom graphs.
J. Comb. Theory B, 2016

2015
On the <i>f</i>-matching polytope and the fractional <i>f</i>-chromatic index.
Int. J. Comput. Math., 2015

2009
Feature Extraction Algorithm for Banknote Textures Based on Incomplete Shift Invariant Wavelet Packet Transform.
Proceedings of the Pattern Recognition, 2009


  Loading...