DOI,IST REx ID,Research Group,Title of publication
10.1112/blms.70464,22752,MaKw,A short proof of a central limit theorem for the order of the giant component and k-core
10.1016/j.dam.2024.10.002,18478,MaKw,On the chromatic number of powers of subdivisions of graphs
10.1017/fms.2024.144,19433,MaKw,"Extremal, enumerative and probabilistic results on ordered hypergraph matchings"
10.1002/rsa.21286,19440,MaKw,The completion numbers of hamiltonicity and pancyclicity in random graphs
10.1002/jcd.21990,19798,MaKw,A note on finding large transversals efficiently
10.1145/3717823.3718173,20007,MaKw,Smoothed analysis for graph isomorphism
10.1112/jlms.70010,18583,MaKw,Partitioning problems via random processes
10.1214/24-ECP639,18655,MaKw,Climbing up a random subgraph of the hypercube
10.1007/978-3-031-78011-0_14,18702,"MaKw,KrPi","The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging"
10.37236/11471,13042,MaKw,A note on long cycles in sparse random graphs
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.5817/cz.muni.eurocomb23-005,14867,MaKw,Constructing Hamilton cycles and perfect matchings efficiently
10.1109/FOCS54457.2022.00091,12432,MaKw,Solving the Hamilton cycle problem fast on average