Pierluigi Crescenzi

Orcid: 0000-0001-8789-3195

  • Gran Sasso Science Institute, L'Aquila, Italy
  • University of Florence, Italy (former)

According to our database1, Pierluigi Crescenzi authored at least 142 papers between 1990 and 2024.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


WorldDynamics.jl: A Julia Package for Developing and Simulating Integrated Assessment Models.
J. Open Source Softw., April, 2024

Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks.
Networks, March, 2023

The Way We Were: Structural Operational Semantics Research in Perspective.
Proceedings of the Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, 2023

A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs.
CoRR, 2023

Proxying Betweenness Centrality Rankings in Temporal Networks.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal Evolution.
Proceedings of the Structural Information and Communication Complexity, 2023

Giant Components in Random Temporal Graphs.
Proceedings of the Approximation, 2023

On Computing the Diameter of (Weighted) Link Streams.
ACM J. Exp. Algorithmics, 2022

CONCUR through time.
Bull. EATCS, 2022

Planning with Biological Neurons and Synapses.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

On computing Pareto optimal paths in weighted time-dependent networks.
Inf. Process. Lett., 2021

On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation.
CoRR, 2021

Public Communication can Facilitate Low-Risk Coordination under Surveillance.
CoRR, 2021

Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs.
Algorithms, 2020

Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Simple and Fast Distributed Computation of Betweenness Centrality.
Proceedings of the 39th IEEE Conference on Computer Communications, 2020

A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs.
Proceedings of the ICETC'20: 12th International Conference on Education Technology and Computers, 2020

Degrees of Separation and Diameter in Large Graphs.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Computing top-<i>k</i> Closeness Centrality Faster in Unweighted Graphs.
ACM Trans. Knowl. Discov. Data, 2019

Approximating the Temporal Neighbourhood Function of Large Temporal Graphs.
Algorithms, 2019

Trade-Offs in Distributed Interactive Proofs.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Improving the Betweenness Centrality of a Node by Adding Links.
ACM J. Exp. Algorithmics, 2018

An ant-colony based approach for real-time implicit collaborative information seeking.
Inf. Process. Manag., 2017

Computing top-k Closeness Centrality Faster in Unweighted Graphs.
CoRR, 2017

Sigil3D: A Crowdsourcing Platform for Interactive 3D Content.
CoRR, 2017

An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Greedily Improving Our Own Closeness Centrality in a Network.
ACM Trans. Knowl. Discov. Data, 2016

Rumor spreading in random evolving graphs.
Random Struct. Algorithms, 2016

On the complexity of the shortest-path broadcast problem.
Discret. Appl. Math., 2016

Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Core-periphery clustering and collaboration networks.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games.
Theor. Comput. Sci., 2015

Synchronous context-free grammars and optimal linear parsing strategies.
J. Comput. Syst. Sci., 2015

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Into the Square: On the Complexity of Some Quadratic-time Solvable Problems.
Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Fast and Simple Computation of Top-k Closeness Centralities.
CoRR, 2015

MeDuSa: a multi-draft based scaffolder.
Bioinform., 2015

EUCALYPT: efficient tree reconciliation enumerator.
Algorithms Mol. Biol., 2015

Greedily Improving Our Own Centrality in A Network.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

An Eclipse IDE for Teaching Java-.
Proceedings of the Software Technologies - 10th International Joint Conference, 2015

Java--Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach.
Proceedings of the ICSOFT-PT 2015, 2015

On Computing the Hyperbolicity of Real-World Graphs.
Proceedings of the Algorithms - ESA 2015, 2015

Blind image clustering based on the Normalized Cuts criterion for camera identification.
Signal Process. Image Commun., 2014

Flooding in dynamic graphs with arbitrary degree sequence.
J. Parallel Distributed Comput., 2014

Into the Square - On the Complexity of Quadratic-Time Solvable Problems.
CoRR, 2014

Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure.
Bioinform., 2014

On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

On computing the diameter of real-world undirected graphs.
Theor. Comput. Sci., 2013

Telling Stories Fast.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Requirements and design strategies for open source interactive computer science eBooks.
Proceedings of the ITiCSE working group reports conference on Innovation and technology in computer science education-working group reports, 2013

From theory to practice: NP-completeness for every CS student.
Proceedings of the Innovation and Technology in Computer Science Education conference 2013, 2013

Rumor Spreading in Random Evolving Graphs.
Proceedings of the Algorithms - ESA 2013, 2013

Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets.
Theor. Comput. Sci., 2012

Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course.
J. Educ. Technol. Soc., 2012

On Computing the Diameter of Real-World Directed (Weighted) Graphs.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Efficient Bubble Enumeration in Directed Graphs.
Proceedings of the String Processing and Information Retrieval, 2012

Making turing machines accessible to blind students.
Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Smooth movement and Manhattan path based Random Waypoint mobility.
Inf. Process. Lett., 2011

Parsimonious flooding in dynamic graphs.
Distributed Comput., 2011

On two collateral effects of using algorithm visualizations.
Br. J. Educ. Technol., 2011

A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems.
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011

Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Adapting moodle to better support CS education.
Proceedings of the 2010 ITiCSE working group reports, 2010

Using AVs to explain NP-completeness.
Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2010

Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound.
Proceedings of the Algorithms, 2010

Theory Comput. Syst., 2009

Adding Test Generation to the Teaching Machine.
ACM Trans. Comput. Educ., 2009

On the connectivity of Bluetooth-based <i>ad hoc</i> networks.
Concurr. Comput. Pract. Exp., 2009

Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.
Proceedings of the Structural Information and Communication Complexity, 2009

