index_new (original) (raw)

PUBLICATIONS

These are the preprints of my published papers. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In some cases, these works may not be reposted without the explicit permission of the copyright holder.

Journals

Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. J. Byrka, F. Grandoni, A. Jabal Ameli. SIAM Journal on Computing, 52(2): 718-739, 2023.

A tight (3/2+ε) approximation for skewed strip packing. W. Galvez, F. Grandoni, A. Jabal Ameli, K. Jansen, A. Khan, M. Rau. Algorithmica, 85(10): 3088-3019, 2023.

Subcubic equivalences between graph centrality problems, APSP and Diameter. A. Abboud, F. Grandoni, and V. Vassilevska Williams. _ACM Transactions on Algorithms,19(1): 3:1-3:30, 2023.

A refined approximation for Euclidean k-means.F. Grandoni, R. Ostrovsky, Y. Rabani, L. J. Schulman, and R. Venkat. Information Processing Letters, 176: 106-251, 2022.

Fully dynamic (Δ+1)-coloring in O(1) update time. S. Bhattacharya, F. Grandoni, J. Kulkarni, Q. C. Liu, and S. Solomon. ACM Transactions on Algorithms, 18(2): 10:1-10:25, 2022.

Approximating geometric knapsack via L-packings. W. Galvez, F. Grandoni, S. Heydrich, S. Ingala, and A. Khan, A. Wiese. ACM Transactions on Algorithms , 17(4): 33:1-33:67, 2021.

On the cycle augmentation problem: hardness and approximation algorithms. W. Galvez, F. Grandoni, A. Jabal Ameli, and K. Sornat. Theory of Computing Systems 65(6): 985-1008, 2021.

Faster replacement paths and distance sensitivity oracles. F. Grandoni and V. Vassilevska Williams. ACM Transactions on Algorithms, 16(1): 15:1-15:25, 2020.

The matching augmentation problem: a 7/4-approximation algorithm. J. Cheriyan, J. Dippel, F. Grandoni, A. Khan, and V.V. Narayan. Mathematical Programming, 182(1): 315-354, 2020.

Truly sub-cubic algorithms for language edit distance and RNA-folding via fast bounded-difference min-plus product. K. Bringmann, F. Grandoni, B. Saha, and V. Vassilevska Williams. SIAM Journal on Computing, 48(2): 481-512, 2019. Special issue devoted to the best papers of FOCS'16.

A mazing 2+ε approximation for unsplittable flow on a path.A. Anagnostopoulos, F. Grandoni, S. Leonardi, and A. Wiese.ACM Transactions on Algorithms, 14(4): 55:1-55:23, 2018.

Tight kernel bounds for problems on graphs with small degeneracy.M. Cygan, F. Grandoni, D. HermelinA. Anagnostopoulos, F. Grandoni, S. Leonardi, and A. Wiese. ACM Transactions on Algorithms, 13(3): 43:1-43:22, 2017.

Online network design with outliers. A. Anagnostopoulos, F. Grandoni, S. Leonardi, and P. Sankowski. Algorithmica, 76(1), 88-109, 2016.

Pricing on paths: a PTAS for the highway problem. F. Grandoni and T. Rothvoss. SIAM Journal on Computing, 45(2), 216-231, 2016.

An LP-rounding 2sqrt22\sqrt{2}2sqrt2-approximation for restricted maximum acyclic subgraph. F. Grandoni, T. Kociumaka, and M. Wlodarczyk. Information Processing Letters, 115: 182-185, 2015.

Utilitarian mechanism design for multi-objective optimization. F. Grandoni, P. Krysta, S. Leonardi, and C. Ventre. SIAM Journal on Computing, 43(4), 1263-1290, 2014.

New approaches to multi-objective optimization. F. Grandoni, R. Ravi, M. Singh, and R. Zenklusen. Mathematical Programming, 146(1-2): 525-554, 2014.

Steiner tree approximation via iterative randomized rounding. J. Byrka, F. Grandoni, T. Rothvoss, and L. Sanita. Journal of the ACM, 60(1), 2013.

Data structures resilient to memory faults: an experimental study of dictionaries. U. Ferraro-Petrilllo, F. Grandoni, and G. F. Italiano. ACM Journal of Experimental Algorithms, 18, 2013.

Computing optimal Steiner trees in polynomial space. F. V. Fomin, F. Grandoni, D. Kratsch, D. Lokshtanov, and S. Saurabh. Algorithmica, 65(3): 584-604, 2013.

