Pubblicazioni

How vulnerable is an undirected planar graph with respect to max flow

2024 - NETWORKS
Balzotti, Lorenzo; Franciosa, Paolo G.

A compact formulation for the base station deployment problem in wireless networks

2023 - NETWORKS
Avella, Pasquale; Calamita, Alice; Palagi, Laura

Connected graph partitioning with aggregated and non‐aggregated gap objective functions

2023 - NETWORKS
Fernández, Elena; Lari, Isabella; Puerto, Justo; Ricca, Federica; Scozzari, Andrea

Max flow vitality in general and st‐planar graphs

2019 - NETWORKS
Ausiello, Giorgio; Franciosa, Paolo G.; Lari, Isabella; Ribichini, Andrea

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem

2017 - NETWORKS
Furini, F.; Gabrel, V.; Ternier, I. -C.

Partitioning a Graph into Connected Components with Fixed Centers and Optimizing Cost-Based Objective Functions or Equipartition Criteria

2016 - NETWORKS
Lari, Isabella; Puerto, Justo; Ricca, Federica; Scozzari, Andrea

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma