Giuseppe F. Italiano

Dany Breslauer, Giuseppe F. Italiano: Near real-time suffix tree construction via the fringe marked ancestor problem. J. Discrete Algorithms 18: 32-48 (2013)

Peter van Emde Boas, Frans C. A. Groen, Giuseppe F. Italiano, Jerzy R. Nawrocki, Harald Sack (Eds.): SOFSEM 2013: Theory and Practice of Computer Science, 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 26-31, 2013. Proceedings. Lecture Notes in Computer Science 7741, Springer 2013, isbn 978-3-642-35842-5

Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini: On Robust Graph Spanners. CoRR abs/1303.1559 (2013)

Giuseppe F. Italiano, Luigi Laura, Federico Santaroni: Finding strong bridges and strong articulation points in linear time. Theor. Comput. Sci. 447: 74-84 (2012)

Dany Breslauer, Giuseppe F. Italiano: On suffix extensions in suffix trees. Theor. Comput. Sci. 457: 27-34 (2012)

Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni: An Experimental Study of Dynamic Dominators. ESA 2012: 491-502

Marco Querini, Giuseppe F. Italiano: Facial Biometrics for 2D Barcodes. FedCSIS 2012: 755-762

Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco: Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. ISCO 2012: 1-14

Sancho Salcedo-Sanz, Leopoldo Carro-Calvo, Antonio Portilla-Figueras, Maurizio Naldi, Luigi Laura, Giuseppe F. Italiano: Traffic vs topology in network clustering: Does it matter? IWCMC 2012: 36-41

Giuseppe F. Italiano: Strong Bridges and Strong Articulation Points of Directed Graphs. SOFSEM 2012: 43

Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi, Federico Santaroni: Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs. SEA 2012: 195-207

Giuseppe D'Acquisto, Maurizio Naldi, Giuseppe F. Italiano: Personal data disclosure and data breaches: the customer's viewpoint. CoRR abs/1203.3870 (2012)

Marco Querini, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano: 2D Color Barcodes for Mobile Phones. IJCSA 8(1): 136-155 (2011)

Maurizio Naldi, Antonio Pavignani, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano: The Competitor Busting Strategy in Keyword Auctions: Who's Worst Hit? CNSR 2011: 153-160

Sancho Salcedo-Sanz, Maurizio Naldi, Leopoldo Carro-Calvo, Luigi Laura, Antonio Portilla-Figueras, Giuseppe F. Italiano: An evolutionary algorithm for network clustering through traffic matrices. IWCMC 2011: 1580-1584

Vittorio Ottaviani, Alessandro Lentini, Antonio Grillo, Silvia Di Cesare, Giuseppe F. Italiano: Shared Backup & Restore: Save, Recover and Share Personal Information into Closed Groups of Smartphones. NTMS 2011: 1-5

Davide Cannone, Maurizio Naldi, Giuseppe F. Italiano, Andrea Brancaleoni: A Simulator of a Mobile Ad-Hoc Network in a Hostile Environment. SIMULTECH 2011: 413-417

Dany Breslauer, Giuseppe F. Italiano: Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem. SPIRE 2011: 156-167

Dany Breslauer, Giuseppe F. Italiano: On Suffix Extensions in Suffix Trees. SPIRE 2011: 301-312

Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen: Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313-322

Maurizio Naldi, Antonio Pavignani, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano: A Model for the Dynamics of Bidders in the Simulation of Keyword Auctions. UKSim 2011: 440-445

Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano: Maintaining dynamic minimum spanning trees: An experimental study. Discrete Applied Mathematics 158(5): 404-425 (2010)

Giorgio Ausiello, Andrea Ribichini, Paolo Giulio Franciosa, Giuseppe F. Italiano: Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. Discrete Math., Alg. and Appl. 2(4): 591-606 (2010)

Maurizio Naldi, Giuseppe D'Acquisto, Giuseppe F. Italiano: The value of location in keyword auctions. Electronic Commerce Research and Applications 9(2): 160-170 (2010)

Giuseppe F. Italiano: Resilient Algorithms and Data Structures. CIAC 2010: 13-24

Antonio Grillo, Alessandro Lentini, Maurizio Naldi, Giuseppe F. Italiano: Penalized Second Price: A New Pricing Algorithm for Advertising in Search Engines. CNSR 2010: 207-214

Giuseppe F. Italiano, Luigi Laura, Federico Santaroni: Finding Strong Bridges and Strong Articulation Points in Linear Time. COCOA (1) 2010: 157-169

Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini: Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. COCOON 2010: 160-172

