Nicola Apollonio

37 papers B 2C 2Journal 32Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs.
Discret. Appl. Math.
Nicola Apollonio
2025 J jnl
Simulating Posterior Bayesian Neural Networks with Dependent Weights.
CoRR
Nicola Apollonio, Giovanni Franzina, Giovanni Luca Torrisi
2024 J jnl
Cantelli's Bounds for Generalized Tail Inequalities.
Axioms
Nicola Apollonio
2024 J jnl
Second-order moments of the size of randomly induced subgraphs of given order.
Discret. Appl. Math.
Nicola Apollonio
2023 J jnl
Evaluating homophily in networks via
Bioinform.
Nicola Apollonio, Daniel J. Blankenberg, Fabio Cumbo, Paolo Giulio Franciosa, Daniele Santoni
2023 — conf
Homophily of Large Weighted Networks in a Data Streaming Setting.
CIBB
Nicola Apollonio, Paolo Giulio Franciosa, Daniele Santoni
2023 J jnl
Second-order moments of the size of randomly induced subgraphs of given order.
CoRR
Nicola Apollonio
2023 J jnl
Two new characterizations of path graphs.
Discret. Math.
Nicola Apollonio, Lorenzo Balzotti
2022 J jnl
A tight relation between series-parallel graphs and bipartite distance hereditary graphs.
Art Discret. Appl. Math.
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa, Jean-François Mascari
2022 J jnl
Two New Characterizations of Path Graphs.
CoRR
Nicola Apollonio, Lorenzo Balzotti
2021 J jnl
On function homophily of microbial Protein-Protein Interaction Networks.
CoRR
Nicola Apollonio, Paolo Giulio Franciosa, Daniele Santoni
2019 J jnl
A New Characterization of Path Graphs.
CoRR
Nicola Apollonio, Lorenzo Balzotti
2017 J jnl
On computing the Galois lattice of bipartite distance hereditary graphs.
Discret. Appl. Math.
Nicola Apollonio, Paolo Giulio Franciosa
2015 J jnl
A tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs.
CoRR
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa, Jean-François Mascari
2015 J jnl
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths.
SIAM J. Discret. Math.
Nicola Apollonio, Anna Galluccio
2015 J jnl
On Computing the Galois Lattice of Bipartite Distance Hereditary Graphs.
CoRR
Nicola Apollonio, Paolo Giulio Franciosa
2015 J jnl
On the Galois lattice of bipartite distance hereditary graphs.
Discret. Appl. Math.
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
2014 J jnl
Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs.
SIAM J. Discret. Math.
Nicola Apollonio, Bruno Simeone
2014 J jnl
Minimally unbalanced diamond-free graphs and Dyck-paths.
CoRR
Nicola Apollonio, Anna Galluccio
2014 C conf
On the Galois Lattice of Bipartite Distance Hereditary Graphs.
IWOCA
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
2014 J jnl
On the Galois Lattice of Bipartite Distance Hereditary Graphs.
CoRR
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
2014 J jnl
The maximum vertex coverage problem on bipartite graphs.
Discret. Appl. Math.
Nicola Apollonio, Bruno Simeone
2013 J jnl
Mengerian quasi-graphical families and clutters.
Eur. J. Comb.
Nicola Apollonio, Massimiliano Caramia
2013 J jnl
On a facility location problem with applications to tele-diagnostic.
Optim. Lett.
Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano
2011 J jnl
Recognizing Helly Edge-Path-Tree graphs and their clique graphs.
Discret. Appl. Math.
Nicola Apollonio, Massimiliano Caramia
2010 J jnl
On the maximum q-colourable induced subgraph problem in perfect graphs.
Int. J. Math. Oper. Res.
Nicola Apollonio, Massimiliano Caramia
2009 J jnl
A superclass of Edge-Path-Tree graphs with few cliques.
Oper. Res. Lett.
Nicola Apollonio, Massimiliano Caramia
2009 J jnl
Bicolored graph partitioning, or: gerrymandering at its worst.
Discret. Appl. Math.
Nicola Apollonio, Ronald I. Becker, Isabella Lari, Federica Ricca, Bruno Simeone
2009 C conf
Integrality Properties of Certain Special Balanceable Families.
IWOCA
Nicola Apollonio, Massimiliano Caramia
2009 J jnl
Integrality properties of edge path tree families.
Discret. Math.
Nicola Apollonio
2009 J jnl
Minconvex Factors of Prescribed Size in Graphs.
SIAM J. Discret. Math.
Nicola Apollonio, András Sebö
2009 J jnl
On the complexity of recognizing directed path families.
Discret. Appl. Math.
Nicola Apollonio, Paolo Giulio Franciosa
2008 J jnl
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs.
Networks
Nicola Apollonio, Isabella Lari, Federica Ricca, Bruno Simeone, Justo Puerto
2007 J jnl
A characterization of partial directed line graphs.
Discret. Math.
Nicola Apollonio, Paolo Giulio Franciosa
2004 B conf
A Stochastic Location Problem with Applications to Tele-diagnostic.
WG
Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano
2004 J jnl
Cardinality constrained path covering problems in grid graphs.
Networks
Nicola Apollonio, Lou Caccetta, Bruno Simeone
2004 B conf
Minsquare Factors and Maxfix Covers of Graphs.
IPCO
Nicola Apollonio, András Sebö