World's Best Scientists 2026 revealed!
Pierluigi Crescenzi

Pierluigi Crescenzi

D-Index & Metrics

Computer Science

D-Index
34
Citations
7194
World Ranking
11969
National Ranking
405

Overview

Pierluigi Crescenzi is affiliated with the Gran Sasso Science Institute in Italy. Their research primarily focuses on various aspects of computer science, with a particular concentration on computer networks, data management, algorithms, and graph theory.

The main fields of study represented in their work include:

  • Computer Science

Within this broad field, their subfields of study cover:

  • Computer Networks and Communications
  • Signal Processing
  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Transportation

Their research topics are centered around:

  • Opportunistic and Delay-Tolerant Networks
  • Data Management and Algorithms
  • Advanced Graph Theory Research
  • Mobile Ad Hoc Networks
  • Graph Theory and Algorithms
  • Human Mobility and Location-Based Analysis
  • Caching and Content Delivery

Recent papers authored or co-authored by Pierluigi Crescenzi include:

  • "Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs", 2020, Algorithms
  • "On computing Pareto optimal paths in weighted time-dependent networks", 2021, Information Processing Letters
  • "On Computing the Diameter of (Weighted) Link Streams", 2022, ACM Journal of Experimental Algorithmics
  • "Planning with Biological Neurons and Synapses", 2022, Proceedings of the AAAI Conference on Artificial Intelligence
  • "Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks", 2022, Networks

Frequent co-authors associated with their work include:

  • Andrea Marino
  • Filippo Brunelli
  • Laurent Viennot
  • Emanuele Natale
  • Paulo Bruno S. Serafim

The venues where they have frequently published are:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • SSRN Electronic Journal
  • HAL (Le Centre pour la Communication Scientifique Directe)
  • Algorithms

Best Publications

  • Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

    Giorgio Ausiello;Pierluigi Crescenzi;Giorgio Gambosi;Viggo Kann

  • Complexity and Approximation

    Giorgio Ausiello;Alberto Marchetti-Spaccamela;Pierluigi Crescenzi;Giorgio Gambosi

  • On the complexity of protein folding

    Pierluigi Crescenzi;Deborah Goldman;Christos H. Papadimitriou;Antonio Piccolboni

  • Introduction to the theory of complexity

    Daniel Pierre Bovet;Pierluigi Crescenzi

  • Approximation on the Web: A Compendium of NP Optimization Problems

    Pierluigi Crescenzi;Viggo Kann

  • MeDuSa: a multi-draft based scaffolder

    Emanuele Bosi;Beatrice Donati;Marco Galardini;Sara Brunetti

  • On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs

    Andrea E. F. Clementi;Pierluigi Crescenzi;Paolo Penna;Gianluca Rossi

  • Completeness in approximation classes

    Pierluigi Crecenzi;Alessandro Panconesi

  • Approximate solution of NP optimization problems

    G. Ausiello;P. Crescenzi;M. Protasi

  • A note on optimal area algorithms for upward drawings of binary trees

    P. Crescenzi;G. Di Battista;A. Piperno

  • A uniform approach to define complexity classes

    Daniel P. Bovet;Pierluigi Crescenzi;Riccardo Silvestri

  • A short guide to approximation preserving reductions

    P. Crescenzi

  • Parsimonious flooding in dynamic graphs

    Hervé Baumann;Pierluigi Crescenzi;Pierre Fraigniaud

  • Reversible Execution and Visualization of Programs with LEONARDO

    Pierluigi Crescenzi;Camil Demetrescu;Irene Finocchi;Rossella Petreschi

  • Structure in Approximation Classes

    Pierluigi Crescenzi;Viggo Kann;Riccardo Silvestri;linebreak Luca Trevisan

  • On computing the diameter of real-world undirected graphs

    Pilu Crescenzi;Roberto Grossi;Michel Habib;Leonardo Lanzi

  • Parsimonious flooding in dynamic graphs

    Hervé Baumann;Pierluigi Crescenzi;Pierre Fraigniaud

  • On the complexity of protein folding (extended abstract)

    Pierluigi Crescenzi;Deborah Goldman;Christos Papadimitriou;Antonio Piccolboni

  • To Weight or Not to Weight: Where is the Question?

    Pierluigi Crescenzi;Riccardo Silvestri;Luca Trevisan

  • IP Address Lookup Made Fast and Simple

    Pierluigi Crescenzi;Leandro Dardini;Roberto Grossi

  • Greedily Improving Our Own Closeness Centrality in a Network

    Pierluigi Crescenzi;Gianlorenzo D'angelo;Lorenzo Severini;Yllka Velaj

  • Completeness in Approximation Classes

    Pierluigi Crescenzi;Alessandro Panconesi

Frequent Co-Authors

Luca Trevisan
Luca Trevisan Bocconi University
Marie-France Sagot
Marie-France Sagot Claude Bernard University Lyon 1
Andrea E. F. Clementi
Andrea E. F. Clementi University of Rome Tor Vergata
Pierre Fraigniaud
Pierre Fraigniaud Université Paris Cité
Alberto Marchetti-Spaccamela
Alberto Marchetti-Spaccamela Sapienza University of Rome
Michel Habib
Michel Habib Université Paris Cité
Christos H. Papadimitriou
Christos H. Papadimitriou Columbia University
Leen Stougie
Leen Stougie Centrum Wiskunde & Informatica
Daniel Gildea
Daniel Gildea University of Rochester
Mihalis Yannakakis
Mihalis Yannakakis Columbia University

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens a range of online degrees and fast-paced career options. Many students aim to save on costs while earning advanced credentials. For those interested in data analysis, the cheapest data science masters in usa can offer a pathway to high-paying roles without breaking the bank.

If your interests lie in engineering, consider pursuing an online bachelor’s in electrical engineering. This flexible option allows you to develop technical skills from anywhere, making it easier to balance study and life commitments.

For those looking to advance or pivot quickly, there are shortest master degree programs available online, letting you earn your degree in less time than traditional programs.

Don’t overlook certifications—many certificate programs that pay well can be completed in months, boosting your credentials and employability with minimal investment.

Combining these flexible education options can help you tailor a career path that fits your goals, timeline, and budget in today’s digital world.

Best Scientists Citing Pierluigi Crescenzi

Trending Scientists