Alessandro Distefano, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano: SecureMyDroid: enforcing security in the mobile devices lifecycle. CSIIRW 2010: 27

Antonio Grillo, Alessandro Lentini, Marco Querini, Giuseppe F. Italiano: High Capacity Colored Two Dimensional Codes. IMCSIT 2010: 709-716

Luigi Laura, Maurizio Naldi, Giuseppe F. Italiano: Traffic-based network clustering. IWCMC 2010: 321-325

Antonio Grillo, Alessandro Lentini, Vittorio Ottaviani, Giuseppe F. Italiano, Fabrizio Battisti: SAVED: Secure Android Value addED services. MobiCASE 2010: 415-427

Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano: Experimental Study of Resilient Algorithms and Data Structures. SEA 2010: 1-12

Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano: Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries. SEA 2010: 398-410

Giuseppe F. Italiano, Piotr Sankowski: Improved Minimum Cuts and Maximum Flows in Undirected Planar Graphs. CoRR abs/1011.2843 (2010)

Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano: The Price of Resiliency: a Case Study on Sorting with Memory Faults. Algorithmica 53(4): 597-620 (2009)

Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini: Graph Spanners in the Streaming Model: An Experimental Study. Algorithmica 55(2): 346-374 (2009)

Giuseppe F. Italiano, Rossella Petreschi: Preface. J. Discrete Algorithms 7(3): 279 (2009)

Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Resilient dictionaries. ACM Transactions on Algorithms 6(1) (2009)

Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano: Small stretch (alpha, beta)-spanners in the streaming model. Theor. Comput. Sci. 410(36): 3406-3413 (2009)

Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Optimal resilient sorting and searching in the presence of memory faults. Theor. Comput. Sci. 410(44): 4457-4470 (2009)

Paolo Spallaccini, Francesco Iovine, Giuseppe F. Italiano: An automatized methodology design for real-time signal processing applications in multiple multi-core platforms. ICME 2009: 1829-1832

Fabio Dellutri, Vittorio Ottaviani, Daniele Bocci, Giuseppe F. Italiano, Gianluigi Me: Data reverse engineering on a smartphone. ICUMT 2009: 1-8

Camil Demetrescu, Giuseppe F. Italiano: Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. Algorithmica 51(4): 387-427 (2008)

Irene Finocchi, Giuseppe F. Italiano: Sorting and Searching in Faulty Memories. Algorithmica 52(3): 309-332 (2008)

Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano: Novel Local-Search-Based Approaches to University Examination Timetabling. INFORMS Journal on Computing 20(1): 86-99 (2008)

Antonio Grillo, Alessandro Lentini, Gianluigi Me, Giuseppe F. Italiano: Transaction Oriented Text Messaging with Trusted-SMS. ACSAC 2008: 485-494

Camil Demetrescu, Giuseppe F. Italiano: Decremental All-Pairs Shortest Paths. Encyclopedia of Algorithms 2008

Camil Demetrescu, Giuseppe F. Italiano: Single-Source Fully Dynamic Reachability. Encyclopedia of Algorithms 2008

Camil Demetrescu, Giuseppe F. Italiano: Trade-Offs for Dynamic Graph Problems. Encyclopedia of Algorithms 2008

Camil Demetrescu, Giuseppe F. Italiano: Visualization Techniques for Algorithm Engineering. Encyclopedia of Algorithms 2008

Giuseppe F. Italiano: Fully Dynamic All Pairs Shortest Paths. Encyclopedia of Algorithms 2008

Giuseppe F. Italiano: Fully Dynamic Connectivity: Upper and Lower Bounds. Encyclopedia of Algorithms 2008

Giuseppe F. Italiano: Fully Dynamic Higher Connectivity. Encyclopedia of Algorithms 2008

Giuseppe F. Italiano: Fully Dynamic Higher Connectivity for Planar Graphs. Encyclopedia of Algorithms 2008

Giuseppe F. Italiano: Fully Dynamic Minimum Spanning Trees. Encyclopedia of Algorithms 2008

Giuseppe F. Italiano: Fully Dynamic Planarity Testing. Encyclopedia of Algorithms 2008

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

Camil Demetrescu, Giuseppe F. Italiano: Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks. Electr. Notes Theor. Comput. Sci. 171(1): 3-15 (2007)

Lars Arge, Giuseppe F. Italiano: Preface. ACM Journal of Experimental Algorithmics 12 (2007)

Giuseppe F. Italiano, Catuscia Palamidessi: Preface. Theor. Comput. Sci. 380(1-2): 1 (2007)

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

Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini: Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. ESA 2007: 605-617

