default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierluigi Crescenzi
Pilu Crescenzi
Person information
- affiliation: Gran Sasso Science Institute, L'Aquila, Italy
- affiliation (former): University of Florence, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i19]Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
Making Temporal Betweenness Computation Faster and Restless. CoRR abs/2501.12708 (2025)- 2024
- [j64]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): 5772 (2024) - [c80]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: 64-72 - [c79]Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos:
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. IWOCA 2024: 247-258 - [c78]Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
Making Temporal Betweenness Computation Faster and Restless. KDD 2024: 163-174 - 2023
- [j63]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): 177-203 (2023) - [c77]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev:
Giant Components in Random Temporal Graphs. APPROX/RANDOM 2023: 29:1-29:17 - [c76]Pierluigi Crescenzi:
Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal Evolution. SIROCCO 2023: 18-32 - [c75]Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, Bojana Kodric:
Proxying Betweenness Centrality Rankings in Temporal Networks. SEA 2023: 6:1-6:22 - [c74]Luca Aceto, Pierluigi Crescenzi, Anna Ingólfsdóttir, Mohammad Reza Mousavi:
The Way We Were: Structural Operational Semantics Research in Perspective. EXPRESS/SOS 2023: 26-40 - [i18]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 abs/2304.00817 (2023) - 2022
- [j62]Luca Aceto, Pierluigi Crescenzi:
CONCUR through time. Bull. EATCS 138 (2022) - [j61]Marco Calamai, Pierluigi Crescenzi, Andrea Marino:
On Computing the Diameter of (Weighted) Link Streams. ACM J. Exp. Algorithmics 27: 4.3:1-4.3:28 (2022) - [c73]Francesco D'Amore, Daniel Mitropolsky, Pierluigi Crescenzi, Emanuele Natale, Christos H. Papadimitriou:
Planning with Biological Neurons and Synapses. AAAI 2022: 21-28 - [i17]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev:
Giant Components in Random Temporal Graphs. CoRR abs/2205.14888 (2022) - 2021
- [j60]Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
On computing Pareto optimal paths in weighted time-dependent networks. Inf. Process. Lett. 168: 106086 (2021) - [c72]Marco Calamai, Pierluigi Crescenzi, Andrea Marino:
On Computing the Diameter of (Weighted) Link Streams. SEA 2021: 11:1-11:21 - [i16]Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks. CoRR abs/2101.02086 (2021) - [i15]Amos Korman, Pierluigi Crescenzi:
Public Communication can Facilitate Low-Risk Coordination under Surveillance. CoRR abs/2105.02093 (2021) - [i14]Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation. CoRR abs/2111.08328 (2021) - [i13]Francesco D'Amore, Daniel Mitropolsky, Pierluigi Crescenzi, Emanuele Natale, Christos H. Papadimitriou:
Planning with Biological Neurons and Synapses. CoRR abs/2112.08186 (2021) - 2020
- [j59]Pierluigi Crescenzi, Clémence Magnien, Andrea Marino:
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. Algorithms 13(9): 211 (2020) - [c71]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: 223-229 - [c70]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Simple and Fast Distributed Computation of Betweenness Centrality. INFOCOM 2020: 337-346 - [c69]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: 25:1-25:14 - [i12]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Simple and Fast Distributed Computation of Betweenness Centrality. CoRR abs/2001.08108 (2020)
2010 – 2019
- 2019
- [j58]Pierluigi Crescenzi, Clémence Magnien, Andrea Marino:
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs. Algorithms 12(10): 211 (2019) - [j57]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing top-k Closeness Centrality Faster in Unweighted Graphs. ACM Trans. Knowl. Discov. Data 13(5): 53:1-53:40 (2019) - [c68]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Trade-Offs in Distributed Interactive Proofs. DISC 2019: 13:1-13:17 - [r1]Pierluigi Crescenzi, Andrea Marino:
Degrees of Separation and Diameter in Large Graphs. Encyclopedia of Big Data Technologies 2019 - [i11]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Trade-offs in Distributed Interactive Proofs. CoRR abs/1908.03363 (2019) - 2018
- [j56]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) - 2017
- [j55]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): 608-623 (2017) - [c67]Michele Borassi, Pierluigi Crescenzi, Luca Trevisan:
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. SODA 2017: 920-939 - [i10]Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj:
Improving the betweenness centrality of a node by adding links. CoRR abs/1702.05284 (2017) - [i9]Andrea Barillari, Daniele Bernardini, Pierluigi Crescenzi:
Sigil3D: A Crowdsourcing Platform for Interactive 3D Content. CoRR abs/1703.02968 (2017) - [i8]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing top-k Closeness Centrality Faster in Unweighted Graphs. CoRR abs/1704.01077 (2017) - 2016
- [j54]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: 101-109 (2016) - [j53]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri:
Rumor spreading in random evolving graphs. Random Struct. Algorithms 48(2): 290-312 (2016) - [j52]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): 9:1-9:32 (2016) - [c66]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing Top-k Closeness Centrality Faster in Unweighted Graphs. ALENEX 2016: 68-80 - [c65]Pierluigi Crescenzi, Pierre Fraigniaud, Zvi Lotker, Paolo Penna:
Core-periphery clustering and collaboration networks. ASONAM 2016: 525-528 - [c64]Francesco Cambi, Pierluigi Crescenzi, Linda Pagli:
Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering. FUN 2016: 9:1-9:14 - [e3]Pierluigi Crescenzi, Michele Loreti:
Proceedings of the 16th Italian Conference on Theoretical Computer Science, ICTCS 2015, Firenze, Italy, September 9-11, 2015. Electronic Notes in Theoretical Computer Science 322, Elsevier 2016 [contents] - [i7]Michele Borassi, Pierluigi Crescenzi, Luca Trevisan:
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. CoRR abs/1604.01445 (2016) - 2015
- [j51]Beatrice Donati, Christian Baudet, Blerina Sinaimeri, Pierluigi Crescenzi, Marie-France Sagot:
EUCALYPT: efficient tree reconciliation enumerator. Algorithms Mol. Biol. 10: 3 (2015) - [j50]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): 2443-2451 (2015) - [j49]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): 1333-1356 (2015) - [j48]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: 59-80 (2015) - [c63]Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino:
On Computing the Hyperbolicity of Real-World Graphs. ESA 2015: 215-226 - [c62]Lorenzo Bettini, Pierluigi Crescenzi:
Java--Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach. ICSOFT-PT 2015: 31-42 - [c61]Lorenzo Bettini, Pierluigi Crescenzi:
An Eclipse IDE for Teaching Java-. ICSOFT (Selected Papers) 2015: 63-78 - [c60]Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Greedily Improving Our Own Centrality in A Network. SEA 2015: 43-55 - [c59]Pierluigi Crescenzi, Michele Loreti:
Preface. ICTCS 2015: 1-2 - [c58]Michele Borassi, Pierluigi Crescenzi, Michel Habib:
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems. ICTCS 2015: 51-67 - [i6]Michele Borassi, Pierluigi Crescenzi, Andrea Marino:
Fast and Simple Computation of Top-k Closeness Centralities. CoRR abs/1507.01490 (2015) - 2014
- [j47]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): 61-70 (2014) - [j46]Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Flooding in dynamic graphs with arbitrary degree sequence. J. Parallel Distributed Comput. 74(5): 2433-2437 (2014) - [j45]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): 831-843 (2014) - [c57]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: 52-63 - [i5]Michele Borassi, Pierluigi Crescenzi, Michel Habib:
Into the Square - On the Complexity of Quadratic-Time Solvable Problems. CoRR abs/1407.4972 (2014) - 2013
- [j44]Pilu Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi, Andrea Marino:
On computing the diameter of real-world undirected graphs. Theor. Comput. Sci. 514: 84-95 (2013) - [c56]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. ESA 2013: 325-336 - [c55]Pierluigi Crescenzi, Emma Enström, Viggo Kann:
From theory to practice: NP-completeness for every CS student. ITiCSE 2013: 16-21 - [c54]Ari Korhonen, Thomas L. Naps, Charles Boisvert, Pilu Crescenzi, Ville Karavirta, Linda Mannila, Bradley Miller, Briana B. Morrison, Susan H. Rodger, Rocky Ross, Clifford A. Shaffer:
Requirements and design strategies for open source interactive computer science eBooks. ITiCSE-WGR 2013: 53-72 - [c53]Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu:
Telling Stories Fast. SEA 2013: 200-211 - [i4]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. CoRR abs/1302.3828 (2013) - [i3]Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta:
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies. CoRR abs/1311.6421 (2013) - 2012
- [j43]Pilu Crescenzi, Alessio Malizia, M. Cecilia Verri, Paloma Díaz, Ignacio Aedo:
Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course. J. Educ. Technol. Soc. 15(2): 115-124 (2012) - [j42]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: 1-9 (2012) - [c52]Alexandre S. Freire, Vicente Acuña, Pilu Crescenzi, Carlos Eduardo Ferreira, Vincent Lacroix, Paulo Vieira Milreu, Eduardo Moreno, Marie-France Sagot:
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone. ISCO 2012: 165-177 - [c51]Pierluigi Crescenzi, Leonardo Rossi, Gianluca Apollaro:
Making turing machines accessible to blind students. SIGCSE 2012: 167-172 - [c50]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: 118-129 - [c49]Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence. DISC 2012: 417-418 - [c48]Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino:
On Computing the Diameter of Real-World Directed (Weighted) Graphs. SEA 2012: 99-110 - 2011
- [j41]Pilu Crescenzi, Alessio Malizia, M. Cecilia Verri, Paloma Díaz, Ignacio Aedo:
On two collateral effects of using algorithm visualizations. Br. J. Educ. Technol. 42(6): 145- (2011) - [j40]Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Parsimonious flooding in dynamic graphs. Distributed Comput. 24(1): 31-44 (2011) - [j39]Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Donatella Merlini, Gianluca Rossi, Paola Vocca:
Smooth movement and Manhattan path based Random Waypoint mobility. Inf. Process. Lett. 111(5): 239-246 (2011) - [c47]Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta:
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. ACL 2011: 450-459 - [c46]Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino:
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. TAPAS 2011: 92-103 - 2010
- [c45]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: 302-313 - [c44]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: 15-27 - [c43]Pierluigi Crescenzi:
Using AVs to explain NP-completeness. ITiCSE 2010: 299 - [c42]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: 226-237
2000 – 2009
- 2009
- [j38]Pierluigi Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci:
On the connectivity of Bluetooth-based ad hoc networks. Concurr. Comput. Pract. Exp. 21(7): 875-887 (2009) - [j37]Michael Bruce-Lockhart, Theodore S. Norvell, Pierluigi Crescenzi:
Adding Test Generation to the Teaching Machine. ACM Trans. Comput. Educ. 9(2): 12:1-12:14 (2009) - [j36]Pierluigi Crescenzi, Fabrizio Luccio, Geppino Pucci:
Foreword. Theory Comput. Syst. 44(2): 141-142 (2009) - [c41]Carlo Nocentini, Pilu Crescenzi, Leonardo Lanzi:
Performance Evaluation of a Chord-Based JXTA Implementation. AP2PS 2009: 7-12 - [c40]Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Parsimonious flooding in dynamic graphs. PODC 2009: 260-269 - [c39]Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Gianluca Rossi, Paola Vocca:
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. SIROCCO 2009: 154-166 - 2008
- [c38]Stefano Boschi, Miriam Di Ianni, Pilu Crescenzi, Gianluca Rossi, Paola Vocca:
MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks. SimuTools 2008: 38 - [c37]Pilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca:
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. WG 2008: 90-100 - [c36]Michael Bruce-Lockhart, Pilu Crescenzi, Theodore S. Norvell:
Integrating test generation functionality into the Teaching Machine environment. PVW 2008: 115-124 - 2007
- [j35]Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger:
On-line load balancing made simple: Greedy strikes back. J. Discrete Algorithms 5(1): 162-175 (2007) - [c35]Pilu Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci, Carlo Sandri:
On the Connectivity of Bluetooth-Based Ad Hoc Networks. Euro-Par 2007: 960-969 - [c34]Pilu Crescenzi, Carlo Nocentini:
Fully integrating algorithm visualization into a cs2 course.: a two-year experience. ITiCSE 2007: 296-300 - [e2]Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci:
Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings. Lecture Notes in Computer Science 4475, Springer 2007, ISBN 978-3-540-72913-6 [contents] - 2006
- [c33]Pilu Crescenzi, Michele Loreti, Rosario Pugliese:
Assessing CS1 java skills: a three-year experience. ITiCSE 2006: 348 - 2005
- [c32]Pilu Crescenzi, Miriam Di Ianni, Alessandro Lazzoni, Paolo Penna, Gianluca Rossi, Paola Vocca:
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. ADHOC-NOW 2005: 4-17 - [c31]Pilu Crescenzi, Giorgio Gambosi, Gaia Innocenti:
NetPrIDE an integrated environment for developing and visualizing computer network protocols. ITiCSE 2005: 306-310 - 2004
- [j34]Pilu Crescenzi, Giorgio Gambosi, Paolo Penna:
On-line algorithms for the channel assignment problem in cellular networks. Discret. Appl. Math. 137(3): 237-266 (2004) - [j33]Pilu Crescenzi, Federico Montecalvo, Gianluca Rossi:
Optimal covering designs: complexity results and new bounds. Discret. Appl. Math. 144(3): 281-290 (2004) - [j32]Pierluigi Crescenzi, Federico Greco:
The minimum likely column cover problem. Inf. Process. Lett. 89(4): 175-179 (2004) - [j31]Pilu Crescenzi, Bülent Yener:
Foreword - ACM MONET Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications. Mob. Networks Appl. 9(2): 99 (2004) - [c30]Lorenzo Bettini, Pilu Crescenzi, Gaia Innocenti, Michele Loreti, Leonardo Cecchi:
An Environment for Self-Assessing Java Programming Skills in Undergraduate First Programming Courses. ICALT 2004 - 2003
- [j30]Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi:
Text sparsification via local maxima. Theor. Comput. Sci. 304(1-3): 341-364 (2003) - [c29]Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger:
Online Load Balancing Made Simple: Greedy Strikes Back. ICALP 2003: 1108-1122 - [c28]Pilu Crescenzi, Gaia Innocenti:
A tool to develop electronic course books based on WWW technologies, resources and usability criteria. ITiCSE 2003: 163-167 - [c27]Leonardo Cecchi, Pilu Crescenzi, Gaia Innocenti:
C : C++ = JavaMM: Java. PPPJ 2003: 75-78 - [c26]Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano:
Search Data Structures for Skewed Strings. WEA 2003: 81-96 - 2002
- [j29]Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri:
A note on the spatiality degree of graphs. Ars Comb. 63 (2002) - [j28]Pierluigi Crescenzi, Gianluca Rossi:
On the Hamming distance of constraint satisfaction problems. Theor. Comput. Sci. 288(1): 85-100 (2002) - [c25]Pierluigi Crescenzi, Gaia Innocenti:
Development of an ECB on Computer Networks Based on WWW Technologies, Resources and Usability Criteria. ICCE 2002: 1198-1202 - 2001
- [j27]Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan:
On Weighted vs Unweighted Versions of Combinatorial Optimization Problems. Inf. Comput. 167(1): 10-26 (2001) - [j26]Pierluigi Crescenzi, Xiaotie Deng, Christos H. Papadimitriou:
On Approximating a Scheduling Problem. J. Comb. Optim. 5(3): 287-297 (2001) - [c24]Pierluigi Crescenzi, Gaia Innocenti:
Towards a Taxonomy of Network Protocol Visualization Tools. Software Visualization 2001: 241-255 - [c23]Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri:
On Computing Ad-hoc Selective Families. RANDOM-APPROX 2001: 211-222 - [c22]Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca:
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. STACS 2001: 121-131 - 2000
- [j25]Pierluigi Crescenzi, Luca Trevisan:
On Approximation Scheme Preserving Reducibility and Its Applications. Theory Comput. Syst. 33(1): 1-16 (2000) - [j24]Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi:
Reversible Execution and Visualization of Programs with LEONARDO. J. Vis. Lang. Comput. 11(2): 125-150 (2000) - [c21]Pierluigi Crescenzi, Giorgio Gambosi, Paolo Penna:
On-line algorithms for the channel assignment problem in cellular networks. DIAL-M 2000: 1-7 - [c20]Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi:
Text Sparsification via Local Maxima. FSTTCS 2000: 290-301
1990 – 1999
- 1999
- [b2]Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, Viggo Kann:
Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer 1999, ISBN 3540654313, pp. I-XIX, 1-524 - [j23]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes. SIAM J. Comput. 28(5): 1759-1782 (1999) - [j22]Pierluigi Crescenzi, Luca Trevisan:
Max NP-completeness Made Easy. Theor. Comput. Sci. 225(1-2): 65-79 (1999) - [c19]Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi:
On the Complexity of Approximating Colored-Graph Problems. COCOON 1999: 281-290 - [c18]Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi:
IP Address Lookup Made Fast and Simple. ESA 1999: 65-76 - 1998
- [j21]Pierluigi Crescenzi, Riccardo Silvestri:
Sperner's Lemma and Robust Machines. Comput. Complex. 7(2): 163-173 (1998) - [j20]Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno:
Linear area upward drawings of AVL trees. Comput. Geom. 9(1-2): 25-42 (1998) - [j19]Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis:
On the Complexity of Protein Folding. J. Comput. Biol. 5(3): 423-465 (1998) - [j18]Pierluigi Crescenzi, Viggo Kann:
How to find the best approximation results. SIGACT News 29(4): 90-97 (1998) - [j17]Pierluigi Crescenzi, Paolo Penna:
Strictly-upward Drawings of Ordered Search Trees. Theor. Comput. Sci. 203(1): 51-67 (1998) - [j16]Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim:
The Parallel Complexity of Approximating the High Degree Subgraph Problem. Theor. Comput. Sci. 205(1-2): 261-282 (1998) - [c17]Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis:
On the complexity of protein folding (abstract). RECOMB 1998: 61-62 - [c16]Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis:
On the Complexity of Protein Folding (Extended Abstract). STOC 1998: 597-603 - 1997
- [c15]Pierluigi Crescenzi:
A Short Guide to Approximation Preserving Reductions. CCC 1997: 262-273 - [c14]Pierluigi Crescenzi, Paolo Penna:
Minimum-Area h-v Drawings of Complete Binary Trees. GD 1997: 371-382 - [c13]Pierluigi Crescenzi, Viggo Kann:
Approximation on the Web: A Compendium of NP Optimization Problems. RANDOM 1997: 111-118 - [c12]Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi:
LEONARDO: a software visualization system. WAE 1997: 146-155 - [i2]Pierluigi Crescenzi, Luca Trevisan:
MAX NP-Completeness Made Easy. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j15]Pierluigi Crescenzi, Luca Trevisan:
On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem. RAIRO Theor. Informatics Appl. 30(5): 431-441 (1996) - [c11]Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan:
To Weight or Not to Weight: Where is the Question? ISTCS 1996: 68-77 - [c10]Daniel P. Bovet, Andrea Clementi, Pierluigi Crescenzi, Riccardo Silvestri:
Parallel approximation of optimization problems. Solving Combinatorial Optimization Problems in Parallel 1996: 7-24 - [c9]Pierluigi Crescenzi, Paolo Penna:
Upward Drawings of Search Trees (Extended Abstract). WG 1996: 114-125 - [i1]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j14]Gian Carlo Bongiovanni, Pierluigi Crescenzi, Concettina Guerra:
Parallel Simulated Annealing for Shape Detection. Comput. Vis. Image Underst. 61(1): 60-69 (1995) - [j13]Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri:
Complexity Classes and Sparse Oracles. J. Comput. Syst. Sci. 50(3): 382-390 (1995) - [j12]Gian Carlo Bongiovanni, Pierluigi Crescenzi, Sergio De Agostino:
Max Sat and Min Set Cover Approximation Algorithms are P-Complete. Parallel Process. Lett. 5: 293-298 (1995) - [j11]Pierluigi Crescenzi, Christos H. Papadimitriou:
Reversible Simulation of Space-Bounded Computations. Theor. Comput. Sci. 143(1): 159-165 (1995) - [j10]Giorgio Ausiello, Pierluigi Crescenzi, Marco Protasi:
Approximate Solution of NP Optimization Problems. Theor. Comput. Sci. 150(1): 1-55 (1995) - [c8]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes (Extended Abstract). COCOON 1995: 539-548 - [c7]Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim:
The Parallel Complexity of Approximating the High Degree Subgraph Problem. ISAAC 1995: 132-141 - 1994
- [b1]Daniel P. Bovet, Pierluigi Crescenzi:
Introduction to the theory of complexity. Prentice Hall international series in computer science, Prentice Hall 1994, ISBN 978-0-13-915380-8, pp. I-XI, 1-282 - [c6]Pierluigi Crescenzi, Luca Trevisan:
On Approximation Scheme Preserving Reducability and Its Applications. FSTTCS 1994: 330-341 - [c5]Pierluigi Crescenzi, Adolfo Piperno:
Optimal-Area Upward Drawings of AVL Trees. GD 1994: 307-317 - [c4]Pierluigi Crescenzi, Luca Trevisan:
Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract). WG 1994: 130-139 - [e1]Maurizio A. Bonuccelli, Pierluigi Crescenzi, Rossella Petreschi:
Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings. Lecture Notes in Computer Science 778, Springer 1994, ISBN 3-540-57811-0 [contents] - 1993
- [j9]Pierluigi Crescenzi, Riccardo Silvestri:
Average Measure, Descriptive Complexity and Approximation of Maximization Problems. Int. J. Found. Comput. Sci. 4(1): 15-30 (1993) - [j8]Pierluigi Crescenzi, Riccardo Silvestri:
A Note on the Descriptive Complexity of Maximization. Inf. Process. Lett. 47(1): 11-15 (1993) - [c3]Pierluigi Crescenzi, Riccardo Silvestri:
Sperner's Lemma and Robust Machines. SCT 1993: 194-199 - 1992
- [j7]Pierluigi Crescenzi, Giuseppe Di Battista, Adolfo Piperno:
A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. Comput. Geom. 2: 187-200 (1992) - [j6]Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri:
A Uniform Approach to Define Complexity Classes. Theor. Comput. Sci. 104(2): 263-283 (1992) - 1991
- [j5]Daniel P. Bovet, Pierluigi Crescenzi:
Minimum-Delay Schedules in Layered Networks. Acta Informatica 28(5): 453-461 (1991) - [j4]Pierluigi Crescenzi, Alessandro Panconesi:
Completeness in Approximation Classes. Inf. Comput. 93(2): 241-262 (1991) - [j3]Pierluigi Crescenzi, C. Fiorini, Riccardo Silvestri:
A Note on the Approximation of the MAX CLIQUE Problem. Inf. Process. Lett. 40(1): 1-5 (1991) - [c2]Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri:
Complexity Classes and Sparse Oracles. SCT 1991: 102-108 - 1990
- [j2]Daniel P. Bovet, Miriam Di Ianni, Pierluigi Crescenzi:
Deadlock Prediction in the Case of Dynamic Routing. Int. J. Found. Comput. Sci. 1(3): 185-200 (1990) - [j1]Pierluigi Crescenzi, Riccardo Silvestri:
Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems. Inf. Process. Lett. 33(5): 221-226 (1990)
1980 – 1989
- 1989
- [c1]Pierluigi Crescenzi, Alessandro Panconesi:
Completeness in Approximation Classes. FCT 1989: 116-126
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-14 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
