On the Upper Tail of Counts of Strictly Balanced Subgraphs. - Matas Sileikis (Electron. J. Comb., 2012)

Optimal Probability Inequalities for Random Walks Related to Problems in Extremal Combinatorics. - D. Dzindzalieta; Tomas Juskevicius; Matas Sileikis (SIAM J. Discret. Math., 2012)

Approximate counting of regular hypergraphs. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001; Matas Sileikis (Inf. Process. Lett., 2013)

Loose Hamilton Cycles in Regular Hypergraphs. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001; Matas Sileikis (Comb. Probab. Comput., 2015)

Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in m-ary Search Trees and Preferential Attachment Trees. - Cecilia Holmgren; Svante Janson; Matas Sileikis (Electron. J. Comb., 2017)

Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001; Matas Sileikis (J. Comb. Theory B, 2017)

Asymptotic Normality of Almost Local Functionals in Conditioned Galton-Watson Trees. - Dimbinaina Ralaivaosaona; Matas Sileikis; Stephan G. Wagner (AofA, 2018)

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

A Central Limit Theorem for Almost Local Additive Tree Functionals. - Dimbinaina Ralaivaosaona; Matas Sileikis; Stephan G. Wagner (Algorithmica, 2020)

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

On the Intersections of Non-homotopic Loops. - Václav Blazej; Michal Opler; Matas Sileikis; Pavel Valtr 001 (CALDAM, 2021)

Non-homotopic Loops with a Bounded Number of Pairwise Intersections. - Václav Blazej; Michal Opler; Matas Sileikis; Pavel Valtr 001 (GD, 2021)

A limit theorem for small cliques in inhomogeneous random graphs. - Jan Hladký; Christos Pelekis; Matas Sileikis (J. Graph Theory, 2021)

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

Sandwiching biregular random graphs. - Tereza Klimosová; Christian Reiher; Andrzej Rucinski 001; Matas Sileikis (Comb. Probab. Comput., 2023)

Prominent examples of flip processes. - Pedro Araújo; Jan Hladký; Eng Keat Hng; Matas Sileikis (Random Struct. Algorithms, 2024)