Deadlock Prediction in the Case of Dynamic Routing. - Daniel P. Bovet; Miriam Di Ianni; Pierluigi Crescenzi (Int. J. Found. Comput. Sci., 1990)

Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems. - Pierluigi Crescenzi; Riccardo Silvestri (Inf. Process. Lett., 1990)

Minimum-Delay Schedules in Layered Networks. - Daniel P. Bovet; Pierluigi Crescenzi (Acta Informatica, 1991)

A Note on the Approximation of the MAX CLIQUE Problem. - Pierluigi Crescenzi; C. Fiorini; Riccardo Silvestri (Inf. Process. Lett., 1991)

Completeness in Approximation Classes - Pierluigi Crescenzi; Alessandro Panconesi (Inf. Comput., 1991)

A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. - Pierluigi Crescenzi; Giuseppe Di Battista; Adolfo Piperno (Comput. Geom., 1992)

A Uniform Approach to Define Complexity Classes. - Daniel P. Bovet; Pierluigi Crescenzi; Riccardo Silvestri (Theor. Comput. Sci., 1992)

Average Measure, Descriptive Complexity and Approximation of Maximization Problems. - Pierluigi Crescenzi; Riccardo Silvestri (Int. J. Found. Comput. Sci., 1993)

A Note on the Descriptive Complexity of Maximization. - Pierluigi Crescenzi; Riccardo Silvestri (Inf. Process. Lett., 1993)

Introduction to the theory of complexity. - Daniel P. Bovet; Pierluigi Crescenzi (Prentice Hall, 1994)

On Approximation Scheme Preserving Reducability and Its Applications. - Pierluigi Crescenzi; Luca Trevisan 001 (FSTTCS, 1994)

Optimal-Area Upward Drawings of AVL Trees. - Pierluigi Crescenzi; Adolfo Piperno (GD, 1994)

Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract). - Pierluigi Crescenzi; Luca Trevisan 001 (WG, 1994)

Structure in Approximation Classes (Extended Abstract). - Pierluigi Crescenzi; Viggo Kann; Riccardo Silvestri; Luca Trevisan 001 (COCOON, 1995)

Parallel Simulated Annealing for Shape Detection. - Gian Carlo Bongiovanni; Pierluigi Crescenzi; Concettina Guerra (Comput. Vis. Image Underst., 1995)

Complexity Classes and Sparse Oracles. - Daniel P. Bovet; Pierluigi Crescenzi; Riccardo Silvestri (J. Comput. Syst. Sci., 1995)

Max Sat and Min Set Cover Approximation Algorithms are P-Complete. - Gian Carlo Bongiovanni; Pierluigi Crescenzi; Sergio De Agostino (Parallel Process. Lett., 1995)

Approximate Solution of NP Optimization Problems. - Giorgio Ausiello; Pierluigi Crescenzi; Marco Protasi (Theor. Comput. Sci., 1995)

Reversible Simulation of Space-Bounded Computations. - Pierluigi Crescenzi; Christos H. Papadimitriou (Theor. Comput. Sci., 1995)

To Weight or Not to Weight: Where is the Question? - Pierluigi Crescenzi; Riccardo Silvestri; Luca Trevisan 001 (ISTCS, 1996)

Parallel approximation of optimization problems. - Daniel P. Bovet; Andrea Clementi; Pierluigi Crescenzi; Riccardo Silvestri (Solving Combinatorial Optimization Problems in Parallel, 1996)

Upward Drawings of Search Trees (Extended Abstract). - Pierluigi Crescenzi; Paolo Penna (WG, 1996)

On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem. - Pierluigi Crescenzi; Luca Trevisan 001 (RAIRO Theor. Informatics Appl., 1996)

A Short Guide to Approximation Preserving Reductions. - Pierluigi Crescenzi (CCC, 1997)

Minimum-Area h-v Drawings of Complete Binary Trees. - Pierluigi Crescenzi; Paolo Penna (GD, 1997)

Approximation on the Web: A Compendium of NP Optimization Problems. - Pierluigi Crescenzi; Viggo Kann (RANDOM, 1997)

LEONARDO: a software visualization system. - Pierluigi Crescenzi; Camil Demetrescu; Irene Finocchi; Rossella Petreschi (WAE, 1997)

On the complexity of protein folding (abstract). - Pierluigi Crescenzi; Deborah Goldman; Christos H. Papadimitriou; Antonio Piccolboni; Mihalis Yannakakis (RECOMB, 1998)

