other persons with the same name:
| 2008 | ||
|---|---|---|
| 36 | EE | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Faster Steiner Tree Computation in Polynomial-Space. ESA 2008: 430-441 |
| 35 | EE | Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh: Set Covering with our Eyes Closed. FOCS 2008: 347-356 |
| 34 | EE | André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer: Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. IPCO 2008: 273-287 |
| 33 | EE | Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer: Approximating connected facility location problems via random facility sampling and core detouring. SODA 2008: 1174-1183 |
| 32 | EE | Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov: Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Transactions on Algorithms 5(1): (2008) |
| 31 | EE | Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi: Distributed weighted vertex cover via maximal matchings. ACM Transactions on Algorithms 5(1): (2008) |
| 30 | EE | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Solving Connected Dominating Set Faster than 2 n . Algorithmica 52(2): 153-166 (2008) |
| 29 | EE | Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo, Martin Skutella: A short proof of the VPN Tree Routing Conjecture on ring networks. Oper. Res. Lett. 36(3): 361-365 (2008) |
| 28 | EE | Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio: A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. SIAM J. Comput. 38(3): 825-840 (2008) |
| 2007 | ||
| 27 | EE | Emilio De Santis, Fabrizio Grandoni, Alessandro Panconesi: Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation. ESA 2007: 206-217 |
| 26 | EE | Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave: Optimal Resilient Dynamic Dictionaries. ESA 2007: 347-358 |
| 25 | EE | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Resilient search trees. SODA 2007: 547-553 |
| 24 | EE | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Designing reliable algorithms in unreliable memories. Computer Science Review 1(2): 77-87 (2007) |
| 23 | EE | Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella: New Approaches for Virtual Private Network Design. SIAM J. Comput. 37(3): 706-721 (2007) |
| 2006 | ||
| 22 | EE | Fabrizio Grandoni, Giuseppe F. Italiano: Algorithms and Constraint Programming. CP 2006: 2-14 |
| 21 | EE | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Solving Connected Dominating Set Faster Than 2n. FSTTCS 2006: 152-163 |
| 20 | EE | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Optimal Resilient Sorting and Searching in the Presence of Memory Faults. ICALP (1) 2006: 286-298 |
| 19 | EE | Fabrizio Grandoni, Giuseppe F. Italiano: Improved Approximation for Single-Sink Buy-at-Bulk. ISAAC 2006: 111-120 |
| 18 | EE | Josep Díaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela: Balanced Cut Approximation in Random Geometric Graphs. ISAAC 2006: 527-536 |
| 17 | EE | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Measure and conquer: a simple O(20.288n) independent set algorithm. SODA 2006: 18-25 |
| 16 | EE | L. Sunil Chandran, Fabrizio Grandoni: A linear time algorithm to list the minimal separators of chordal graphs. Discrete Mathematics 306(3): 351-358 (2006) |
| 15 | EE | Fabrizio Grandoni: A note on the complexity of minimum dominating set. J. Discrete Algorithms 4(2): 209-214 (2006) |
| 2005 | ||
| 14 | EE | Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi: Distributed Weighted Vertex Cover via Maximal Matchings. COCOON 2005: 839-848 |
| 13 | EE | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Designing Reliable Algorithms in Unreliable Memories. ESA 2005: 1-8 |
| 12 | EE | Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella: New Approaches for Virtual Private Network Design. ICALP 2005: 1151-1162 |
| 11 | EE | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Measure and Conquer: Domination - A Case Study. ICALP 2005: 191-203 |
| 10 | EE | Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov: Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. ISAAC 2005: 573-582 |
| 9 | EE | Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio: Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. PODC 2005: 118-125 |
| 8 | EE | Friedrich Eisenbrand, Fabrizio Grandoni: An improved approximation algorithm for virtual private network design. SODA 2005: 928-932 |
| 7 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bulletin of the EATCS 87: 47-77 (2005) | |
| 6 | EE | L. Sunil Chandran, Fabrizio Grandoni: Refined memorization for vertex cover. Inf. Process. Lett. 93(3): 123-131 (2005) |
| 2004 | ||
| 5 | EE | L. Sunil Chandran, Fabrizio Grandoni: Refined Memorisation for Vertex Cover. IWPEC 2004: 61-70 |
| 4 | EE | Fabrizio Grandoni, Giuseppe F. Italiano: Decremental Clique Problem. WG 2004: 142-153 |
| 3 | EE | Friedrich Eisenbrand, Fabrizio Grandoni: On the complexity of fixed parameter clique and dominating set. Theor. Comput. Sci. 326(1-3): 57-67 (2004) |
| 2003 | ||
| 2 | EE | Fabrizio Grandoni, Giuseppe F. Italiano: Improved Algorithms for Max-restricted Path Consistency. CP 2003: 858-862 |
| 1 | EE | Friedrich Eisenbrand, Fabrizio Grandoni: Detecting directed 4-cycles still faster. Inf. Process. Lett. 87(1): 13-15 (2003) |
| 1 | André Berger | [34] |
| 2 | Vincenzo Bonifaci | [34] |
| 3 | Gerth Stølting Brodal | [26] |
| 4 | L. Sunil Chandran | [5] [6] [16] |
| 5 | Josep Díaz | [18] |
| 6 | Friedrich Eisenbrand | [1] [3] [8] [12] [23] [33] |
| 7 | Rolf Fagerberg | [26] |
| 8 | Irene Finocchi | [13] [20] [24] [25] [26] |
| 9 | Fedor V. Fomin | [7] [10] [11] [17] [21] [30] [32] [36] |
| 10 | Anupam Gupta | [35] |
| 11 | Giuseppe F. Italiano | [2] [4] [13] [19] [20] [22] [24] [25] [26] |
| 12 | Allan Grønlund Jørgensen | [26] |
| 13 | Volker Kaibel | [29] |
| 14 | Jochen Könemann | [9] [14] [28] [31] |
| 15 | Dieter Kratsch | [7] [11] [17] [21] [30] [36] |
| 16 | Stefano Leonardi | [35] |
| 17 | Alberto Marchetti-Spaccamela | [18] |
| 18 | Pauli Miettinen | [35] |
| 19 | Thomas Mølhave | [26] |
| 20 | Gabriel Moruz | [26] |
| 21 | Gianpaolo Oriolo | [12] [23] [29] |
| 22 | Alessandro Panconesi | [9] [14] [27] [28] [31] |
| 23 | Artem V. Pyatkin | [10] [32] |
| 24 | Thomas Rothvoß | [33] |
| 25 | Piotr Sankowski | [35] |
| 26 | Emilio De Santis | [27] |
| 27 | Guido Schäfer | [33] [34] |
| 28 | Mohit Singh | [35] |
| 29 | Martin Skutella | [12] [23] [29] |
| 30 | Mauro Sozio | [9] [28] |
| 31 | Alexey A. Stepanov | [10] [32] |