 | 2011 |
|---|
| 12 |       | Nicola Apollonio,
Massimiliano Caramia:
Recognizing Helly Edge-Path-Tree graphs and their clique graphs.
Discrete Applied Mathematics 159(11): 1166-1175 (2011) |
| 2009 |
|---|
| 11 | | Nicola Apollonio,
Massimiliano Caramia:
Integrality Properties of Certain Special Balanceable Families.
IWOCA 2009: 48-59 |
| 10 | | Nicola Apollonio,
Paolo Giulio Franciosa:
On the complexity of recognizing directed path families.
Discrete Applied Mathematics 157(11): 2525-2535 (2009) |
| 9 | | Nicola Apollonio,
Ronald I. Becker,
Isabella Lari,
Federica Ricca,
Bruno Simeone:
Bicolored graph partitioning, or: gerrymandering at its worst.
Discrete Applied Mathematics 157(17): 3601-3614 (2009) |
| 8 | | Nicola Apollonio:
Integrality properties of edge path tree families.
Discrete Mathematics 309(12): 4181-4184 (2009) |
| 7 | | Nicola Apollonio,
Massimiliano Caramia:
A superclass of Edge-Path-Tree graphs with few cliques.
Oper. Res. Lett. 37(5): 351-355 (2009) |
| 6 | | Nicola Apollonio,
András Sebö:
Minconvex Factors of Prescribed Size in Graphs.
SIAM J. Discrete Math. 23(3): 1297-1310 (2009) |
| 2008 |
|---|
| 5 | | 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 |
|---|
| 4 | | Nicola Apollonio,
Paolo Giulio Franciosa:
A characterization of partial directed line graphs.
Discrete Mathematics 307(21): 2598-2614 (2007) |
| 2004 |
|---|
| 3 | | Nicola Apollonio,
András Sebö:
Minsquare Factors and Maxfix Covers of Graphs.
IPCO 2004: 388-400 |
| 2 | | Nicola Apollonio,
Massimiliano Caramia,
Giuseppe F. Italiano:
A Stochastic Location Problem with Applications to Tele-diagnostic.
WG 2004: 201-213 |
| 1 | | Nicola Apollonio,
Lou Caccetta,
Bruno Simeone:
Cardinality constrained path covering problems in grid graphs.
Networks 44(2): 120-131 (2004) |
Data released under the ODC-BY 1.0 license — See also our legal information page