On the Complexity of Protein Folding (Extended Abstract). - Pierluigi Crescenzi; Deborah Goldman; Christos H. Papadimitriou; Antonio Piccolboni; Mihalis Yannakakis (STOC, 1998)

Sperner's Lemma and Robust Machines. - Pierluigi Crescenzi; Riccardo Silvestri (Comput. Complex., 1998)

Linear area upward drawings of AVL trees. - Pierluigi Crescenzi; Paolo Penna; Adolfo Piperno (Comput. Geom., 1998)

On the Complexity of Protein Folding. - Pierluigi Crescenzi; Deborah Goldman; Christos H. Papadimitriou; Antonio Piccolboni; Mihalis Yannakakis (J. Comput. Biol., 1998)

How to find the best approximation results. - Pierluigi Crescenzi; Viggo Kann (SIGACT News, 1998)

The Parallel Complexity of Approximating the High Degree Subgraph Problem. - Alexander E. Andreev; Andrea E. F. Clementi; Pierluigi Crescenzi; Elias Dahlhaus; Sergio De Agostino; José D. P. Rolim (Theor. Comput. Sci., 1998)

Strictly-upward Drawings of Ordered Search Trees. - Pierluigi Crescenzi; Paolo Penna (Theor. Comput. Sci., 1998)

Complexity and approximation: combinatorial optimization problems and their approximability properties. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Pierluigi Crescenzi; Giorgio Gambosi; Marco Protasi; Viggo Kann (Springer, 1999)

On the Complexity of Approximating Colored-Graph Problems. - Andrea E. F. Clementi; Pierluigi Crescenzi; Gianluca Rossi (COCOON, 1999)

IP Address Lookup Made Fast and Simple. - Pierluigi Crescenzi; Leandro Dardini; Roberto Grossi (ESA, 1999)

Structure in Approximation Classes. - Pierluigi Crescenzi; Viggo Kann; Riccardo Silvestri; Luca Trevisan 001 (SIAM J. Comput., 1999)

Max NP-completeness Made Easy. - Pierluigi Crescenzi; Luca Trevisan 001 (Theor. Comput. Sci., 1999)

On Approximation Scheme Preserving Reducibility and Its Applications. - Pierluigi Crescenzi; Luca Trevisan 001 (Theory Comput. Syst., 2000)

Reversible Execution and Visualization of Programs with LEONARDO. - Pierluigi Crescenzi; Camil Demetrescu; Irene Finocchi; Rossella Petreschi (J. Vis. Lang. Comput., 2000)

Towards a Taxonomy of Network Protocol Visualization Tools. - Pierluigi Crescenzi; Gaia Innocenti (Software Visualization, 2001)

On Computing Ad-hoc Selective Families. - Andrea E. F. Clementi; Pierluigi Crescenzi; Angelo Monti; Paolo Penna; Riccardo Silvestri (RANDOM-APPROX, 2001)

On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. - Andrea E. F. Clementi; Pierluigi Crescenzi; Paolo Penna; Gianluca Rossi; Paola Vocca (STACS, 2001)

On Weighted vs Unweighted Versions of Combinatorial Optimization Problems. - Pierluigi Crescenzi; Riccardo Silvestri; Luca Trevisan 001 (Inf. Comput., 2001)

On Approximating a Scheduling Problem. - Pierluigi Crescenzi; Xiaotie Deng; Christos H. Papadimitriou (J. Comb. Optim., 2001)

Development of an ECB on Computer Networks Based on WWW Technologies, Resources and Usability Criteria. - Pierluigi Crescenzi; Gaia Innocenti (ICCE, 2002)

A note on the spatiality degree of graphs. - Pierluigi Crescenzi; Sergio De Agostino; Riccardo Silvestri (Ars Comb., 2002)

On the Hamming distance of constraint satisfaction problems. - Pierluigi Crescenzi; Gianluca Rossi (Theor. Comput. Sci., 2002)

Online Load Balancing Made Simple: Greedy Strikes Back. - Pierluigi Crescenzi; Giorgio Gambosi; Gaia Nicosia; Paolo Penna; Walter Unger (ICALP, 2003)

A tool to develop electronic course books based on WWW technologies, resources and usability criteria. - Pilu Crescenzi; Gaia Innocenti (ITiCSE, 2003)

C : C++ = JavaMM: Java. - Leonardo Cecchi; Pilu Crescenzi; Gaia Innocenti (PPPJ, 2003)

