Nicola Apollonio

Orcid: 0000-0001-6089-1333

According to our database1, Nicola Apollonio authored at least 26 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

2023
Two new characterizations of path graphs.
Discret. Math., December, 2023

Evaluating homophily in networks via <i>HONTO</i> (HOmophily Network TOol): a case study of chromosomal interactions in human PPI networks.
Bioinform., January, 2023

2022
A tight relation between series-parallel graphs and bipartite distance hereditary graphs.
Art Discret. Appl. Math., 2022

2021
On function homophily of microbial Protein-Protein Interaction Networks.
CoRR, 2021

2019
A New Characterization of Path Graphs.
CoRR, 2019

2017
On computing the Galois lattice of bipartite distance hereditary graphs.
Discret. Appl. Math., 2017

2015
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths.
SIAM J. Discret. Math., 2015

On the Galois lattice of bipartite distance hereditary graphs.
Discret. Appl. Math., 2015

2014
Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs.
SIAM J. Discret. Math., 2014

The maximum vertex coverage problem on bipartite graphs.
Discret. Appl. Math., 2014

2013
On a facility location problem with applications to tele-diagnostic.
Optim. Lett., 2013

Mengerian quasi-graphical families and clutters.
Eur. J. Comb., 2013

2011
Recognizing Helly Edge-Path-Tree graphs and their clique graphs.
Discret. Appl. Math., 2011

2010
On the maximum q-colourable induced subgraph problem in perfect graphs.
Int. J. Math. Oper. Res., 2010

2009
Minconvex Factors of Prescribed Size in Graphs.
SIAM J. Discret. Math., 2009

A superclass of Edge-Path-Tree graphs with few cliques.
Oper. Res. Lett., 2009

Integrality properties of edge path tree families.
Discret. Math., 2009

On the complexity of recognizing directed path families.
Discret. Appl. Math., 2009

Bicolored graph partitioning, or: gerrymandering at its worst.
Discret. Appl. Math., 2009

Integrality Properties of Certain Special Balanceable Families.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs.
Networks, 2008

2007
A characterization of partial directed line graphs.
Discret. Math., 2007

2004
Cardinality constrained path covering problems in grid graphs.
Networks, 2004

A Stochastic Location Problem with Applications to Tele-diagnostic.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Minsquare Factors and Maxfix Covers of Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004


  Loading...