CNR Institutional Research Information System

APOLLONIO, NICOLA

APOLLONIO, NICOLA  

Istituto Applicazioni del Calcolo ''Mauro Picone''  

Mostra records
Risultati 1 - 20 di 24 (tempo di esecuzione: 0.048 secondi).
Titolo Data di pubblicazione Autore(i) File
Normal Approximation of Random Gaussian Neural Networks 1-gen-2024 Apollonio, Nicola; DE CANDITIIS, Daniela; Franzina, Giovanni; Stolfi, Paola; Torrisi, GIOVANNI LUCA
Second-order moments of the size of randomly induced subgraphs of given order 1-gen-2024 Apollonio, Nicola
Network homophily via tail inequalities 1-gen-2023 Apollonio, Nicola; Franciosa, ; Paolo, G; Santoni, Daniele
Two new characterizations of path graphs 1-gen-2023 Apollonio, Nicola; Balzotti, Lorenzo
A novel method for assessing and measuring homophily in networks through second-order statistics 1-gen-2022 Apollonio, N; Franciosa, Pg; Santoni, D
A tight relation between series-parallel graphs and bipartite distance hereditary graphs 1-gen-2022 Apollonio, N.; Caramia, M.; Franciosa, P. G.; Mascari, J. -F.
Evaluating homophily in networks via HONTO (HOmophily Network TOol): a case study of chromosomal interactions in human PPI networks 1-gen-2022 Apollonio, Nicola; Blankenberg, Daniel; Cumbo, Fabio; Giulio Franciosa, Paolo; Santoni, Daniele
A tight relation between series-parallel graphs and bipartite distance hereditary graphs 1-gen-2020 Nicola Apollonio;Massimiliano Caramia;Paolo Giulio Franciosa;JeanFranc ois Mascari ;
On computing the Galois Lattice of Bipartite Distance Hereditary graphs 1-gen-2017 Apollonio, Nicola; Giulio Franciosa, Paolo
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths 1-gen-2015 Apollonio, Nicola; Galluccio, Anna
On the Galois lattice of bipartite distance hereditary graphs 1-gen-2015 Apollonio, Nicola; Caramia, Massimiliano; Franciosa, Paolo Giulio
IMPROVED APPROXIMATION OF MAXIMUM VERTEX COVERAGE PROBLEM ON BIPARTITE GRAPHS 1-gen-2014 Apollonio, Nicola; Simeone, Bruno
The maximum vertex coverage problem on bipartite graphs 1-gen-2013 Apollonio, Nicola; Simeone, Bruno
Mengerian quasi-graphical families and clutters 1-gen-2012 Apollonio, Nicola; Caramia, Massimiliano
On a facility location problem with applications to tele-diagnostic 1-gen-2012 Apollonio, N; Caramia, M; F Italiano, G
Recognizing Helly Edge-Path-Tree graphs and their clique graphs. 1-gen-2011 Apollonio N.; Caramia M.
A superclass of Edge-Path-Tree graphs with few cliques 1-gen-2009 Apollonio N; Caramia M
Bicolored graph partitioning, or: gerrymandering at its worst. 1-gen-2009 Apollonio, N; Becker, R; Lari, I; Ricca, F; Simeone, B
Integrality properties of edge path tree families 1-gen-2009 Apollonio N
Minconvex Factors of Prescribed Size in Graphs 1-gen-2009 Apollonio N; Sebo A