Search Data Structures for Skewed Strings. - Pierluigi Crescenzi; Roberto Grossi; Giuseppe F. Italiano (WEA, 2003)

Text sparsification via local maxima. - Pierluigi Crescenzi; Alberto Del Lungo; Roberto Grossi; Elena Lodi; Linda Pagli; Gianluca Rossi (Theor. Comput. Sci., 2003)

An Environment for Self-Assessing Java Programming Skills in Undergraduate First Programming Courses. - Lorenzo Bettini; Pilu Crescenzi; Gaia Innocenti; Michele Loreti; Leonardo Cecchi (ICALT, 2004)

On-line algorithms for the channel assignment problem in cellular networks. - Pilu Crescenzi; Giorgio Gambosi; Paolo Penna (Discret. Appl. Math., 2004)

Optimal covering designs: complexity results and new bounds. - Pilu Crescenzi; Federico Montecalvo; Gianluca Rossi (Discret. Appl. Math., 2004)

The minimum likely column cover problem. - Pierluigi Crescenzi; Federico Greco (Inf. Process. Lett., 2004)

Foreword - ACM MONET Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications. - Pilu Crescenzi; Bülent Yener (Mob. Networks Appl., 2004)

Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. - Pilu Crescenzi; Miriam Di Ianni; Alessandro Lazzoni; Paolo Penna; Gianluca Rossi; Paola Vocca (ADHOC-NOW, 2005)

NetPrIDE an integrated environment for developing and visualizing computer network protocols. - Pilu Crescenzi; Giorgio Gambosi; Gaia Innocenti (ITiCSE, 2005)

Assessing CS1 java skills: a three-year experience. - Pilu Crescenzi; Michele Loreti; Rosario Pugliese (ITiCSE, 2006)

On the Connectivity of Bluetooth-Based Ad Hoc Networks. - Pilu Crescenzi; Carlo Nocentini; Andrea Pietracaprina; Geppino Pucci; Carlo Sandri (Euro-Par, 2007)

Fully integrating algorithm visualization into a cs2 course.: a two-year experience. - Pilu Crescenzi; Carlo Nocentini (ITiCSE, 2007)

On-line load balancing made simple: Greedy strikes back. - Pilu Crescenzi; Giorgio Gambosi; Gaia Nicosia; Paolo Penna; Walter Unger (J. Discrete Algorithms, 2007)

MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks. - Stefano Boschi; Miriam Di Ianni; Pilu Crescenzi; Gianluca Rossi; Paola Vocca (SimuTools, 2008)

Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. - Pilu Crescenzi; Miriam Di Ianni; Federico Greco; Gianluca Rossi; Paola Vocca (WG, 2008)

Integrating test generation functionality into the Teaching Machine environment. - Michael Bruce-Lockhart; Pilu Crescenzi; Theodore S. Norvell (PVW, 2008)

Performance Evaluation of a Chord-Based JXTA Implementation. - Carlo Nocentini; Pilu Crescenzi; Leonardo Lanzi (AP2PS, 2009)

Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. - Pilu Crescenzi; Miriam Di Ianni; Andrea Marino 001; Gianluca Rossi; Paola Vocca (SIROCCO, 2009)

On the connectivity of Bluetooth-based ad hoc networks. - Pierluigi Crescenzi; Carlo Nocentini; Andrea Pietracaprina; Geppino Pucci (Concurr. Comput. Pract. Exp., 2009)

Adding Test Generation to the Teaching Machine. - Michael Bruce-Lockhart; Theodore S. Norvell; Pierluigi Crescenzi (ACM Trans. Comput. Educ., 2009)

Foreword. - Pierluigi Crescenzi; Fabrizio Luccio; Geppino Pucci (Theory Comput. Syst., 2009)

Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. - Pierluigi Crescenzi; Roberto Grossi; Claudio Imbrenda; Leonardo Lanzi; Andrea Marino 001 (ESA (1), 2010)

Using AVs to explain NP-completeness. - Pierluigi Crescenzi (ITiCSE, 2010)

Adapting moodle to better support CS education. - Guido Rößling; Myles F. McNally; Pierluigi Crescenzi; Atanas Radenski; Petri Ihantola; M. Gloria Sánchez-Torrubia (ITiCSE-WGR, 2010)

Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms. - Paulo Vieira Milreu; Vicente Acuña; Etienne Birmelé; Pierluigi Crescenzi; Alberto Marchetti-Spaccamela; Marie-France Sagot; Leen Stougie; Vincent Lacroix (WABI, 2010)

Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. - Pierluigi Crescenzi; Daniel Gildea; Andrea Marino 001; Gianluca Rossi; Giorgio Satta (ACL, 2011)

