Pierluigi Crescenzi

#	Item
1	Parsimonious Flooding in Dynamic Graphs∗ Hervé Baumann Pierluigi Crescenzi Pierre Fraigniaud Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2010-02-08 08:39:17 Mathematics Reachability Chernoff bound Random walk Random graph Statistics Graph connectivity Graph theory
2	How to find the best approximation results – a follow-up to Garey and Johnson∗ Pierluigi Crescenzi† Viggo Kann‡ Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 1998-12-21 18:16:27 Complexity classes Mathematical optimization NP-complete problems Combinatorial optimization Approximation algorithm NP-complete Hardness of approximation Optimization problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
3	FUN 2014 CALL FOR PAPERS http://www.di.unipi.it/fun14 Seventh International Conference on FUN WITH ALGORITHMS July 1-3, 2014, Lipari Island, Sicily, Italy The Seventh International conference on Fun with Algorithms (FUN Add to Reading List Source URL: www.di.unipi.it Language: English - Date: 2014-01-12 22:32:15 IDSIA Pierluigi Crescenzi Algorithm Mathematical logic Theoretical computer science