DOI,IST REx ID,Research Group,Title of publication
10.37236/11471,13042,MaKw,A note on long cycles in sparse random graphs
10.5817/cz.muni.eurocomb23-005,14867,MaKw,Constructing Hamilton cycles and perfect matchings efficiently
10.37236/11714,14319,MaKw,Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
10.1137/1.9781611977554.ch88,14344,MaKw,Fast algorithms for solving the Hamilton cycle problem with high probability
10.1007/s11856-023-2513-9,14444,MaKw,Substructures in Latin squares
10.1017/fmp.2023.17,14499,MaKw,"Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture"
10.1002/rsa.21106,11706,MaKw,Asymmetric Ramsey properties of random graphs involving cliques and cycles
10.37236/10794,12286,MaKw,Loose cores and cycles in random hypergraphs
10.1109/FOCS54457.2022.00091,12432,MaKw,Solving the Hamilton cycle problem fast on average
10.1109/TIT.2022.3148779,10775,MaKw,List-decodability with large radius for Reed-Solomon codes
10.1109/FOCS52979.2021.00075,11145,MaKw,List-decodability with large radius for Reed-Solomon codes
10.1112/blms.12638,11186,MaKw,Large deviations in random latin squares
10.1090/tran/8614,11443,MaKw,Extension complexity of low-dimensional polytopes
10.37236/10607,11740,MaKw,Phase transition in cohomology groups of non-uniform random simplicial complexes
10.1007/s10474-022-01265-8,12151,MaKw,On a question of Vera T. Sós about size forcing of graphons