Pierluigi Crescenzi

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 44

Top Venues

CoRR

SEA

ACM Trans. Knowl. Discov. Data

Algorithms

Publications

Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
Making Temporal Betweenness Computation Faster and Restless. KDD (2024)
Pierluigi Crescenzi, Emanuele Natale, Aurora Rossi, Paulo Bruno S. Serafim
WorldDynamics.jl: A Julia Package for Developing and Simulating Integrated Assessment Models. J. Open Source Softw. 9 (96) (2024)
Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. IWOCA (2024)
Paulo Bruno S. Serafim, Pierluigi Crescenzi, Gizem Gezici, Eleonora Cappuccio, Salvatore Rinzivillo, Fosca Giannotti
Exploring Large Language Models Capabilities to Explain Decision Trees. HHAI (2024)
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks. Networks 81 (2) (2023)
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev
Giant Components in Random Temporal Graphs. APPROX/RANDOM (2023)
Pierluigi Crescenzi
Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal Evolution. SIROCCO (2023)
Luca Aceto, Pierluigi Crescenzi, Anna Ingólfsdóttir, Mohammad Reza Mousavi
The Way We Were: Structural Operational Semantics Research in Perspective. EXPRESS/SOS (2023)
Alkida Balliu, Filippo Brunelli, Pierluigi Crescenzi, Dennis Olivetti, Laurent Viennot
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs. CoRR (2023)
Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, Bojana Kodric
Proxying Betweenness Centrality Rankings in Temporal Networks. SEA (2023)
Marco Calamai, Pierluigi Crescenzi, Andrea Marino
On Computing the Diameter of (Weighted) Link Streams. ACM J. Exp. Algorithmics 27 (2022)
Luca Aceto, Pierluigi Crescenzi
CONCUR through time. Bull. EATCS 138 (2022)
Francesco D'Amore, Daniel Mitropolsky, Pierluigi Crescenzi, Emanuele Natale, Christos H. Papadimitriou
Planning with Biological Neurons and Synapses. AAAI (2022)
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev
Giant Components in Random Temporal Graphs. CoRR (2022)
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation. CoRR (2021)
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks. CoRR (2021)
Amos Korman, Pierluigi Crescenzi
Public Communication can Facilitate Low-Risk Coordination under Surveillance. CoRR (2021)
Marco Calamai, Pierluigi Crescenzi, Andrea Marino
On Computing the Diameter of (Weighted) Link Streams. SEA (2021)
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
On computing Pareto optimal paths in weighted time-dependent networks. Inf. Process. Lett. 168 (2021)
Francesco D'Amore, Daniel Mitropolsky, Pierluigi Crescenzi, Emanuele Natale, Christos H. Papadimitriou
Planning with Biological Neurons and Synapses. CoRR (2021)
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Simple and Fast Distributed Computation of Betweenness Centrality. CoRR (2020)
Gabriele Goretti, Benedetta Terenzi, Elisabetta Cianfanelli, Pierluigi Crescenzi, Carlo Colombo, Enrico Civitelli
A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs. ICETC (2020)
Alessio Conte, Pierluigi Crescenzi, Andrea Marino, Giulia Punzi
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs. MFCS (2020)
Pierluigi Crescenzi, Clémence Magnien, Andrea Marino
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. Algorithms 13 (9) (2020)
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Simple and Fast Distributed Computation of Betweenness Centrality. INFOCOM (2020)
Pierluigi Crescenzi, Clémence Magnien, Andrea Marino
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs. Algorithms 12 (10) (2019)
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Trade-offs in Distributed Interactive Proofs. CoRR (2019)
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Trade-Offs in Distributed Interactive Proofs. DISC (2019)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Closeness Centrality Faster in Unweighted Graphs. ACM Trans. Knowl. Discov. Data 13 (5) (2019)
Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj
Improving the Betweenness Centrality of a Node by Adding Links. ACM J. Exp. Algorithmics 23 (2018)
Alessio Malizia, Kai A. Olsen, Tommaso Turchi, Pierluigi Crescenzi
An ant-colony based approach for real-time implicit collaborative information seeking. Inf. Process. Manag. 53 (3) (2017)
Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj
Improving the betweenness centrality of a node by adding links. CoRR (2017)
Michele Borassi, Pierluigi Crescenzi, Luca Trevisan
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. SODA (2017)
Andrea Barillari, Daniele Bernardini, Pierluigi Crescenzi
Sigil3D: A Crowdsourcing Platform for Interactive 3D Content. CoRR (2017)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Computing top-k Closeness Centrality Faster in Unweighted Graphs. CoRR (2017)
Pierluigi Crescenzi, Michele Loreti
Preface. Electron. Notes Theor. Comput. Sci. 322 (2016)
Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
Greedily Improving Our Own Closeness Centrality in a Network. ACM Trans. Knowl. Discov. Data 11 (1) (2016)
Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri
Rumor spreading in random evolving graphs. Random Struct. Algorithms 48 (2) (2016)
Michele Borassi, Pierluigi Crescenzi, Michel Habib
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems. Electron. Notes Theor. Comput. Sci. 322 (2016)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Closeness Centrality Faster in Unweighted Graphs. ALENEX (2016)
Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci
On the complexity of the shortest-path broadcast problem. Discret. Appl. Math. 199 (2016)
Pierluigi Crescenzi, Pierre Fraigniaud, Zvi Lotker, Paolo Penna
Core-periphery clustering and collaboration networks. ASONAM (2016)
Francesco Cambi, Pierluigi Crescenzi, Linda Pagli
Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering. FUN (2016)
Michele Borassi, Pierluigi Crescenzi, Luca Trevisan
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. CoRR (2016)
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
Synchronous context-free grammars and optimal linear parsing strategies. J. Comput. Syst. Sci. 81 (7) (2015)
Lorenzo Bettini, Pierluigi Crescenzi
Java--Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach. ICSOFT-PT (2015)
Michele Borassi, Pierluigi Crescenzi, Andrea Marino
Fast and Simple Computation of Top-k Closeness Centralities. CoRR (2015)
Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino
On Computing the Hyperbolicity of Real-World Graphs. ESA (2015)
Lorenzo Bettini, Pierluigi Crescenzi
An Eclipse IDE for Teaching Java-. ICSOFT (Selected Papers) (2015)
Beatrice Donati, Christian Baudet, Blerina Sinaimeri, Pierluigi Crescenzi, Marie-France Sagot
EUCALYPT: efficient tree reconciliation enumerator. Algorithms Mol. Biol. 10 (2015)
Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
Greedily Improving Our Own Centrality in A Network. SEA (2015)
Emanuele Bosi, Beatrice Donati, Marco Galardini, Sara Brunetti, Marie-France Sagot, Pietro Liò, Pierluigi Crescenzi, Renato Fani, Marco Fondi
MeDuSa: a multi-draft based scaffolder. Bioinform. 31 (15) (2015)
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
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. 586 (2015)
Irene Amerini, Roberto Caldelli, Pierluigi Crescenzi, Andrea Del Mastio, Andrea Marino
Blind image clustering based on the Normalized Cuts criterion for camera identification. Signal Process. Image Commun. 29 (8) (2014)
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. FUN (2014)
Michele Borassi, Pierluigi Crescenzi, Michel Habib
Into the Square - On the Complexity of Quadratic-Time Solvable Problems. CoRR (2014)
Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud
Flooding in dynamic graphs with arbitrary degree sequence. J. Parallel Distributed Comput. 74 (5) (2014)
Paulo Vieira Milreu, Cecilia Coimbra Klein, Ludovic Cottret, Vicente Acuña, Etienne Birmelé, Michele Borassi, Christophe Junot, Alberto Marchetti-Spaccamela, Andrea Marino, Leen Stougie, Fabien Jourdan, Pierluigi Crescenzi, Vincent Lacroix, Marie-France Sagot
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. Bioinform. 30 (1) (2014)
Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri
Rumor Spreading in Random Evolving Graphs. ESA (2013)
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies. CoRR (2013)
Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu
Telling Stories Fast. SEA (2013)
Pierluigi Crescenzi, Emma Enström, Viggo Kann
From theory to practice: NP-completeness for every CS student. ITiCSE (2013)
Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri
Rumor Spreading in Random Evolving Graphs CoRR (2013)
Vicente Acuña, Etienne Birmelé, Ludovic Cottret, Pierluigi Crescenzi, Fabien Jourdan, Vincent Lacroix, Alberto Marchetti-Spaccamela, Andrea Marino, Paulo Vieira Milreu, Marie-France Sagot, Leen Stougie
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. Theor. Comput. Sci. 457 (2012)
Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot
Efficient Bubble Enumeration in Directed Graphs. SPIRE (2012)
Pierluigi Crescenzi, Leonardo Rossi, Gianluca Apollaro
Making turing machines accessible to blind students. SIGCSE (2012)
Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud
Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence. DISC (2012)
Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino
On Computing the Diameter of Real-World Directed (Weighted) Graphs. SEA (2012)
Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. TAPAS (2011)
Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud
Parsimonious flooding in dynamic graphs. Distributed Comput. 24 (1) (2011)
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. ACL (2011)
Paulo Vieira Milreu, Vicente Acuña, Etienne Birmelé, Pierluigi Crescenzi, Alberto Marchetti-Spaccamela, Marie-France Sagot, Leen Stougie, Vincent Lacroix
Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms. WABI (2010)
Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. ESA (1) (2010)
Pierluigi Crescenzi
Using AVs to explain NP-completeness. ITiCSE (2010)
Guido Rößling, Myles F. McNally, Pierluigi Crescenzi, Atanas Radenski, Petri Ihantola, M. Gloria Sánchez-Torrubia
Adapting moodle to better support CS education. ITiCSE-WGR (2010)
Pierluigi Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci
networks. Concurr. Comput. Pract. Exp. 21 (7) (2009)
Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud
Parsimonious flooding in dynamic graphs. PODC (2009)
Pierluigi Crescenzi, Fabrizio Luccio, Geppino Pucci
Foreword. Theory Comput. Syst. 44 (2) (2009)
Michael Bruce-Lockhart, Theodore S. Norvell, Pierluigi Crescenzi
Adding Test Generation to the Teaching Machine. ACM Trans. Comput. Educ. 9 (2) (2009)
Pierluigi Crescenzi, Federico Greco
The minimum likely column cover problem. Inf. Process. Lett. 89 (4) (2004)
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
Text sparsification via local maxima. Theor. Comput. Sci. 304 (1-3) (2003)
Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano
Search Data Structures for Skewed Strings. WEA (2003)
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
Online Load Balancing Made Simple: Greedy Strikes Back. ICALP (2003)
Pierluigi Crescenzi, Gaia Innocenti
Development of an ECB on Computer Networks Based on WWW Technologies, Resources and Usability Criteria. ICCE (2002)
Pierluigi Crescenzi, Gianluca Rossi
On the Hamming distance of constraint satisfaction problems. Theor. Comput. Sci. 288 (1) (2002)
Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri
A note on the spatiality degree of graphs. Ars Comb. 63 (2002)
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. STACS (2001)
Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri
On Computing Ad-hoc Selective Families. RANDOM-APPROX (2001)
Pierluigi Crescenzi, Xiaotie Deng, Christos H. Papadimitriou
On Approximating a Scheduling Problem. J. Comb. Optim. 5 (3) (2001)
Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan
On Weighted vs Unweighted Versions of Combinatorial Optimization Problems. Inf. Comput. 167 (1) (2001)
Pierluigi Crescenzi, Gaia Innocenti
Towards a Taxonomy of Network Protocol Visualization Tools. Software Visualization (2001)
Pierluigi Crescenzi, Giorgio Gambosi, Paolo Penna
On-line algorithms for the channel assignment problem in cellular networks. DIAL-M (2000)
Pierluigi Crescenzi, Luca Trevisan
On Approximation Scheme Preserving Reducibility and Its Applications. Theory Comput. Syst. 33 (1) (2000)
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
Text Sparsification via Local Maxima. FSTTCS (2000)
Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi
Reversible Execution and Visualization of Programs with LEONARDO. J. Vis. Lang. Comput. 11 (2) (2000)
Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi
On the Complexity of Approximating Colored-Graph Problems. COCOON (1999)
Pierluigi Crescenzi, Luca Trevisan
Max NP-completeness Made Easy. Theor. Comput. Sci. 225 (1-2) (1999)
Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
Structure in Approximation Classes. SIAM J. Comput. 28 (5) (1999)
Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi
IP Address Lookup Made Fast and Simple. ESA (1999)
Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno
Linear area upward drawings of AVL trees. Comput. Geom. 9 (1-2) (1998)

Pierluigi Crescenzi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pierluigi Crescenzi