Set covering with our eyes closed. F. Grandoni, A. Gupta, S. Leonardi, P. Miettinen, P. Sankowski, and M. Singh. SIAM Journal on Computing, 42(3): 808-830, 2013.

Sharp separation and applications to exact and parameterized algorithms. F. V. Fomin, F. Grandoni, D. Lokshtanov, and S. Saurabh. Algorithmica, 63(3): 692-706, 2012.

Budgeted matching and budgeted matroid intersection via the gasoline puzzle. A. Berger, V. Bonifaci, F. Grandoni, and G. Schafer. Mathematical Programming, 128(1-2): 355-372, 2011.

From uncertainty to non-linearity: Solving virtual private network via single-sink buy-at-bulk. F. Grandoni, T. Rothvoss, and L. Sanita. Mathematics of Operations Research, 36(2): 185-204, 2011.

Stable routing under the spanning tree protocol. F. Grandoni, G. Nicosia, G. Oriolo, and L. Sanita. Operations Research Letters, 38(5): 399-404, 2010.

Low degree connectivity of ad-hoc networks via percolation. E. De Santis, F. Grandoni, and A. Panconesi. Advances in Applied Probability, 42(2): 559-576, 2010.

Connected facility location via random facility sampling and core detouring. F. Eisenbrand, F. Grandoni, T. Rothvoss, and G. Schafer. Journal of Computer and System Sciences, 76: 709-726, 2010.

Balanced cut approximation in random geometric graphs. J. Diaz, F. Grandoni, and A. Marchetti-Spaccamela. Theoretical Computer Science, 410(27-29): 2725-2731, 2009.

Resilient dictionaries. I. Finocchi, F. Grandoni, and G. F. Italiano. ACM Transactions on Algorithms, 6(1), 2009.

Optimal resilient sorting and searching in the presence of dynamic memory faults. I. Finocchi, F. Grandoni, and G. F. Italiano. Theoretical Computer Science, 410(44): 4457--4470, 2009. Special issue devoted to the best papers of ICALP'06.

A measure & conquer approach for the analysis of exact algorithms. F. V. Fomin, F. Grandoni, and D. Kratsch. Journal of the ACM 56(5), 2009. EATCS NERODE PRIZE.

Solving connected dominating set faster than 2^n. F. V. Fomin, F. Grandoni, and D. Kratsch. Algorithmica, 52(2): 153-166, 2008.

Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. F. V. Fomin, F. Grandoni, A. V. Pyatkin, and A. A. Stepanov. ACM Transactions on Algorithms, 5(1), 2008.

A short proof of the VPN tree routing conjecture on ring networks. F. Grandoni, V. Kaibel, G. Oriolo, and M. Skutella. Operations Research Letters, 36(3): 361-365, 2008.

Distributed weighted vertex cover via maximal matchings. F. Grandoni, J. Konemann, and A. Panconesi. ACM Transactions on Algorithms, 5(1), 2008.

A primal-dual bicriteria distributed algorithm for capacitated vertex cover. F. Grandoni, J. Konemann, A. Panconesi, and M. Sozio. SIAM Journal on Computing, 38(3): 825-840, 2008.

New approaches for virtual private network design. F. Eisenbrand, F. Grandoni, G. Oriolo, and M. Skutella. SIAM Journal on Computing, 37(3): 706-721, 2007.

Designing reliable algorithms in unreliable memories. I. Finocchi, F. Grandoni, and G. F. Italiano. Computer Science Review, 1(2): 77-87, 2007.

A linear time algorithm to list the minimal separators of chordal graphs. L. S. Chandran and F. Grandoni. Discrete Mathematics, 306(3): 351-358, 2006.

A note on the complexity of minimum dominating set. F. Grandoni. Journal of Discrete Algorithms, 4(2): 209-214, 2006.

Refined memorization for vertex cover. L. S. Chandran and F. Grandoni. Information Processing Letters, 93(3):123--131, 2005.

Some new techniques in design and analysis of exact (exponential) algorithms. F.V. Fomin, F. Grandoni, and D. Kratsch. Bulletin of the European Association for Theoretical Computer Science, 87:47--77, 2005.

On the complexity of fixed parameter clique and dominating set. F. Eisenbrand and F. Grandoni. Theoretical Computer Science, 326(1-3): 57-67, 2004.

Detecting directed 4-cycles still faster. F. Eisenbrand and F. Grandoni. Information Processing Letters, 87(1):13-15, 2003.

Conferences

