 | Up a level |
Grandoni, Fabrizio and Leonardi, Stefano and Sankowski, Piotr and Schwiegelshohn, Chris and Solomon, Shay (2019) (1 + \(ε\))-Approximate Incremental Matching in Constant Deterministic Amortized Time. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019.
Anagnostopoulos, Aris and Grandoni, Fabrizio and Leonardi, Stefano and Sankowski, Piotr (2016) Online Network Design with Outliers. Algorithmica, 76 (1). pp. 88-109. ISSN 0178-4617
Grandoni, Fabrizio and Gupta, Anupam and Leonardi, Stefano and Miettinen, Pauli and Sankowski, Piotr and Singh, Mohit (2013) Set Covering with Our Eyes Closed. In: Foundations of Computer Science FOCS '08. IEEE 49th Annual IEEE Symposium, 25.10.2008-28.10.2008, Philadelphia, PA.
Cygan, Marek and Grandoni, Fabrizio and Leonardi, Stefano and Pilipczuk, Marcin and Sankowski, Piotr (2012) A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. In: ESA.
Cygan, Marek and Grandoni, Fabrizio and Leonardi, Stefano and Mucha, Marcin and Pilipczuk, Marcin and Sankowski, Piotr (2011) Approximation Algorithms for Union and Intersection Covering Problems. In: FSTTCS.
Anagnostopoulos, Aris and Grandoni, Fabrizio and Leonardi, Stefano and Sankowski, Piotr (2010) Online Network Design with Outliers. In: ICALP (1).
Grandoni, Fabrizio and Gupta, Anupam and Leonardi, Stefano and Miettinen, Pauli and Sankowski, Piotr and Singh, Mohit (2008) Set Covering with our Eyes Closed. In: FOCS.