VU Duomenų mokslo ir skaitmeninių technologijų instituto / Matematikos ir informatikos instituto autoriaus (-ių) 'Valentas Kurauskas' publikacijų sąrašas (pagal Lietuvos akademinių bibliotekų tinklo (LABT) publikacijų bazes VUB [nuo 2011 m. iki dabar] ir LMAVB [iki 2010 m. imtinai]):
Publications of 'Valentas Kurauskas', VU Institute of Data Science and Digital Technologies / Institute of Mathematics and Informatics (based on 1. Lithuanian Academic Library Network (LABT) database of Vilnius University Library [since 2011 until now] and 2. LABT database of Wroblewski Library of the Lithuanian Academy of Sciences [until 2010]):
Eil. Nr. Publikacija
1Bloznelis, Mindaugas; Kurauskas, Valentas. Clustering coefficient of random intersection graphs with infinite degree variance // Internet mathematics : Ryerson University. ISSN 1542-7951. eISSN 1944-9488. 2017, Vol. 1, no. 1, p. [1-23]. DOI: 10.24166/im.02.2017.
2Bloznelis, Mindaugas; Kurauskas, Valentas. Large cliques in sparse random intersection graphs // Electronic journal of combinatorics. Clemson : Electronic Journal of Combinatorics. ISSN 1077-8926. 2017, Vol. 24, no 2, P2.5 [p. 1-26]. Prieiga per internetą: <http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p5/0>.
3Laužikas, Rimvydas; Kuncevičius, Albinas; Kurauskas, Valentas; Žižiūnas, Tadas; Šmigelskas, Marius; Augustinavičius, Renaldas; Žilinskas, Egidijus. Kultūros paveldo informacijos pusiau automatinis valdymas ir tyrimai naudojant 3D technologijas = The semi-automated management of cultural heritage information and investigations in implementing 3D technologies // Informacijos mokslai. Vilnius : Vilniaus universiteto leidykla. ISSN 1392-0561. 2017, T. 77, p. 160-179. DOI: 10.15388/Im.2017.77.10712.
4Bloznelis, Mindaugas; Kurauskas, Valentas. Clustering function: Another view on clustering coefficient // Journal of complex networks. Oxford : Oxford University press. ISSN 2051-1310. eISSN 2051-1329. 2016, Vol. 4, No. 1, p. 61-86. DOI: 10.1093/comnet/cnv010.
5Kurauskas, Valentas. On the genus of the complete tripartite graph Kn,n,1 // Discrete mathematics. Amsterdam : Elsevier Science BV. ISSN 0012-365X. eISSN 1872-681X. 2017, Vol. 340, no. 3, p. 508-515. DOI: 10.1016/j.disc.2016.09.017.
6McDiarmid, Colin; Kurauskas, Valentas. Random graphs containing few disjoint excluded minors // Random structures and algorithms. Hoboken : John Wiley & Sons, Inc. ISSN 1042-9832. 2014, vol. 44, no 2, p. 240-268. DOI: 10.1002/rsa.20447.
7Kurauskas, Valentas. On graphs containing few disjoint excluded minors. Asymptotic number and structure of graphs containing few disjoint minors K4 // RS&A2013 : 16th International Conference on Random Structures and Algorithms, Poznan, Poland, 5-9 August, 2013 [Internete]. Poznan : Adam Mickiewicz University. 2013, [1 p.]. Prieiga per internetą: <http://rsa2013.amu.edu.pl/abstracts/Kurauskas.Valentas.pdf>.