Unsplittable flow on a short path. I. Doron-Arad, F. Grandoni, and A. Kulik. International Symposium on Parameterized and Exact Computation (IPEC) , 2024. To appear.

The bidirected cut relaxation for Steiner tree has integrality gap smaller than 2. J. Byrka, F. Grandoni, and V. Traub. IEEE Symposium on Foundations of Computer Science (FOCS) , 2024. To appear.

An O(loglog n)-approximation for submodular facility location. F. Abbasi, M. Adamczyk, M. Bosch-Calvo, J. Byrka, F. Grandoni, K. Sornat, and A. Tinguely. International Colloquium on Automata, Languages and Programming (ICALP) , 5:1-5:20, 2024.

Approximating the maximum independent set of convex polygons with a bounded number of directions. F. Grandoni, E. Husic, and M. Mari, and A. Tinguely. _International Symposium on Computational Geometry (SoCG) , 61:1-61:16, 2024.

A 4/3 approximation for 2-vertex-connectivity. M. Bosch-Calvo, F. Grandoni, and A. Jabal Ameli. International Colloquium on Automata, Languages and Programming (ICALP) , 29:1-29:13, 2023. BEST PAPER AWARD.

Unsplittable Euclidean capacitated vehicle routing: a (2+ε)-approximation algorithm. F. Grandoni, C. Mathieu, and H. Zhou. _Innovations in Theoretical Computer Science (ITCS), 63:1-63:12, 2023.

Breaching the 2 LMP approximation barrier for facility location and applications to k-median. V. Cohen-Addad, F. Grandoni, E. Lee, and C. Schwiegelshohn. _ACM-SIAM Symposium on Discrete Algorithms (SODA), 940-986, 2023.

Improved approximation for two-edge-connectivity. M. Garg, F. Grandoni, and A. Jabal Ameli. _ACM-SIAM Symposium on Discrete Algorithms (SODA), 2368-2410, 2023.

Breaching the 2-approximation barrier for the forest augmentation problem. F. Grandoni, A. Jabal Ameli, and V. Traub. _ACM Symposium on Theory of Computing (STOC), 1598-1611, 2022.

A PTAS for unsplittable flow on a path. F. Grandoni, T. Momke, and A. Wiese. _ACM Symposium on Theory of Computing (STOC), 289-302, 2022.

Unsplittable flow on a path: the game!. F. Grandoni, T. Momke, and A. Wiese. _ACM-SIAM Symposium on Discrete Algorithms (SODA),906-926, 2022.

Maintaining and EDCS in general graphs: simpler, density-sensitive and with worst-case time bounds. F. Grandoni, C. Schwiegelshohn, S. Solomon, and A. Uzrad. SIAM Symposium on Simplicity in Algorithms (SOSA) , 12-23, 2022.

Faster(1+ε) approximation for unsplittable flow on a path via resource augmentation and back. F. Grandoni, T. Momke, and A. Wiese. European Symposium on Algorithms (ESA) , 49:1-49:15, 2021.

Approximation algorithms for demand strip packing. W. Galvez, F. Grandoni, A. Jabal Ameli, K. Khodamoradi. APPROX/RANDOM, 20:1-20:24, 2021.

Improved approximation algorithms for 2-dimensional knapsack: packing into multiple L-shapes, spirals, and more. W. Galvez, F. Grandoni, A. Khan, D. Ramirez-Romero, A. Wiese. International Symposium on Computational Geometry (SoCG), 39:1-39:17, 2021.

Online Edge Coloring Algorithms via the Nibble Method. S. Bhattacharya, F. Grandoni, D. Wajc. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2830-2842, 2021.

All-pairs LCA in DAGs: breaking through the O(n^2.5) barrier. F. Grandoni, G. Italiano, A. Lukasiewicz, N. Parotsidis, P. Uznanski. ACM-SIAM Symposium on Discrete Algorithms (SODA), 273-289, 2021.

A tight (3/2+ε) approximation for skewed strip packing. W. Galvez, F. Grandoni, A. Jabal Ameli, K. Jansen, A. Khan, M. Rau. APPROX/RANDOM, 44:1-44:18, 2020.

Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. J. Byrka, F. Grandoni, A. Jabal Ameli. ACM Symposium on Theory of Computing (STOC), 815-825, 2020.

On the cycle augmentation problem: hardness and approximation algorithms. W. Galvez, F. Grandoni, A. Jabal Ameli, and K. Sornat. Workshop on Approximation and Online Algorithms (WAOA) , 138-153, 2019.

