Seguir
Pierluigi Crescenzi
Pierluigi Crescenzi
Professor of Computer Science, GSSI, L'Aquila, Italy
E-mail confirmado em gssi.it - Página inicial
Título
Citado por
Citado por
Ano
Complexity and approximation: Combinatorial optimization problems and their approximability properties
G Ausiello, P Crescenzi, G Gambosi, V Kann, A Marchetti-Spaccamela, ...
Springer Verlag, 1999
2604*1999
On the complexity of protein folding
P Crescenzi, D Goldman, C Papadimitriou, A Piccolboni, M Yannakakis
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
5761998
Introduction to the Theory of Complexity
DP Bovet, P Crescenzi, D Bovet
Prentice Hall, 1994
5471994
A compendium of NP optimization problems
P Crescenzi, V Kann, M Halldórsson
5281995
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
4012015
On the complexity of computing minimum energy consumption broadcast subgraphs
AEF Clementi, P Crescenzi, P Penna, G Rossi, P Vocca
STACS 2001: 18th Annual Symposium on Theoretical Aspects of Computer Science …, 2001
3022001
A short guide to approximation preserving reductions
P Crescenzi
Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 262-273, 1997
1761997
Completeness in approximation classes
P Crescenzi, A Panconesi
Information and Computation 93 (2), 241-262, 1991
1721991
Approximate solution of NP optimization problems
G Ausiello, P Crescenzi, M Protasi
Theoretical Computer Science 150 (1), 1-55, 1995
1711995
A uniform approach to define complexity classes
DP Bovet, P Crescenzi, R Silvestri
Theoretical Computer Science 104 (2), 263-283, 1992
1641992
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
1571992
Parsimonious flooding in dynamic graphs
H Baumann, P Crescenzi, P Fraigniaud
Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009
1282009
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
972000
Into the square: On the complexity of some quadratic-time solvable problems
M Borassi, P Crescenzi, M Habib
Electronic Notes in Theoretical Computer Science 322, 51-67, 2016
952016
Structure in approximation classes
P Crescenzi, V Kann, R Silvestri, L Trevisan
SIAM Journal on Computing 28 (5), 1759-1782, 1999
951999
Greedily improving our own closeness centrality in a network
P Crescenzi, G D'angelo, L Severini, Y Velaj
ACM Transactions on Knowledge Discovery from Data (TKDD) 11 (1), 1-32, 2016
852016
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
822013
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
741997
To weight or not to weight: where is the question?
P Crescenzi, R Silvestri, L Trevisan
ISTCS 96, 68-77, 1996
701996
Computing top-k Closeness Centrality Faster in Unweighted Graphs
E Bergamini, M Borassi, P Crescenzi, A Marino, H Meyerhenke
ACM Transactions on Knowledge Discovery from Data (TKDD) 13 (5), 1-40, 2019
682019
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20