Fabio Dellutri, Salvatore Di Blasi, Giuseppe F. Italiano: Transparent File Protection in On-Demand Computing. GCA 2007: 116-122

Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Resilient search trees. SODA 2007: 547-553

Giuseppe F. Italiano, Eugenio Moggi, Luigi Laura (Eds.): Theoretical Computer Science, 10th Italian Conference, ICTCS 2007, Rome, Italy, October 3-5, 2007, Proceedings. World Scientific 2007, isbn 981-277-098-4

Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plasil (Eds.): SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings. Lecture Notes in Computer Science 4362, Springer 2007, isbn 978-3-540-69506-6

Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plasil, Mária Bieliková (Eds.): SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings Volume II. Institute of Computer Science AS CR, Prague 2007, isbn 80-903298-9-6

Camil Demetrescu, Giuseppe F. Italiano: Fully dynamic all pairs shortest paths with real edge weights. J. Comput. Syst. Sci. 72(5): 813-837 (2006)

Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano: CHECKCOL: Improved local search for graph coloring. J. Discrete Algorithms 4(2): 277-298 (2006)

Giuseppe F. Italiano, Alberto Marchetti-Spaccamela: Preface. J. Discrete Algorithms 4(3): 337-338 (2006)

Camil Demetrescu, Giuseppe F. Italiano: Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. J. Discrete Algorithms 4(3): 353-383 (2006)

Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano: Small Stretch Spanners on Dynamic Graphs. J. Graph Algorithms Appl. 10(2): 365-385 (2006)

Giuseppe F. Italiano, Stefano Leonardi, Gianpaolo Oriolo: Design of trees in the hose model: The balanced case. Oper. Res. Lett. 34(6): 601-606 (2006)

Camil Demetrescu, Giuseppe F. Italiano: Experimental analysis of dynamic all pairs shortest path algorithms. ACM Transactions on Algorithms 2(4): 578-601 (2006)

Fabrizio Grandoni, Giuseppe F. Italiano: Algorithms and Constraint Programming. CP 2006: 2-14

Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup: Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? ESA 2006: 732-743

Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano: The Price of Resiliency: A Case Study on Sorting with Memory Faults. ESA 2006: 768-779

Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Optimal Resilient Sorting and Searching in the Presence of Memory Faults. ICALP (1) 2006: 286-298

Fabrizio Grandoni, Giuseppe F. Italiano: Improved Approximation for Single-Sink Buy-at-Bulk. ISAAC 2006: 111-120

Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano (Eds.): Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings. Lecture Notes in Computer Science 3998, Springer 2006, isbn 3-540-34375-X

Camil Demetrescu, Giuseppe F. Italiano: Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n² barrier. J. ACM 52(2): 147-156 (2005)

Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Designing Reliable Algorithms in Unreliable Memories. ESA 2005: 1-8

Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano: Small Stretch Spanners on Dynamic Graphs. ESA 2005: 532-543

Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura: Portraying Algorithms with Leonardo Web. WISE Workshops 2005: 73-83

Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, Moti Yung (Eds.): Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings. Lecture Notes in Computer Science 3580, Springer 2005, isbn 3-540-27580-0

Camil Demetrescu, Giuseppe F. Italiano: A new approach to dynamic all pairs shortest paths. J. ACM 51(6): 968-992 (2004)

Gianluigi Me, Giuseppe F. Italiano, Paolo Spagnoletti: GSM and GPRS Performance of IPSEC Data Communication. ICETE (2) 2004: 3-11

Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano: Experimental analysis of dynamic all pairs shortest path algorithms. SODA 2004: 369-378

Irene Finocchi, Giuseppe F. Italiano: Sorting and searching in the presence of memory faults (without redundancy). STOC 2004: 101-110

Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano: JIVE: Java Interactive Software Visualization Environment. VL/HCC 2004: 41-43

Camil Demetrescu, Giuseppe F. Italiano: Engineering Shortest Path Algorithms. WEA 2004: 191-198

Fabrizio Grandoni, Giuseppe F. Italiano: Decremental Clique Problem. WG 2004: 142-153

Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano: A Stochastic Location Problem with Applications to Tele-diagnostic. WG 2004: 201-213

Lars Arge, Giuseppe F. Italiano, Robert Sedgewick (Eds.): Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, USA, January 10, 2004. SIAM 2004, isbn 0-89871-564-4

Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano: Algorithm engineering, Algorithmics Column. Bulletin of the EATCS 79: 48-63 (2003)

Gianfranco Bilardi, Giuseppe F. Italiano: Preface. J. Algorithms 49(1): 1 (2003)