Parameterized approximation schemes for independent set of rectangles and geometric knapsack. F. Grandoni, S. Kratsch, and A. Wiese. European Symposium on Algorithms (ESA) , 53:1-53:16, 2019.

Packing cars into narrow roads: PTASs for limited supply highway. F. Grandoni and A. Wiese. European Symposium on Algorithms (ESA) , 54:1-54:14, 2019.

Dynamic set cover: improved algorithms and lower bounds. A. Abboud, R. Addanki, F. Grandoni, D. Panigrahi, B. Saha. ACM Symposium on Theory of Computing (STOC), 114-125, 2019.

Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma. L. Becchetti, M. Bury, V. Cohen-Addad, F. Grandoni, C. Schwiegelshohn. ACM Symposium on Theory of Computing (STOC), 1039-1050, 2019.

O(log^2 k/loglog k) approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. F. Grandoni, B. Laekhanukit, S. Li. ACM Symposium on Theory of Computing (STOC), 253-264, 2019.

(1+ε)-Approximate incremental matching in constant deterministic amortized time. F. Grandoni, S. Leonardi, P. Sankowski, C. Schwiegelshohn, S. Solomon. ACM-SIAM Symposium on Discrete Algorithms (SODA), 1886-1898, 2019.

Improved approximation for tree augmentation: saving by rewiring. F. Grandoni, C. Kalaitzis, and R. Zenklusen. ACM Symposium on Theory of Computing (STOC), 632-645, 2018.

A (5/3+ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. F. Grandoni, T. Momke, A. Wiese, and H. Zhou.ACM Symposium on Theory of Computing (STOC), 607-619, 2018.

Approximating geometric knapsack via L-packings. W. Galvez, F. Grandoni, S. Heydrich, S. Ingala, and A. Khan, A. Wiese. IEEE Symposium on Foundations of Computer Science (FOCS) , 260-271, 2017.

Preserving distances in very faulty graphs. G. Bodwin, F. Grandoni, M. Parter, and V. Vassilevska Williams. International Colloquium on Automata, Languages and Programming (ICALP) , 73:1-73:14, 2017.

When the optimum is also blind: a new perspective on universal optimization. M. Adamczyk, F. Grandoni, S. Leonardi, and M. Wlodarczyk. International Colloquium on Automata, Languages and Programming (ICALP) , 35:1-35:15, 2017.

Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. F. Grandoni and B. Laekhanukit. ACM Symposium on Theory of Computing (STOC), 420-428, 2017.

To augment or not to augment: solving unsplittable flow on a path by creating slack. F. Grandoni, T. Momke, A. Wiese, and H. Zhou.ACM-SIAM Symposium on Discrete Algorithms (SODA), 2411-2422, 2017.

Improved pseudo-polynomial-time approximation for strip packing. W. Galvez, F. Grandoni, S. Ingala, and A. Khan. Foundations of Software Technology and Theoretical Computer Science (FSTTCS) , 9:1-9:14, 2016.

Truly sub-cubic algorithms for language edit distance and RNA-folding via fast bounded-difference min-plus product. K. Bringmann, F. Grandoni, B. Saha, and V. Vassilevska Williams.IEEE Symposium on Foundations of Computer Science (FOCS), 375-384, 2016.

Improved approximation algorithms for unsplittable flow on a path with time windows. F. Grandoni, S. Ingala, and S. Uniyal. Workshop on Approximation and Online Algorithms (WAOA) , 13-24, 2015.

Improved purely additive fault-tolerant spanners. D. Bilo, F. Grandoni, L. Guala, S. Leucci, and G. Proietti. European Symposium on Algorithms (ESA) , 167-178, 2015.

Improved approximation algorithms for stochastic matching. M. Adamczyk, F. Grandoni, and J. Mukherjee. European Symposium on Algorithms (ESA) , 1-12, 2015.

On conflict-free multi-coloring. A. Bartschi and F. Grandoni. Algorithms and Data Structures Symposium (WADS), 103-114, 2015.

Subcubic equivalences between graph centrality problems, APSP and Diameter. A. Abboud, F. Grandoni, and V. Vassilevska Williams. ACM-SIAM Symposium on Discrete Algorithms (SODA), 1681-1697, 2015.

On survivable set connectivity. P. Chalermsook, F. Grandoni, and B. Laekhanukit. ACM-SIAM Symposium on Discrete Algorithms (SODA), 25-36, 2015.

A Mazing 2+ε Approximation for Unsplittable Flow on a Path. A. Anagnostopoulos, F. Grandoni, S. Leonardi, and A. Wiese. ACM-SIAM Symposium on Discrete Algorithms (SODA), 26-41, 2014.

Constant integrality gap LP formulations of unsplittable flow on a path. A. Anagnostopoulos, F. Grandoni, S. Leonardi, and A. Wiese. Conference on Integer Programming and Combinatorial Optimization (IPCO), 25-36, 2013.

Tight kernel bounds for problems on graphs with small degeneracy - (Extended Abstract). M. Cygan, F. Grandoni, D. Hermelin. European Symposium on Algorithms (ESA), 361-372, 2013.

How to sell hyperedges: the hypermatching assignment problem. M. Cygan, F. Grandoni, and M. Mastrolilli. ACM-SIAM Symposium on Discrete Algorithms (SODA), 342-351, 2013.

On pairwise spanners. M. Cygan, F. Grandoni, and K. Telikepalli. Symposium on Theoretical Aspects of Computer Science (STACS), 209-220, 2013.

A path-decomposition theorem with applications to pricing and covering on trees. M. Cygan, F. Grandoni, S. Leonardi, M. Pilipczuk, and P. Sankowski. European Symposium on Algorithms (ESA), 349-360, 2012.

On min-power Steiner tree. F. Grandoni.European Symposium on Algorithms (ESA), 527-538, 2012.

Improved distance sensitivity oracles via fast single-source replacement paths. F. Grandoni and V. Vassilevska Williams. In IEEE Symposium on Foundations of Computer Science (FOCS), 748-757, 2012.

Approximation algorithms for union and intersection covering problems. M. Cygan, F. Grandoni, S. Leonardi, M. Mucha, M. Pilipczuk, and P. Sankowski. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS) , 28-40, 2011.