A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. - Pierluigi Crescenzi; Roberto Grossi; Leonardo Lanzi; Andrea Marino 001 (TAPAS, 2011)

On two collateral effects of using algorithm visualizations. - Pilu Crescenzi; Alessio Malizia; M. Cecilia Verri; Paloma Díaz 001; Ignacio Aedo (Br. J. Educ. Technol., 2011)

Parsimonious flooding in dynamic graphs. - Hervé Baumann; Pierluigi Crescenzi; Pierre Fraigniaud (Distributed Comput., 2011)

Smooth movement and Manhattan path based Random Waypoint mobility. - Pilu Crescenzi; Miriam Di Ianni; Andrea Marino 001; Donatella Merlini; Gianluca Rossi; Paola Vocca (Inf. Process. Lett., 2011)

Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone. - Alexandre S. Freire; Vicente Acuña; Pilu Crescenzi; Carlos Eduardo Ferreira; Vincent Lacroix; Paulo Vieira Milreu; Eduardo Moreno 001; Marie-France Sagot (ISCO, 2012)

Making turing machines accessible to blind students. - Pierluigi Crescenzi; Leonardo Rossi; Gianluca Apollaro (SIGCSE, 2012)

Efficient Bubble Enumeration in Directed Graphs. - Etienne Birmelé; Pierluigi Crescenzi; Rui A. Ferreira; Roberto Grossi; Vincent Lacroix; Andrea Marino 001; Nadia Pisanti; Gustavo Akio Tominaga Sacomoto; Marie-France Sagot (SPIRE, 2012)

Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence. - Hervé Baumann; Pierluigi Crescenzi; Pierre Fraigniaud (DISC, 2012)

On Computing the Diameter of Real-World Directed (Weighted) Graphs. - Pierluigi Crescenzi; Roberto Grossi; Leonardo Lanzi; Andrea Marino 001 (SEA, 2012)

Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course. - Pilu Crescenzi; Alessio Malizia; M. Cecilia Verri; Paloma Díaz 001; Ignacio Aedo (J. Educ. Technol. Soc., 2012)

Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. - Vicente Acuña; Etienne Birmelé; Ludovic Cottret; Pierluigi Crescenzi; Fabien Jourdan; Vincent Lacroix; Alberto Marchetti-Spaccamela; Andrea Marino 001; Paulo Vieira Milreu; Marie-France Sagot; Leen Stougie (Theor. Comput. Sci., 2012)

Rumor Spreading in Random Evolving Graphs. - Andrea Clementi; Pierluigi Crescenzi; Carola Doerr; Pierre Fraigniaud; Marco Isopi; Alessandro Panconesi; Francesco Pasquale; Riccardo Silvestri (ESA, 2013)

From theory to practice: NP-completeness for every CS student. - Pierluigi Crescenzi; Emma Enström; Viggo Kann (ITiCSE, 2013)

Requirements and design strategies for open source interactive computer science eBooks. - Ari Korhonen; Thomas L. Naps; Charles Boisvert; Pilu Crescenzi; Ville Karavirta; Linda Mannila; Bradley Miller 001; Briana B. Morrison; Susan H. Rodger; Rocky Ross; Clifford A. Shaffer (ITiCSE-WGR, 2013)

Telling Stories Fast. - Michele Borassi; Pierluigi Crescenzi; Vincent Lacroix; Andrea Marino 001; Marie-France Sagot; Paulo Vieira Milreu (SEA, 2013)

On computing the diameter of real-world undirected graphs. - Pilu Crescenzi; Roberto Grossi; Michel Habib; Leonardo Lanzi; Andrea Marino 001 (Theor. Comput. Sci., 2013)

On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. - Michele Borassi; Pierluigi Crescenzi; Michel Habib; Walter A. Kosters; Andrea Marino 001; Frank W. Takes (FUN, 2014)

Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. - Paulo Vieira Milreu; Cecilia Coimbra Klein; Ludovic Cottret; Vicente Acuña; Etienne Birmelé; Michele Borassi; Christophe Junot; Alberto Marchetti-Spaccamela; Andrea Marino 001; Leen Stougie; Fabien Jourdan; Pierluigi Crescenzi; et al. (Bioinform., 2014)

Into the Square - On the Complexity of Quadratic-Time Solvable Problems. - Michele Borassi; Pierluigi Crescenzi; Michel Habib (CoRR, 2014)

