Valentas Kurauskas

According to our database, Valentas Kurauskas authored at least 13 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Estimating Global Subgraph Counts by Sampling.

Svante Janson, Valentas Kurauskas

Electron. J. Comb., 2023

2022

On local weak limit and subgraph counts for sparse random graphs.

Valentas Kurauskas

J. Appl. Probab., 2022

2021

On the Littlewood-Offord problem for arbitrary distributions.

Tomas Juskevicius, Valentas Kurauskas

Random Struct. Algorithms, 2021

2017

On the genus of the complete tripartite graph K_{n, n, 1}.

Valentas Kurauskas

Discret. Math., 2017

Large Cliques in Sparse Random Intersection Graphs.

Mindaugas Bloznelis, Valentas Kurauskas

Electron. J. Comb., 2017

2016

Clustering function: another view on clustering coefficient.

Mindaugas Bloznelis, Valentas Kurauskas

J. Complex Networks, 2016

2015

On the Chromatic Index of Random Uniform Hypergraphs.

Valentas Kurauskas, Katarzyna Rybarczyk

SIAM J. Discret. Math., 2015

2014

Random graphs containing few disjoint excluded minors.

Colin McDiarmid, Valentas Kurauskas

Random Struct. Algorithms, 2014

2013

On small subgraphs in a random intersection digraph.

Valentas Kurauskas

Discret. Math., 2013

Recent Progress in Complex Network Analysis: Properties of Random Intersection Graphs.

Mindaugas Bloznelis, Erhard Godehardt, Jerzy Jaworski, Valentas Kurauskas, Katarzyna Rybarczyk

Proceedings of the Data Science, 2013

Recent Progress in Complex Network Analysis: Models of Random Intersection Graphs.

Mindaugas Bloznelis, Erhard Godehardt, Jerzy Jaworski, Valentas Kurauskas, Katarzyna Rybarczyk

Proceedings of the Data Science, 2013

2012

Clustering function: a measure of social influence

Mindaugas Bloznelis, Valentas Kurauskas

CoRR, 2012

2011

Random Graphs with Few Disjoint Cycles.

Valentas Kurauskas, Colin McDiarmid

Comb. Probab. Comput., 2011