Pricing on paths: a PTAS for the highway problem. F. Grandoni and T. Rothvoss. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 675-684, 2011.

Approximation algorithms for single and multi-commodity connected facility location. F. Grandoni and T. Rothvoss. Conference on Integer Programming and Combinatorial Optimization (IPCO), 248-260, 2011.

Online network design with outliers. A. Anagnostopoulos, F. Grandoni, S. Leonardi, and P. Sankowski. International Colloquium on Automata, Languages and Programming (ICALP) , 114-126, 2010.

An improved LP-based approximation for Steiner tree. J. Byrka, F. Grandoni, T. Rothvoss, and L. Sanita.ACM Symposium on Theory of Computing (STOC), 583-592, 2010. BEST PAPER AWARD.

Data structures resilient to memory faults: an experimental study of dictionaries. U. Ferraro-Petrillo, F. Grandoni, and G. F. Italiano. International Symposium on Experimental Algorithms (SEA), 398-410, 2010.

Sharp separation and applications to exact and parameterized algorithms. F. V. Fomin, F. Grandoni, D. Lokshtanov, and S. Saurabh. Latin American Theoretical Informatics Symposium (LATIN), 72-83, 2010.

Utilitarian mechanism design for multi-objective optimization. F. Grandoni, P. Krysta, S. Leonardi, and C. Ventre. ACM-SIAM Symposium on Discrete Algorithms (SODA), 573-584, 2010.

Network design via core detouring for problems without a core. F. Grandoni and T. Rothvoss. International Colloquium on Automata, Languages and Programming (ICALP) , 490-502, 2010.

Approximation schemes for multi-budgeted independence systems. F. Grandoni and R. Zenklusen. European Symposium on Algorithms (ESA), 536-548, 2010.

Iterative rounding for multi-objective optimization problems. F. Grandoni, R. Ravi, and M. Singh. European Symposium on Algorithms (ESA), 95-106, 2009.

Budgeted matching and budgeted matroid intersection via the gasoline puzzle. A. Berger, V. Bonifaci, F. Grandoni, and G. Schafer. Conference on Integer Programming and Combinatorial Optimization (IPCO), 273-287, 2008.

Approximating connected facility location problems via random facility sampling and core detouring. F. Eisenbrand, F. Grandoni, T. Rothvoss, and G. Schafer. ACM-SIAM Symposium on Discrete Algorithms (SODA), 1174-1183, 2008.

Faster Steiner tree computation in polynomial space. F. V. Fomin, F. Grandoni, and D. Kratsch. European Symposium on Algorithms (ESA), 430-441, 2008.

