• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 184 matches

• 2024
• 
  Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely:
  Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions. SoCG 2024: 61:1-61:16
• 
  Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely:
  An O(loglog n)-Approximation for Submodular Facility Location. ICALP 2024: 5:1-5:20
• 
  Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely:
  Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions. CoRR abs/2402.07666 (2024)
• 
  Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik:
  Unsplittable Flow on a Short Path. CoRR abs/2407.10138 (2024)
• 
  Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub:
  The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2. CoRR abs/2407.19905 (2024)
• 
  Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli:
  A 5/4 Approximation for Two-Edge-Connectivity. CoRR abs/2408.07019 (2024)
• 2023
• 
  Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau:
  A Tight (3/2+ε )-Approximation for Skewed Strip Packing. Algorithmica 85(10): 3088-3109 (2023)
• 
  Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli:
  Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. SIAM J. Comput. 52(3): 718-739 (2023)
• 
  Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams:
  Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter. ACM Trans. Algorithms 19(1): 3:1-3:30 (2023)
• 
  Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli:
  A 4/3 Approximation for 2-Vertex-Connectivity. ICALP 2023: 29:1-29:13
• 
  Fabrizio Grandoni, Claire Mathieu, Hang Zhou:
  Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. ITCS 2023: 63:1-63:13
• 
  Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli:
  Improved Approximation for Two-Edge-Connectivity. SODA 2023: 2368-2410
• 
  Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn:
  Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. SODA 2023: 940-986
• 
  Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli:
  A 4/3 Approximation for 2-Vertex-Connectivity. CoRR abs/2305.02240 (2023)
• 
  Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli:
  A PTAS for Triangle-Free 2-Matching. CoRR abs/2311.11869 (2023)
• 2022
• 
  Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat:
  A refined approximation for Euclidean k-means. Inf. Process. Lett. 176: 106251 (2022)
• 
  Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon:
  Fully Dynamic (Δ +1)-Coloring in O(1) Update Time. ACM Trans. Algorithms 18(2): 10:1-10:25 (2022)
• 
  Fabrizio Grandoni, Tobias Mömke, Andreas Wiese:
  Unsplittable Flow on a Path: The Game!. SODA 2022: 906-926
• 
  Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad:
  Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. SOSA 2022: 12-23
• 
  Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub:
  Breaching the 2-approximation barrier for the forest augmentation problem. STOC 2022: 1598-1611
• 
  Fabrizio Grandoni, Tobias Mömke, Andreas Wiese:
  A PTAS for unsplittable flow on a path. STOC 2022: 289-302
• 
  Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn:
  Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. CoRR abs/2207.05150 (2022)
• 
  Fabrizio Grandoni, Claire Mathieu, Hang Zhou:
  Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. CoRR abs/2209.05520 (2022)
• 
  Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli:
  Improved Approximation for Two-Edge-Connectivity. CoRR abs/2209.10265 (2022)
• 
  Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely:
  An O(loglog n)-Approximation for Submodular Facility Location. CoRR abs/2211.05474 (2022)
• 2021
• 
  Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat:
  On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. Theory Comput. Syst. 65(6): 985-1008 (2021)
• 
  Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Andreas Wiese:
  Approximating Geometric Knapsack via L-packings. ACM Trans. Algorithms 17(4): 33:1-33:67 (2021)
• 
  Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi:
  Approximation Algorithms for Demand Strip Packing. APPROX-RANDOM 2021: 20:1-20:24
• 
  Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese:
  Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. SoCG 2021: 39:1-39:17
• 
  Fabrizio Grandoni, Tobias Mömke, Andreas Wiese:
  Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. ESA 2021: 49:1-49:15

skipping 154 more matches