The following pages link to Nicola Apollonio (Q964477):
Displaying 26 items.
- (Q360495) (redirect page) (← links)
- On a facility location problem with applications to tele-diagnostic (Q360498) (← links)
- On the maximum \(q\)-colourable induced subgraph problem in perfect graphs (Q964478) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- Bicolored graph partitioning, or: gerrymandering at its worst (Q967425) (← links)
- A superclass of edge-path-tree graphs with few cliques (Q1038105) (← links)
- Integrality properties of edge path tree families (Q1043594) (← links)
- Mengerian quasi-graphical families and clutters (Q1933646) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- On the Galois lattice of bipartite distance hereditary graphs (Q2352777) (← links)
- On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- A characterization of partial directed line graphs (Q2455584) (← links)
- Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs (Q2935262) (← links)
- On the Galois Lattice of Bipartite Distance Hereditary Graphs (Q2946040) (← links)
- Cardinality constrained path covering problems in grid graphs (Q3156826) (← links)
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (Q3195131) (← links)
- Minconvex Factors of Prescribed Size in Graphs (Q3583302) (← links)
- Integrality Properties of Certain Special Balanceable Families (Q3651533) (← links)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710801) (← links)
- Integer Programming and Combinatorial Optimization (Q5712468) (← links)
- Two new characterizations of path graphs (Q6056699) (← links)
- Second-order moments of the size of randomly induced subgraphs of given order (Q6433968) (← links)
- Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs (Q6517140) (← links)
