Pierluigi Crescenzi
Pierluigi Crescenzi
Professor of Computer Science, GSSI, L'Aquila, Italy
Verified email at gssi.it - Homepage
Title
Cited by
Cited by
Year
Complexity and approximation: Combinatorial optimization problems and their approximability properties
G Ausiello, P Crescenzi, G Gambosi, V Kann, A Marchetti-Spaccamela, ...
Springer Verlag, 1999
2285*1999
On the complexity of protein folding
P Crescenzi, D Goldman, C Papadimitriou, A Piccolboni, M Yannakakis
Journal of computational biology 5 (3), 423-465, 1998
5331998
A compendium of NP optimization problems
P Crescenzi, V Kann, M Halldórsson
5031995
Introduction to the Theory of Complexity
DP Bovet, P Crescenzi, D Bovet
Prentice Hall, 1994
4691994
On the complexity of computing minimum energy consumption broadcast subgraphs
AEF Clementi, P Crescenzi, P Penna, G Rossi, P Vocca
Annual Symposium on Theoretical Aspects of Computer Science, 121-131, 2001
2862001
MeDuSa: a multi-draft based scaffolder
E Bosi, B Donati, M Galardini, S Brunetti, MF Sagot, P Lió, P Crescenzi, ...
Bioinformatics 31 (15), 2443-2451, 2015
1802015
Completeness in approximation classes
P Crescenzi, A Panconesi
Information and Computation 93 (2), 241-262, 1991
1601991
A uniform approach to define complexity classes
DP Bovet, P Crescenzi, R Silvestri
Theoretical Computer Science 104 (2), 263-283, 1992
1521992
Approximate solution of NP optimization problems
G Ausiello, P Crescenzi, M Protasi
Theoretical Computer Science 150 (1), 1-55, 1995
1511995
A note on optimal area algorithms for upward drawings of binary trees
P Crescenzi, G Di Battista, A Piperno
Computational Geometry 2 (4), 187-200, 1992
1451992
A short guide to approximation preserving reductions
P Crescenzi
Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 262-273, 1997
1221997
Parsimonious flooding in dynamic graphs
H Baumann, P Crescenzi, P Fraigniaud
Distributed Computing 24 (1), 31-44, 2011
1122011
Reversible execution and visualization of programs with LEONARDO
P Crescenzi, C Demetrescu, I Finocchi, R Petreschi
Journal of Visual Languages & Computing 11 (2), 125-150, 2000
902000
Structure in approximation classes
P Crescenzi, V Kann, R Silvestri, L Trevisan
SIAM Journal on Computing 28 (5), 1759-1782, 1999
901999
Structure in approximation classes
P Crescenzi, V Kann, R Silvestri, L Trevisan
International Computing and Combinatorics Conference, 539-548, 1995
711995
IP address lookupmade fast and simple
P Crescenzi, L Dardini, R Grossi
European Symposium on Algorithms, 65-76, 1999
691999
To weight or not to weight: where is the question?
P Crescenzi, R Silvestri, L Trevisan
ISTCS 96, 68-77, 1996
691996
A compendium of NP optimization problems
P Crescenzi, V Kann, M Halldórsson, M Karpinski, G Woeginger
URL: http://www. nada. kth. se/~ viggo/problemlist/compendium. html, 1997
671997
On computing the diameter of real-world undirected graphs
P Crescenzi, R Grossi, M Habib, L Lanzi, A Marino
Theoretical Computer Science 514, 84-95, 2013
612013
On approximating a scheduling problem
P Crescenzi, X Deng, CH Papadimitriou
Journal of Combinatorial Optimization 5 (3), 287-297, 2001
602001
The system can't perform the operation now. Try again later.
Articles 1–20