Fabrizio Grandoni, Giuseppe F. Italiano: Improved Algorithms for Max-restricted Path Consistency. CP 2003: 858-862

Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano: Engineering and Visualizing Algorithms. Graph Drawing 2003: 509-513

Camil Demetrescu, Giuseppe F. Italiano: A new approach to dynamic all pairs shortest paths. STOC 2003: 159-166

Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano: Search Data Structures for Skewed Strings. WEA 2003: 81-96

Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan: Wavelength rerouting in optical networks, or the Venetian Routing problem. J. Algorithms 45(2): 93-125 (2002)

Giuseppe Cattaneo, Giuseppe F. Italiano, Umberto Ferraro Petrillo: CATAI: Concurrent Algorithms and Data Types Animation over the Internet. J. Vis. Lang. Comput. 13(4): 391-419 (2002)

Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano: Maintaining Dynamic Minimum Spanning Trees: An Experimental Study. ALENEX 2002: 111-125

Camil Demetrescu, Giuseppe F. Italiano: Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. ICALP 2002: 633-643

Giuseppe F. Italiano, Rajeev Rastogi, Bülent Yener: Restoration Algorithms for Virtual Private Networks in the Hose Model. INFOCOM 2002

Giuseppe F. Italiano: Guest Editor's Introduction. Algorithmica 30(4): 471-472 (2001)

Camil Demetrescu, Giuseppe F. Italiano: Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. FOCS 2001: 260-267

Camil Demetrescu, Giuseppe F. Italiano: Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. CoRR cs.DS/0104001 (2001)

Daniele Frigioni, Giuseppe F. Italiano: Dynamically Switching Vertices in Planar Graphs. Algorithmica 28(1): 76-103 (2000)

Antoine Vigneron, Lixin Gao, Mordecai J. Golin, Giuseppe F. Italiano, Bo Li: An algorithm for finding a k-median in a directed tree. Inf. Process. Lett. 74(1-2): 81-88 (2000)

Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan: Wavelength rerouting in optical networks, or the Venetian routing problem. APPROX 2000: 72-83

Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher: Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics 2000: 24-50

Camil Demetrescu, Giuseppe F. Italiano: Fully Dynamic Transitive Closure: Breaking Through the O(n²) Barrier. FOCS 2000: 381-389

Camil Demetrescu, Giuseppe F. Italiano: What Do We Learn from Experimental Algorithmics? MFCS 2000: 36-51

Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano: New Algorithms for Examination Timetabling. Algorithm Engineering 2000: 230-242

Giuseppe Cattaneo, Giuseppe F. Italiano: Algorithm Engineering. ACM Comput. Surv. 31(3es): 3 (1999)

Roberto Grossi, Giuseppe F. Italiano: Efficient Splitting and Merging Algorithms for Order Decomposable Problems. Inf. Comput. 154(1): 1-33 (1999)

Zvi Galil, Giuseppe F. Italiano, Neil Sarnak: Fully Dynamic Planarity Testing with Applications. J. ACM 46(1): 28-91 (1999)

David Eppstein, Giuseppe F. Italiano: PREFACE: Festschrift for Zvi Galil. J. Complexity 15(1): 1-3 (1999)

Roberto Grossi, Giuseppe F. Italiano: Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. ICALP 1999: 372-381

Bo Li, Mordecai J. Golin, Giuseppe F. Italiano, Xin Deng, Kazem Sohraby: On the Optimal Placement of Web Proxies in the Internet. INFOCOM 1999: 1282-1290

Giuseppe F. Italiano, Rajiv Ramaswami: Maintaining Spanning Trees of Small Diameter. Algorithmica 22(3): 275-304 (1998)

David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer: Separator-Based Sparsification II: Edge and Vertex Connectivity. SIAM J. Comput. 28(1): 341-381 (1998)

Giuseppe Cattaneo, Umberto Ferraro Petrillo, Giuseppe F. Italiano, Vittorio Scarano: Concurrent Algorithms and Data Types Animation over the Internet. IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 63-80

Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni: Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. MFCS 1998: 1-16

Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci (Eds.): Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings. Lecture Notes in Computer Science 1461, Springer 1998, isbn 3-540-64848-8

David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig: Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM 44(5): 669-696 (1997)

David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano: An Empirical Study of Dynamic Graph Algorithms. ACM Journal of Experimental Algorithmics 2: 5 (1997)

Daniele Frigioni, Giuseppe F. Italiano: Dynamically Switching Vertices in Planar Graphs (Extended Abstract). ESA 1997: 186-199

Roberto Grossi, Giuseppe F. Italiano: Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract). ICALP 1997: 605-615

