Complexity and approximation: Combinatorial optimization problems and their approximability properties G Ausiello, P Crescenzi, G Gambosi, V Kann, A Marchetti-Spaccamela, ... Springer Verlag, 1999 | 2590* | 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 | 575 | 1998 |
Introduction to the Theory of Complexity DP Bovet, P Crescenzi, D Bovet Prentice Hall, 1994 | 546 | 1994 |
A compendium of NP optimization problems P Crescenzi, V Kann, M Halldórsson | 528 | 1995 |
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 | 395 | 2015 |
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 | 302 | 2001 |
A short guide to approximation preserving reductions P Crescenzi Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 262-273, 1997 | 172 | 1997 |
Completeness in approximation classes P Crescenzi, A Panconesi Information and Computation 93 (2), 241-262, 1991 | 172 | 1991 |
Approximate solution of NP optimization problems G Ausiello, P Crescenzi, M Protasi Theoretical Computer Science 150 (1), 1-55, 1995 | 171 | 1995 |
A uniform approach to define complexity classes DP Bovet, P Crescenzi, R Silvestri Theoretical Computer Science 104 (2), 263-283, 1992 | 164 | 1992 |
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 | 156 | 1992 |
Parsimonious flooding in dynamic graphs H Baumann, P Crescenzi, P Fraigniaud Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009 | 128 | 2009 |
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 | 97 | 2000 |
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 | 95 | 2016 |
Structure in approximation classes P Crescenzi, V Kann, R Silvestri, L Trevisan SIAM Journal on Computing 28 (5), 1759-1782, 1999 | 95 | 1999 |
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 | 82 | 2016 |
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 | 81 | 2013 |
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 | 72 | 1997 |
To weight or not to weight: where is the question? P Crescenzi, R Silvestri, L Trevisan ISTCS 96, 68-77, 1996 | 70 | 1996 |
IP address lookupmade fast and simple P Crescenzi, L Dardini, R Grossi Algorithms-ESA’99: 7th Annual European Symposium Prague, Czech Republic …, 1999 | 68 | 1999 |