Dense subgraphs in the H-free process. - Lutz Warnke (Discret. Math., 2011)

When does the K4-free process stop? - Lutz Warnke (Random Struct. Algorithms, 2014)

The Cℓ-free process. - Lutz Warnke (Random Struct. Algorithms, 2014)

The Janson inequalities for general up-sets. - Oliver Riordan; Lutz Warnke (Random Struct. Algorithms, 2015)

The evolution of subcritical Achlioptas processes. - Oliver Riordan; Lutz Warnke (Random Struct. Algorithms, 2015)

Convergence of Achlioptas Processes via Differential Equations with Unique Solutions. - Oliver Riordan; Lutz Warnke (Comb. Probab. Comput., 2016)

On the Method of Typical Bounded Differences. - Lutz Warnke (Comb. Probab. Comput., 2016)

The lower tail: Poisson approximation revisited. - Svante Janson; Lutz Warnke (Random Struct. Algorithms, 2016)

Preferential attachment without vertex growth: emergence of the giant component. - Svante Janson; Lutz Warnke (CoRR, 2019)

On Wormald's differential equation method. - Lutz Warnke (CoRR, 2019)

Large girth approximate Steiner triple systems. - Tom Bohman; Lutz Warnke (J. Lond. Math. Soc., 2019)

A counterexample to the DeMarco-Kahn upper tail conjecture. - Matas Sileikis; Lutz Warnke (Random Struct. Algorithms, 2019)

Packing Nearly Optimal Ramsey R(3, t) Graphs. - He Guo 002; Lutz Warnke (Comb., 2020)

Upper Tail Bounds for Stars. - Matas Sileikis; Lutz Warnke (Electron. J. Comb., 2020)

On the missing log in upper tail estimates. - Lutz Warnke (J. Comb. Theory, Ser. B, 2020)

Note on sunflowers. - Tolson Bell; Suchakree Chueluecha; Lutz Warnke (Discret. Math., 2021)

The degree-restricted random process is far from uniform. - Michael Molloy 001; Erlang Surya; Lutz Warnke (CoRR, 2022)

On the power of random greedy algorithms. - He Guo 002; Lutz Warnke (Eur. J. Comb., 2022)

Counting extensions revisited. - Matas Sileikis; Lutz Warnke (Random Struct. Algorithms, 2022)

The Density of Costas Arrays Decays Exponentially. - Lutz Warnke; Bill Correll Jr.; Christopher N. Swanson (IEEE Trans. Inf. Theory, 2023)

The jump of the clique chromatic number of random graphs. - Lyuben Lichev; Dieter Mitsche; Lutz Warnke (Random Struct. Algorithms, 2023)

Prague Dimension of Random Graphs. - He Guo 002; Kalen Patton; Lutz Warnke (Comb., 2023)

Bounds on Ramsey games via alterations. - He Guo 002; Lutz Warnke (J. Graph Theory, 2023)

Lagrange Inversion Formula by Induction. - Erlang Surya; Lutz Warnke (Am. Math. Mon., 2023)

On the Concentration of the Chromatic Number of Random Graphs. - Erlang Surya; Lutz Warnke (Electron. J. Comb., 2024)

The clique chromatic number of sparse random graphs. - Manuel Fernandez V; Lutz Warnke (CoRR, 2024)

On the typical structure of graphs not containing a fixed vertex-critical subgraph. - Oren Engelberg; Wojciech Samotij; Lutz Warnke (Random Struct. Algorithms, 2024)

Note on down-set thresholds. - Lutz Warnke (Random Struct. Algorithms, 2024)

Optimal Hardness of Online Algorithms for Large Independent Sets. - David Gamarnik; Eren C. Kizildag; Lutz Warnke (CoRR, 2025)

Isomorphisms Between Dense Random Graphs. - Erlang Surya; Lutz Warnke; Emily Zhu (Comb., 2025)