Nicola Apollonio

From MaRDI portal
Person:964477

Available identifiers

zbMath Open apollonio.nicolaMaRDI QIDQ964477

List of research outcomes





PublicationDate of PublicationType
Two new characterizations of path graphs2023-10-04Paper
Normal approximation of Random Gaussian Neural Networks2023-07-10Paper
Cantelli's bounds for generalized tail inequalities in Euclidean spaces2023-07-07Paper
Second-order moments of the size of randomly induced subgraphs of given order2023-04-22Paper
A tight relation between series-parallel graphs and bipartite distance hereditary graphs2022-11-04Paper
Network homophily via tail inequalities2022-08-03Paper
A New Characterization of Path Graphs2019-11-20Paper
On computing the Galois lattice of bipartite distance hereditary graphs2017-06-14Paper
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths2015-10-21Paper
On the Galois Lattice of Bipartite Distance Hereditary Graphs2015-09-15Paper
On the Galois lattice of bipartite distance hereditary graphs2015-07-06Paper
Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs2014-12-22Paper
The maximum vertex coverage problem on bipartite graphs2014-05-05Paper
On a facility location problem with applications to tele-diagnostic2013-08-27Paper
Mengerian quasi-graphical families and clutters2013-01-24Paper
Recognizing Helly edge-path-tree graphs and their clique graphs2011-08-10Paper
Minconvex Factors of Prescribed Size in Graphs2010-08-27Paper
Bicolored graph partitioning, or: gerrymandering at its worst2010-04-28Paper
On the complexity of recognizing directed path families2010-04-28Paper
On the maximum \(q\)-colourable induced subgraph problem in perfect graphs2010-04-15Paper
Integrality Properties of Certain Special Balanceable Families2009-12-11Paper
Integrality properties of edge path tree families2009-12-09Paper
A superclass of edge-path-tree graphs with few cliques2009-11-17Paper
Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs2008-01-08Paper
A characterization of partial directed line graphs2007-10-25Paper
Integer Programming and Combinatorial Optimization2005-12-23Paper
Graph-Theoretic Concepts in Computer Science2005-12-08Paper
Cardinality constrained path covering problems in grid graphs2005-01-12Paper
Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphsN/APaper

Research outcomes over time

This page was built for person: Nicola Apollonio