Pierluigi Crescenzi

148 papers A* 8A 12B 15C 5Misc 5Journal 77Unranked 22
YearRankTypeTitle / Venue / Authors
2026 J jnl
Giant Components in Random Temporal Graphs.
SIAM J. Discret. Math.
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Michael Raskin, Malte Renken, Viktor Zamaraev
2026 J jnl
Making the interval membership width of temporal graphs connected and bidirectional.
J. Comput. Syst. Sci.
Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos
2025 J jnl
Making Temporal Betweenness Computation Faster and Restless.
CoRR
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
2024 — conf
Exploring Large Language Models Capabilities to Explain Decision Trees.
HHAI
Paulo Bruno S. Serafim, Pierluigi Crescenzi, Gizem Gezici, Eleonora Cappuccio, Salvatore Rinzivillo, Fosca Giannotti
2024 A* conf
Making Temporal Betweenness Computation Faster and Restless.
KDD
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
2024 C conf
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional.
IWOCA
Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos
2024 J jnl
WorldDynamics.jl: A Julia Package for Developing and Simulating Integrated Assessment Models.
J. Open Source Softw.
Pierluigi Crescenzi, Emanuele Natale, Aurora Rossi, Paulo Bruno S. Serafim
2023 J jnl
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs.
CoRR
Alkida Balliu, Filippo Brunelli, Pierluigi Crescenzi, Dennis Olivetti, Laurent Viennot
2023 A conf
Giant Components in Random Temporal Graphs.
APPROX/RANDOM
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev
2023 J jnl
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks.
Networks
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
2023 B conf
Proxying Betweenness Centrality Rankings in Temporal Networks.
SEA
Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, Bojana Kodric
2023 — conf
The Way We Were: Structural Operational Semantics Research in Perspective.
EXPRESS/SOS
Luca Aceto, Pierluigi Crescenzi, Anna Ingólfsdóttir, Mohammad Reza Mousavi
2023 B conf
Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal Evolution.
SIROCCO
Pierluigi Crescenzi
2022 J jnl
CONCUR through time.
Bull. EATCS
Luca Aceto, Pierluigi Crescenzi
2022 J jnl
Giant Components in Random Temporal Graphs.
CoRR
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev
2022 J jnl
On Computing the Diameter of (Weighted) Link Streams.
ACM J. Exp. Algorithmics
Marco Calamai, Pierluigi Crescenzi, Andrea Marino
2022 A* conf
Planning with Biological Neurons and Synapses.
AAAI
Francesco d'Amore, Daniel Mitropolsky, Pierluigi Crescenzi, Emanuele Natale, Christos H. Papadimitriou
2021 J jnl
On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks.
CoRR
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
2021 B conf
On Computing the Diameter of (Weighted) Link Streams.
SEA
Marco Calamai, Pierluigi Crescenzi, Andrea Marino
2021 J jnl
On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation.
CoRR
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
2021 J jnl
On computing Pareto optimal paths in weighted time-dependent networks.
Inf. Process. Lett.
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
2021 J jnl
Planning with Biological Neurons and Synapses.
CoRR
Francesco d'Amore, Daniel Mitropolsky, Pierluigi Crescenzi, Emanuele Natale, Christos H. Papadimitriou
2021 J jnl
Public Communication can Facilitate Low-Risk Coordination under Surveillance.
CoRR
Amos Korman, Pierluigi Crescenzi
2020 — conf
A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs.
ICETC
Gabriele Goretti, Benedetta Terenzi, Elisabetta Cianfanelli, Pierluigi Crescenzi, Carlo Colombo, Enrico Civitelli
2020 B conf
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs.
MFCS
Alessio Conte, Pierluigi Crescenzi, Andrea Marino, Giulia Punzi
2020 J jnl
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs.
Algorithms
Pierluigi Crescenzi, Clémence Magnien, Andrea Marino
2020 A* conf
Simple and Fast Distributed Computation of Betweenness Centrality.
INFOCOM
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
2020 J jnl
Simple and Fast Distributed Computation of Betweenness Centrality.
CoRR
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
2019 J jnl
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs.
Algorithms
Pierluigi Crescenzi, Clémence Magnien, Andrea Marino
2019 J jnl
Computing top-
ACM Trans. Knowl. Discov. Data
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
2019 — ch.
Degrees of Separation and Diameter in Large Graphs.
Encyclopedia of Big Data Technologies
Pierluigi Crescenzi, Andrea Marino
2019 A conf
Trade-Offs in Distributed Interactive Proofs.
DISC
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
2019 J jnl
Trade-offs in Distributed Interactive Proofs.
CoRR
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
2018 J jnl
Improving the Betweenness Centrality of a Node by Adding Links.
ACM J. Exp. Algorithmics
Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj
2017 A* conf
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs.
SODA
Michele Borassi, Pierluigi Crescenzi, Luca Trevisan
2017 J jnl
An ant-colony based approach for real-time implicit collaborative information seeking.
Inf. Process. Manag.
Alessio Malizia, Kai A. Olsen, Tommaso Turchi, Pierluigi Crescenzi
2017 J jnl
Computing top-k Closeness Centrality Faster in Unweighted Graphs.
CoRR
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
2017 J jnl
Improving the betweenness centrality of a node by adding links.
CoRR
Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj
2017 J jnl
Sigil3D: A Crowdsourcing Platform for Interactive 3D Content.
CoRR
Andrea Barillari, Daniele Bernardini, Pierluigi Crescenzi
2016 J jnl
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs.
CoRR
Michele Borassi, Pierluigi Crescenzi, Luca Trevisan
2016 Misc conf
Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering.
FUN
Francesco Cambi, Pierluigi Crescenzi, Linda Pagli
2016 A conf
Computing Top-
ALENEX
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
2016 B conf
Core-periphery clustering and collaboration networks.
ASONAM
Pierluigi Crescenzi, Pierre Fraigniaud, Zvi Lotker, Paolo Penna
2016 J jnl
Greedily Improving Our Own Closeness Centrality in a Network.
ACM Trans. Knowl. Discov. Data
Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
2016 J jnl
On the complexity of the shortest-path broadcast problem.
Discret. Appl. Math.
Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci
2016 — ed.
Proceedings of the 16th Italian Conference on Theoretical Computer Science, ICTCS 2015, Firenze, Italy, September 9-11, 2015
ICTCS
Pierluigi Crescenzi, Michele Loreti
2016 J jnl
Rumor spreading in random evolving graphs.
Random Struct. Algorithms
Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri
2015 — conf
An Eclipse IDE for Teaching Java-.
ICSOFT (Selected Papers)
Lorenzo Bettini, Pierluigi Crescenzi
2015 J jnl
EUCALYPT: efficient tree reconciliation enumerator.
Algorithms Mol. Biol.
Beatrice Donati, Christian Baudet, Blerina Sinaimeri, Pierluigi Crescenzi, Marie-France Sagot
2015 J jnl
Fast and Simple Computation of Top-k Closeness Centralities.
CoRR
Michele Borassi, Pierluigi Crescenzi, Andrea Marino
2015 J jnl
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.
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
2015 B conf
Greedily Improving Our Own Centrality in A Network.
SEA
Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
2015 — conf
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems.
ICTCS
Michele Borassi, Pierluigi Crescenzi, Michel Habib
2015 — conf
Java--Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach.
ICSOFT-PT
Lorenzo Bettini, Pierluigi Crescenzi
2015 J jnl
MeDuSa: a multi-draft based scaffolder.
Bioinform.
Emanuele Bosi, Beatrice Donati, Marco Galardini, Sara Brunetti, Marie-France Sagot, Pietro Liò, Pierluigi Crescenzi, Renato Fani, Marco Fondi
2015 A conf
On Computing the Hyperbolicity of Real-World Graphs.
ESA
Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino
2015 — conf
Preface.
ICTCS
Pierluigi Crescenzi, Michele Loreti
2015 J jnl
Synchronous context-free grammars and optimal linear parsing strategies.
J. Comput. Syst. Sci.
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
2014 J jnl
Blind image clustering based on the Normalized Cuts criterion for camera identification.
Signal Process. Image Commun.
Irene Amerini, Roberto Caldelli, Pierluigi Crescenzi, Andrea Del Mastio, Andrea Marino
2014 J jnl
Flooding in dynamic graphs with arbitrary degree sequence.
J. Parallel Distributed Comput.
Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud
2014 J jnl
Into the Square - On the Complexity of Quadratic-Time Solvable Problems.
CoRR
Michele Borassi, Pierluigi Crescenzi, Michel Habib
2014 Misc conf
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.
FUN
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
2014 J jnl
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure.
Bioinform.
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
2013 B conf
From theory to practice: NP-completeness for every CS student.
ITiCSE
Pierluigi Crescenzi, Emma Enström, Viggo Kann
2013 J jnl
Rumor Spreading in Random Evolving Graphs
CoRR
Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri
2013 A conf
Rumor Spreading in Random Evolving Graphs.
ESA
Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri
2013 J jnl
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies.
CoRR
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
2013 B conf
Telling Stories Fast.
SEA
Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu
2012 A conf
Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence.
DISC
Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud
2012 C conf
Efficient Bubble Enumeration in Directed Graphs.
SPIRE
Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot
2012 A conf
Making turing machines accessible to blind students.
SIGCSE
Pierluigi Crescenzi, Leonardo Rossi, Gianluca Apollaro
2012 B conf
On Computing the Diameter of Real-World Directed (Weighted) Graphs.
SEA
Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino
2012 J jnl
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets.
Theor. Comput. Sci.
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
2011 — conf
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs.
TAPAS
Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino
2011 A* conf
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems.
ACL
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
2011 J jnl
Parsimonious flooding in dynamic graphs.
Distributed Comput.
Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud
2010 — conf
Adapting moodle to better support CS education.
ITiCSE-WGR
Guido Rößling, Myles F. McNally, Pierluigi Crescenzi, Atanas Radenski, Petri Ihantola, M. Gloria Sánchez-Torrubia
2010 C conf
Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms.
WABI
Paulo Vieira Milreu, Vicente Acuña, Etienne Birmelé, Pierluigi Crescenzi, Alberto Marchetti-Spaccamela, Marie-France Sagot, Leen Stougie, Vincent Lacroix
2010 — conf
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound.
ESA (1)
Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino
2010 B conf
Using AVs to explain NP-completeness.
ITiCSE
Pierluigi Crescenzi
2009 J jnl
Adding Test Generation to the Teaching Machine.
ACM Trans. Comput. Educ.
Michael Bruce-Lockhart, Theodore S. Norvell, Pierluigi Crescenzi
2009 J jnl
Foreword.
Theory Comput. Syst.
Pierluigi Crescenzi, Fabrizio Luccio, Geppino Pucci
2009 J jnl
On the connectivity of Bluetooth-based
Concurr. Comput. Pract. Exp.
Pierluigi Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci
2009 A* conf
Parsimonious flooding in dynamic graphs.
PODC
Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud
2007 Misc ed.
Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings
FUN
Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci
2004 J jnl
The minimum likely column cover problem.
Inf. Process. Lett.
Pierluigi Crescenzi, Federico Greco
2003 A* conf
Online Load Balancing Made Simple: Greedy Strikes Back.
ICALP
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
2003 — conf
Search Data Structures for Skewed Strings.
WEA
Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano
2003 J jnl
Text sparsification via local maxima.
Theor. Comput. Sci.
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
2002 J jnl
A note on the spatiality degree of graphs.
Ars Comb.
Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri
2002 C conf
Development of an ECB on Computer Networks Based on WWW Technologies, Resources and Usability Criteria.
ICCE
Pierluigi Crescenzi, Gaia Innocenti
2002 J jnl
On the Hamming distance of constraint satisfaction problems.
Theor. Comput. Sci.
Pierluigi Crescenzi, Gianluca Rossi
2001 J jnl
On Approximating a Scheduling Problem.
J. Comb. Optim.
Pierluigi Crescenzi, Xiaotie Deng, Christos H. Papadimitriou
2001 — conf
On Computing Ad-hoc Selective Families.
RANDOM-APPROX
Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri
2001 J jnl
On Weighted vs Unweighted Versions of Combinatorial Optimization Problems.
Inf. Comput.
Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan
2001 A conf
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs.
STACS
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca
2001 — conf
Towards a Taxonomy of Network Protocol Visualization Tools.
Software Visualization
Pierluigi Crescenzi, Gaia Innocenti
2000 J jnl
On Approximation Scheme Preserving Reducibility and Its Applications.
Theory Comput. Syst.
Pierluigi Crescenzi, Luca Trevisan
2000 — conf
On-line algorithms for the channel assignment problem in cellular networks.
DIAL-M
Pierluigi Crescenzi, Giorgio Gambosi, Paolo Penna
2000 J jnl
Reversible Execution and Visualization of Programs with LEONARDO.
J. Vis. Lang. Comput.
Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi
2000 — conf
Text Sparsification via Local Maxima.
FSTTCS
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
1999 — book
Complexity and approximation: combinatorial optimization problems and their approximability properties.
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, Viggo Kann
1999 A conf
IP Address Lookup Made Fast and Simple.
ESA
Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi
1999 J jnl
Max NP-completeness Made Easy.
Theor. Comput. Sci.
Pierluigi Crescenzi, Luca Trevisan
1999 Misc conf
On the Complexity of Approximating Colored-Graph Problems.
COCOON
Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi
1999 J jnl
Structure in Approximation Classes.
SIAM J. Comput.
Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
1998 J jnl
How to find the best approximation results.
SIGACT News
Pierluigi Crescenzi, Viggo Kann
1998 J jnl
Linear area upward drawings of AVL trees.
Comput. Geom.
Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno
1998 A* conf
On the Complexity of Protein Folding (Extended Abstract).
STOC
Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
1998 J jnl
On the Complexity of Protein Folding.
J. Comput. Biol.
Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
1998 B conf
On the complexity of protein folding (abstract).
RECOMB
Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
1998 J jnl
Sperner's Lemma and Robust Machines.
Comput. Complex.
Pierluigi Crescenzi, Riccardo Silvestri
1998 J jnl
Strictly-upward Drawings of Ordered Search Trees.
Theor. Comput. Sci.
Pierluigi Crescenzi, Paolo Penna
1998 J jnl
The Parallel Complexity of Approximating the High Degree Subgraph Problem.
Theor. Comput. Sci.
Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim
1997 A conf
A Short Guide to Approximation Preserving Reductions.
CCC
Pierluigi Crescenzi
1997 — conf
Approximation on the Web: A Compendium of NP Optimization Problems.
RANDOM
Pierluigi Crescenzi, Viggo Kann
1997 — conf
LEONARDO: a software visualization system.
WAE
Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi
1997 J jnl
MAX NP-Completeness Made Easy
Electron. Colloquium Comput. Complex.
Pierluigi Crescenzi, Luca Trevisan
1997 A conf
Minimum-Area h-v Drawings of Complete Binary Trees.
GD
Pierluigi Crescenzi, Paolo Penna
1996 J jnl
On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem.
RAIRO Theor. Informatics Appl.
Pierluigi Crescenzi, Luca Trevisan
1996 — conf
Parallel approximation of optimization problems.
Solving Combinatorial Optimization Problems in Parallel
Daniel P. Bovet, Andrea Clementi, Pierluigi Crescenzi, Riccardo Silvestri
1996 J jnl
Structure in Approximation Classes
Electron. Colloquium Comput. Complex.
Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
1996 — conf
To Weight or Not to Weight: Where is the Question?
ISTCS
Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan
1996 B conf
Upward Drawings of Search Trees (Extended Abstract).
WG
Pierluigi Crescenzi, Paolo Penna
1995 J jnl
Approximate Solution of NP Optimization Problems.
Theor. Comput. Sci.
Giorgio Ausiello, Pierluigi Crescenzi, Marco Protasi
1995 J jnl
Complexity Classes and Sparse Oracles.
J. Comput. Syst. Sci.
Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
1995 J jnl
Max Sat and Min Set Cover Approximation Algorithms are P-Complete.
Parallel Process. Lett.
Gian Carlo Bongiovanni, Pierluigi Crescenzi, Sergio De Agostino
1995 J jnl
Parallel Simulated Annealing for Shape Detection.
Comput. Vis. Image Underst.
Gian Carlo Bongiovanni, Pierluigi Crescenzi, Concettina Guerra
1995 J jnl
Reversible Simulation of Space-Bounded Computations.
Theor. Comput. Sci.
Pierluigi Crescenzi, Christos H. Papadimitriou
1995 Misc conf
Structure in Approximation Classes (Extended Abstract).
COCOON
Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
1995 B conf
The Parallel Complexity of Approximating the High Degree Subgraph Problem.
ISAAC
Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim
1994 C ed.
Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings
CIAC
Maurizio A. Bonuccelli, Pierluigi Crescenzi, Rossella Petreschi
1994 — book
Introduction to the theory of complexity.
Daniel P. Bovet, Pierluigi Crescenzi
1994 B conf
Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract).
WG
Pierluigi Crescenzi, Luca Trevisan
1994 — conf
On Approximation Scheme Preserving Reducability and Its Applications.
FSTTCS
Pierluigi Crescenzi, Luca Trevisan
1994 A conf
Optimal-Area Upward Drawings of AVL Trees.
GD
Pierluigi Crescenzi, Adolfo Piperno
1993 J jnl
A Note on the Descriptive Complexity of Maximization.
Inf. Process. Lett.
Pierluigi Crescenzi, Riccardo Silvestri
1993 J jnl
Average Measure, Descriptive Complexity and Approximation of Maximization Problems.
Int. J. Found. Comput. Sci.
Pierluigi Crescenzi, Riccardo Silvestri
1993 — conf
Sperner's Lemma and Robust Machines.
SCT
Pierluigi Crescenzi, Riccardo Silvestri
1992 J jnl
A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees.
Comput. Geom.
Pierluigi Crescenzi, Giuseppe Di Battista, Adolfo Piperno
1992 J jnl
A Uniform Approach to Define Complexity Classes.
Theor. Comput. Sci.
Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
1991 J jnl
A Note on the Approximation of the MAX CLIQUE Problem.
Inf. Process. Lett.
Pierluigi Crescenzi, C. Fiorini, Riccardo Silvestri
1991 J jnl
Completeness in Approximation Classes
Inf. Comput.
Pierluigi Crescenzi, Alessandro Panconesi
1991 — conf
Complexity Classes and Sparse Oracles.
SCT
Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
1991 J jnl
Minimum-Delay Schedules in Layered Networks.
Acta Informatica
Daniel P. Bovet, Pierluigi Crescenzi
1990 J jnl
Deadlock Prediction in the Case of Dynamic Routing.
Int. J. Found. Comput. Sci.
Daniel P. Bovet, Miriam Di Ianni, Pierluigi Crescenzi
1990 J jnl
Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems.
Inf. Process. Lett.
Pierluigi Crescenzi, Riccardo Silvestri
1989 B conf
Completeness in Approximation Classes.
FCT
Pierluigi Crescenzi, Alessandro Panconesi