 | Up a level |
Adamczyk, Marek and Grandoni, Fabrizio and Leonardi, Stefano and Wlodarczyk, Michal (2017) When the Optimum is also Blind: a New Perspective on Universal Optimization. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland.
Abboud, Amir and Addanki, Raghavendra and Grandoni, Fabrizio and Panigrahi, Debmalya and Saha, Barna (2019) Dynamic set cover: improved algorithms and lower bounds. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Abboud, Amir and Grandoni, Fabrizio and Vassilevska Williams, Virginia (2023) Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter. ACM Transactions on Algorithms, 19 (1). pp. 1-30. ISSN 1549-6325
Abboud, Amir and Grandoni, Fabrizio and Williams, Virginia Vassilevska (2014) Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms UNSPECIFIED.
Adamczyk, Marek and Grandoni, Fabrizio and Mukherjee, Joydeep (2015) Improved Approximation Algorithms for Stochastic Matching. In: Algorithms - ESA 2015 UNSPECIFIED.
Alberucci, Luca and Facchini, Alessandro (2009) On Modal μ-Calculus and Gödel-Löb Logic. Studia Logica, 91 (2). pp. 145-169. ISSN 0039-3215
Alberucci, Luca and Facchini, Alessandro (2009) The modal μ-calculus hierarchy over restricted classes of transition systems. Journal of Symbolic Logic, 74 (4). pp. 1367-1400. ISSN 0022-4812
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
Anagnostopoulos, Aris and Grandoni, Fabrizio and Leonardi, Stefano and Wiese, Andreas (2018) A Mazing 2+ε Approximation for Unsplittable Flow on a Path. ACM Transactions on Algorithms, 14 (4). pp. 1-23. ISSN 1549-6325
Anagnostopoulos, Aris and Grandoni, Fabrizio and Leonardi, Stefano and Wiese, Andreas (2013) A Mazing 2+∊ Approximation for Unsplittable Flow on a Path. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms UNSPECIFIED.
Byrka, Jaroslaw and Grandoni, Fabrizio and Ameli, Afrouz Jabal (2023) Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. In: UNSPECIFIED.
Becchetti, Luca and Bury, Marc and Cohen-Addad, Vincent and Grandoni, Fabrizio and Schwiegelshohn, Chris (2019) Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Bhattacharya, Sayan and Grandoni, Fabrizio and Kulkarni, Janardhan and Liu, Quanquan C. and Solomon, Shay (2022) Fully Dynamic (Δ +1)-Coloring in O (1) Update Time. ACM Transactions on Algorithms, 18 (2). pp. 1-25. ISSN 1549-6325
Bhattacharya, Sayan and Grandoni, Fabrizio and Wajc, David (2021) Online Edge Coloring Algorithms via the Nibble Method. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) UNSPECIFIED.
Bilo, Davide and Grandoni, Fabrizio and Guala, Luciano and Leucci, Stefano and Proietti, Guido (2015) Improved Purely Additive Fault-Tolerant Spanners. In: Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings.
Bodwin, Greg and Grandoni, Fabrizio and Parter, Merav and Williams, Virginia Vassilevska (2017) Preserving Distances in Very Faulty Graphs. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland.
Bringmann, Karl and Grandoni, Fabrizio and Saha, Barna and Williams, Virginia Vassilevska (2016) Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product. In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA.
Bringmann, Karl and Grandoni, Fabrizio and Saha, Barna and Williams, Virginia Vassilevska (2019) Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. SIAM Journal on Computing, 48 (2). pp. 481-512. ISSN 0097-5397
Byrka, Jarosław and Grandoni, Fabrizio and Ameli, Afrouz Jabal (2023) Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. SIAM Journal on Computing, 52 (3). pp. 718-739. ISSN 0097-5397
Bärtschi, Andreas and Grandoni, Fabrizio (2015) On Conflict-Free Multi-coloring. In: Algorithms and Data Structures UNSPECIFIED.
Cabessa, Jérémie and Duparc, Jacques and Facchini, Alessandro and Murlak, Filip (2009) The Wadge Hierarchy of Max-Regular Languages. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India.
Carreiro, Facundo and Facchini, Alessandro and Venema, Yde and Zanasi, Fabio (2014) Weak MSO: automata and expressiveness modulo bisimilarity. In: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014.
Carreiro, Facundo and Facchini, Alessandro and Venema, Yde and Zanasi, Fabio (2020) The power of the weak. ACM Transactions on Computational Logic (TOCL), 21 (2). pp. 1-47.
Chalermsook, Parinya and Grandoni, Fabrizio and Laekhanukit, Bundit (2014) On Survivable Set Connectivity. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms UNSPECIFIED.
Cheriyan, Joe and Dippel, Jack and Grandoni, Fabrizio and Khan, Arindam and Narayan, Vishnu V. (2020) The matching augmentation problem: a $$\frac{7}{4}$$-approximation algorithm. Mathematical Programming, 182 (1-2). pp. 315-354. ISSN 0025-5610
Cohen-Addad Viallat, Vincent and Grandoni, Fabrizio and Lee, Euiwoong and Schwiegelshohn, Chris (2023) Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) UNSPECIFIED.
Cygan, Marek and Grandoni, Fabrizio and Hermelin, Danny (2017) Tight Kernel Bounds for Problems on Graphs with Small Degeneracy. ACM Transactions on Algorithms, 13 (3). pp. 1-22. ISSN 1549-6325
Duparc, Jacques and Facchini, Alessandro (2008) Describing the Wadge Hierarchy for the Alternation Free Fragment of μ-Calculus (I). In: Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings.
Duparc, Jacques and Facchini, Alessandro (2009) A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata. In: ILC 2007. Revised Selected Papers Infinity in Logic and Computation, International Conference, ILC 2007, November 3-5, 2007, Cape Town, South Africa.
Duparc, Jacques and Facchini, Alessandro and Murlak, Filip (2011) Definable Operations On Weakly Recognizable Sets of Trees. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India.
Duparc, Jacques and Facchini, Alessandro and Murlak, Filip (2009) Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata. In: Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings.
Facchini, Alessandro and Hirai, Yoichi and Marx, Maarten and Sherkhonov, Evgeny (2015) Containment for Conditional Tree Patterns. Logical Methods in Computer Science, 11 (2).
Facchini, Alessandro and Michalewski, Henryk (2014) Deciding the Borel Complexity of Regular Tree Languages. In: Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings.
Facchini, Alessandro and Murlak, Filip and Skrzypczak, Michal (2016) Index Problems for Game Automata. ACM Transactions on Computational Logic, 17 (4).
Facchini, Alessandro and Murlak, Filip and Skrzypczak, Michal (2013) Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata. In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013.
Facchini, Alessandro and Venema, Yde and Zanasi, Fabio (2013) A Characterization Theorem for the Alternation-Free Fragment of the Modal μ-Calculus. In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013.
G\'lvez, Waldo and Grandoni, Fabrizio and Ameli, Afrouz Jabal and Jansen, Klaus and Khan, Arindam and Rau, Malin (2020) A Tight (3/2+\(ε\)) Approximation for Skewed Strip Packing. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference.
G\'lvez, Waldo and Grandoni, Fabrizio and Ameli, Afrouz Jabal and Khodamoradi, Kamyar (2021) Approximation Algorithms for Demand Strip Packing. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference).
G\'lvez, Waldo and Grandoni, Fabrizio and Heydrich, Sandy and Ingala, Salvatore and Khan, Arindam and Wiese, Andreas (2017) Approximating Geometric Knapsack via L-Packings. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017.
G\'lvez, Waldo and Grandoni, Fabrizio and Ingala, Salvatore and Khan, Arindam (2016) Improved Pseudo-Polynomial-Time Approximation for Strip Packing. In: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India.
Galvez, Waldo and Grandoni, Fabrizio and Khan, Arindam and Ramirez-Romero, Diego and Wiese, Andreas (2021) Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. In: 37th International Symposium on Computational Geometry, SoCG 2021, June 7-11, 2021, Buffalo, NY, USA (Virtual Conference).
Garg, Mohit and Grandoni, Fabrizio and Jabal Ameli, Afrouz (2023) Improved Approximation for Two-Edge-Connectivity. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) UNSPECIFIED.
Grandoni, Fabrizio and Ameli, Afrouz Jabal and Traub, Vera (2022) Breaching the 2-approximation barrier for the forest augmentation problem. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Grandoni, Fabrizio and Ingala, Salvatore and Uniyal, Sumedha (2015) Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. In: Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers.
Grandoni, Fabrizio and Italian, Giuseppe F. and Łukasiewicz, Aleksander and Parotsidis, Nikos and Uznański, Przemysław (2021) All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) UNSPECIFIED.
Grandoni, Fabrizio and Kalaitzis, Christos and Zenklusen, Rico (2018) Improved approximation for tree augmentation: saving by rewiring. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Grandoni, Fabrizio and Kociumaka, Tomasz and Wlodarczyk, Michal (2015) An LP-rounding 2\(\surd\)2-approximation for restricted maximum acyclic subgraph. Inf. Process. Lett., 115 (2). pp. 182-185.
Grandoni, Fabrizio and Kratsch, Stefan and Wiese, Andreas (2019) Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany.
Grandoni, Fabrizio and Krysta, Piotr and Leonardi, Stefano and Ventre, Carmine (2014) Utilitarian Mechanism Design for Multiobjective Optimization. SIAM Journal on Computing, 43 (4). pp. 1263-1290. ISSN 0097-5397
Grandoni, Fabrizio and Laekhanukit, Bundit (2017) Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Grandoni, Fabrizio and Laekhanukit, Bundit and Li, Shi (2019) O (log 2 k / log log k )-approximation algorithm for directed Steiner tree. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
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.
Grandoni, Fabrizio and M\"mke, Tobias and Wiese, Andreas (2021) Faster (1+\(ε\))-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference).
Grandoni, Fabrizio and Mathieu, Claire and Zhou, Hang (2023) Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. In: 14th Innovations in Theoretical Computer Science Conference (ITCS 2023).
Grandoni, Fabrizio and Mömke, Tobias and Wiese, Andreas (2022) A PTAS for unsplittable flow on a path. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Grandoni, Fabrizio and Mömke, Tobias and Wiese, Andreas (2022) Unsplittable Flow on a Path: The Game! In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) UNSPECIFIED.
Grandoni, Fabrizio and Mömke, Tobias and Wiese, Andreas and Zhou, Hang (2018) A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing UNSPECIFIED.
Grandoni, Fabrizio and Mömke, Tobias and Wiese, Andreas and Zhou, Hang (2017) To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms UNSPECIFIED.
Grandoni, Fabrizio and Ostrovsky, Rafail and Rabani, Yuval and Schulman, Leonard J. and Venkat, Rakesh (2022) A refined approximation for Euclidean k-means. Information Processing Letters, 176. p. 106251. ISSN 00200190
Grandoni, Fabrizio and Ravi, R. and Singh, Mohit and Zenklusen, Rico (2014) New approaches to multi-objective optimization. Mathematical Programming, 146 (1-2). pp. 525-554. ISSN 0025-5610
Grandoni, Fabrizio and Rothvoß, Thomas (2016) Pricing on Paths: A PTAS for the Highway Problem. SIAM Journal on Computing, 45 (2). pp. 216-231. ISSN 0097-5397
Grandoni, Fabrizio and Schwiegelshohn, Chris and Solomon, Shay and Uzrad, Amitai (2022) Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. In: Symposium on Simplicity in Algorithms (SOSA) UNSPECIFIED.
Grandoni, Fabrizio and Wiese, Andreas (2019) Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany.
Grandoni, Fabrizio and Williams, Virginia Vassilevska (2020) Faster Replacement Paths and Distance Sensitivity Oracles. ACM Transactions on Algorithms, 16 (1). pp. 1-25. ISSN 1549-6325
Gálvez, Waldo and Grandoni, Fabrizio and Ameli, Afrouz Jabal and Sornat, Krzysztof (2020) On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. In: Approximation and Online Algorithms UNSPECIFIED.
Gálvez, Waldo and Grandoni, Fabrizio and Ingala, Salvatore and Heydrich, Sandy and Khan, Arindam and Wiese, Andreas (2021) Approximating Geometric Knapsack via L-packings. ACM Transactions on Algorithms, 17 (4). pp. 1-67. ISSN 1549-6325
Gálvez, Waldo and Grandoni, Fabrizio and Jabal Ameli, Afrouz and Sornat, Krzysztof (2021) On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. Theory of Computing Systems, 65 (6). pp. 985-1008. ISSN 1432-4350
Molinari, Monia Elisa and Cannata, Massimiliano and Begueria, Santiago and Ambrosi, Christian (2012) Gis-based Calibration of MassMov2D. Transactions in GIS, 16 (2). pp. 215-231. ISSN 1361-1682
Ten Cate, Balder and Facchini, Alessandro (2011) Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs. In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings.
Termine, Alberto and Antonucci, Alessandro and Facchini, Alessandro and Primiero, Giuseppe (2021) Robust model checking with imprecise Markov reward models. In: International Symposium on Imprecise Probability: Theories and Applications.
Termine, Alberto and Antonucci, Alessandro and Primiero, Giuseppe and Facchini, Alessandro (2021) Logic and model checking by imprecise probabilistic interpreted systems. In: Multi-Agent Systems: 18th European Conference, EUMAS 2021, Virtual Event, June 28--29, 2021, Revised Selected Papers 18.