Random Graphs with Few Disjoint Cycles. - Valentas Kurauskas; Colin McDiarmid (Comb. Probab. Comput., 2011)

Clustering function: a measure of social influence - Mindaugas Bloznelis; Valentas Kurauskas (CoRR, 2012)

Recent Progress in Complex Network Analysis: Models of Random Intersection Graphs. - Mindaugas Bloznelis; Erhard Godehardt; Jerzy Jaworski; Valentas Kurauskas; Katarzyna Rybarczyk (ECDA, 2013)

Recent Progress in Complex Network Analysis: Properties of Random Intersection Graphs. - Mindaugas Bloznelis; Erhard Godehardt; Jerzy Jaworski; Valentas Kurauskas; Katarzyna Rybarczyk (ECDA, 2013)

On small subgraphs in a random intersection digraph. - Valentas Kurauskas (Discret. Math., 2013)

Random graphs containing few disjoint excluded minors. - Colin McDiarmid; Valentas Kurauskas (Random Struct. Algorithms, 2014)

On the Chromatic Index of Random Uniform Hypergraphs. - Valentas Kurauskas; Katarzyna Rybarczyk (SIAM J. Discret. Math., 2015)

Clustering function: another view on clustering coefficient. - Mindaugas Bloznelis; Valentas Kurauskas (J. Complex Networks, 2016)

Large Cliques in Sparse Random Intersection Graphs. - Mindaugas Bloznelis; Valentas Kurauskas (Electron. J. Comb., 2017)

On the genus of the complete tripartite graph Kn, n, 1. - Valentas Kurauskas (Discret. Math., 2017)

On the Littlewood-Offord problem for arbitrary distributions. - Tomas Juskevicius; Valentas Kurauskas (Random Struct. Algorithms, 2021)

On local weak limit and subgraph counts for sparse random graphs. - Valentas Kurauskas (J. Appl. Probab., 2022)

Estimating Global Subgraph Counts by Sampling. - Svante Janson; Valentas Kurauskas (Electron. J. Comb., 2023)

Anticoncentration of Random Vectors via the Strong Perfect Graph Theorem. - Tomas Juskevicius; Valentas Kurauskas (Comb., 2025)