Set covering with our eyes closed. F. Grandoni, A. Gupta, S. Leonardi, P. Miettinen, P. Sankowski, M. Singh. IEEE Symposium on Foundations of Computer Science (FOCS), 347-356, 2008.

Optimal resilient dynamic dictionaries. G. S. Brodal, R. Fagerberg, I. Finocchi, F. Grandoni, G. F. Italiano, A. G. Jorgensen, G. Moruz, and T. Molhave. European Symposium on Algorithms (ESA), 347-358, 2007.

Fast low degree connectivity of ad-hoc networks via percolation. E. De Santis, F. Grandoni, and A. Panconesi. European Symposium on Algorithms (ESA), 206-217, 2007.

Resilient search trees. I. Finocchi, F. Grandoni, and G. F. Italiano. ACM-SIAM Symposium on Discrete Algorithms (SODA), 547-555, 2007.

Balanced cut approximation in random geometric graphs. J. Diaz, F. Grandoni, and A. Marchetti-Spaccamela. International Symposium on Algorithms and Computation (ISAAC), 527-536, 2006.

Optimal resilient sorting and searching in the presence of memory faults. I. Finocchi, F. Grandoni, and G. F. Italiano. International Colloquium on Automata, Languages and Programming (ICALP), 286-298, 2006.

Measure and conquer: a simple O(2^{0.288 n}) independent set algorithm. F. Fomin, F. Grandoni, and D. Kratsch. ACM-SIAM Symposium on Discrete Algorithms (SODA), 18-25, 2006.

Solving connected dominating set faster than 2^n. F. Fomin, F. Grandoni, and D. Kratsch. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 152-163, 2006.

Algorithms and constraint programming. F. Grandoni and G. F. Italiano. Principles and Practice of Constraint Programming (CP), 2-14, 2006.

Improved approximation for single-sink buy-at-bulk. F. Grandoni and G. F. Italiano. International Symposium on Algorithms and Computation (ISAAC), 111-120, 2006.

An improved approximation algorithm for virtual private network design. F. Eisenbrand and F. Grandoni. ACM-SIAM Symposium on Discrete Algorithms (SODA), 928--932, 2005.

New approaches for virtual private network design. F. Eisenbrand, F. Grandoni, G. Oriolo, and M. Skutella. International Colloquium on Automata, Languages and Programming (ICALP), 1151-1162, 2005.

Designing reliable algorithms in unreliable memories. I. Finocchi, F. Grandoni, and G. F. Italiano. European Symposium on Algorithms (ESA), 1-8, 2005.

Measure and conquer: domination - a case study. F. Fomin, F. Grandoni, and D. Kratsch. International Colloquium on Automata, Languages and Programming (ICALP), 191-203, 2005.

Bounding the number of minimal dominating sets: a measure and conquer approach. F. Fomin, F. Grandoni, A. Pyatkin, and A. A. Stepanov. International Symposium on Algorithms and Computation (ISAAC), 573-582, 2005.

Distributed weighted vertex cover via maximal matchings. F. Grandoni, J. Konemann, and A. Panconesi. International Computing and Combinatorics Conference (COCOON), 839-848, 2005.

Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. F. Grandoni, J. Konemann, A. Panconesi, and M. Sozio. ACM Symposium on Principles of Distributed Computing (PODC), 118-125, 2005.

Refined memorisation for vertex cover. L.S. Chandran and F. Grandoni. International Workshop on Parameterized and Exact Computation (IWPEC), 61-70, 2004.

Decremental clique problem. F. Grandoni and G. F. Italiano. International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 142-153, 2004.

Improved algorithms for max-restricted path consistency. F. Grandoni and G. F. Italiano. International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 142-153, 2004.

Other

Exact algorithms for maximum independent set. F. Grandoni. Entry of Encyclopedia of Algorithms, 680-683, 2016 .

Exact algorithms for dominating set. F. V. Fomin, F. Grandoni, and D. Kratsch. Entry of Encyclopedia of Algorithms, 2008_._

Distributed approximation algorithms via LP-duality and randomization. D. Dubhashi, F. Grandoni, and A. Panconesi. Chapter 13 of "Handbook of Approximation Algorithms and Metaheuristics". Taylor and Francis, 2007.

On the maximum number of minimal dominating sets in graphs. F. Fomin, F. Grandoni, A. Pyatkin, and A. A. Stepanov. Electronic Notes in Discrete Mathematics 22: 157-162, 2005.

Exact algorithms for hard graph problems. F. Grandoni. Ph.D. Thesis. University of Rome Tor Vergata. 2004.