Minsquare Factors and Maxfix Covers of Graphs. - Nicola Apollonio; András Sebö (IPCO, 2004)

A Stochastic Location Problem with Applications to Tele-diagnostic. - Nicola Apollonio; Massimiliano Caramia; Giuseppe F. Italiano (WG, 2004)

Cardinality constrained path covering problems in grid graphs. - Nicola Apollonio; Lou Caccetta; Bruno Simeone (Networks, 2004)

A characterization of partial directed line graphs. - Nicola Apollonio; Paolo Giulio Franciosa (Discret. Math., 2007)

Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs. - Nicola Apollonio; Isabella Lari; Federica Ricca; Bruno Simeone; Justo Puerto (Networks, 2008)

Integrality Properties of Certain Special Balanceable Families. - Nicola Apollonio; Massimiliano Caramia (IWOCA, 2009)

Bicolored graph partitioning, or: gerrymandering at its worst. - Nicola Apollonio; Ronald I. Becker; Isabella Lari; Federica Ricca; Bruno Simeone (Discret. Appl. Math., 2009)

On the complexity of recognizing directed path families. - Nicola Apollonio; Paolo Giulio Franciosa (Discret. Appl. Math., 2009)

Integrality properties of edge path tree families. - Nicola Apollonio (Discret. Math., 2009)

A superclass of Edge-Path-Tree graphs with few cliques. - Nicola Apollonio; Massimiliano Caramia (Oper. Res. Lett., 2009)

Minconvex Factors of Prescribed Size in Graphs. - Nicola Apollonio; András Sebö (SIAM J. Discret. Math., 2009)

On the maximum q-colourable induced subgraph problem in perfect graphs. - Nicola Apollonio; Massimiliano Caramia (Int. J. Math. Oper. Res., 2010)

Recognizing Helly Edge-Path-Tree graphs and their clique graphs. - Nicola Apollonio; Massimiliano Caramia (Discret. Appl. Math., 2011)

Mengerian quasi-graphical families and clutters. - Nicola Apollonio; Massimiliano Caramia (Eur. J. Comb., 2013)

On a facility location problem with applications to tele-diagnostic. - Nicola Apollonio; Massimiliano Caramia; Giuseppe F. Italiano (Optim. Lett., 2013)

The maximum vertex coverage problem on bipartite graphs. - Nicola Apollonio; Bruno Simeone (Discret. Appl. Math., 2014)

Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs. - Nicola Apollonio; Bruno Simeone (SIAM J. Discret. Math., 2014)

On the Galois lattice of bipartite distance hereditary graphs. - Nicola Apollonio; Massimiliano Caramia; Paolo Giulio Franciosa (Discret. Appl. Math., 2015)

Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths. - Nicola Apollonio; Anna Galluccio (SIAM J. Discret. Math., 2015)

On computing the Galois lattice of bipartite distance hereditary graphs. - Nicola Apollonio; Paolo Giulio Franciosa (Discret. Appl. Math., 2017)

A New Characterization of Path Graphs. - Nicola Apollonio; Lorenzo Balzotti (CoRR, 2019)

On function homophily of microbial Protein-Protein Interaction Networks. - Nicola Apollonio; Paolo Giulio Franciosa; Daniele Santoni (CoRR, 2021)

A tight relation between series-parallel graphs and bipartite distance hereditary graphs. - Nicola Apollonio; Massimiliano Caramia; Paolo Giulio Franciosa; Jean-François Mascari (Art Discret. Appl. Math., 2022)

Homophily of Large Weighted Networks in a Data Streaming Setting. - Nicola Apollonio; Paolo Giulio Franciosa; Daniele Santoni (CIBB, 2023)

Evaluating homophily in networks via HONTO (HOmophily Network TOol): a case study of chromosomal interactions in human PPI networks. - Nicola Apollonio; Daniel Blankenberg; Fabio Cumbo; Paolo Giulio Franciosa; Daniele Santoni (Bioinform., 2023)

Two new characterizations of path graphs. - Nicola Apollonio; Lorenzo Balzotti (Discret. Math., 2023)

Second-order moments of the size of randomly induced subgraphs of given order. - Nicola Apollonio (Discret. Appl. Math., 2024)

Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs. - Nicola Apollonio (Discret. Appl. Math., 2025)

Simulating Posterior Bayesian Neural Networks with Dependent Weights. - Nicola Apollonio; Giovanni Franzina; Giovanni Luca Torrisi (CoRR, 2025)