H. BAUMANN and P. CRESCENZI and P. FRAIGNIAUD. Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence, 26th International Symposium on Distributed Computing, in press
P. CRESCENZI and R. GROSSI and M. HABIB and L. LANZI and A. MARINO. On computing the diameter of real-world undirected graphs, Theoretical Computer Science, in press (doi:10.1016/j.tcs.2012.09.018)
V. ACUÑA and E. BIRMELE and L. COTTRET and P. CRESCENZI and F. JOURDAN and V. LACROIX and A. MARCHETTI-SPACCAMELA and A. MARINO and P. MILREU and M.-F. SAGOT and L. STOUGIE. Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets, Theoretical Computer Science, 457:1–9, 2012
E. BIRMELE and P. CRESCENZI and R. FERREIRA and R. GROSSI and V. LACROIX and A. MARINO and N. PISANTI and G. SACOMOTO and M.-F. SAGOT. Efficient Bubble Enumeration in Directed Graphs, 19th International Symposium on String Processing and Information Retrieval, 118–129, 2012
P. CRESCENZI and R. GROSSI and L. LANZI and A. MARINO. On Computing the Diameter of Real-World Directed (Weighted) Graphs, 11Th International Symposium on Experimental Algorithms, 99–110, 2012
P. CRESCENZI and A. MALIZIA and M.C. VERRI and P. DIAZ and I. AEDO. Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course, Educational Technology & Society Journal, 15(2):115–124, 2012
P. CRESCENZI and L. ROSSI and G. APOLLARO. Making Turing Machines Accessible to Blind Students, 43rd ACM Technical Symposium on Computer Science Education, 167–172, 2012
A. FREIRE, V. ACUÑA, P. CRESCENZI, C. FERREIRA, V. LACROIX, P. VIEIRA MILREU, E. MORENO, M.-F. SAGOT. Minimum Ratio Cover of Matrix Columns by Extreme Rays of its Induced Cone, Second International Symposium on Combinatorial Optimization, 165–177, 2012
P. CRESCENZI and A. MALIZIA and M.C. VERRI and P. DIAZ and I. AEDO. On two collateral effects of using algorithm visualizations, British Journal of Educational Technology , 42(6):E145–E147, 2011
H. BAUMANN and P. CRESCENZI and P. FRAIGNIAUD. Parsimonious Flooding in Dynamic Graphs, Distributed Computing, 24:31–44, 2011
P. CRESCENZI and M. DI IANNI and A. MARINO and D. MERLINI and G. ROSSI and P. VOCCA. Smooth Movement and Manhattan Path Based Random Waypoint Mobility, Information Processing Letter, 111:239–-246, 2011
P. CRESCENZI and D. GILDEA and A. MARINO and G. ROSSI and G. SATTA. Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems, 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 450–459, 2011
P. CRESCENZI and R. GROSSI and L. LANZI and A. MARINO. A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs, First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, 92–103, 2011
P. CRESCENZI. Using Avs to Explain NP-completeness, Fifteenth Annual Conference on Innovation and Technology in Computer Science Education, 299, 2010
P. CRESCENZI and M. DI IANNI and A. MARINO and G. ROSSI and P. VOCCA. Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications, 16th International Colloquium on Structural Information and Communication Complexity, 154–166, 2010
P. CRESCENZI and R. GROSSI and C. IMBRENDA and L. LANZI and A. MARINO. Finding the Diameter in Real-World Graphs: Experimentally Turning a Lower Bound into an Upper Bound, Eighteenth Annual European Symposium on Algorithms, 302–313, 2010
P. MILREU and V. ACUNA and E. BIRMELE and P. CRESCENZI and A. MARCHETTI-SPACCAMELA and M.-F. SAGOT and and L. STOUGIE and V. LACROIX. Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms, Tenth Workshop on Algorithms in Bioinformatics, 226–237, 2010
G. ROESSLING and P. CRESCENZI and P. IHANTOLA and M. MCNALLY and A. RADENSKI and M.G. SANCHEZ-TORRUBIA. Adapting moodle to better support CS education, ITiCSE working group reports on Working group reports, 15-27, 2010
H. BAUMANN and P. CRESCENZI and P. FRAIGNIAUD. Parsimonious Flooding in Dynamic Graphs, 28th Annual Symposium on Principles of Distributed Computing, 260–269, 2009
M. BRUCE-LOCKHART and P. CRESCENZI and T. NORVELL. Adding test generation to the Teaching Machine, ACM TRANSACTIONS ON COMPUTING EDUCATION, 9:Article 12, 2009
M. BRUCE-LOCKHART and P. CRESCENZI and T. NORVELL. Integrating test generation functionality into the Teaching Machine environment, ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 224:115–124, 2009
P. CRESCENZI and F. LUCCIO and G. PUCCI. Foreword: Special Issue on Fun with Algorithms, THEORY OF COMPUTING SYSTEMS, 44:141–142, 2009
P. CRESCENZI and C. NOCENTINI and A. PIETRACAPRINA and G. PUCCI. On the Connectivity of Bluetooth-Based Ad Hoc Networks, CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE, 21:875–887, 2009
C. NOCENTINI and P. CRESCENZI and L. LANZI. Performance Evaluation of a Chord-based JXTA Implementation, 1st International Conference on Advances in P2P Systems, 7–12, 2009
G. BARTOLONI and A. BIGAGLI and L. BRANDI and P. CRESCENZI and C. PERLMUTER and M. ROSI AND T. ROSSI and B. SALVADORI. StruDle: Uno strumento di aiuto all’individuazione precoce dei disturbi di apprendimento della lettura, DIDAMATICA 2008, Parte II, 785–793, 2008
S. BOSCHI and P. CRESCENZI and M. DI IANNI and G. ROSSI and P. VOCCA. MOMOSE: A Mobility Model Simulation Environment for Mobile Wireless Ad-hoc Networks, First International Conference on Simulation Tools and Techniques for Communications, Networks and Systems, 2008
P. CRESCENZI and M. DI IANNI and F. GRECO AND G. ROSSI and P. VOCCA. Making Role Assignment Feasible: A Polynomial-time Algorithm for Computing Ecological Colorings, 34th International Workshop on Graph-Theoretic Concepts in Computer Science, 90–100, 2008
P. CRESCENZI and G. PUCCI and G. PRENCIPE (eds.). Fourth International Conference on Fun with Algorithms, LNCS 4475, 2007
P. CRESCENZI and C. NOCENTINI and A. PIETRACAPRINA and G. PUCCI and C. SANDRI. On the Connectivity of Bluetooth-Based Ad Hoc Networks, Thirteenth International European Conference on Parallel and Distributed Computing, 944–953, 2007
P. CRESCENZI and G. GAMBOSI and G. NICOSIA and P. PENNA and W. UNGER. On-line load balancing made simple: Greedy strikes back, JOURNAL OF DISCRETE ALGORITHMS, 5:162–175, 2007
P. CRESCENZI and C. NOCENTINI. Fully Integrating Algorithm Visualization into a CS2 course, Twelfth Annual Conference on Innovation and Technology in Computer Science Education, 296–300, 2007
P. CRESCENZI. Approximation algorithms. In Optimization and Operations Research, Derigs U. (ed.), 2:241–257, EOLSS, 2006
P. BELTRAMI and P. CRESCENZI and G. GENSINI and A. INNOCENTI and P. LIPPI and N. SACCONE. Automatic feedback generation in scenario-based e-learning with an application to the healthcare sector, JOURNAL OF E-LEARNING AND KNOWLEDGE SOCIETY, 2:229–240, 2006
P. CRESCENZI and G. GAMBOSI and R. GROSSI. Strutture di dati e algoritmi. Progettazione, analisi e visualizzazione, Pearson Education Italia, 2006
P. CRESCENZI and M. LORETI and R. PUGLIESE. Assessing CS1 Java Skills: A Three-Year Experience, Eleventh Annual Conference on Innovation and Technology in Computer Science Education, 348–348, 2006
P. CRESCENZI and M. DI IANNI and A. LAZZONI and P. PENNA and G. ROSSI and P. VOCCA. Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks, Fourth International Conference on Ad-Hoc Networks & Wireless, 4–17, 2005
P. CRESCENZI and G. GAMBOSI and G. INNOCENTI. NetPrIDE: an integrated environment for developing and visualizing computer network protocols, Tenth annual conference on Innovation and technology in computer science education, 306–310, 2005
P. CRESCENZI and M. MOLLICONE. Da JAZ ad AVE. Evoluzione di un visualizzatore di algoritmi in Java, DIDAMATICA 2005, 367–376, 2005
P. CRESCENZI and B. YENER. Foreword: ACM MONET special issue on discrete algorithms and methods for mobile computing and communication, MOBILE NETWORKS AND APPLICATIONS, 9:99–99, 2004
P. CRESCENZI and F. GRECO. The minimum likely column cover problem, INFORMATION PROCESSING LETTERS, 89:175–179, 2004
P. CRESCENZI and G. ROSSI and F. MONTECALVO. Optimal covering designs: complexity results and new bounds, DISCRETE APPLIED MATHEMATICS, 144:281–290, 2004
P. CRESCENZI and G. GAMBOSI and P. PENNA. On-line algorithms for the channel assignment problem in cellular networks, DISCRETE APPLIED MATHEMATICS, 137:237–266, 2004
P. CRESCENZI. Gocce di Java, Franco Angeli, 2004
P. CRESCENZI and E. LODI and L. PAGLI. The estherithms museum, Third International Conference on Fun with Algorithms, 273–280, 2004
P. CRESCENZI and F. GRECO. An experimental evaluation of cover design algorithms, Third International Conference on Fun with Algorithms, 197–205, 2004
L. BETTINI and L. CECCHI and P. CRESCENZI and G. INNOCENTI and M. LORETI. An environment for self-assessing Java programming skills in undergraduate first programming courses, IEEE International Conference on Advanced Learning Technologies, 161–165, 2004
P. CRESCENZI and A. DEL LUNGO and R. GROSSI and E. LODI and L. PAGLI and G. ROSSI. Text sparsification via local maxima, THEORETICAL COMPUTER SCIENCE, 304:341—364, 2003
P. CRESCENZI and G. INNOCENTI. A tool to develop electronic course books based on WWW technologies, resources and usability criteria, Eighth annual conference on Innovation and technology in Computer Science Education, 163–167, 2003
P. CRESCENZI and G. GAMBOSI and G. NICOSIA and P. PENNA and W. UNGER. On-line load balancing made simple: greedy strikes back, Thirteenth International Colloquium on Automata, Languages and Programming, 1108–1122, 2003
P. CRESCENZI and R. GROSSI and G. ITALIANO. Search data structures for skewed strings, Workshop on Experimental and Efficient Algorithms, 81–96, 2003
L. CECCHI and P. CRESCENZI and G. INNOCENTI. C : C++ = JavaMM: Java, Second International Conference on Principles and Practice of Programming in Java, 75–78, 2003
P. CRESCENZI and S. DE AGOSTINO and R. SILVESTRI. A note on the spatiality degree of graphs, ARS COMBINATORIA, 63:185–191, 2002
P. CRESCENZI and G. ROSSI. On the Hamming distance of constraint satisfaction problems, THEORETICAL COMPUTER SCIENCE, 288:85–100, 2002
U. BIADER CEIPIDOR and P. CRESCENZI and M. DE PAOLI and S. FERRARO and M. IANNUCCI and A. MESSINA and P. PASSAMONTI. Platform Independent Virtual Laboratory System: Simulation of Gradient Elution HPLC, INTERNATIONAL JOURNAL OF MODELLING \& SIMULATION, 22:148–158, 2002
P. CRESCENZI and G. INNOCENTI. Towards a Taxonomy of Network Protocol Visualization Tools. In Software Visualization, 241–254, 2002
P. CRESCENZI and G. INNOCENTI. Development of an ECB on computer networks based on WWW technologies, resources and usability criteria, International Conference on Computers in Education, 1198–1202, 2002
P. CRESCENZI and N. FALTIN and R. FLEISCHER and C. HUNDHAUSEN and S. NAEHER and G. ROESSLING and J. STASKO and E. SUTINEN. The algorithm animation repository, Second Program Visualization Workshop, 148–16, 2002
A.E.F. CLEMENTI and P. CRESCENZI and P. PENNA and G. ROSSI and P. VOCCA. On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs, Eighteenth Annual Symposium on Theoretical Aspects of Computer Science, 121–131, 2001
A.E.F. CLEMENTI and P. CRESCENZI and A. MONTI and P. PENNA and R. SILVESTRI. On Computing Ad-Hoc Selective Families, Fourth International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization, 211–222, 2001
P. CRESCENZI and X. DENG and C. H. PAPADIMITRIOU. On Approximating a Scheduling Problem, JOURNAL OF COMBINATORIAL OPTIMIZATION, 5:287–297, 2001
P. CRESCENZI and R. SILVESTRI and L. TREVISAN. On Weighted vs Unweighted Versions of Combinatorial Optimization Problems, INFORMATION AND COMPUTATION, 167:10–262, 2001
P. CRESCENZI and B. YENER (eds.). Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 2001
P. CRESCENZI and C. DEMETRESCU and I. FINOCCHI and R. PETRESCHI. Reversible Execution and Visualization of Programs with LEONARDO, JOURNAL OF VISUAL LANGUAGES AND COMPUTING, 11:125–150, 2000
P. CRESCENZI and L. TREVISAN. On Approximation Scheme Preserving Reducibility and Its Applications, THEORY OF COMPUTING SYSTEMS, 33:1–16, 2000
P. CRESCENZI and A. DEL LUNGO and R. GROSSI and E. LODI and L. PAGLI and G. ROSSI. Text Sparsification via Local Maxima, Twentieth Conference on Foundations of Software Technology and Theoretical Computer Science, 290–301, 2000
P. CRESCENZI and G. GAMBOSI and P. PENNA. On-line algorithms for the channel assignment problem in cellular networks, Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication, 1–7, 2000
P. CRESCENZI and V. KANN and R. SILVESTRI and L. TREVISAN. Structure in Approximation Classes, SIAM JOURNAL ON COMPUTING, 28:1759–1782, 1999
P. CRESCENZI and L. TREVISAN. Max NP-completeness Made Easy, THEORETICAL COMPUTER SCIENCE, 225:65–79, 1999
G. AUSIELLO and P. CRESCENZI and V. KANN and G. GAMBOSI and A. MARCHETTI-SPACCAMELA and M. PROTASI. Complexity and Approximation. Combinatorial optimization problems and their approximability properties., Springer Verlag, 1999
A. E. F. CLEMENTI and P. CRESCENZI and G. ROSSI. On the Complexity of Approximating Colored-Graph Problems, Fifth Annual International Conference on Computing and Combinatorics, 281–290, 1999
P. CRESCENZI and L. DARDINI and R. GROSSI. IP Address Lookup Made Fast and Simple, Seventh Annual European Symposium on Algorithms, 65–76, 1999
A. ANDREEV and A. E. F. CLEMENTI and P. CRESCENZI and E. DAHLHAUS and S. {DE AGOSTINO} and J. D. P. ROLIM. The Parallel Complexity of Approximating the High Degree Subgraph Problem, THEORETICAL COMPUTER SCIENCE, 205:261–282, 1998
G. BONGIOVANNI and P. CRESCENZI and G. RAGO. JAZ: Java Algorithm visualiZer. A Multi-Platform Collaborative Tool for Teaching and Testing Graph Algorithms, ”Sixth International Conference in Central Europe on
Computer Graphics and Visualization”, 73–80, 1998
P. CRESCENZI and D. GOLDMAN and C. H. PAPADIMITRIOU and A. PICCOLBONI and M. YANNAKAKIS. On the Complexity of Protein Folding, JOURNAL OF COMPUTATIONAL BIOLOGY, 50:423–466, 1998
P. CRESCENZI and P. PENNA. Strictly-upward Drawings of Ordered Search Trees, THEORETICAL COMPUTER SCIENCE, 203:51–67, 1998
P. CRESCENZI and P. PENNA and A. PIPERNO. Linear area upward drawings of AVL trees, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 93:25–42, 1998
P. CRESCENZI and R. SILVESTRI. Sperner’s Lemma and Robust Machines, COMPUTATIONAL COMPLEXITY, 7:163–173, 1998
P. CRESCENZI and D. GOLDMAN and C. H. PAPADIMITRIOU and A. PICCOLBONI and M. YANNAKAKIS. On the Complexity of Protein Folding, Thirtieth Annual ACM Symposium on the Theory of Computing, 597–603, 1998
P. CRESCENZI. A Short Guide to Approximation Preserving Reductions, Twelfth Annual IEEE Conference on Computational Complexity, 262–273, 1997
P. CRESCENZI and V. KANN. Approximation on the Web: A Compendium of NP Optimization Problems, International Workshop on Randomization and Approximation Techniques in Computer Science, 111–118, 1997
P. CRESCENZI and P. PENNA. Minimum-Area h-v Drawings of Complete Binary Trees, Fifth International Symposium on Graph Drawing, 371–382, 1997
A. D’AMICO and M. GAETA and P. CRESCENZI and P. RENZI. Il teatrino dei numeri: Un programma per la comprensione numerica nell’età evolutiva, Quinto Convegno Nazionale Informatica, Didattica e Disabilità, 58–61, 1997
P. CRESCENZI and L. TREVISAN. On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem, RAIRO. INFORMATIQUE THEORIQUE ET APPLICATIONS, 30:431–441, 1996
D. P. BOVET and A. E. F. CLEMENTI and P. CRESCENZI and R. SILVESTRI. Parallel approximation of optimization problems. In Solving Combinatorial Optimization Problems in Parallel, 7–24, 1996
P. CRESCENZI and P. PENNA. Upward Drawings of Search Trees, Twenty-second International Workshop on Graph-Theoretic Concepts in Computer Science, 114–125, 1996
P. CRESCENZI and R. SILVESTRI and L. TREVISAN. To Weight or Not to Weight: Where is the Question?, Fourth Israel Symposium on Theory of Computing and Systems, 68–77, 1996
A. ANDREEV and A. E. F. CLEMENTI and P. CRESCENZI and E. DAHLHAUS and S. {DE AGOSTINO} and J. D. P. ROLIM. The Parallel Complexity of Approximating the High Degree Subgraph Problem, Sixth International Symposium on Algorithms and Computation, 132–141, 1995
G. AUSIELLO and P. CRESCENZI and M. PROTASI. Approximate Solution of NP Optimization Problems, THEORETICAL COMPUTER SCIENCE, 150:1–55, 1995
G. BONGIOVANNI and P. CRESCENZI and S. DE AGOSTINO. Max Sat and Min Set Cover Approximation Algorithms are P-Complete, PARALLEL PROCESSING LETTERS, 5:293–298, 1995
G. BONGIOVANNI and P. CRESCENZI and C. GUERRA. Parallel Simulated Annealing for Shape Detection, COMPUTER VISION AND IMAGE UNDERSTANDING, 61:60–69, 1995
D. P. BOVET and P. CRESCENZI and R. SILVESTRI. Complexity Classes and Sparse Oracles, JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 50:382–390, 1995
P. CRESCENZI and V. KANN and R. SILVESTRI and L. TREVISAN. Structure in Approximation Classes, First Annual International Conference on Computing and Combinatorics, 539–548, 1995
P. CRESCENZI and C. H. PAPADIMITRIOU. Reversible Simulation of Space-Bounded Computations, THEORETICAL COMPUTER SCIENCE, 143:159–165, 1995
D. P. BOVET and P. CRESCENZI. Introduction to the Theory of Complexity, Prentice Hall, 1994
M. BONUCCELLI and P. CRESCENZI and R. PETRESCHI (eds.). Second Italian Conference on Algorithms and Complexity, 1994
P. CRESCENZI and A. PIPERNO. Optimal-Area Upward Drawings of AVL Trees, International Workshop on Graph Drawing, 307–317, 1994
P. CRESCENZI and L. TREVISAN. Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity, Twentieth International Workshop on Graph-Theoretic Concepts in Computer Science, 130–139, 1994
P. CRESCENZI and L. TREVISAN. On Approximation Scheme Preserving Reducibility and Its Applications, Fourteenth Conference on Foundations of Software Technology and Theoretical Computer Science, 330–341, 1994
P. CRESCENZI and R. SILVESTRI. Average Measure, Descriptive Complexity and Approximation of Maximization Problems, INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 4:15–30, 1993
P. CRESCENZI and R. SILVESTRI. A Note on the Descriptive Complexity of Maximization Problems, INFORMATION PROCESSING LETTERS, 47:11–15, 1993
P. CRESCENZI and R. SILVESTRI. Sperner’s lemma and robust machines, Eighth Structure in Complexity Theory Conference, 194–199, 1993
D. P. BOVET and P. CRESCENZI and R. SILVESTRI. A Uniform Approach to Define Complexity Classes, THEORETICAL COMPUTER SCIENCE, 104:263–283, 1992
P. CRESCENZI and G. DI BATTISTA and A. PIPERNO. A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2:187–200, 1992
D. P. BOVET and P. CRESCENZI. Minimum-Delay Schedules in Layered Networks, ACTA INFORMATICA, 28:453–461, 1991
P. CRESCENZI and C. FIORINI and R. SILVESTRI. A Note on the Approximation of the MAX CLIQUE Problem, INFORMATION PROCESSING LETTERS, 40:1–5, 1991
P. CRESCENZI and A. PANCONESI. Completeness in approximation classes, INFORMATION AND COMPUTATION, 93:241–262, 1991
D. P. BOVET and P. CRESCENZI. Teoria della Complessità Computazionale, Franco Angeli, 1991
D. P. BOVET and P. CRESCENZI and R. SILVESTRI. Complexity Classes and Sparse Oracles, Sixth Structure in Complexity Theory Conference, 102–108, 1991
D. P. BOVET and P. CRESCENZI and M. D. IANNI. Deadlock Prediction in the Case of Dynamic Routing, INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 1:185–200, 1990
P. CRESCENZI and R. SILVESTRI. Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems, INFORMATION PROCESSING LETTERS, 33:221–226, 1990
P. CRESCENZI and A. PANCONESI. Completeness in Approximation Classes, International Conference on Fundamentals of Computation Theory, 116–126, 1989
D.P. BOVET and P. CRESCENZI. An introduction to the theory of computational complexity. In Measures of Complexity, 102–111, 1988