Giuseppe Amato II, Giuseppe Cattaneo, Giuseppe F. Italiano: Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms (Extended Abstract). SODA 1997: 314-323

Dora Giammarresi, Giuseppe F. Italiano: Decremental 2- and 3-Connectivity on Planar Graphs. Algorithmica 16(3): 263-287 (1996)

David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer: Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. J. Comput. Syst. Sci. 52(1): 3-27 (1996)

David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano: An Empirical Study of Dynamic Graph Algorithms (Extended Abstract). SODA 1996: 192-201

Alberto Apostolico, Giuseppe F. Italiano, Giorgio Gambosi, Maurizio Talamo: The Set Union Problem With Unlimited Backtracking. SIAM J. Comput. 23(1): 50-70 (1994)

Giuseppe F. Italiano, Rajiv Ramaswami: Maintaining Spanning Trees of Small Diameter. ICALP 1994: 227-238

David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung: Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 15(1): 173 (1993)

Zvi Galil, Giuseppe F. Italiano: Maintaining the 3-Edge-Connected Components of a Graph On-Line. SIAM J. Comput. 22(1): 11-28 (1993)

Giuseppe F. Italiano, Johannes A. La Poutré, Monika Rauch: Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract). ESA 1993: 212-223

David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer: Separator based sparsification for dynamic planar graph algorithms. STOC 1993: 208-217

David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano: Sparse Dynamic Programming I: Linear Cost Functions. J. ACM 39(3): 519-545 (1992)

David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano: Sparse Dynamic Programming II: Convex and Concave Cost Functions. J. ACM 39(3): 546-567 (1992)

David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 13(1): 33-54 (1992)

Zvi Galil, Giuseppe F. Italiano: Fully Dynamic Algorithms for 2-Edge Connectivity. SIAM J. Comput. 21(6): 1047-1069 (1992)

Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: On-Line Computation of Minimal and Maximal Length Paths. Theor. Comput. Sci. 95(2): 245-261 (1992)

David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig: Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract). FOCS 1992: 60-69

Zvi Galil, Giuseppe F. Italiano, Neil Sarnak: Fully Dynamic Planarity Testing (Extended Abstract). STOC 1992: 495-506

Dora Giammarresi, Giuseppe F. Italiano: Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version). SWAT 1992: 221-232

Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo: The Set Union Problem with Dynamic Weighted Backtracking. BIT 31(3): 383-393 (1991)

Zvi Galil, Giuseppe F. Italiano: Data Structures and Algorithms for Disjoint Set Union Problems. ACM Comput. Surv. 23(3): 319-344 (1991)

Zvi Galil, Giuseppe F. Italiano: A Note on Set Union with Arbitrary Deunions. Inf. Process. Lett. 37(6): 331-335 (1991)

Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for Minimal Length Paths. J. Algorithms 12(4): 615-638 (1991)

Giorgio Ausiello, Giuseppe F. Italiano: On-Line Algorithms for Polynomially Solvable Satisfiability Problems. J. Log. Program. 10(1): 69-90 (1991)

Zvi Galil, Giuseppe F. Italiano: Maintaining Biconnected Components of Dynamic Planar Graphs. ICALP 1991: 339-350

Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung: Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. SODA 1991: 158-167

Zvi Galil, Giuseppe F. Italiano: Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract). STOC 1991: 317-327

Giuseppe F. Italiano, Neil Sarnak: Fully Persistent Data Structures for Disjoint Set Union Problems. WADS 1991: 449-460

Giuseppe F. Italiano: Distributed Algorithms for Updating Shortest Paths (Extended Abstract). WDAG 1991: 200-211

Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi: Predicting deadlock in store-and-forward networks. Networks 20(7): 861-881 (1990)

David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung: Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. SODA 1990: 1-11

Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for Minimal Length Paths. SODA 1990: 12-21

David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano: Sparse Dynamic Programming. SODA 1990: 513-522

Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo: Worst-Case Analysis of the Set-Union Problem with Extended Backtracking. Theor. Comput. Sci. 68(1): 57-70 (1989)

Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). WADS 1989: 352-372

Giuseppe F. Italiano: Finding Paths and Deleting Edges in Directed Acyclic Graphs. Inf. Process. Lett. 28(1): 5-11 (1988)

Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi: Predicting deadlock in Store-and-Forward Networks. FSTTCS 1988: 123-142

Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo: Getting Back to the Past in the Union-Find Problem. STACS 1988: 8-17

Giuseppe F. Italiano: Amortized Efficiency of a Path Retrieval Data Structure. Theor. Comput. Sci. 48(3): 273-281 (1986)