Performance Evaluation of a Chord-Based JXTA Implementation.
Proceedings of the First International Conference on Advances in P2P Systems, 2009

Integrating test generation functionality into the Teaching Machine environment.
Proceedings of the Fifth Program Visualization Workshop, 2008

Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks.
Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, 2008

On-line load balancing made simple: Greedy strikes back.
J. Discrete Algorithms, 2007

Fully integrating algorithm visualization into a cs2 course.: a two-year experience.
Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2007

On the Connectivity of Bluetooth-Based Ad Hoc Networks.
Proceedings of the Euro-Par 2007, 2007

Assessing CS1 java skills: a three-year experience.
Proceedings of the 11th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2006

NetPrIDE an integrated environment for developing and visualizing computer network protocols.
Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, 2005

Foreword - ACM MONET Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications.
Mob. Networks Appl., 2004

The minimum likely column cover problem.
Inf. Process. Lett., 2004

Optimal covering designs: complexity results and new bounds.
Discret. Appl. Math., 2004

On-line algorithms for the channel assignment problem in cellular networks.
Discret. Appl. Math., 2004

An Environment for Self-Assessing Java Programming Skills in Undergraduate First Programming Courses.
Proceedings of the IEEE International Conference on Advanced Learning Technologies, 2004

Text sparsification via local maxima.
Theor. Comput. Sci., 2003

Search Data Structures for Skewed Strings.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

C : C++ = JavaMM: Java.
Proceedings of the 2nd International Symposium on Principles and Practice of Programming in Java, 2003

A tool to develop electronic course books based on WWW technologies, resources and usability criteria.
Proceedings of the 8th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2003

Online Load Balancing Made Simple: Greedy Strikes Back.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

On the Hamming distance of constraint satisfaction problems.
Theor. Comput. Sci., 2002

A note on the spatiality degree of graphs.
Ars Comb., 2002

Development of an ECB on Computer Networks Based on WWW Technologies, Resources and Usability Criteria.
Proceedings of the International Conference on Computers in Education, 2002

On Approximating a Scheduling Problem.
J. Comb. Optim., 2001

On Weighted vs Unweighted Versions of Combinatorial Optimization Problems.
Inf. Comput., 2001

On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs.
Proceedings of the STACS 2001, 2001

On Computing Ad-hoc Selective Families.
Proceedings of the Approximation, 2001

Towards a Taxonomy of Network Protocol Visualization Tools.
Proceedings of the Software Visualization, 2001

Reversible Execution and Visualization of Programs with LEONARDO.
J. Vis. Lang. Comput., 2000

On Approximation Scheme Preserving Reducibility and Its Applications.
Theory Comput. Syst., 2000

Max NP-completeness Made Easy.
Theor. Comput. Sci., 1999

IP Address Lookup Made Fast and Simple.
Proceedings of the Algorithms, 1999

On the Complexity of Approximating Colored-Graph Problems.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

Complexity and approximation: combinatorial optimization problems and their approximability properties.
Springer, ISBN: 3540654313, 1999

Strictly-upward Drawings of Ordered Search Trees.
Theor. Comput. Sci., 1998

The Parallel Complexity of Approximating the High Degree Subgraph Problem.
Theor. Comput. Sci., 1998

How to find the best approximation results.
SIGACT News, 1998

On the Complexity of Protein Folding.
J. Comput. Biol., 1998

Linear area upward drawings of AVL trees.
Comput. Geom., 1998

Sperner's Lemma and Robust Machines.
Comput. Complex., 1998

On the Complexity of Protein Folding (Extended Abstract).
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

On the complexity of protein folding (abstract).
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998

LEONARDO: a software visualization system.
Proceedings of the Workshop on Algorithm Engineering, 1997

Approximation on the Web: A Compendium of NP Optimization Problems.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

Minimum-Area h-v Drawings of Complete Binary Trees.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

A Short Guide to Approximation Preserving Reductions.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem.
RAIRO Theor. Informatics Appl., 1996

Structure in Approximation Classes
Electron. Colloquium Comput. Complex., 1996

Upward Drawings of Search Trees (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Parallel approximation of optimization problems.
Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

To Weight or Not to Weight: Where is the Question?
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

Reversible Simulation of Space-Bounded Computations.
Theor. Comput. Sci., 1995

Approximate Solution of NP Optimization Problems.
Theor. Comput. Sci., 1995

Max Sat and Min Set Cover Approximation Algorithms are P-Complete.
Parallel Process. Lett., 1995

Complexity Classes and Sparse Oracles.
J. Comput. Syst. Sci., 1995

Parallel Simulated Annealing for Shape Detection.
Comput. Vis. Image Underst., 1995

Structure in Approximation Classes (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Optimal-Area Upward Drawings of AVL Trees.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

On Approximation Scheme Preserving Reducability and Its Applications.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Introduction to the theory of complexity.
Prentice Hall international series in computer science, Prentice Hall, ISBN: 978-0-13-915380-8, 1994

A Note on the Descriptive Complexity of Maximization.
Inf. Process. Lett., 1993

Average Measure, Descriptive Complexity and Approximation of Maximization Problems.
Int. J. Found. Comput. Sci., 1993

A Uniform Approach to Define Complexity Classes.
Theor. Comput. Sci., 1992

A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees.
Comput. Geom., 1992

Completeness in Approximation Classes
Inf. Comput., August, 1991

A Note on the Approximation of the MAX CLIQUE Problem.
Inf. Process. Lett., 1991

Minimum-Delay Schedules in Layered Networks.
Acta Informatica, 1991

Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems.
Inf. Process. Lett., 1990

Deadlock Prediction in the Case of Dynamic Routing.
Int. J. Found. Comput. Sci., 1990