2026 Giuseppe F. Italiano: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	50	5672	5512	129	127	336	8743

Research.com Recognitions

2023 - Research.com Computer Science in Italy Leader Award
2016 - European Association for Theoretical Computer Science (EATCS) Fellow For fundamental contributions to the design and analysis of algorithms for solving theoretical and applied problems in graphs and massive data sets, and for his role in establishing the field of algorithm engineering

Overview

Giuseppe F. Italiano is affiliated with the Guido Carli Free International University for Social Studies in Italy. Their research primarily focuses on computer science, with a significant emphasis on computer networks and communications, computational theory and mathematics, and artificial intelligence.

The scientist has contributed to multiple subfields including:

Computer Networks and Communications
Computational Theory and Mathematics
Artificial Intelligence
Statistical and Nonlinear Physics
Computer Vision and Pattern Recognition

Key research topics in their portfolio encompass:

Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Graph Theory and Algorithms
Interconnection Networks and Systems
Distributed systems and fault tolerance
Optimization and Search Problems
Complex Network Analysis Techniques

Their recent papers to date include:

Symmetric continuous subgraph matching with bidirectional dynamic programming, 2021, Proceedings of the VLDB Endowment
Strong Connectivity in Directed Graphs under Failures, with Applications, 2020, SIAM Journal on Computing
Compressed Weighted de Bruijn Graphs, 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Seeking critical nodes in digraphs, 2023, Journal of Computational Science
Inferring tie strength in temporal networks, 2025, Data Mining and Knowledge Discovery

Frequent coauthors associated with this scientist include:

Athanasios L. Konstantinidis
Evangelos Kosinas
Loukas Georgiadis
Partha Sarathi Mandal
Lutz Oettershagen

Their publications appear often in journals and venues such as:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Journal of Graph Algorithms and Applications
Proceedings of the VLDB Endowment
SIAM Journal on Computing

Giuseppe F. Italiano has also published a book titled Privacy Technologies and Policy in 2020, through Springer Science+Business Media.

In recognition of their contributions, this scientist was named a Fellow of the European Association for Theoretical Computer Science (EATCS) in 2016, citing fundamental work on the design and analysis of algorithms related to graphs and massive data sets as well as a role in establishing the algorithm engineering field.

Best Publications

On the optimal placement of web proxies in the Internet

Bo Li;M.J. Golin;G.F. Italiano;Xin Deng

612
Citations
Sparsification—a technique for speeding up dynamic graph algorithms

David Eppstein;Zvi Galil;Giuseppe F. Italiano;Amnon Nissenzweig

542
Citations
A new approach to dynamic all pairs shortest paths

Camil Demetrescu;Giuseppe F. Italiano

436
Citations
Data structures and algorithms for disjoint set union problems

Zvi Galil;Giuseppe F. Italiano

281
Citations
Incremental algorithms for minimal length paths

Giorgio Ausiello;Giuseppe F. Italiano;Giuseppe F. Italiano;Alberto Marchetti Spaccamela;Umberto Nanni

242
Citations
Dynamic graph algorithms

Camil Demetrescu;David Eppstein;Zvi Galil;Giuseppe F. Italiano

235
Citations
Maintenance of a minimum spanning forest in a dynamic plane graph

David Eppstein;Giuseppe F. Italiano;Roberto Tamassia;Robert E. Tarjan

234
Citations
Dynamic Graph Algorithms

Unknown

216
Citations
Sparse dynamic programming I: linear cost functions

David Eppstein;Zvi Galil;Raffaele Giancarlo;Giuseppe F. Italiano

212
Citations
Resilient dictionaries

Irene Finocchi;Fabrizio Grandoni;Giuseppe F. Italiano

174
Citations
Amortized efficiency of a path retrieval data structure

G. F. Italiano

172
Citations
Experimental analysis of dynamic all pairs shortest path algorithms

Camil Demetrescu;Giuseppe F. Italiano

166
Citations
Sparsification-a technique for speeding up dynamic graph algorithms

D. Eppstein

162
Citations
New Algorithms for Examination Timetabling

Massimiliano Caramia;Paolo Dell'Olmo;Giuseppe F. Italiano

158
Citations
Finding paths and deleting edges in directed acyclic graphs

Giuseppe F. Italiano

139
Citations
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier

C. Demetrescu;G.F. Italiano

136
Citations
Improved algorithms for min cut and max flow in undirected planar graphs

Giuseppe F. Italiano;Yahav Nussbaum;Piotr Sankowski;Christian Wulff-Nilsen

133
Citations
Finding strong bridges and strong articulation points in linear time

Giuseppe F. Italiano;Luigi Laura;Federico Santaroni

119
Citations
Sparse dynamic programming II: convex and concave cost functions

David Eppstein;Zvi Galil;Raffaele Giancarlo;Giuseppe F. Italiano

114
Citations
High Capacity Colored Two Dimensional codes

Antonio Grillo;Alessandro Lentini;Marco Querini;Giuseppe F. Italiano

109
Citations
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights

Camil Demetrescu;Giuseppe F. Italiano

99
Citations

Frequent Co-Authors

Zvi Galil Georgia Institute of Technology

Fabrizio Grandoni Dalle Molle Institute for Artificial Intelligence Research

David Eppstein University of California, Irvine

Monika Henzinger Institute of Science and Technology Austria

David S. Johnson AT&T (United States)

Catuscia Palamidessi French Institute for Research in Computer Science and Automation - INRIA

Peter Sanders Karlsruhe Institute of Technology

Roberto Tamassia Brown University

Hans L. Bodlaender Utrecht University

Marie-France Sagot Claude Bernard University Lyon 1

External Links

Wikipedia of Giuseppe F. Italiano Personal website of Giuseppe F. Italiano Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Pursuing a Computer Science degree opens the door to a wide range of online academic options and career paths in the USA. For those looking for a fast start, there are 1 year associate degree programs online that provide fundamental skills and can help you enter the workforce quickly or build credits toward a bachelor’s degree.

Budget is often a key concern for students. Fortunately, there are many cheapest online degrees available, allowing you to gain quality education without incurring heavy debt.

If your GPA isn’t as high as you’d like, you still have options. Some online schools that accept low gpa offer flexible admission requirements for aspiring computer science students, helping more students start their tech careers.

A computer science background also opens pathways beyond traditional tech roles. You might also consider inter-disciplinary areas such as environmental science. Explore a variety of jobs with elementary education and environmental science degree to broaden your horizons in technology-driven industries.