LEONARDI, Stefano
LEONARDI, Stefano
DIPARTIMENTO DI INGEGNERIA INFORMATICA, AUTOMATICA E GESTIONALE -ANTONIO RUBERTI-
(1 + ε)-approximate incremental matching in constant deterministic amortized time
2019 Grandoni, F.; Leonardi, S.; Sankowski, P.; Schwiegelshohn, C.; Solomon, S.
A Data-Driven Approach to Refine Predictions of Differentiated Thyroid Cancer Outcomes: A Prospective Multicenter Study
2023 Grani, Giorgio; Gentili, Michele; Siciliano, Federico; Albano, Domenico; Zilioli, Valentina; Morelli, Silvia; Puxeddu, Efisio; Zatelli, MARIA CHIARA; Gagliardi, Irene; Piovesan, Alessandro; Nervo, Alice; Crocetti, Umberto; Massa, Michela; Teresa Samà, Maria; Mele, Chiara; Deandrea, Maurilio; Fugazzola, Laura; Puligheddu, Barbara; Antonelli, Alessandro; Rossetto, Ruth; D’Amore, Annamaria; Ceresini, Graziano; Castello, Roberto; Solaroli, Erica; Centanni, Marco; Monti, Salvatore; Magri, Flavia; Bruno, Rocco; Sparano, Clotilde; Pezzullo, Luciano; Crescenzi, Anna; Mian, Caterina; Tumino, Dario; Repaci, Andrea; Grazia Castagna, Maria; Triggiani, Vincenzo; Porcelli, Tommaso; Meringolo, Domenico; Locati, Laura; Spiazzi, Giovanna; Di Dalmazi, Giulia; Anagnostopoulos, Aris; Leonardi, Stefano; Filetti, Sebastiano; Durante, Cosimo
A group-strategyproof cost sharing mechanism for the steiner forest game
2008 Koenemann, J; Leonardi, Stefano; Schaefer, G; VAN ZWAM, S.
A group-strategyproof mechanism for steiner forests
2005 Jochen, Koenemann; Leonardi, Stefano; Guido, Schaefer
A Mazing 2+eps Approximation Algorithm for Unsplittable Flow on a Path
2014 Anagnostopoulos, Aristidis; Fabrizio, Grandoni; Leonardi, Stefano; Andreas, Wiese
A mazing 2+ε approximation for unsplittable flow on a path
2018 Anagnostopoulos, Aris; Grandoni, Fabrizio; Leonardi, Stefano; Wiese, Andreas
A multi-layer model for the web graph
2002 Laura, Luigi; Leonardi, Stefano; Caldarelli, G.; De Los Rios, P.
A path-decomposition theorem with applications to pricing and covering on trees
2012 Cygan, Marek; Fabrizio, Grandoni; Leonardi, Stefano; Marcin, Pilipczuk; Piotr, Sankowski
A reference collection for web spam.
2005 Castillo, C; Donato, D; Becchetti, Luca; Boldi, P; Leonardi, Stefano; Santini, M; Vigna, S.
A regret analysis of bilateral trade
2021 Cesa-Bianchi, Nicolò; Cesari, Tommaso R.; Colomboni, Roberto; Fusco, Federico; Leonardi, Stefano
A simpler proof of preemptive total flow time approximation on parallel machines
2006 Leonardi, Stefano
Algorithms and Experiments for the Webgraph
2006 Donato, Debora; Laura, Luigi; Leonardi, Stefano; Meyer, U; Millozzi, Stefano; Sibeyn, J. F.
Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004,
2004 Leonardi, Stefano
Algorithms for auctions and games
2013 Bonifaci, Vincenzo; Leonardi, Stefano
Algorithms for fair k-clustering with multiple protected attributes
2021 Bohm, M.; Fazzone, A.; Leonardi, S.; Menghini, C.; Schwiegelshohn, C.
Algorithms for fair team formation in online labour marketplaces
2019 Barnabo, G.; Leonardi, S.; Fazzone, A.; Schwiegelshohn, C.
Algorithms for hiring and outsourcing in the online labor market
2018 Anagnostopoulos, Aris; Castillo, Carlos; Fazzone, Adriano; Leonardi, Stefano; Terzi, Evimaria
Algorithms for the on-line travelling salesman
2001 Ausiello, Giorgio; E., Feuerstein; Leonardi, Stefano; L., Stougie; M., Talamo
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
2022 Amanatidis, G.; Birmpas, G.; Fusco, F.; Lazos, Filippos.; Leonardi, S.; Reiffenhauser, R.
An efficient cost-sharing mechanism for the prize-collecting steiner forest problem
2007 Anupam, Gupta; Jochen, Koenemann; Leonardi, Stefano; R., Ravi; AND GUIDO, Schaefer
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| (1 + ε)-approximate incremental matching in constant deterministic amortized time | 2019 | Grandoni, F.; Leonardi, S.; Sankowski, P.; Schwiegelshohn, C.; Solomon, S. | |
| A Data-Driven Approach to Refine Predictions of Differentiated Thyroid Cancer Outcomes: A Prospective Multicenter Study | 2023 | Grani, Giorgio; Gentili, Michele; Siciliano, Federico; Albano, Domenico; Zilioli, Valentina; Morelli, Silvia; Puxeddu, Efisio; Zatelli, MARIA CHIARA; Gagliardi, Irene; Piovesan, Alessandro; Nervo, Alice; Crocetti, Umberto; Massa, Michela; Teresa Samà, Maria; Mele, Chiara; Deandrea, Maurilio; Fugazzola, Laura; Puligheddu, Barbara; Antonelli, Alessandro; Rossetto, Ruth; D’Amore, Annamaria; Ceresini, Graziano; Castello, Roberto; Solaroli, Erica; Centanni, Marco; Monti, Salvatore; Magri, Flavia; Bruno, Rocco; Sparano, Clotilde; Pezzullo, Luciano; Crescenzi, Anna; Mian, Caterina; Tumino, Dario; Repaci, Andrea; Grazia Castagna, Maria; Triggiani, Vincenzo; Porcelli, Tommaso; Meringolo, Domenico; Locati, Laura; Spiazzi, Giovanna; Di Dalmazi, Giulia; Anagnostopoulos, Aris; Leonardi, Stefano; Filetti, Sebastiano; Durante, Cosimo | |
| A group-strategyproof cost sharing mechanism for the steiner forest game | 2008 | Koenemann, J; Leonardi, Stefano; Schaefer, G; VAN ZWAM, S. | |
| A group-strategyproof mechanism for steiner forests | 2005 | Jochen, Koenemann; Leonardi, Stefano; Guido, Schaefer | |
| A Mazing 2+eps Approximation Algorithm for Unsplittable Flow on a Path | 2014 | Anagnostopoulos, Aristidis; Fabrizio, Grandoni; Leonardi, Stefano; Andreas, Wiese | |
| A mazing 2+ε approximation for unsplittable flow on a path | 2018 | Anagnostopoulos, Aris; Grandoni, Fabrizio; Leonardi, Stefano; Wiese, Andreas | |
| A multi-layer model for the web graph | 2002 | Laura, Luigi; Leonardi, Stefano; Caldarelli, G.; De Los Rios, P. | |
| A path-decomposition theorem with applications to pricing and covering on trees | 2012 | Cygan, Marek; Fabrizio, Grandoni; Leonardi, Stefano; Marcin, Pilipczuk; Piotr, Sankowski | |
| A reference collection for web spam. | 2005 | Castillo, C; Donato, D; Becchetti, Luca; Boldi, P; Leonardi, Stefano; Santini, M; Vigna, S. | |
| A regret analysis of bilateral trade | 2021 | Cesa-Bianchi, Nicolò; Cesari, Tommaso R.; Colomboni, Roberto; Fusco, Federico; Leonardi, Stefano | |
| A simpler proof of preemptive total flow time approximation on parallel machines | 2006 | Leonardi, Stefano | |
| Algorithms and Experiments for the Webgraph | 2006 | Donato, Debora; Laura, Luigi; Leonardi, Stefano; Meyer, U; Millozzi, Stefano; Sibeyn, J. F. | |
| Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, | 2004 | Leonardi, Stefano | |
| Algorithms for auctions and games | 2013 | Bonifaci, Vincenzo; Leonardi, Stefano | |
| Algorithms for fair k-clustering with multiple protected attributes | 2021 | Bohm, M.; Fazzone, A.; Leonardi, S.; Menghini, C.; Schwiegelshohn, C. | |
| Algorithms for fair team formation in online labour marketplaces | 2019 | Barnabo, G.; Leonardi, S.; Fazzone, A.; Schwiegelshohn, C. | |
| Algorithms for hiring and outsourcing in the online labor market | 2018 | Anagnostopoulos, Aris; Castillo, Carlos; Fazzone, Adriano; Leonardi, Stefano; Terzi, Evimaria | |
| Algorithms for the on-line travelling salesman | 2001 | Ausiello, Giorgio; E., Feuerstein; Leonardi, Stefano; L., Stougie; M., Talamo | |
| Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness | 2022 | Amanatidis, G.; Birmpas, G.; Fusco, F.; Lazos, Filippos.; Leonardi, S.; Reiffenhauser, R. | |
| An efficient cost-sharing mechanism for the prize-collecting steiner forest problem | 2007 | Anupam, Gupta; Jochen, Koenemann; Leonardi, Stefano; R., Ravi; AND GUIDO, Schaefer |