Reducing Network Congestion and Blocking Probability Through Balanced Allocation. - Malwina J. Luczak; Eli Upfal (FOCS, 1999)

Bisecting sparse random graphs. - Malwina J. Luczak; Colin McDiarmid (Random Struct. Algorithms, 2001)

Optimal arrangement of data in a tree directory. - Malwina J. Luczak; Steven D. Noble (Discret. Appl. Math., 2002)

Concentration for locally acting permutations. - Malwina J. Luczak; Colin J. H. McDiarmid (Discret. Math., 2003)

Building uniformly random subtrees. - Malwina J. Luczak; Peter Winkler 001 (Random Struct. Algorithms, 2004)

The phase transition in the cluster-scaled model of a random graph. - Malwina J. Luczak; Tomasz Luczak 001 (Random Struct. Algorithms, 2006)

A simple solution to the k-core problem. - Svante Janson; Malwina J. Luczak (Random Struct. Algorithms, 2007)

A new approach to the giant component problem. - Svante Janson; Malwina J. Luczak (Random Struct. Algorithms, 2009)

The second largest component in the supercritical 2D Hamming graph. - Remco van der Hofstad; Malwina J. Luczak; Joel Spencer (Random Struct. Algorithms, 2010)

Order-Invariant Measures on Fixed Causal Sets. - Graham R. Brightwell; Malwina J. Luczak (Comb. Probab. Comput., 2012)

Law of large numbers for the SIR epidemic on a random graph with given degrees. - Svante Janson; Malwina J. Luczak; Peter Windridge (Random Struct. Algorithms, 2014)

The Greedy Independent Set in a Random Graph with Given Degrees. - Graham R. Brightwell; Svante Janson; Malwina J. Luczak (Random Struct. Algorithms, 2017)

Component structure of the configuration model: Barely supercritical case. - Remco van der Hofstad; Svante Janson; Malwina J. Luczak (Random Struct. Algorithms, 2019)