Fabrizio Grandoni

List of publications from the DBLP Bibliography Server - FAQ

other persons with the same name:


Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
30EEAndré Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer: Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. IPCO 2008: 273-287
29EEFriedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer: Approximating connected facility location problems via random facility sampling and core detouring. SODA 2008: 1174-1183
28EEFabrizio 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)
27EEFabrizio 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
26EEEmilio De Santis, Fabrizio Grandoni, Alessandro Panconesi: Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation. ESA 2007: 206-217
25EEGerth 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
24EEIrene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Resilient search trees. SODA 2007: 547-553
23EEFriedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella: New Approaches for Virtual Private Network Design. SIAM J. Comput. 37(3): 706-721 (2007)
2006
22EEFabrizio Grandoni, Giuseppe F. Italiano: Algorithms and Constraint Programming. CP 2006: 2-14
21EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Solving Connected Dominating Set Faster Than 2n. FSTTCS 2006: 152-163
20EEIrene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Optimal Resilient Sorting and Searching in the Presence of Memory Faults. ICALP (1) 2006: 286-298
19EEFabrizio Grandoni, Giuseppe F. Italiano: Improved Approximation for Single-Sink Buy-at-Bulk. ISAAC 2006: 111-120
18EEJosep Diaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela: Balanced Cut Approximation in Random Geometric Graphs. ISAAC 2006: 527-536
17EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Measure and conquer: a simple O(20.288n) independent set algorithm. SODA 2006: 18-25
16EEL. Sunil Chandran, Fabrizio Grandoni: A linear time algorithm to list the minimal separators of chordal graphs. Discrete Mathematics 306(3): 351-358 (2006)
15EEFabrizio Grandoni: A note on the complexity of minimum dominating set. J. Discrete Algorithms 4(2): 209-214 (2006)
2005
14EEFabrizio Grandoni, Jochen Könemann, Alessandro Panconesi: Distributed Weighted Vertex Cover via Maximal Matchings. COCOON 2005: 839-848
13EEIrene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Designing Reliable Algorithms in Unreliable Memories. ESA 2005: 1-8
12EEFriedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella: New Approaches for Virtual Private Network Design. ICALP 2005: 1151-1162
11EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Measure and Conquer: Domination - A Case Study. ICALP 2005: 191-203
10EEFedor 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
9EEFabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio: Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. PODC 2005: 118-125
8EEFriedrich 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)
6EEL. Sunil Chandran, Fabrizio Grandoni: Refined memorization for vertex cover. Inf. Process. Lett. 93(3): 123-131 (2005)
2004
5EEL. Sunil Chandran, Fabrizio Grandoni: Refined Memorisation for Vertex Cover. IWPEC 2004: 61-70
4EEFabrizio Grandoni, Giuseppe F. Italiano: Decremental Clique Problem. WG 2004: 142-153
3EEFriedrich Eisenbrand, Fabrizio Grandoni: On the complexity of fixed parameter clique and dominating set. Theor. Comput. Sci. 326(1-3): 57-67 (2004)
2003
2EEFabrizio Grandoni, Giuseppe F. Italiano: Improved Algorithms for Max-restricted Path Consistency. CP 2003: 858-862
1EEFriedrich Eisenbrand, Fabrizio Grandoni: Detecting directed 4-cycles still faster. Inf. Process. Lett. 87(1): 13-15 (2003)

Coauthor Index

1André Berger [30]
2Vincenzo Bonifaci [30]
3Gerth Stølting Brodal [25]
4L. Sunil Chandran [5] [6] [16]
5Josep Diaz [18]
6Friedrich Eisenbrand [1] [3] [8] [12] [23] [29]
7Rolf Fagerberg [25]
8Irene Finocchi [13] [20] [24] [25]
9Fedor V. Fomin [7] [10] [11] [17] [21]
10Giuseppe F. Italiano [2] [4] [13] [19] [20] [22] [24] [25]
11Allan Grønlund Jørgensen [25]
12Volker Kaibel [28]
13Jochen Könemann [9] [14] [27]
14Dieter Kratsch [7] [11] [17] [21]
15Alberto Marchetti-Spaccamela [18]
16Thomas Mølhave [25]
17Gabriel Moruz [25]
18Gianpaolo Oriolo [12] [23] [28]
19Alessandro Panconesi [9] [14] [26] [27]
20Artem V. Pyatkin [10]
21Thomas Rothvoß [29]
22Emilio De Santis [26]
23Guido Schäfer [29] [30]
24Martin Skutella [12] [23] [28]
25Mauro Sozio [9] [27]
26Alexey A. Stepanov [10]

Colors in the list of coauthors

Copyright © Fri Jul 4 15:51:06 2008 by Michael Ley (ley@uni-trier.de)