Professore Ordinario

Gabriele Di Stefano


Computer Engineering, Distributed Algorithms, Computational complexity
11 Ingegneria Informatica
ING-INF/05 - Sistemi di elaborazione delle informazioni
Information Engineering

External site   Scholar DBLP



  • Gabriele Di Stefano received the Dr. degree cum laude and honors in Computer Science from the University of Turin, Italy, in 1989.
  • He obtained his Ph.D. at University "La Sapienza" of Rome in September 1992.


  • In the period September 1994 - December 2004 he was Assistant Professor at University of L'Aquila.
  • Currently and since January 2005, he is Associate Professor for Computer Science at University of L'Aquila, where he teaches Object-Oriented Programming and Computer Networks.

European Projects

He had key-participations in several EU funded projects.

  • Currently, and since February 2006, he is site leader for University of L'Aquila in the European project funded by the Future and Emerging Technologies Unit of EC (IST priority - 6th FP), under contract no. FP6-021235-2 (Project ARRIVAL - Algorithms for Robust and online Railway optimization: Improving the Validity and reliAbility of Large scale systems). He coordinates the research activities carried out both at Department of Electrical and Information Engineering (Univ. L'Aquila) and Department of Computer and Systems Sciences (Univ. Sapienza, Rome).
    The main goal of ARRIVAL is to develop the necessary foundational algorithmic research in order to provide ingenious and sound answers to the fundamental efficiency and quality issues encapsulated in robust and online planning of complex, large-scale systems as those in railways.
  • From February 2000 to February 2004, he was site leader for University of L'Aquila in the European project funded by the Human Potential Program of the EU, under contract no HPRN-CT-1999-00104 (Project AMORE - Algorithmic Methods for Optimizing the Railways in Europe). He coordinated the research activities carried out Department of Electrical and Information Engineering (Univ. L'Aquila). The main goal of AMORE is to develop models for railway optimization problems, and to propose and implement algorithms for solving them.
  • He also participated to the European Projects COLUMBUS (IST 2001-38314), where he worked on positioning algorithms for nodes in wireless sensor networks, and MILORD (AIM 2024).

Other Research Activities

  • He coordinates national funded projects and has research cooperations with the CNR (Italian National Research Council), the INFN (Istituto Nazionale di Fisica Nucleare), and the PSTDA (Parco Scientico e Tecnologico d'Abruzzo).
  • From 2000 to 2005 he supervised inter-project activities for the MIUR (Ministry of Instruction, University and Research).
  • He is program chair of 9th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ALGO/ATMOS09), September 2009, Copenhagen, Denmark. He was member of program committee of the same conference in the edition of September 2004, in Bergen, Norway. He was member of program committee of the Workshop on Algorithmic Methods and Models for Optimization of Railways, 2002, in Malaga, Spain. He organized the 2nd ARRIVAL Annual Workshop and Review Meeting, Rome, 11 March, 2008. He has also contributed to the organization of several international and national conference.
  • He acted as a referee for international journals like IEEE Transaction on Computers, IEEE Transaction on Intelligent Transport Systems, Journal on Parallel and Distributed Computing, Journal of Discrete Algorithms, Discrete Mathematics, Discrete Applied Mathematics, Graphs and Combinatorics and others.
  • His current research interests include recoverable robustness, network algorithms, combinatorial optimization, algorithmic graph theory. He is (co-)author of about 90 publications in international journals and conferences in these areas.


Non ci sono annunci disponibili.

Utilizziamo i cookie per offrirti il ​​nostro servizio. Continuando a utilizzare questo sito acconsenti al nostro utilizzo dei cookie come descritto nella nostra policy.