default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicola Apollonio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j21]Nicola Apollonio
:
Second-order moments of the size of randomly induced subgraphs of given order. Discret. Appl. Math. 355: 46-56 (2024)- 2023
- [j20]Nicola Apollonio, Daniel Blankenberg, Fabio Cumbo, Paolo Giulio Franciosa, Daniele Santoni:
Evaluating homophily in networks via HONTO (HOmophily Network TOol): a case study of chromosomal interactions in human PPI networks. Bioinform. 39(1) (2023) - [j19]Nicola Apollonio, Lorenzo Balzotti:
Two new characterizations of path graphs. Discret. Math. 346(12): 113596 (2023) - 2022
- [j18]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa, Jean-François Mascari:
A tight relation between series-parallel graphs and bipartite distance hereditary graphs. Art Discret. Appl. Math. 5(1) (2022) - 2017
- [j17]Nicola Apollonio, Paolo Giulio Franciosa:
On computing the Galois lattice of bipartite distance hereditary graphs. Discret. Appl. Math. 226: 1-9 (2017) - 2015
- [j16]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa:
On the Galois lattice of bipartite distance hereditary graphs. Discret. Appl. Math. 190-191: 13-23 (2015) - [j15]Nicola Apollonio, Anna Galluccio:
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths. SIAM J. Discret. Math. 29(4): 1837-1863 (2015) - 2014
- [j14]Nicola Apollonio, Bruno Simeone:
The maximum vertex coverage problem on bipartite graphs. Discret. Appl. Math. 165: 37-48 (2014) - [j13]Nicola Apollonio, Bruno Simeone:
Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs. SIAM J. Discret. Math. 28(3): 1137-1151 (2014) - 2013
- [j12]Nicola Apollonio, Massimiliano Caramia:
Mengerian quasi-graphical families and clutters. Eur. J. Comb. 34(3): 647-659 (2013) - [j11]Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano:
On a facility location problem with applications to tele-diagnostic. Optim. Lett. 7(6): 1179-1192 (2013) - 2011
- [j10]Nicola Apollonio, Massimiliano Caramia:
Recognizing Helly Edge-Path-Tree graphs and their clique graphs. Discret. Appl. Math. 159(11): 1166-1175 (2011) - 2010
- [j9]Nicola Apollonio, Massimiliano Caramia:
On the maximum q-colourable induced subgraph problem in perfect graphs. Int. J. Math. Oper. Res. 2(1): 1-16 (2010) - 2009
- [j8]Nicola Apollonio, Paolo Giulio Franciosa:
On the complexity of recognizing directed path families. Discret. Appl. Math. 157(11): 2525-2535 (2009) - [j7]Nicola Apollonio, Ronald I. Becker, Isabella Lari, Federica Ricca, Bruno Simeone:
Bicolored graph partitioning, or: gerrymandering at its worst. Discret. Appl. Math. 157(17): 3601-3614 (2009) - [j6]Nicola Apollonio:
Integrality properties of edge path tree families. Discret. Math. 309(12): 4181-4184 (2009) - [j5]Nicola Apollonio, Massimiliano Caramia:
A superclass of Edge-Path-Tree graphs with few cliques. Oper. Res. Lett. 37(5): 351-355 (2009) - [j4]Nicola Apollonio, András Sebö:
Minconvex Factors of Prescribed Size in Graphs. SIAM J. Discret. Math. 23(3): 1297-1310 (2009) - 2008
- [j3]Nicola Apollonio, Isabella Lari, Federica Ricca, Bruno Simeone, Justo Puerto:
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs. Networks 51(1): 78-89 (2008) - 2007
- [j2]Nicola Apollonio, Paolo Giulio Franciosa:
A characterization of partial directed line graphs. Discret. Math. 307(21): 2598-2614 (2007) - 2004
- [j1]Nicola Apollonio, Lou Caccetta, Bruno Simeone:
Cardinality constrained path covering problems in grid graphs. Networks 44(2): 120-131 (2004)
Conference and Workshop Papers
- 2014
- [c4]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa:
On the Galois Lattice of Bipartite Distance Hereditary Graphs. IWOCA 2014: 37-48 - 2009
- [c3]Nicola Apollonio, Massimiliano Caramia:
Integrality Properties of Certain Special Balanceable Families. IWOCA 2009: 48-59 - 2004
- [c2]Nicola Apollonio, András Sebö:
Minsquare Factors and Maxfix Covers of Graphs. IPCO 2004: 388-400 - [c1]Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano:
A Stochastic Location Problem with Applications to Tele-diagnostic. WG 2004: 201-213
Informal and Other Publications
- 2023
- [i8]Nicola Apollonio:
Second-order moments of the size of randomly induced subgraphs of given order. CoRR abs/2304.11423 (2023) - 2022
- [i7]Nicola Apollonio, Lorenzo Balzotti:
Two New Characterizations of Path Graphs. CoRR abs/2208.01001 (2022) - 2021
- [i6]Nicola Apollonio, Paolo Giulio Franciosa, Daniele Santoni:
On function homophily of microbial Protein-Protein Interaction Networks. CoRR abs/2107.10037 (2021) - 2019
- [i5]Nicola Apollonio, Lorenzo Balzotti:
A New Characterization of Path Graphs. CoRR abs/1911.09069 (2019) - 2015
- [i4]Nicola Apollonio, Paolo Giulio Franciosa:
On Computing the Galois Lattice of Bipartite Distance Hereditary Graphs. CoRR abs/1510.06883 (2015) - [i3]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa, Jean-François Mascari:
A tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs. CoRR abs/1511.03100 (2015) - 2014
- [i2]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa:
On the Galois Lattice of Bipartite Distance Hereditary Graphs. CoRR abs/1406.0154 (2014) - [i1]Nicola Apollonio, Anna Galluccio:
Minimally unbalanced diamond-free graphs and Dyck-paths. CoRR abs/1406.6494 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
