default search action
Fabrizio Grandoni 0001
Person information
- affiliation: University of Lugano, IDSIA, Switzerland
Other persons with the same name
- Fabrizio Grandoni 0002 — National Research Council, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c83]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 - [c82]Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub:
The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller Than 2. FOCS 2024: 730-753 - [c81]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 - [c80]Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik:
Unsplittable Flow on a Short Path. IPEC 2024: 5:1-5:22 - [i40]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) - [i39]Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik:
Unsplittable Flow on a Short Path. CoRR abs/2407.10138 (2024) - [i38]Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub:
The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2. CoRR abs/2407.19905 (2024) - [i37]Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli:
A 5/4 Approximation for Two-Edge-Connectivity. CoRR abs/2408.07019 (2024) - 2023
- [j46]Waldo Gálvez
, Fabrizio Grandoni
A Tight (3/2+ε )-Approximation for Skewed Strip Packing. Algorithmica 85(10): 3088-3109 (2023) - [j45]Jaroslaw Byrka, Fabrizio Grandoni
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. SIAM J. Comput. 52(3): 718-739 (2023) - [j44]Amir Abboud
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter. ACM Trans. Algorithms 19(1): 3:1-3:30 (2023) - [c79]Miguel Bosch-Calvo, Fabrizio Grandoni
A 4/3 Approximation for 2-Vertex-Connectivity. ICALP 2023: 29:1-29:13 - [c78]Fabrizio Grandoni
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. ITCS 2023: 63:1-63:13 - [c77]Vincent Cohen-Addad, Fabrizio Grandoni
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. SODA 2023: 940-986 - [c76]Mohit Garg, Fabrizio Grandoni
Improved Approximation for Two-Edge-Connectivity. SODA 2023: 2368-2410 - [i36]Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli:
A 4/3 Approximation for 2-Vertex-Connectivity. CoRR abs/2305.02240 (2023) - [i35]Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli:
A PTAS for Triangle-Free 2-Matching. CoRR abs/2311.11869 (2023) - 2022
- [j43]Fabrizio Grandoni
A refined approximation for Euclidean k-means. Inf. Process. Lett. 176: 106251 (2022) - [j42]Sayan Bhattacharya, Fabrizio Grandoni
Fully Dynamic (Δ +1)-Coloring in O(1) Update Time. ACM Trans. Algorithms 18(2): 10:1-10:25 (2022) - [c75]Fabrizio Grandoni, Tobias Mömke, Andreas Wiese:
Unsplittable Flow on a Path: The Game!. SODA 2022: 906-926 - [c74]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 - [c73]Fabrizio Grandoni
A PTAS for unsplittable flow on a path. STOC 2022: 289-302 - [c72]Fabrizio Grandoni, Afrouz Jabal Ameli
Breaching the 2-approximation barrier for the forest augmentation problem. STOC 2022: 1598-1611 - [i34]Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. CoRR abs/2207.05150 (2022) - [i33]Fabrizio Grandoni, Claire Mathieu, Hang Zhou:
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. CoRR abs/2209.05520 (2022) - [i32]Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli:
Improved Approximation for Two-Edge-Connectivity. CoRR abs/2209.10265 (2022) - [i31]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
- [j41]Waldo Gálvez
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. Theory Comput. Syst. 65(6): 985-1008 (2021) - [j40]Waldo Gálvez
Approximating Geometric Knapsack via L-packings. ACM Trans. Algorithms 17(4): 33:1-33:67 (2021) - [c71]Waldo Gálvez
Approximation Algorithms for Demand Strip Packing. APPROX-RANDOM 2021: 20:1-20:24 - [c70]Waldo Gálvez
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. SoCG 2021: 39:1-39:17 - [c69]Fabrizio Grandoni
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. ESA 2021: 49:1-49:15 - [c68]Fabrizio Grandoni
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. SODA 2021: 273-289 - [c67]Sayan Bhattacharya, Fabrizio Grandoni
Online Edge Coloring Algorithms via the Nibble Method. SODA 2021: 2830-2842 - [i30]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. CoRR abs/2103.10406 (2021) - [i29]Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi:
Approximation Algorithms for Demand Strip Packing. CoRR abs/2105.08577 (2021) - [i28]Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat:
A Refined Approximation for Euclidean k-Means. CoRR abs/2107.07358 (2021) - [i27]Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad:
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. CoRR abs/2108.08825 (2021) - [i26]Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub:
Breaching the 2-Approximation Barrier for the Forest Augmentation Problem. CoRR abs/2112.11799 (2021) - 2020
- [j39]Joe Cheriyan
The matching augmentation problem: a $\frac{7}{4}$-approximation algorithm. Math. Program. 182(1): 315-354 (2020) - [j38]Fabrizio Grandoni
Faster Replacement Paths and Distance Sensitivity Oracles. ACM Trans. Algorithms 16(1): 15:1-15:25 (2020) - [c66]Waldo Gálvez
A Tight (3/2+ε) Approximation for Skewed Strip Packing. APPROX-RANDOM 2020: 44:1-44:18 - [c65]Jaroslaw Byrka
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. STOC 2020: 815-825 - [e2]Fabrizio Grandoni
28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference). LIPIcs 173, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-162-7 [contents] - [i25]Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. CoRR abs/2007.08914 (2020) - [i24]Marek Adamczyk, Brian Brubach, Fabrizio Grandoni, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Improved Approximation Algorithms for Stochastic-Matching Problems. CoRR abs/2010.08142 (2020) - [i23]Sayan Bhattacharya, Fabrizio Grandoni, David Wajc:
Online Edge Coloring Algorithms via the Nibble Method. CoRR abs/2010.16376 (2020)
2010 – 2019
- 2019
- [j37]Karl Bringmann, Fabrizio Grandoni
Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. SIAM J. Comput. 48(2): 481-512 (2019) - [c64]Fabrizio Grandoni
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. ESA 2019: 53:1-53:16 - [c63]Fabrizio Grandoni
Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. ESA 2019: 54:1-54:14 - [c62]Fabrizio Grandoni
(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. SODA 2019: 1886-1898 - [c61]Amir Abboud, Raghavendra Addanki, Fabrizio Grandoni
Dynamic set cover: improved algorithms and lower bounds. STOC 2019: 114-125 - [c60]Fabrizio Grandoni
O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. STOC 2019: 253-264 - [c59]Luca Becchetti
Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma. STOC 2019: 1039-1050 - [c58]Waldo Gálvez
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. WAOA 2019: 138-153 - [i22]Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese:
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. CoRR abs/1906.10982 (2019) - [i21]Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon:
Fully Dynamic (Δ+1)-Coloring in Constant Update Time. CoRR abs/1910.02063 (2019) - [i20]Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli:
Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree. CoRR abs/1911.02259 (2019) - 2018
- [j36]Arnab Bhattacharyya, Fabrizio Grandoni
Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. ACM Trans. Algorithms 14(3): 26:1-26:2 (2018) - [j35]Aris Anagnostopoulos
A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path. ACM Trans. Algorithms 14(4): 55:1-55:23 (2018) - [j34]Erik D. Demaine, Fabrizio Grandoni
Editorial fun. Theor. Comput. Sci. 748: 1 (2018) - [c57]Fabrizio Grandoni
A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. STOC 2018: 607-619 - [c56]Fabrizio Grandoni
Improved approximation for tree augmentation: saving by rewiring. STOC 2018: 632-645 - [p1]Devdatt P. Dubhashi, Fabrizio Grandoni
Distributed Approximation Algorithms via LP-Duality and Randomization. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 203-224 - [i19]Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan:
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. CoRR abs/1801.07541 (2018) - [i18]Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen:
Improved Approximation for Tree Augmentation: Saving by Rewiring. CoRR abs/1804.02242 (2018) - [i17]Joe Cheriyan, Jack Dippel, Fabrizio Grandoni, Arindam Khan, Vishnu V. Narayan:
The Matching Augmentation Problem: A 7/4-Approximation Algorithm. CoRR abs/1810.07816 (2018) - [i16]Fabrizio Grandoni, Bundit Laekhanukit, Shi Li:
O(log2k/log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm. CoRR abs/1811.03020 (2018) - 2017
- [j33]Marek Cygan
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy. ACM Trans. Algorithms 13(3): 43:1-43:22 (2017) - [c55]Waldo Gálvez
Approximating Geometric Knapsack via L-Packings. FOCS 2017: 260-271 - [c54]Marek Adamczyk, Fabrizio Grandoni
When the Optimum is also Blind: a New Perspective on Universal Optimization. ICALP 2017: 35:1-35:15 - [c53]Greg Bodwin, Fabrizio Grandoni
Preserving Distances in Very Faulty Graphs. ICALP 2017: 73:1-73:14 - [c52]Fabrizio Grandoni
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. SODA 2017: 2411-2422 - [c51]Fabrizio Grandoni
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. STOC 2017: 420-428 - [i15]Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams:
Preserving Distances in Very Faulty Graphs. CoRR abs/1703.10293 (2017) - [i14]Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk:
When the Optimum is also Blind: a New Perspective on Universal Optimization. CoRR abs/1707.01702 (2017) - [i13]Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams:
Truly Sub-cubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. CoRR abs/1707.05095 (2017) - [i12]Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan
Approximating Geometric Knapsack via L-packings. CoRR abs/1711.07710 (2017) - 2016
- [j32]Aris Anagnostopoulos
Online Network Design with Outliers. Algorithmica 76(1): 88-109 (2016) - [j31]Fabrizio Grandoni
Pricing on Paths: A PTAS for the Highway Problem. SIAM J. Comput. 45(2): 216-231 (2016) - [c50]Karl Bringmann, Fabrizio Grandoni
Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product. FOCS 2016: 375-384 - [c49]Waldo Gálvez
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. FSTTCS 2016: 9:1-9:14 - [e1]Erik D. Demaine, Fabrizio Grandoni:
8th International Conference on Fun with Algorithms, FUN 2016, June 8-10, 2016, La Maddalena, Italy. LIPIcs 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-005-7 [contents] - [r3]Fabrizio Grandoni:
Exact Algorithms for Maximum Independent Set. Encyclopedia of Algorithms 2016: 680-683 - [i11]Fabrizio Grandoni, Bundit Laekhanukit:
Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree. CoRR abs/1611.01644 (2016) - 2015
- [j30]Fabrizio Grandoni
An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph. Inf. Process. Lett. 115(2): 182-185 (2015) - [c48]Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee:
Improved Approximation Algorithms for Stochastic Matching. ESA 2015: 1-12 - [c47]Davide Bilò
Improved Purely Additive Fault-Tolerant Spanners. ESA 2015: 167-178 - [c46]Parinya Chalermsook, Fabrizio Grandoni
On Survivable Set Connectivity. SODA 2015: 25-36 - [c45]Amir Abboud, Fabrizio Grandoni
Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter. SODA 2015: 1681-1697 - [c44]Andreas Bärtschi
On Conflict-Free Multi-coloring. WADS 2015: 103-114 - [c43]Fabrizio Grandoni, Salvatore Ingala, Sumedha Uniyal
Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. WAOA 2015: 13-24 - [i10]Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee:
Improved Approximation Algorithms for Stochastic Matching. CoRR abs/1505.01439 (2015) - [i9]Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti:
Improved Purely Additive Fault-Tolerant Spanners. CoRR abs/1507.00505 (2015) - 2014
- [j29]Fabrizio Grandoni
New approaches to multi-objective optimization. Math. Program. 146(1-2): 525-554 (2014) - [j28]Fabrizio Grandoni
Utilitarian Mechanism Design for Multiobjective Optimization. SIAM J. Comput. 43(4): 1263-1290 (2014) - [c42]Aris Anagnostopoulos, Fabrizio Grandoni
A Mazing 2+∊ Approximation for Unsplittable Flow on a Path. SODA 2014: 26-41 - [i8]Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk:
An LP-Rounding $2\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph. CoRR abs/1405.0456 (2014) - 2013
- [j27]Fedor V. Fomin
Computing Optimal Steiner Trees in Polynomial Space. Algorithmica 65(3): 584-604 (2013) - [j26]Jaroslaw Byrka, Fabrizio Grandoni
Steiner Tree Approximation via Iterative Randomized Rounding. J. ACM 60(1): 6:1-6:33 (2013) - [j25]Umberto Ferraro Petrillo
Data structures resilient to memory faults: An experimental study of dictionaries. ACM J. Exp. Algorithmics 18 (2013) - [j24]Fabrizio Grandoni
Set Covering with Our Eyes Closed. SIAM J. Comput. 42(3): 808-830 (2013) - [c41]Marek Cygan
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract). ESA 2013: 361-372 - [c40]Aris Anagnostopoulos
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. IPCO 2013: 25-36 - [c39]Marek Cygan, Fabrizio Grandoni
How to Sell Hyperedges: The Hypermatching Assignment Problem. SODA 2013: 342-351 - [c38]Marek Cygan
On Pairwise Spanners. STACS 2013: 209-220 - [i7]Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha:
On Pairwise Spanners. CoRR abs/1301.1999 (2013) - [i6]Marek Cygan, Fabrizio Grandoni, Danny Hermelin:
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy. CoRR abs/1305.4914 (2013) - 2012
- [j23]Fedor V. Fomin
Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica 63(3): 692-706 (2012) - [c37]Marek Cygan
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. ESA 2012: 349-360 - [c36]Fabrizio Grandoni:
On Min-Power Steiner Tree. ESA 2012: 527-538 - [c35]Fabrizio Grandoni
Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths. FOCS 2012: 748-757 - [i5]Fabrizio Grandoni:
On Min-Power Steiner Tree. CoRR abs/1205.3605 (2012) - [i4]Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese:
A Mazing 2+eps Approximation for Unsplittable Flow on a Path. CoRR abs/1211.2670 (2012) - 2011
- [j22]Fabrizio Grandoni
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk. Math. Oper. Res. 36(2): 185-204 (2011) - [j21]André Berger, Vincenzo Bonifaci
Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Math. Program. 128(1-2): 355-372 (2011) - [c34]Marek Cygan
Approximation Algorithms for Union and Intersection Covering Problems. FSTTCS 2011: 28-40 - [c33]Fabrizio Grandoni, Thomas Rothvoß:
Approximation Algorithms for Single and Multi-Commodity Connected Facility Location. IPCO 2011: 248-260 - [c32]Fabrizio Grandoni
Pricing on Paths: A PTAS for the Highway Problem. SODA 2011: 675-684 - [i3]Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski:
Approximation Algorithms for Union and Intersection Covering Problems. CoRR abs/1102.5105 (2011) - 2010
- [j20]Friedrich Eisenbrand, Fabrizio Grandoni
Connected facility location via random facility sampling and core detouring. J. Comput. Syst. Sci. 76(8): 709-726 (2010) - [j19]Fabrizio Grandoni
Stable routing under the Spanning Tree Protocol. Oper. Res. Lett. 38(5): 399-404 (2010) - [c31]Fabrizio Grandoni, Rico Zenklusen:
Approximation Schemes for Multi-Budgeted Independence Systems. ESA (1) 2010: 536-548 - [c30]Aris Anagnostopoulos
Online Network Design with Outliers. ICALP (1) 2010: 114-126 - [c29]Fabrizio Grandoni, Thomas Rothvoß:
Network Design via Core Detouring for Problems without a Core. ICALP (1) 2010: 490-502 - [c28]Fedor V. Fomin
Sharp Separation and Applications to Exact and Parameterized Algorithms. LATIN 2010: 72-83 - [c27]Fabrizio Grandoni
Utilitarian Mechanism Design for Multi-Objective Optimization. SODA 2010: 573-584 - [c26]Jaroslaw Byrka, Fabrizio Grandoni
An improved LP-based approximation for steiner tree. STOC 2010: 583-592 - [c25]Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries. SEA 2010: 398-410 - [i2]Fabrizio Grandoni, Rico Zenklusen:
Optimization with More than One Budget. CoRR abs/1002.2147 (2010) - [i1]Fabrizio Grandoni, Thomas Rothvoß:
Prizing on Paths: A PTAS for the Highway Problem. CoRR abs/1004.3051 (2010)
2000 – 2009
- 2009
- [j18]Fedor V. Fomin
A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5): 25:1-25:32 (2009) - [j17]Irene Finocchi
Resilient dictionaries. ACM Trans. Algorithms 6(1): 1:1-1:19 (2009) - [j16]Josep Díaz
Balanced cut approximation in random geometric graphs. Theor. Comput. Sci. 410(27-29): 2725-2731 (2009) - [j15]Irene Finocchi
Optimal resilient sorting and searching in the presence of memory faults. Theor. Comput. Sci. 410(44): 4457-4470 (2009) - [c24]Fabrizio Grandoni, R. Ravi, Mohit Singh:
Iterative Rounding for Multi-Objective Optimization Problems. ESA 2009: 95-106 - 2008
- [j14]Fedor V. Fomin
Solving Connected Dominating Set Faster than 2 n . Algorithmica 52(2): 153-166 (2008) - [j13]Fabrizio Grandoni
A short proof of the VPN Tree Routing Conjecture on ring networks. Oper. Res. Lett. 36(3): 361-365 (2008) - [j12]Fabrizio Grandoni
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. SIAM J. Comput. 38(3): 825-840 (2008) - [j11]Fabrizio Grandoni
Distributed weighted vertex cover via maximal matchings. ACM Trans. Algorithms 5(1): 6:1-6:12 (2008) - [j10]Fedor V. Fomin
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Trans. Algorithms 5(1): 9:1-9:17 (2008) - [c23]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Faster Steiner Tree Computation in Polynomial-Space. ESA 2008: 430-441 - [c22]Fabrizio Grandoni
Set Covering with our Eyes Closed. FOCS 2008: 347-356 - [c21]André Berger
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. IPCO 2008: 273-287 - [c20]Friedrich Eisenbrand, Fabrizio Grandoni
Approximating connected facility location problems via random facility sampling and core detouring. SODA 2008: 1174-1183 - [r2]Dieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni:
Exact Algorithms for Dominating Set. Encyclopedia of Algorithms 2008 - 2007
- [j9]Irene Finocchi
Designing reliable algorithms in unreliable memories. Comput. Sci. Rev. 1(2): 77-87 (2007) - [j8]Friedrich Eisenbrand, Fabrizio Grandoni
New Approaches for Virtual Private Network Design. SIAM J. Comput. 37(3): 706-721 (2007) - [c19]Emilio De Santis, Fabrizio Grandoni, Alessandro Panconesi:
Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation. ESA 2007: 206-217 - [c18]Gerth Stølting Brodal
Optimal Resilient Dynamic Dictionaries. ESA 2007: 347-358 - [c17]Irene Finocchi, Fabrizio Grandoni
Resilient search trees. SODA 2007: 547-553 - [r1]Alessandro Panconesi, Fabrizio Grandoni
Distributed Approximation Algorithms via LP-Duality and Randomization. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j7]L. Sunil Chandran, Fabrizio Grandoni
A linear time algorithm to list the minimal separators of chordal graphs. Discret. Math. 306(3): 351-358 (2006) - [j6]Fabrizio Grandoni
A note on the complexity of minimum dominating set. J. Discrete Algorithms 4(2): 209-214 (2006) - [c16]Fabrizio Grandoni, Giuseppe F. Italiano:
Algorithms and Constraint Programming. CP 2006: 2-14 - [c15]Fedor V. Fomin
Solving Connected Dominating Set Faster Than 2n. FSTTCS 2006: 152-163 - [c14]Irene Finocchi
Optimal Resilient Sorting and Searching in the Presence of Memory Faults. ICALP (1) 2006: 286-298 - [c13]Fabrizio Grandoni, Giuseppe F. Italiano
Improved Approximation for Single-Sink Buy-at-Bulk. ISAAC 2006: 111-120 - [c12]Josep Díaz
Balanced Cut Approximation in Random Geometric Graphs. ISAAC 2006: 527-536 - [c11]Fedor V. Fomin, Fabrizio Grandoni
Measure and conquer: a simple O(20.288n) independent set algorithm. SODA 2006: 18-25 - 2005
- [j5]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bull. EATCS 87: 47-77 (2005) - [j4]Fedor V. Fomin
On maximum number of minimal dominating sets in graphs. Electron. Notes Discret. Math. 22: 157-162 (2005) - [j3]L. Sunil Chandran, Fabrizio Grandoni
Refined memorization for vertex cover. Inf. Process. Lett. 93(3): 123-131 (2005) - [c10]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi:
Distributed Weighted Vertex Cover via Maximal Matchings. COCOON 2005: 839-848 - [c9]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Designing Reliable Algorithms in Unreliable Memories. ESA 2005: 1-8 - [c8]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Measure and Conquer: Domination - A Case Study. ICALP 2005: 191-203 - [c7]Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella:
New Approaches for Virtual Private Network Design. ICALP 2005: 1151-1162 - [c6]Fedor V. Fomin
Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. ISAAC 2005: 573-582 - [c5]Fabrizio Grandoni
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. PODC 2005: 118-125 - [c4]Friedrich Eisenbrand, Fabrizio Grandoni
An improved approximation algorithm for virtual private network design. SODA 2005: 928-932 - 2004
- [j2]Friedrich Eisenbrand, Fabrizio Grandoni
On the complexity of fixed parameter clique and dominating set. Theor. Comput. Sci. 326(1-3): 57-67 (2004) - [c3]L. Sunil Chandran, Fabrizio Grandoni:
Refined Memorisation for Vertex Cover. IWPEC 2004: 61-70 - [c2]Fabrizio Grandoni, Giuseppe F. Italiano:
Decremental Clique Problem. WG 2004: 142-153 - 2003
- [j1]Friedrich Eisenbrand, Fabrizio Grandoni
Detecting directed 4-cycles still faster. Inf. Process. Lett. 87(1): 13-15 (2003) - [c1]Fabrizio Grandoni, Giuseppe F. Italiano:
Improved Algorithms for Max-restricted Path Consistency. CP 2003: 858-862
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: