The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Fabrizio Grandoni: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi
    Distributed Weighted Vertex Cover via Maximal Matchings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:839-848 [Conf]
  2. Fabrizio Grandoni, Giuseppe F. Italiano
    Improved Algorithms for Max-restricted Path Consistency. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:858-862 [Conf]
  3. Fabrizio Grandoni, Giuseppe F. Italiano
    Algorithms and Constraint Programming. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:2-14 [Conf]
  4. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
    Designing Reliable Algorithms in Unreliable Memories. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:1-8 [Conf]
  5. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    Solving Connected Dominating Set Faster Than 2n. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:152-163 [Conf]
  6. Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
    New Approaches for Virtual Private Network Design. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1151-1162 [Conf]
  7. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
    Optimal Resilient Sorting and Searching in the Presence of Memory Faults. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:286-298 [Conf]
  8. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    Measure and Conquer: Domination - A Case Study. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:191-203 [Conf]
  9. Josep Diaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela
    Balanced Cut Approximation in Random Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:527-536 [Conf]
  10. Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
    Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:573-582 [Conf]
  11. Fabrizio Grandoni, Giuseppe F. Italiano
    Improved Approximation for Single-Sink Buy-at-Bulk. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:111-120 [Conf]
  12. L. Sunil Chandran, Fabrizio Grandoni
    Refined Memorisation for Vertex Cover. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:61-70 [Conf]
  13. Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio
    Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:118-125 [Conf]
  14. Friedrich Eisenbrand, Fabrizio Grandoni
    An improved approximation algorithm for virtual private network design. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:928-932 [Conf]
  15. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    Measure and conquer: a simple O(20.288n) independent set algorithm. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:18-25 [Conf]
  16. Fabrizio Grandoni, Giuseppe F. Italiano
    Decremental Clique Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:142-153 [Conf]
  17. L. Sunil Chandran, Fabrizio Grandoni
    A linear time algorithm to list the minimal separators of chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:3, pp:351-358 [Journal]
  18. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:87, n:, pp:47-77 [Journal]
  19. L. Sunil Chandran, Fabrizio Grandoni
    Refined memorization for vertex cover. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:3, pp:123-131 [Journal]
  20. Friedrich Eisenbrand, Fabrizio Grandoni
    Detecting directed 4-cycles still faster. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:1, pp:13-15 [Journal]
  21. Fabrizio Grandoni
    A note on the complexity of minimum dominating set. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:2, pp:209-214 [Journal]
  22. Friedrich Eisenbrand, Fabrizio Grandoni
    On the complexity of fixed parameter clique and dominating set. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:57-67 [Journal]
  23. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:347-358 [Conf]
  24. Emilio De Santis, Fabrizio Grandoni, Alessandro Panconesi
    Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:206-217 [Conf]
  25. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
    Resilient search trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:547-553 [Conf]
  26. Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
    New Approaches for Virtual Private Network Design. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:3, pp:706-721 [Journal]

  27. Faster Steiner Tree Computation in Polynomial-Space. [Citation Graph (, )][DBLP]


  28. Iterative Rounding for Multi-Objective Optimization Problems. [Citation Graph (, )][DBLP]


  29. Approximation Schemes for Multi-Budgeted Independence Systems. [Citation Graph (, )][DBLP]


  30. Set Covering with our Eyes Closed. [Citation Graph (, )][DBLP]


  31. Online Network Design with Outliers. [Citation Graph (, )][DBLP]


  32. Network Design via Core Detouring for Problems without a Core. [Citation Graph (, )][DBLP]


  33. Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. [Citation Graph (, )][DBLP]


  34. Sharp Separation and Applications to Exact and Parameterized Algorithms. [Citation Graph (, )][DBLP]


  35. Approximating connected facility location problems via random facility sampling and core detouring. [Citation Graph (, )][DBLP]


  36. Utilitarian Mechanism Design for Multi-Objective Optimization. [Citation Graph (, )][DBLP]


  37. An improved LP-based approximation for steiner tree. [Citation Graph (, )][DBLP]


  38. Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries. [Citation Graph (, )][DBLP]


  39. Solving Connected Dominating Set Faster than 2 n . [Citation Graph (, )][DBLP]


  40. Optimization with More than One Budget [Citation Graph (, )][DBLP]


  41. Prizing on Paths: A PTAS for the Highway Problem [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002