Giuseppe F. Italiano

ORCID

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 96

Top Venues

Publications

Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal
Black Hole Search in Dynamic Tori. CoRR (2024)
Massimo Bernaschi, Alessandro Celestini, Marco Cianfriglia, Stefano Guarino, Giuseppe F. Italiano, Enrico Mastrostefano, Lena Rebecca Zastrow
Seeking critical nodes in digraphs. J. Comput. Sci. 69 (2023)
Seunghwan Min, Jihoon Jang, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han
Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking. CoRR (2023)
Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano
Temporal Network Core Decomposition and Community Search. CoRR (2023)
Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal
Black Hole Search in Dynamic Cactus Graph. CoRR (2023)
Giuseppe F. Italiano
EATCS-Fellows 2023. Bull. EATCS 140 (2023)
Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos
Structural Parameterization of Cluster Deletion. WALCOM (2023)
Giuseppe F. Italiano, Debasish Pattanayak, Gokarna Sharma
Dispersion of Mobile Robots on Directed Anonymous Graphs. SIROCCO (2022)
Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano
Inferring Tie Strength in Temporal Networks. CoRR (2022)
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. ESA (2022)
Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano
Inferring Tie Strength in Temporal Networks. ECML/PKDD (2) (2022)
Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han
Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions. ICDE (2022)
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas, Debasish Pattanayak
On maximal 3-edge-connected subgraphs of undirected graphs. CoRR (2022)
Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
Planar Reachability Under Single Vertex or Edge Failures. CoRR (2021)
Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
) barrier. SODA (2021)
Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Evangelos Kosinas
Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. SEA (2021)
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph. CoRR (2021)
Seunghwan Min, Sung Gwan Park, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming. CoRR (2021)
Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
Planar Reachability Under Single Vertex or Edge Failures. SODA (2021)
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
Computing the 4-Edge-Connected Components of a Graph in Linear Time. ESA (2021)
Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
Tropical paths in vertex-colored graphs. J. Comb. Optim. 42 (3) (2021)
Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini
Compressed Weighted de Bruijn Graphs. CPM (2021)
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
Computing the 4-Edge-Connected Components of a Graph in Linear Time. CoRR (2021)
Vicente Acuña, Leandro Ishi Soares de Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri
A family of tree-based generators for bubbles in directed graphs. J. Graph Algorithms Appl. 25 (1) (2021)
Seunghwan Min, Sung Gwan Park, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming. Proc. VLDB Endow. 14 (8) (2021)
Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han
Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate Space. ICDE (2021)
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph. Theor. Comput. Sci. 807 (2020)
Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano
EATCS Fellows 2021 - Call for Nominations. Bull. EATCS 132 (2020)
Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
) barrier. CoRR (2020)
Gabriele Fici, Giuseppe F. Italiano
Preface. Theor. Comput. Sci. 812 (2020)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
Strong Connectivity in Directed Graphs under Failures, with Applications. SIAM J. Comput. 49 (5) (2020)
Vicente Acuña, Leandro Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri
A Family of Tree-Based Generators for Bubbles in Directed Graphs. IWOCA (2020)
Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic
Dominating Sets and Connected Dominating Sets in Dynamic Graphs. CoRR (2019)
Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, Luigi Laura
Dynamic Dominators and Low-High Orders in DAGs. ESA (2019)
Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf
Faster Algorithms for All-Pairs Bounded Min-Cuts. ICALP (2019)
Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic
Dominating Sets and Connected Dominating Sets in Dynamic Graphs. STACS (2019)
Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis
Dynamic Algorithms for the Massively Parallel Computation Model. CoRR (2019)
Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis
Dynamic Algorithms for the Massively Parallel Computation Model. SPAA (2019)
Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano
EATCS Fellows 2020 - Call for Nominations. Bull. EATCS 129 (2019)
Amir Abboud, Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski
Faster Algorithms for All-Pairs Bounded Min-Cuts. CoRR (2018)
Giovanni Bottazzi, Giuseppe F. Italiano, Domenico Spera
Preventing Ransomware Attacks Through File System Filter Drivers. ITASEC (2018)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-vertex connectivity in directed graphs. Inf. Comput. 261 (2018)
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
Dynamic algorithms via the primal-dual method. Inf. Comput. 261 (2018)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR (2018)
Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano
Computing Critical Nodes in Directed Graphs. ACM J. Exp. Algorithmics 23 (2018)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
Decremental SPQR-trees for Planar Graphs. CoRR (2018)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. LATIN (2018)
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel
Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. ALENEX (2018)
Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
Maximum Colorful Cycles in Vertex-Colored Graphs. CSR (2018)
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SIAM J. Comput. 47 (3) (2018)
Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
Maximum Colorful Cliques in Vertex-Colored Graphs. COCOON (2018)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
Decremental SPQR-trees for Planar Graphs. ESA (2018)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
Contracting a Planar Graph Efficiently. CoRR (2017)
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. CoRR (2017)
Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
Tropical Paths in Vertex-Colored Graphs. COCOA (2) (2017)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
Strong Connectivity in Directed Graphs under Failures, with Applications. SODA (2017)
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. SODA (2017)
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
Decremental Single-Source Reachability in Planar Digraphs. CoRR (2017)
Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri
On Bubble Generators in Directed Graphs. WG (2017)
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou
Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders. SEA (2017)
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. CoRR (2017)
Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán
Foreword. Theor. Comput. Sci. 658 (2017)
Giacomo Marciani, Michele Porretta, Matteo Nardelli, Giuseppe F. Italiano
A Data Streaming Approach to Link Mining in Criminal Networks. FiCloud Workshops (2017)
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
Sparse certificates for 2-connectivity in directed graphs. Theor. Comput. Sci. 698 (2017)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
Contracting a Planar Graph Efficiently. ESA (2017)
Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano
Computing Critical Nodes in Directed Graphs. ALENEX (2017)
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. ICALP (2017)
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
Decremental single-source reachability in planar digraphs. STOC (2017)
Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski
All-Pairs 2-Reachability in O(n^w log n) Time. ICALP (2017)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni
An Experimental Study of Dynamic Dominators. CoRR (2016)
Donatella Firmani, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni
Strong Articulation Points and Strong Bridges in Large Scale Graphs. Algorithmica 74 (3) (2016)
Giovanni Bottazzi, Giuseppe F. Italiano, Giuseppe Giulio Rutigliano
Frequency Domain Analysis of Large-Scale Proxy Logs for Botnet Traffic Detection. SIN (2016)
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis
Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. FOCS (2016)
Nilakantha Paudel, Marco Querini, Giuseppe F. Italiano
Online Handwritten Signature Verification for Low-End Devices. ICISSP (Revised Selected Papers) (2016)
Giuseppe F. Italiano, Marc J. van Kreveld, Bettina Speckmann, Guy Theraulaz
Geometric and Graph-based Approaches to Collective Motion (Dagstuhl Seminar 16022). Dagstuhl Reports 6 (1) (2016)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
On Resilient Graph Spanners. Algorithmica 74 (4) (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
Incremental 2-Edge-Connectivity in Directed Graphs. CoRR (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
Sparse Subgraphs for 2-Connectivity in Directed Graphs. SEA (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2-Connectivity in Directed Graphs. ESA (2016)
Nilakantha Paudel, Marco Querini, Giuseppe F. Italiano
Handwritten Signature Verification for Mobile Phones. ICISSP (2016)
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
Design of Dynamic Algorithms via Primal-Dual Method. CoRR (2016)
Luca Aceto, Mariangiola Dezani-Ciancaglini, Yuri Gurevich, David Harel, Monika Henzinger, Giuseppe F. Italiano, Scott A. Smolka, Paul G. Spirakis, Wolfgang Thomas
EATCS Fellows' Advice to the Young Theoretical Computer Scientist. Bull. EATCS 119 (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-Edge Connectivity in Directed Graphs. ACM Trans. Algorithms 13 (1) (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
Incremental 2-Edge-Connectivity in Directed Graphs. ICALP (2016)
Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski
) Time. CoRR (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-Edge Connectivity in Directed Graphs. SODA (2015)
Marco Querini, Marco Gattelli, Valerio M. Gentile, Giuseppe F. Italiano
A New System for Secure Handwritten Signing of Documents. Int. J. Comput. Sci. Appl. 12 (2) (2015)
Hans L. Bodlaender, MohammadTaghi Hajiaghayi, Giuseppe F. Italiano
Editorial. Algorithmica 73 (4) (2015)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR (2015)
Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. CoRR (2015)
Hans L. Bodlaender, Mohammad Taghi Hajiaghayi, Giuseppe F. Italiano
Erratum to: Editorial. Algorithmica 73 (4) (2015)
Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. ESA (2015)
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
Design of Dynamic Algorithms via Primal-Dual Method. ICALP (1) (2015)
William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-Connectivity in Directed Graphs: An Experimental Study. ALENEX (2015)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-Vertex Connectivity in Directed Graphs. ICALP (1) (2015)
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SODA (2015)
Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura
Experimental Evaluation of Algorithms for the Food-Selection Problem. CoRR (2014)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-Edge Connectivity in Directed Graphs. CoRR (2014)
Marco Querini, Giuseppe F. Italiano
Reliability and data density in high capacity color barcodes. Comput. Sci. Inf. Syst. 11 (4) (2014)
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. CoRR (2014)

Giuseppe F. Italiano.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Giuseppe F. Italiano