Valentas Kurauskas

14 papers Journal 12Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Anticoncentration of Random Vectors via the Strong Perfect Graph Theorem.
Comb.
Tomas Juskevicius, Valentas Kurauskas
2023 J jnl
Estimating Global Subgraph Counts by Sampling.
Electron. J. Comb.
Svante Janson, Valentas Kurauskas
2022 J jnl
On local weak limit and subgraph counts for sparse random graphs.
J. Appl. Probab.
Valentas Kurauskas
2021 J jnl
On the Littlewood-Offord problem for arbitrary distributions.
Random Struct. Algorithms
Tomas Juskevicius, Valentas Kurauskas
2017 J jnl
Large Cliques in Sparse Random Intersection Graphs.
Electron. J. Comb.
Mindaugas Bloznelis, Valentas Kurauskas
2017 J jnl
On the genus of the complete tripartite graph K
Discret. Math.
Valentas Kurauskas
2016 J jnl
Clustering function: another view on clustering coefficient.
J. Complex Networks
Mindaugas Bloznelis, Valentas Kurauskas
2015 J jnl
On the Chromatic Index of Random Uniform Hypergraphs.
SIAM J. Discret. Math.
Valentas Kurauskas, Katarzyna Rybarczyk
2014 J jnl
Random graphs containing few disjoint excluded minors.
Random Struct. Algorithms
Colin McDiarmid, Valentas Kurauskas
2013 J jnl
On small subgraphs in a random intersection digraph.
Discret. Math.
Valentas Kurauskas
2013 — conf
Recent Progress in Complex Network Analysis: Models of Random Intersection Graphs.
ECDA
Mindaugas Bloznelis, Erhard Godehardt, Jerzy Jaworski, Valentas Kurauskas, Katarzyna Rybarczyk
2013 — conf
Recent Progress in Complex Network Analysis: Properties of Random Intersection Graphs.
ECDA
Mindaugas Bloznelis, Erhard Godehardt, Jerzy Jaworski, Valentas Kurauskas, Katarzyna Rybarczyk
2012 J jnl
Clustering function: a measure of social influence
CoRR
Mindaugas Bloznelis, Valentas Kurauskas
2011 J jnl
Random Graphs with Few Disjoint Cycles.
Comb. Probab. Comput.
Valentas Kurauskas, Colin McDiarmid