Giuseppe F. Italiano

345 papers A* 41A 31B 33C 15Misc 3Journal 143Unranked 42

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. ACM Trans. Algorithms Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2026	B	`conf`	Fast Landmark Reconfiguration for Highway Cover Indexes. EDBT David Coudert, Andrea D'Ascenzo, Mattia D'Emidio, Giuseppe F. Italiano
2026	J	`jnl`	On maximal k-edge-connected subgraphs of undirected graphs. J. Comput. Syst. Sci. Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas, Debasish Pattanayak
2026	—	`conf`	The Agentic Kill Chain: A Cognitive Threat Framework for Autonomous Agent Ecosystems. ITASEC/SERICS Giorgio Piccardo, Giuseppe F. Italiano, Alessio Martino
2025	A	`conf`	An Edge-Based Decomposition Framework for Temporal Networks. WSDM Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano
2025	J	`jnl`	Beer Path Problems in Temporal Graphs. CoRR Andrea D'Ascenzo, Giuseppe F. Italiano, Sotiris Kanellopoulos, Anna Mpanti, Aris Pagourtzis, Christos Pergaminelis
2025	J	`jnl`	Dispersion of mobile robots on directed anonymous graphs. J. Parallel Distributed Comput. Giuseppe F. Italiano, Debasish Pattanayak, Gokarna Sharma
2025	J	`jnl`	Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint. CoRR Siwoo Song, Wonseok Shin, Kunsoo Park, Giuseppe F. Italiano, Zhengyi Yang, Wenjie Zhang
2025	A	`conf`	Faster Dynamic 2-Edge Connectivity in Directed Graphs. ESA Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano
2025	—	`conf`	Graph Traversal via Connected Mobile Agents. ALGOWIN Saswata Jana, Giuseppe F. Italiano, Partha Sarathi Mandal
2025	J	`jnl`	Graph Traversal via Connected Mobile Agents. CoRR Saswata Jana, Giuseppe F. Italiano, Partha Sarathi Mandal
2025	B	`conf`	Higher Connectivity in Directed Graphs (Invited Talk). MFCS Giuseppe F. Italiano
2025	J	`jnl`	Inferring tie strength in temporal networks. Data Min. Knowl. Discov. Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano
2025	J	`jnl`	Letter from the President. Bull. EATCS Giuseppe F. Italiano
2025	J	`jnl`	Local Clustering in Hypergraphs through Higher-Order Motifs. CoRR Giuseppe F. Italiano, Athanasios L. Konstantinidis, Anna Mpanti, Fariba Ranjbar
2025	—	`conf`	On Graph Burning and Edge Burning. From Strings to Graphs, and Back Again Giuseppe F. Italiano, Athanasios L. Konstantinidis, Manas Jyoti Kashyop
2025	B	`conf`	On the Performance of Mildly Greedy Players in k-Coloring Games. MFCS Vittorio Bilò, Andrea D'Ascenzo, Mattia D'Emidio, Giuseppe F. Italiano
2025	J	`jnl`	Searching for a Black Hole in a Dynamic Cactus. J. Graph Algorithms Appl. Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal
2025	J	`jnl`	Structural Parameterization of Cluster Deletion. Algorithmica Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos
2024	B	`conf`	Black Hole Search in Dynamic Cactus Graph. WALCOM Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal
2024	—	`conf`	Black Hole Search in Dynamic Tori. SAND Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal
2024	J	`jnl`	Black Hole Search in Dynamic Tori. CoRR Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal
2024	A*	`conf`	Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time. FOCS Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2024	J	`jnl`	Consistent Strong Triadic Closure in Multilayer Networks. CoRR Lutz Oettershagen, Athanasios L. Konstantinidis, Fariba Ranjbar, Giuseppe F. Italiano
2024	J	`jnl`	Letter from the President. Bull. EATCS Giuseppe F. Italiano
2024	B	`conf`	Online Drone Scheduling for Last-Mile Delivery. SIROCCO Saswata Jana, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas, Partha Sarathi Mandal
2024	J	`jnl`	Online Drone Scheduling for Last-mile Delivery. CoRR Saswata Jana, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas, Partha Sarathi Mandal
2024	A*	`conf`	Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking. ICDE Seunghwan Min, Jihoon Jang, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han
2023	—	`conf`	A Network Approach to Aquatic Food Web Dynamics. CIBB Davide Torre, Giuseppe F. Italiano, Blerina Sinaimeri
2023	J	`jnl`	Black Hole Search in Dynamic Cactus Graph. CoRR Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal
2023	J	`jnl`	EATCS-Fellows 2023. Bull. EATCS Giuseppe F. Italiano
2023	J	`jnl`	Seeking critical nodes in digraphs. J. Comput. Sci. Massimo Bernaschi, Alessandro Celestini, Marco Cianfriglia, Stefano Guarino, Giuseppe F. Italiano, Enrico Mastrostefano, Lena Rebecca Zastrow
2023	B	`conf`	Structural Parameterization of Cluster Deletion. WALCOM Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos
2023	J	`jnl`	Temporal Network Core Decomposition and Community Search. CoRR Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano
2023	J	`jnl`	Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking. CoRR Seunghwan Min, Jihoon Jang, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han
2022	A	`conf`	Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. ESA Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2022	B	`conf`	Dispersion of Mobile Robots on Directed Anonymous Graphs. SIROCCO Giuseppe F. Italiano, Debasish Pattanayak, Gokarna Sharma
2022	A*	`conf`	Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions. ICDE Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han
2022	—	`conf`	Inferring Tie Strength in Temporal Networks. ECML/PKDD (2) Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano
2022	J	`jnl`	Inferring Tie Strength in Temporal Networks. CoRR Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano
2022	J	`jnl`	On maximal 3-edge-connected subgraphs of undirected graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas, Debasish Pattanayak
2021	J	`jnl`	A family of tree-based generators for bubbles in directed graphs. J. Graph Algorithms Appl. Vicente Acuña, Leandro Ishi Soares de Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri
2021	A*	`conf`	All-Pairs LCA in DAGs: Breaking through the SODA Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
2021	B	`conf`	Compressed Weighted de Bruijn Graphs. CPM Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini
2021	B	`conf`	Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. SEA Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Evangelos Kosinas
2021	A	`conf`	Computing the 4-Edge-Connected Components of a Graph in Linear Time. ESA Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2021	J	`jnl`	Computing the 4-Edge-Connected Components of a Graph in Linear Time. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2021	J	`jnl`	Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2021	A*	`conf`	Planar Reachability Under Single Vertex or Edge Failures. SODA Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
2021	J	`jnl`	Planar Reachability Under Single Vertex or Edge Failures. CoRR Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
2021	A*	`conf`	Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate Space. ICDE Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han
2021	J	`jnl`	Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming. CoRR Seunghwan Min, Sung Gwan Park, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han
2021	J	`jnl`	Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming. Proc. VLDB Endow. Seunghwan Min, Sung Gwan Park, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han
2021	J	`jnl`	Tropical paths in vertex-colored graphs. J. Comb. Optim. Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
2020	C	`conf`	A Family of Tree-Based Generators for Bubbles in Directed Graphs. IWOCA Vicente Acuña, Leandro Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri
2020	J	`jnl`	All-Pairs LCA in DAGs: Breaking through the O(n CoRR Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
2020	J	`jnl`	Approximating the smallest 2-vertex connected spanning subgraph of a directed graph. Theor. Comput. Sci. Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou
2020	J	`jnl`	EATCS Fellows 2021 - Call for Nominations. Bull. EATCS Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano
2020	J	`jnl`	Preface. Theor. Comput. Sci. Gabriele Fici, Giuseppe F. Italiano
2020	—	`ed.`	Privacy Technologies and Policy - 8th Annual Privacy Forum, APF 2020, Lisbon, Portugal, October 22-23, 2020, Proceedings APF Luís Antunes, Maurizio Naldi, Giuseppe F. Italiano, Kai Rannenberg, Prokopios Drogkaris
2020	J	`jnl`	Strong Connectivity in Directed Graphs under Failures, with Applications. SIAM J. Comput. Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2019	A	`conf`	Dominating Sets and Connected Dominating Sets in Dynamic Graphs. STACS Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic
2019	J	`jnl`	Dominating Sets and Connected Dominating Sets in Dynamic Graphs. CoRR Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic
2019	B	`conf`	Dynamic Algorithms for the Massively Parallel Computation Model. SPAA Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis
2019	J	`jnl`	Dynamic Algorithms for the Massively Parallel Computation Model. CoRR Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis
2019	A	`conf`	Dynamic Dominators and Low-High Orders in DAGs. ESA Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, Luigi Laura
2019	J	`jnl`	EATCS Fellows 2020 - Call for Nominations. Bull. EATCS Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano
2019	A*	`conf`	Faster Algorithms for All-Pairs Bounded Min-Cuts. ICALP Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf
2019	—	`ed.`	Privacy Technologies and Policy - 7th Annual Privacy Forum, APF 2019, Rome, Italy, June 13-14, 2019, Proceedings APF Maurizio Naldi, Giuseppe F. Italiano, Kai Rannenberg, Manel Medina, Athena Bourka
2018	J	`jnl`	2-vertex connectivity in directed graphs. Inf. Comput. Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2018	A	`conf`	Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. ALENEX Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel
2018	J	`jnl`	Computing Critical Nodes in Directed Graphs. ACM J. Exp. Algorithmics Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano
2018	A	`conf`	Decremental SPQR-trees for Planar Graphs. ESA Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
2018	J	`jnl`	Decremental SPQR-trees for Planar Graphs. CoRR Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
2018	J	`jnl`	Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SIAM J. Comput. Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2018	J	`jnl`	Dynamic algorithms via the primal-dual method. Inf. Comput. Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2018	J	`jnl`	Faster Algorithms for All-Pairs Bounded Min-Cuts. CoRR Amir Abboud, Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski
2018	B	`conf`	Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. LATIN Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2018	J	`jnl`	Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2018	Misc	`conf`	Maximum Colorful Cliques in Vertex-Colored Graphs. COCOON Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
2018	Misc	`conf`	Maximum Colorful Cycles in Vertex-Colored Graphs. CSR Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
2018	—	`conf`	Preventing Ransomware Attacks Through File System Filter Drivers. ITASEC Giovanni Bottazzi, Giuseppe F. Italiano, Domenico Spera
2017	—	`conf`	A Data Streaming Approach to Link Mining in Criminal Networks. FiCloud Workshops Giacomo Marciani, Michele Porretta, Matteo Nardelli, Giuseppe F. Italiano
2017	A*	`conf`	All-Pairs 2-Reachability in O(n^w log n) Time. ICALP Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski
2017	B	`conf`	Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders. SEA Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou
2017	A	`conf`	Computing Critical Nodes in Directed Graphs. ALENEX Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano
2017	A	`conf`	Contracting a Planar Graph Efficiently. ESA Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
2017	J	`jnl`	Contracting a Planar Graph Efficiently. CoRR Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
2017	A*	`conf`	Decremental Data Structures for Connectivity and Dominators in Directed Graphs. ICALP Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
2017	J	`jnl`	Decremental Data Structures for Connectivity and Dominators in Directed Graphs. CoRR Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
2017	J	`jnl`	Decremental Single-Source Reachability in Planar Digraphs. CoRR Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
2017	A*	`conf`	Decremental single-source reachability in planar digraphs. STOC Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
2017	A*	`conf`	Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. SODA Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis
2017	J	`jnl`	Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. CoRR Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis
2017	J	`jnl`	Foreword. Theor. Comput. Sci. Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán
2017	B	`conf`	On Bubble Generators in Directed Graphs. WG Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri
2017	J	`jnl`	Sparse certificates for 2-connectivity in directed graphs. Theor. Comput. Sci. Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
2017	A*	`conf`	Strong Connectivity in Directed Graphs under Failures, with Applications. SODA Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2017	—	`conf`	Tropical Paths in Vertex-Colored Graphs. COCOA (2) Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
2016	A	`conf`	2-Connectivity in Directed Graphs. ESA Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2016	J	`jnl`	2-Edge Connectivity in Directed Graphs. ACM Trans. Algorithms Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2016	J	`jnl`	All-Pairs $2$-reachability in Õ(n CoRR Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski
2016	J	`jnl`	An Experimental Study of Dynamic Dominators. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni
2016	—	`ch.`	Decremental All-Pairs Shortest Paths. Encyclopedia of Algorithms Camil Demetrescu, Giuseppe F. Italiano
2016	A*	`conf`	Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. FOCS Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis
2016	J	`jnl`	Design of Dynamic Algorithms via Primal-Dual Method. CoRR Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2016	J	`jnl`	EATCS Fellows' Advice to the Young Theoretical Computer Scientist. Bull. EATCS Luca Aceto, Mariangiola Dezani-Ciancaglini, Yuri Gurevich, David Harel, Monika Henzinger, Giuseppe F. Italiano, Scott A. Smolka, Paul G. Spirakis, Wolfgang Thomas
2016	C	`conf`	Frequency Domain Analysis of Large-Scale Proxy Logs for Botnet Traffic Detection. SIN Giovanni Bottazzi, Giuseppe F. Italiano, Giuseppe Giulio Rutigliano
2016	—	`ch.`	Fully Dynamic All Pairs Shortest Paths. Encyclopedia of Algorithms Giuseppe F. Italiano
2016	—	`ch.`	Fully Dynamic Connectivity: Upper and Lower Bounds. Encyclopedia of Algorithms Giuseppe F. Italiano
2016	—	`ch.`	Fully Dynamic Higher Connectivity for Planar Graphs. Encyclopedia of Algorithms Giuseppe F. Italiano
2016	—	`ch.`	Fully Dynamic Higher Connectivity. Encyclopedia of Algorithms Giuseppe F. Italiano
2016	—	`ch.`	Fully Dynamic Minimum Spanning Trees. Encyclopedia of Algorithms Giuseppe F. Italiano
2016	—	`ch.`	Fully Dynamic Planarity Testing. Encyclopedia of Algorithms Giuseppe F. Italiano
2016	J	`jnl`	Geometric and Graph-based Approaches to Collective Motion (Dagstuhl Seminar 16022). Dagstuhl Reports Giuseppe F. Italiano, Marc J. van Kreveld, Bettina Speckmann, Guy Theraulaz
2016	C	`conf`	Handwritten Signature Verification for Mobile Phones. ICISSP Nilakantha Paudel, Marco Querini, Giuseppe F. Italiano
2016	A*	`conf`	Incremental 2-Edge-Connectivity in Directed Graphs. ICALP Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2016	J	`jnl`	Incremental 2-Edge-Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2016	J	`jnl`	On Resilient Graph Spanners. Algorithmica Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
2016	—	`conf`	Online Handwritten Signature Verification for Low-End Devices. ICISSP (Revised Selected Papers) Nilakantha Paudel, Marco Querini, Giuseppe F. Italiano
2016	—	`ch.`	Single-Source Fully Dynamic Reachability. Encyclopedia of Algorithms Camil Demetrescu, Giuseppe F. Italiano
2016	B	`conf`	Sparse Subgraphs for 2-Connectivity in Directed Graphs. SEA Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
2016	J	`jnl`	Strong Articulation Points and Strong Bridges in Large Scale Graphs. Algorithmica Donatella Firmani, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni
2016	—	`ch.`	Trade-Offs for Dynamic Graph Problems. Encyclopedia of Algorithms Camil Demetrescu, Giuseppe F. Italiano
2016	—	`ch.`	Visualization Techniques for Algorithm Engineering. Encyclopedia of Algorithms Camil Demetrescu, Giuseppe F. Italiano
2015	C	`ed.`	15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2015, Patras, Greece, September 17, 2015 ATMOS Giuseppe F. Italiano, Marie Schmidt
2015	A	`conf`	2-Connectivity in Directed Graphs: An Experimental Study. ALENEX William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2015	A*	`conf`	2-Edge Connectivity in Directed Graphs. SODA Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2015	—	`conf`	2-Vertex Connectivity in Directed Graphs. ICALP (1) Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2015	J	`jnl`	A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2015	J	`jnl`	A New System for Secure Handwritten Signing of Documents. Int. J. Comput. Sci. Appl. Marco Querini, Marco Gattelli, Valerio M. Gentile, Giuseppe F. Italiano
2015	A	`conf`	Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. ESA Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
2015	J	`jnl`	Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
2015	—	`conf`	Design of Dynamic Algorithms via Primal-Dual Method. ICALP (1) Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2015	A*	`conf`	Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SODA Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2015	J	`jnl`	Editorial. Algorithmica Hans L. Bodlaender, MohammadTaghi Hajiaghayi, Giuseppe F. Italiano
2015	J	`jnl`	Erratum to: Editorial. Algorithmica Hans L. Bodlaender, Mohammad Taghi Hajiaghayi, Giuseppe F. Italiano
2015	—	`ed.`	Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I MFCS (1) Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella
2015	—	`ed.`	Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II MFCS (2) Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella
2015	—	`ed.`	Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, the 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015) , Pec pod Snezkou, Czech Republic, January 24-29, 2015. SOFSEM (Student Research Forum Papers / Posters) Giuseppe F. Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhofer, Roman Spanek, Martin Rimnac
2015	B	`ed.`	SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. Proceedings SOFSEM Giuseppe F. Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhofer
2014	J	`jnl`	2-Edge Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2014	J	`jnl`	2-Vertex Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2014	—	`conf`	Better transit routing by exploiting vehicle GPS data. IWCTS@SIGSPATIAL Daniel Delling, Giuseppe F. Italiano, Thomas Pajor, Federico Santaroni
2014	J	`jnl`	Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. CoRR Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2014	B	`conf`	Engineering Color Barcode Algorithms for Mobile Applications. SEA Donatella Firmani, Giuseppe F. Italiano, Marco Querini
2014	J	`jnl`	Experimental Evaluation of Algorithms for the Food-Selection Problem. CoRR Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura
2014	B	`conf`	Exploiting GPS Data in Public Transport Journey Planners. SEA Luca Allulli, Giuseppe F. Italiano, Federico Santaroni
2014	C	`conf`	Handwritten Signature Verification with 2D Color Barcodes. FedCSIS Marco Querini, Marco Gattelli, Valerio M. Gentile, Giuseppe F. Italiano
2014	J	`jnl`	Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201). Dagstuhl Reports Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán
2014	J	`jnl`	Reliability and data density in high capacity color barcodes. Comput. Sci. Inf. Syst. Marco Querini, Giuseppe F. Italiano
2014	—	`conf`	The (not so) Critical Nodes of Criminal Networks. SocInfo Workshops Donatella Firmani, Giuseppe F. Italiano, Luigi Laura
2013	J	`jnl`	A traffic-based evolutionary algorithm for network clustering. Appl. Soft Comput. Maurizio Naldi, Sancho Salcedo-Sanz, Leopoldo Carro-Calvo, Luigi Laura, Antonio Portilla-Figueras, Giuseppe F. Italiano
2013	J	`jnl`	Algorithm Engineering (Dagstuhl Seminar 13391). Dagstuhl Reports Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner
2013	A	`ed.`	Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings ESA Hans L. Bodlaender, Giuseppe F. Italiano
2013	C	`conf`	Color Classifiers for 2D Color Barcodes. FedCSIS Marco Querini, Giuseppe F. Italiano
2013	J	`jnl`	Data structures resilient to memory faults: An experimental study of dictionaries. ACM J. Exp. Algorithmics Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano
2013	J	`jnl`	Facial Recognition with 2D Color Barcodes. Int. J. Comput. Sci. Appl. Marco Querini, Giuseppe F. Italiano
2013	C	`conf`	Is Timetabling Routing Always Reliable for Public Transport?. ATMOS Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni
2013	J	`jnl`	Near real-time suffix tree construction via the fringe marked ancestor problem. J. Discrete Algorithms Dany Breslauer, Giuseppe F. Italiano
2013	J	`jnl`	On Robust Graph Spanners CoRR Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
2013	J	`jnl`	On a facility location problem with applications to tele-diagnostic. Optim. Lett. Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano
2013	B	`ed.`	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 SOFSEM Peter van Emde Boas, Frans C. A. Groen, Giuseppe F. Italiano, Jerzy R. Nawrocki, Harald Sack
2013	J	`jnl`	The Gödel Prize 2014 - Call for Nominations. Bull. EATCS Giuseppe F. Italiano
2013	—	`ch.`	The Quest for the Shortest Route. The Power of Algorithms Camil Demetrescu, Giuseppe F. Italiano
2013	—	`conf`	Topic 12: Theory and Algorithms for Parallel Computation - (Introduction). Euro-Par Giuseppe F. Italiano, Henning Meyerhenke, Guy E. Blelloch, Philippas Tsigas
2012	A	`conf`	An Experimental Study of Dynamic Dominators. ESA Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni
2012	B	`conf`	Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs. SEA Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi, Federico Santaroni
2012	C	`conf`	Facial Biometrics for 2D Barcodes. FedCSIS Marco Querini, Giuseppe F. Italiano
2012	J	`jnl`	Finding strong bridges and strong articulation points in linear time. Theor. Comput. Sci. Giuseppe F. Italiano, Luigi Laura, Federico Santaroni
2012	J	`jnl`	On suffix extensions in suffix trees. Theor. Comput. Sci. Dany Breslauer, Giuseppe F. Italiano
2012	J	`jnl`	Personal data disclosure and data breaches: the customer's viewpoint CoRR Giuseppe D'Acquisto, Maurizio Naldi, Giuseppe F. Italiano
2012	B	`conf`	Strong Bridges and Strong Articulation Points of Directed Graphs. SOFSEM Giuseppe F. Italiano
2012	C	`conf`	Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. ISCO Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco
2012	B	`conf`	Traffic vs topology in network clustering: Does it matter? IWCMC Sancho Salcedo-Sanz, Leopoldo Carro-Calvo, Antonio Portilla-Figueras, Maurizio Naldi, Luigi Laura, Giuseppe F. Italiano
2011	J	`jnl`	2D Color Barcodes for Mobile Phones. Int. J. Comput. Sci. Appl. Marco Querini, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano
2011	—	`conf`	A Model for the Dynamics of Bidders in the Simulation of Keyword Auctions. UKSim Maurizio Naldi, Antonio Pavignani, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano
2011	C	`conf`	A Simulator of a Mobile Ad-Hoc Network in a Hostile Environment. SIMULTECH Davide Cannone, Maurizio Naldi, Giuseppe F. Italiano, Andrea Brancaleoni
2011	B	`conf`	An evolutionary algorithm for network clustering through traffic matrices. IWCMC Sancho Salcedo-Sanz, Maurizio Naldi, Leopoldo Carro-Calvo, Luigi Laura, Antonio Portilla-Figueras, Giuseppe F. Italiano
2011	A*	`conf`	Improved algorithms for min cut and max flow in undirected planar graphs. STOC Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
2011	C	`conf`	Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem. SPIRE Dany Breslauer, Giuseppe F. Italiano
2011	C	`conf`	On Suffix Extensions in Suffix Trees. SPIRE Dany Breslauer, Giuseppe F. Italiano
2011	—	`conf`	Shared Backup & Restore: Save, Recover and Share Personal Information into Closed Groups of Smartphones. NTMS Vittorio Ottaviani, Alessandro Lentini, Antonio Grillo, Silvia Di Cesare, Giuseppe F. Italiano
2011	—	`conf`	The Competitor Busting Strategy in Keyword Auctions: Who's Worst Hit? CNSR Maurizio Naldi, Antonio Pavignani, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano
2010	—	`conf`	10261 Abstracts Collection - Algorithm Engineering. Algorithm Engineering Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders
2010	—	`conf`	10261 Executive Summary - Algorithm Engineering. Algorithm Engineering Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders
2010	—	`ed.`	Algorithm Engineering, 27.06. - 02.07.2010 Algorithm Engineering Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders
2010	Misc	`conf`	Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. COCOON Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
2010	J	`jnl`	Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. Discret. Math. Algorithms Appl. Giorgio Ausiello, Andrea Ribichini, Paolo Giulio Franciosa, Giuseppe F. Italiano
2010	B	`conf`	Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries. SEA Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano
2010	B	`conf`	Experimental Study of Resilient Algorithms and Data Structures. SEA Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano
2010	—	`conf`	Finding Strong Bridges and Strong Articulation Points in Linear Time. COCOA (1) Giuseppe F. Italiano, Luigi Laura, Federico Santaroni
2010	—	`conf`	High Capacity Colored Two Dimensional Codes. IMCSIT Antonio Grillo, Alessandro Lentini, Marco Querini, Giuseppe F. Italiano
2010	J	`jnl`	Improved Minimum Cuts and Maximum Flows in Undirected Planar Graphs CoRR Giuseppe F. Italiano, Piotr Sankowski
2010	J	`jnl`	Maintaining dynamic minimum spanning trees: An experimental study. Discret. Appl. Math. Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano
2010	—	`conf`	Penalized Second Price: A New Pricing Algorithm for Advertising in Search Engines. CNSR Antonio Grillo, Alessandro Lentini, Maurizio Naldi, Giuseppe F. Italiano
2010	C	`conf`	Resilient Algorithms and Data Structures. CIAC Giuseppe F. Italiano
2010	—	`conf`	SAVED: Secure Android Value addED services. MobiCASE Antonio Grillo, Alessandro Lentini, Vittorio Ottaviani, Giuseppe F. Italiano, Fabrizio Battisti
2010	—	`conf`	SecureMyDroid: enforcing security in the mobile devices lifecycle. CSIIRW Alessandro Distefano, Antonio Grillo, Alessandro Lentini, Giuseppe F. Italiano
2010	J	`jnl`	The value of location in keyword auctions. Electron. Commer. Res. Appl. Maurizio Naldi, Giuseppe D'Acquisto, Giuseppe F. Italiano
2010	B	`conf`	Traffic-based network clustering. IWCMC Luigi Laura, Maurizio Naldi, Giuseppe F. Italiano
2009	A	`conf`	An automatized methodology design for real-time signal processing applications in multiple multi-core platforms. ICME Paolo Spallaccini, Francesco Iovine, Giuseppe F. Italiano
2009	—	`conf`	Data reverse engineering on a smartphone. ICUMT Fabio Dellutri, Vittorio Ottaviani, Daniele Bocci, Giuseppe F. Italiano, Gianluigi Me
2009	—	`conf`	Extracting social networks from seized smartphones and web data. WIFS Fabio Dellutri, Luigi Laura, Vittorio Ottaviani, Giuseppe F. Italiano
2009	J	`jnl`	Graph Spanners in the Streaming Model: An Experimental Study. Algorithmica Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
2009	J	`jnl`	Optimal resilient sorting and searching in the presence of memory faults. Theor. Comput. Sci. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
2009	J	`jnl`	Preface. J. Discrete Algorithms Giuseppe F. Italiano, Rossella Petreschi
2009	J	`jnl`	Resilient dictionaries. ACM Trans. Algorithms Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
2009	J	`jnl`	Small stretch (alpha, beta)-spanners in the streaming model. Theor. Comput. Sci. Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano
2009	J	`jnl`	The Price of Resiliency: a Case Study on Sorting with Memory Faults. Algorithmica Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano
2008	—	`ch.`	Decremental All-Pairs Shortest Paths. Encyclopedia of Algorithms Camil Demetrescu, Giuseppe F. Italiano
2008	—	`ch.`	Fully Dynamic All Pairs Shortest Paths. Encyclopedia of Algorithms Giuseppe F. Italiano
2008	—	`ch.`	Fully Dynamic Connectivity: Upper and Lower Bounds. Encyclopedia of Algorithms Giuseppe F. Italiano
2008	—	`ch.`	Fully Dynamic Higher Connectivity for Planar Graphs. Encyclopedia of Algorithms Giuseppe F. Italiano
2008	—	`ch.`	Fully Dynamic Higher Connectivity. Encyclopedia of Algorithms Giuseppe F. Italiano
2008	—	`ch.`	Fully Dynamic Minimum Spanning Trees. Encyclopedia of Algorithms Giuseppe F. Italiano
2008	—	`ch.`	Fully Dynamic Planarity Testing. Encyclopedia of Algorithms Giuseppe F. Italiano
2008	J	`jnl`	Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. Algorithmica Camil Demetrescu, Giuseppe F. Italiano
2008	J	`jnl`	Novel Local-Search-Based Approaches to University Examination Timetabling. INFORMS J. Comput. Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano
2008	—	`ch.`	Single-Source Fully Dynamic Reachability. Encyclopedia of Algorithms Camil Demetrescu, Giuseppe F. Italiano
2008	J	`jnl`	Sorting and Searching in Faulty Memories. Algorithmica Irene Finocchi, Giuseppe F. Italiano
2008	—	`ch.`	Trade-Offs for Dynamic Graph Problems. Encyclopedia of Algorithms Camil Demetrescu, Giuseppe F. Italiano
2008	A	`conf`	Transaction Oriented Text Messaging with Trusted-SMS. ACSAC Antonio Grillo, Alessandro Lentini, Gianluigi Me, Giuseppe F. Italiano
2008	—	`ch.`	Visualization Techniques for Algorithm Engineering. Encyclopedia of Algorithms Camil Demetrescu, Giuseppe F. Italiano
2007	J	`jnl`	Designing reliable algorithms in unreliable memories. Comput. Sci. Rev. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
2007	A	`conf`	Optimal Resilient Dynamic Dictionaries. ESA Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave
2007	J	`jnl`	Preface. ACM J. Exp. Algorithmics Lars Arge, Giuseppe F. Italiano
2007	J	`jnl`	Preface. Theor. Comput. Sci. Giuseppe F. Italiano, Catuscia Palamidessi
2007	A*	`conf`	Resilient search trees. SODA Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
2007	—	`ed.`	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 SOFSEM (1) Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plásil
2007	—	`ed.`	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 SOFSEM (2) Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plásil, Mária Bieliková
2007	A	`conf`	Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. ESA Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
2007	—	`ed.`	Theoretical Computer Science, 10th Italian Conference, ICTCS 2007, Rome, Italy, October 3-5, 2007, Proceedings ICTCS Giuseppe F. Italiano, Eugenio Moggi, Luigi Laura
2007	—	`conf`	Transparent File Protection in On-Demand Computing. GCA Fabio Dellutri, Salvatore Di Blasi, Giuseppe F. Italiano
2006	—	`conf`	Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks. WCAN@ICALP Camil Demetrescu, Giuseppe F. Italiano
2006	C	`ed.`	Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings CIAC Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano
2006	A	`conf`	Algorithms and Constraint Programming. CP Fabrizio Grandoni, Giuseppe F. Italiano
2006	J	`jnl`	CHECKCOL: Improved local search for graph coloring. J. Discrete Algorithms Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano
2006	J	`jnl`	Design of trees in the hose model: The balanced case. Oper. Res. Lett. Giuseppe F. Italiano, Stefano Leonardi, Gianpaolo Oriolo
2006	A	`conf`	Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? ESA Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup
2006	J	`jnl`	Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. J. Discrete Algorithms Camil Demetrescu, Giuseppe F. Italiano
2006	J	`jnl`	Experimental analysis of dynamic all pairs shortest path algorithms. ACM Trans. Algorithms Camil Demetrescu, Giuseppe F. Italiano
2006	J	`jnl`	Fully dynamic all pairs shortest paths with real edge weights. J. Comput. Syst. Sci. Camil Demetrescu, Giuseppe F. Italiano
2006	—	`ch.`	GSM and GPRS performance of IPSEC data communication. e-Business and Telecommunication Networks Gianluigi Me, Giuseppe F. Italiano, Paolo Spagnoletti
2006	B	`conf`	Improved Approximation for Single-Sink Buy-at-Bulk. ISAAC Fabrizio Grandoni, Giuseppe F. Italiano
2006	—	`conf`	Optimal Resilient Sorting and Searching in the Presence of Memory Faults. ICALP (1) Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
2006	J	`jnl`	Preface. J. Discrete Algorithms Giuseppe F. Italiano, Alberto Marchetti-Spaccamela
2006	J	`jnl`	Small Stretch Spanners on Dynamic Graphs. J. Graph Algorithms Appl. Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano
2006	A	`conf`	The Price of Resiliency: A Case Study on Sorting with Memory Faults. ESA Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano
2005	A*	`ed.`	Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings ICALP Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, Moti Yung
2005	A	`conf`	Designing Reliable Algorithms in Unreliable Memories. ESA Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
2005	—	`conf`	Portraying Algorithms with Leonardo Web. WISE Workshops Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura
2005	A	`conf`	Small Stretch Spanners on Dynamic Graphs. ESA Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano
2005	J	`jnl`	Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n J. ACM Camil Demetrescu, Giuseppe F. Italiano
2004	B	`conf`	A Stochastic Location Problem with Applications to Tele-diagnostic. WG Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano
2004	J	`jnl`	A new approach to dynamic all pairs shortest paths. J. ACM Camil Demetrescu, Giuseppe F. Italiano
2004	B	`conf`	Decremental Clique Problem. WG Fabrizio Grandoni, Giuseppe F. Italiano
2004	—	`ch.`	Dynamic Graphs. Handbook of Data Structures and Applications Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
2004	—	`ch.`	Dynamic Trees. Handbook of Data Structures and Applications Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
2004	—	`conf`	Engineering Shortest Path Algorithms. WEA Camil Demetrescu, Giuseppe F. Italiano
2004	A*	`conf`	Experimental analysis of dynamic all pairs shortest path algorithms. SODA Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano
2004	—	`conf`	GSM and GPRS Performance of IPSEC Data Communication. ICETE (2) Gianluigi Me, Giuseppe F. Italiano, Paolo Spagnoletti
2004	B	`conf`	JIVE: Java Interactive Software Visualization Environment. VL/HCC Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano
2004	—	`ed.`	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 ALENEX/ANALC Lars Arge, Giuseppe F. Italiano, Robert Sedgewick
2004	A*	`conf`	Sorting and searching in the presence of memory faults (without redundancy). STOC Irene Finocchi, Giuseppe F. Italiano
2003	A*	`conf`	A new approach to dynamic all pairs shortest paths. STOC Camil Demetrescu, Giuseppe F. Italiano
2003	J	`jnl`	Algorithm engineering, Algorithmics Column. Bull. EATCS Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
2003	A	`conf`	Engineering and Visualizing Algorithms. GD Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
2003	A	`conf`	Improved Algorithms for Max-restricted Path Consistency. CP Fabrizio Grandoni, Giuseppe F. Italiano
2003	J	`jnl`	Preface. J. Algorithms Gianfranco Bilardi, Giuseppe F. Italiano
2003	—	`conf`	Search Data Structures for Skewed Strings. WEA Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano
2002	J	`jnl`	CATAI: Concurrent Algorithms and Data Types Animation over the Internet. J. Vis. Lang. Comput. Giuseppe Cattaneo, Giuseppe F. Italiano, Umberto Ferraro Petrillo
2002	A*	`conf`	Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. ICALP Camil Demetrescu, Giuseppe F. Italiano
2002	A	`conf`	Maintaining Dynamic Minimum Spanning Trees: An Experimental Study. ALENEX Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano
2002	A*	`conf`	Restoration Algorithms for Virtual Private Networks in the Hose Model. INFOCOM Giuseppe F. Italiano, Rajeev Rastogi, Bülent Yener
2002	J	`jnl`	Wavelength rerouting in optical networks, or the Venetian Routing problem. J. Algorithms Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan
2001	A*	`conf`	Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. FOCS Camil Demetrescu, Giuseppe F. Italiano
2001	J	`jnl`	Guest Editor's Introduction. Algorithmica Giuseppe F. Italiano
2001	J	`jnl`	Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure CoRR Camil Demetrescu, Giuseppe F. Italiano
2000	J	`jnl`	An algorithm for finding a k-median in a directed tree. Inf. Process. Lett. Antoine Vigneron, Lixin Gao, Mordecai J. Golin, Giuseppe F. Italiano, Bo Li
2000	J	`jnl`	Dynamically Switching Vertices in Planar Graphs. Algorithmica Daniele Frigioni, Giuseppe F. Italiano
2000	A*	`conf`	Fully Dynamic Transitive Closure: Breaking Through the O(n FOCS Camil Demetrescu, Giuseppe F. Italiano
2000	—	`conf`	New Algorithms for Examination Timetabling. WAE Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano
2000	—	`conf`	Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher
2000	—	`conf`	Wavelength rerouting in optical networks, or the Venetian routing problem. APPROX Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan
2000	B	`conf`	What Do We Learn from Experimental Algorithmics? MFCS Camil Demetrescu, Giuseppe F. Italiano
1999	J	`jnl`	Algorithm Engineering. ACM Comput. Surv. Giuseppe Cattaneo, Giuseppe F. Italiano
1999	—	`ch.`	Dynamic Graph Algorithms. Algorithms and Theory of Computation Handbook David Eppstein, Zvi Galil, Giuseppe F. Italiano
1999	J	`jnl`	Efficient Splitting and Merging Algorithms for Order Decomposable Problems. Inf. Comput. Roberto Grossi, Giuseppe F. Italiano
1999	A*	`conf`	Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. ICALP Roberto Grossi, Giuseppe F. Italiano
1999	J	`jnl`	Fully Dynamic Planarity Testing with Applications. J. ACM Zvi Galil, Giuseppe F. Italiano, Neil Sarnak
1999	A*	`conf`	On the Optimal Placement of Web Proxies in the Internet. INFOCOM Bo Li, Mordecai J. Golin, Giuseppe F. Italiano, Xin Deng, Kazem Sohraby
1999	J	`jnl`	PREFACE: Festschrift for Zvi Galil. J. Complex. David Eppstein, Giuseppe F. Italiano
1999	—	`ch.`	Topics in Data Structures. Algorithms and Theory of Computation Handbook Giuseppe F. Italiano, Rajeev Raman
1998	A	`ed.`	Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings ESA Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci
1998	C	`conf`	Architecture and Digital Exhibitions the Einstein Tower World. EGVE Fabio Pittarello, Mauro Pittarello, Giuseppe F. Italiano
1998	—	`conf`	Concurrent Algorithms and Data Types Animation over the Internet. IFIP Congress: Fundamentals - Foundations of Computer Science Giuseppe Cattaneo, Umberto Ferraro Petrillo, Giuseppe F. Italiano, Vittorio Scarano
1998	—	`conf`	Efficient cross-trees for external memory. External Memory Algorithms Roberto Grossi, Giuseppe F. Italiano
1998	B	`conf`	Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. MFCS Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni
1998	J	`jnl`	Maintaining Spanning Trees of Small Diameter. Algorithmica Giuseppe F. Italiano, Rajiv Ramaswami
1998	J	`jnl`	Separator-Based Sparsification II: Edge and Vertex Connectivity. SIAM J. Comput. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1997	J	`jnl`	An Empirical Study of Dynamic Graph Algorithms. ACM J. Exp. Algorithmics David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano
1997	A	`conf`	Dynamically Switching Vertices in Planar Graphs (Extended Abstract). ESA Daniele Frigioni, Giuseppe F. Italiano
1997	A*	`conf`	Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract). ICALP Roberto Grossi, Giuseppe F. Italiano
1997	A*	`conf`	Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms (Extended Abstract). SODA Giuseppe Amato, Giuseppe Cattaneo, Giuseppe F. Italiano
1997	J	`jnl`	Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
1997	—	`ed.`	Workshop on Algorithm Engineering, WAE '97, Venezia, Italy, September 11-13, 1997. Proceedings. WAE Giuseppe F. Italiano, Salvatore Orlando
1996	A*	`conf`	An Empirical Study of Dynamic Graph Algorithms (Extended Abstract). SODA David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano
1996	J	`jnl`	Decremental 2- and 3-Connectivity on Planar Graphs. Algorithmica Dora Giammarresi, Giuseppe F. Italiano
1996	J	`jnl`	Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. J. Comput. Syst. Sci. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1994	A*	`conf`	Maintaining Spanning Trees of Small Diameter. ICALP Giuseppe F. Italiano, Rajiv Ramaswami
1994	J	`jnl`	The Set Union Problem With Unlimited Backtracking. SIAM J. Comput. Alberto Apostolico, Giuseppe F. Italiano, Giorgio Gambosi, Maurizio Talamo
1993	J	`jnl`	Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung
1993	A	`conf`	Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract). ESA Giuseppe F. Italiano, Johannes A. La Poutré, Monika Rauch
1993	J	`jnl`	Maintaining the 3-Edge-Connected Components of a Graph On-Line. SIAM J. Comput. Zvi Galil, Giuseppe F. Italiano
1993	A*	`conf`	Separator based sparsification for dynamic planar graph algorithms. STOC David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1992	—	`conf`	Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version). SWAT Dora Giammarresi, Giuseppe F. Italiano
1992	J	`jnl`	Fully Dynamic Algorithms for 2-Edge Connectivity. SIAM J. Comput. Zvi Galil, Giuseppe F. Italiano
1992	A*	`conf`	Fully Dynamic Planarity Testing (Extended Abstract) STOC Zvi Galil, Giuseppe F. Italiano, Neil Sarnak
1992	J	`jnl`	Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung
1992	J	`jnl`	On-Line Computation of Minimal and Maximal Length Paths. Theor. Comput. Sci. Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
1992	J	`jnl`	Sparse Dynamic Programming I: Linear Cost Functions. J. ACM David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
1992	J	`jnl`	Sparse Dynamic Programming II: Convex and Concave Cost Functions. J. ACM David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
1992	A*	`conf`	Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) FOCS David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
1991	J	`jnl`	A Note on Set Union with Arbitrary Deunions. Inf. Process. Lett. Zvi Galil, Giuseppe F. Italiano
1991	J	`jnl`	Data Structures and Algorithms for Disjoint Set Union Problems. ACM Comput. Surv. Zvi Galil, Giuseppe F. Italiano
1991	—	`conf`	Distributed Algorithms for Updating Shortest Paths (Extended Abstract). WDAG Giuseppe F. Italiano
1991	A*	`conf`	Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. SODA Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung
1991	A*	`conf`	Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract) STOC Zvi Galil, Giuseppe F. Italiano
1991	B	`conf`	Fully Persistent Data Structures for Disjoint Set Union Problems. WADS Giuseppe F. Italiano, Neil Sarnak
1991	J	`jnl`	Incremental Algorithms for Minimal Length Paths. J. Algorithms Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
1991	A*	`conf`	Maintaining Biconnected Components of Dynamic Planar Graphs. ICALP Zvi Galil, Giuseppe F. Italiano
1991	J	`jnl`	On-Line Algorithms for Polynomially Solvable Satisfiability Problems. J. Log. Program. Giorgio Ausiello, Giuseppe F. Italiano
1991	J	`jnl`	Reducing edge connectivity to vertex connectivity. SIGACT News Zvi Galil, Giuseppe F. Italiano
1991	J	`jnl`	The Set Union Problem with Dynamic Weighted Backtracking. BIT Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo
1990	A*	`conf`	Incremental Algorithms for Minimal Length Paths. SODA Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
1990	A*	`conf`	Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. SODA David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung
1990	J	`jnl`	Predicting deadlock in store-and-forward networks. Networks Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi
1990	A*	`conf`	Sparse Dynamic Programming. SODA David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
1989	B	`conf`	Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). WADS Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
1989	J	`jnl`	Worst-Case Analysis of the Set-Union Problem with Extended Backtracking. Theor. Comput. Sci. Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo
1988	J	`jnl`	Finding Paths and Deleting Edges in Directed Acyclic Graphs. Inf. Process. Lett. Giuseppe F. Italiano
1988	A	`conf`	Getting Back to the Past in the Union-Find Problem. STACS Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo
1988	—	`conf`	Predicting deadlock in Store-and-Forward Networks. FSTTCS Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi
1986	J	`jnl`	Amortized Efficiency of a Path Retrieval Data Structure. Theor. Comput. Sci. Giuseppe F. Italiano