Flooding in dynamic graphs with arbitrary degree sequence. - Hervé Baumann; Pierluigi Crescenzi; Pierre Fraigniaud (J. Parallel Distributed Comput., 2014)

Blind image clustering based on the Normalized Cuts criterion for camera identification. - Irene Amerini; Roberto Caldelli; Pierluigi Crescenzi; Andrea Del Mastio; Andrea Marino 001 (Signal Process. Image Commun., 2014)

On Computing the Hyperbolicity of Real-World Graphs. - Michele Borassi; David Coudert; Pierluigi Crescenzi; Andrea Marino 001 (ESA, 2015)

Java–Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach. - Lorenzo Bettini; Pierluigi Crescenzi (ICSOFT-PT, 2015)

An Eclipse IDE for Teaching Java-. - Lorenzo Bettini; Pierluigi Crescenzi (ICSOFT (Selected Papers), 2015)

Greedily Improving Our Own Centrality in A Network. - Pierluigi Crescenzi; Gianlorenzo D'Angelo; Lorenzo Severini; Yllka Velaj (SEA, 2015)

EUCALYPT: efficient tree reconciliation enumerator. - Beatrice Donati; Christian Baudet; Blerina Sinaimeri; Pierluigi Crescenzi; Marie-France Sagot (Algorithms Mol. Biol., 2015)

MeDuSa: a multi-draft based scaffolder. - Emanuele Bosi; Beatrice Donati; Marco Galardini; Sara Brunetti; Marie-France Sagot; Pietro Liò; Pierluigi Crescenzi; Renato Fani; Marco Fondi (Bioinform., 2015)

Fast and Simple Computation of Top-k Closeness Centralities. - Michele Borassi; Pierluigi Crescenzi; Andrea Marino 001 (CoRR, 2015)

Into the Square: On the Complexity of Some Quadratic-time Solvable Problems. - Michele Borassi; Pierluigi Crescenzi; Michel Habib (ICTCS, 2015)

Preface. - Pierluigi Crescenzi; Michele Loreti (ICTCS, 2015)

Synchronous context-free grammars and optimal linear parsing strategies. - Pierluigi Crescenzi; Daniel Gildea; Andrea Marino 001; Gianluca Rossi; Giorgio Satta (J. Comput. Syst. Sci., 2015)

Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. - Michele Borassi; Pierluigi Crescenzi; Michel Habib; Walter A. Kosters; Andrea Marino 001; Frank W. Takes (Theor. Comput. Sci., 2015)

Core-periphery clustering and collaboration networks. - Pierluigi Crescenzi; Pierre Fraigniaud; Zvi Lotker; Paolo Penna (ASONAM, 2016)

Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering. - Francesco Cambi; Pierluigi Crescenzi; Linda Pagli (FUN, 2016)

On the complexity of the shortest-path broadcast problem. - Pierluigi Crescenzi; Pierre Fraigniaud; Magnús M. Halldórsson; Hovhannes A. Harutyunyan; Chiara Pierucci; Andrea Pietracaprina; Geppino Pucci (Discret. Appl. Math., 2016)

Rumor spreading in random evolving graphs. - Andrea Clementi; Pierluigi Crescenzi; Carola Doerr; Pierre Fraigniaud; Francesco Pasquale; Riccardo Silvestri (Random Struct. Algorithms, 2016)

Greedily Improving Our Own Closeness Centrality in a Network. - Pierluigi Crescenzi; Gianlorenzo D'Angelo; Lorenzo Severini; Yllka Velaj (ACM Trans. Knowl. Discov. Data, 2016)

An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. - Michele Borassi; Pierluigi Crescenzi; Luca Trevisan 001 (SODA, 2017)

Sigil3D: A Crowdsourcing Platform for Interactive 3D Content. - Andrea Barillari; Daniele Bernardini 002; Pierluigi Crescenzi (CoRR, 2017)

Computing top-k Closeness Centrality Faster in Unweighted Graphs. - Elisabetta Bergamini; Michele Borassi; Pierluigi Crescenzi; Andrea Marino 001; Henning Meyerhenke (CoRR, 2017)

An ant-colony based approach for real-time implicit collaborative information seeking. - Alessio Malizia; Kai A. Olsen; Tommaso Turchi; Pierluigi Crescenzi (Inf. Process. Manag., 2017)

Improving the Betweenness Centrality of a Node by Adding Links. - Elisabetta Bergamini; Pierluigi Crescenzi; Gianlorenzo D'Angelo; Henning Meyerhenke; Lorenzo Severini; Yllka Velaj (ACM J. Exp. Algorithmics, 2018)

Trade-Offs in Distributed Interactive Proofs. - Pierluigi Crescenzi; Pierre Fraigniaud; Ami Paz (DISC, 2019)

Approximating the Temporal Neighbourhood Function of Large Temporal Graphs. - Pierluigi Crescenzi; Clémence Magnien; Andrea Marino 001 (Algorithms, 2019)

Computing top-k Closeness Centrality Faster in Unweighted Graphs. - Elisabetta Bergamini; Michele Borassi; Pierluigi Crescenzi; Andrea Marino 001; Henning Meyerhenke (ACM Trans. Knowl. Discov. Data, 2019)

Degrees of Separation and Diameter in Large Graphs. - Pierluigi Crescenzi; Andrea Marino 001 (Encyclopedia of Big Data Technologies, 2019)

A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs. - Gabriele Goretti; Benedetta Terenzi; Elisabetta Cianfanelli; Pierluigi Crescenzi; Carlo Colombo; Enrico Civitelli (ICETC, 2020)

Simple and Fast Distributed Computation of Betweenness Centrality. - Pierluigi Crescenzi; Pierre Fraigniaud; Ami Paz (INFOCOM, 2020)

Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs. - Alessio Conte; Pierluigi Crescenzi; Andrea Marino 001; Giulia Punzi (MFCS, 2020)

Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. - Pierluigi Crescenzi; Clémence Magnien; Andrea Marino 001 (Algorithms, 2020)

Public Communication can Facilitate Low-Risk Coordination under Surveillance. - Amos Korman; Pierluigi Crescenzi (CoRR, 2021)

On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation. - Filippo Brunelli; Pierluigi Crescenzi; Laurent Viennot (CoRR, 2021)

On computing Pareto optimal paths in weighted time-dependent networks. - Filippo Brunelli; Pierluigi Crescenzi; Laurent Viennot (Inf. Process. Lett., 2021)

Planning with Biological Neurons and Synapses. - Francesco D'Amore 001; Daniel Mitropolsky; Pierluigi Crescenzi; Emanuele Natale; Christos H. Papadimitriou (AAAI, 2022)

CONCUR through time. - Luca Aceto; Pierluigi Crescenzi (Bull. EATCS, 2022)

On Computing the Diameter of (Weighted) Link Streams. - Marco Calamai; Pierluigi Crescenzi; Andrea Marino 001 (ACM J. Exp. Algorithmics, 2022)

Giant Components in Random Temporal Graphs. - Ruben Becker; Arnaud Casteigts; Pierluigi Crescenzi; Bojana Kodric; Malte Renken; Michael Raskin; Viktor Zamaraev (APPROX/RANDOM, 2023)

Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal Evolution. - Pierluigi Crescenzi (SIROCCO, 2023)

Proxying Betweenness Centrality Rankings in Temporal Networks. - Ruben Becker; Pierluigi Crescenzi; Antonio Cruciani; Bojana Kodric (SEA, 2023)

A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs. - Alkida Balliu; Filippo Brunelli; Pierluigi Crescenzi; Dennis Olivetti; Laurent Viennot (CoRR, 2023)

The Way We Were: Structural Operational Semantics Research in Perspective. - Luca Aceto; Pierluigi Crescenzi; Anna Ingólfsdóttir; Mohammad Reza Mousavi 001 (EXPRESS/SOS, 2023)

Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks. - Filippo Brunelli; Pierluigi Crescenzi; Laurent Viennot (Networks, 2023)

Exploring Large Language Models Capabilities to Explain Decision Trees. - Paulo Bruno S. Serafim; Pierluigi Crescenzi; Gizem Gezici; Eleonora Cappuccio; Salvatore Rinzivillo; Fosca Giannotti (HHAI, 2024)

Making Temporal Betweenness Computation Faster and Restless. - Filippo Brunelli; Pierluigi Crescenzi; Laurent Viennot (KDD, 2024)

WorldDynamics.jl: A Julia Package for Developing and Simulating Integrated Assessment Models. - Pierluigi Crescenzi; Emanuele Natale; Aurora Rossi; Paulo Bruno S. Serafim (J. Open Source Softw., 2024)

Making the interval membership width of temporal graphs connected and bidirectional. - Filippos Christodoulou; Pierluigi Crescenzi; Andrea Marino 001; Ana Silva 001; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2026)