Pierluigi Crescenzi

Pilu Crescenzi

	2009
77		Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud: Parsimonious flooding in dynamic graphs. PODC 2009: 260-269
76		Pierluigi Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci: On the connectivity of Bluetooth-based ad hoc networks. Concurrency and Computation: Practice and Experience 21(7): 875-887 (2009)
75		Michael Bruce-Lockhart, Pilu Crescenzi, Theodore S. Norvell: Integrating test generation functionality into the Teaching Machine environment. Electr. Notes Theor. Comput. Sci. 224: 115-124 (2009)
	2008
74		Stefano Boschi, Miriam Di Ianni, Pilu Crescenzi, Gianluca Rossi, Paola Vocca: MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks. SimuTools 2008: 38
73		Pilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca: Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. WG 2008: 90-100
	2007
72		Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci: Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings Springer 2007
71		Pilu Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci, Carlo Sandri: On the Connectivity of Bluetooth-Based Ad Hoc Networks. Euro-Par 2007: 960-969
70		Pilu Crescenzi, Carlo Nocentini: Fully integrating algorithm visualization into a cs2 course.: a two-year experience. ITiCSE 2007: 296-300
69		Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger: On-line load balancing made simple: Greedy strikes back. J. Discrete Algorithms 5(1): 162-175 (2007)
	2006
68		Pilu Crescenzi, Michele Loreti, Rosario Pugliese: Assessing CS1 java skills: a three-year experience. ITiCSE 2006: 348
	2005
67		Pilu Crescenzi, Miriam Di Ianni, Alessandro Lazzoni, Paolo Penna, Gianluca Rossi, Paola Vocca: Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. ADHOC-NOW 2005: 4-17
66		Pilu Crescenzi, Giorgio Gambosi, Gaia Innocenti: NetPrIDE an integrated environment for developing and visualizing computer network protocols. ITiCSE 2005: 306-310
	2004
65		Lorenzo Bettini, Pilu Crescenzi, Gaia Innocenti, Michele Loreti, Leonardo Cecchi: An Environment for Self-Assessing Java Programming Skills in Undergraduate First Programming Courses. ICALT 2004
64		Pilu Crescenzi, Giorgio Gambosi, Paolo Penna: On-line algorithms for the channel assignment problem in cellular networks. Discrete Applied Mathematics 137(3): 237-266 (2004)
63		Pilu Crescenzi, Federico Montecalvo, Gianluca Rossi: Optimal covering designs: complexity results and new bounds. Discrete Applied Mathematics 144(3): 281-290 (2004)
62		Pierluigi Crescenzi, Federico Greco: The minimum likely column cover problem. Inf. Process. Lett. 89(4): 175-179 (2004)
61		Pilu Crescenzi, Bülent Yener: Foreword - ACM MONET Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications. MONET 9(2): 99 (2004)
	2003
60		Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger: Online Load Balancing Made Simple: Greedy Strikes Back. ICALP 2003: 1108-1122
59		Pilu Crescenzi, Gaia Innocenti: A tool to develop electronic course books based on WWW technologies, resources and usability criteria. ITiCSE 2003: 163-167
58		Leonardo Cecchi, Pilu Crescenzi, Gaia Innocenti: C : C++ = JavaMM: Java. PPPJ 2003: 75-78
57		Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano: Search Data Structures for Skewed Strings. WEA 2003: 81-96
56		Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi: Text sparsification via local maxima. Theor. Comput. Sci. 1-3(304): 341-364 (2003)
	2002
55		Pierluigi Crescenzi, Gaia Innocenti: Development of an ECB on Computer Networks Based on WWW Technologies, Resources and Usability Criteria. ICCE 2002: 1198-1202
54		Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri: A note on the spatiality degree of graphs. Ars Comb. 63: (2002)
53		Pierluigi Crescenzi, Gianluca Rossi: On the Hamming distance of constraint satisfaction problems. Theor. Comput. Sci. 288(1): 85-100 (2002)
	2001
52		Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri: On Computing Ad-hoc Selective Families. RANDOM-APPROX 2001: 211-222
51		Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. STACS 2001: 121-131
50		Pierluigi Crescenzi, Gaia Innocenti: Towards a Taxonomy of Network Protocol Visualization Tools. Software Visualization 2001: 241-255
49		Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan: On Weighted vs Unweighted Versions of Combinatorial Optimization Problems. Inf. Comput. 167(1): 10-26 (2001)
48		Pierluigi Crescenzi, Xiaotie Deng, Christos H. Papadimitriou: On Approximating a Scheduling Problem. J. Comb. Optim. 5(3): 287-297 (2001)
	2000
47		Pierluigi Crescenzi, Giorgio Gambosi, Paolo Penna: On-line algorithms for the channel assignment problem in cellular networks. DIAL-M 2000: 1-7
46		Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi: Text Sparsification via Local Maxima. FSTTCS 2000: 290-301
45		Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi: Reversible Execution and Visualization of Programs with LEONARDO. J. Vis. Lang. Comput. 11(2): 125-150 (2000)
44		Pierluigi Crescenzi, Luca Trevisan: On Approximation Scheme Preserving Reducibility and Its Applications. Theory Comput. Syst. 33(1): 1-16 (2000)
	1999
43		Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi: On the Complexity of Approximating Colored-Graph Problems. COCOON 1999: 281-290
42		Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi: IP Address Lookup Made Fast and Simple. ESA 1999: 65-76
41		Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan: Structure in Approximation Classes. SIAM J. Comput. 28(5): 1759-1782 (1999)
40		Pierluigi Crescenzi, Luca Trevisan: Max NP-completeness Made Easy. Theor. Comput. Sci. 225(1-2): 65-79 (1999)
	1998
39		Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis: On the complexity of protein folding (abstract). RECOMB 1998: 61-62
38		Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis: On the Complexity of Protein Folding (Extended Abstract). STOC 1998: 597-603
37		Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno: Linear area upward drawings of AVL trees. Comput. Geom. 9(1-2): 25-42 (1998)
36		Pierluigi Crescenzi, Riccardo Silvestri: Sperner's Lemma and Robust Machines. Computational Complexity 7(2): 163-173 (1998)
35		Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis: On the Complexity of Protein Folding. Journal of Computational Biology 5(3): 423-466 (1998)
34		Pierluigi Crescenzi, Paolo Penna: Strictly-upward Drawings of Ordered Search Trees. Theor. Comput. Sci. 203(1): 51-67 (1998)
33		Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim: The Parallel Complexity of Approximating the High Degree Subgraph Problem. Theor. Comput. Sci. 205(1-2): 261-282 (1998)
	1997
32		Pierluigi Crescenzi, Paolo Penna: Minimum-Area h-v Drawings of Complete Binary Trees. Graph Drawing 1997: 371-382
31		Pierluigi Crescenzi: A Short Guide to Approximation Preserving Reductions. IEEE Conference on Computational Complexity 1997: 262-273
30		Pierluigi Crescenzi, Viggo Kann: Approximation on the Web: A Compendium of NP Optimization Problems. RANDOM 1997: 111-118
29		Pierluigi Crescenzi, Luca Trevisan: MAX NP-Completeness Made Easy Electronic Colloquium on Computational Complexity (ECCC) 4(39): (1997)
	1996
28		Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan: To Weight or Not to Weight: Where is the Question? ISTCS 1996: 68-77
27		Daniel P. Bovet, Andrea E. F. Clementi, Pierluigi Crescenzi, Riccardo Silvestri: Parallel approximation of optimization problems. Solving Combinatorial Optimization Problems in Parallel 1996: 7-24
26		Pierluigi Crescenzi, Paolo Penna: Upward Drawings of Search Trees (Extended Abstract). WG 1996: 114-125
25		Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan: Structure in Approximation Classes Electronic Colloquium on Computational Complexity (ECCC) 3(66): (1996)
24		Pierluigi Crescenzi, Luca Trevisan: On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem. ITA 30(5): 431-441 (1996)
	1995
23		Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan: Structure in Approximation Classes (Extended Abstract). COCOON 1995: 539-548
22		Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim: The Parallel Complexity of Approximating the High Degree Subgraph Problem. ISAAC 1995: 132-141
21		Gian Carlo Bongiovanni, Pierluigi Crescenzi, C. Guerra: Parallel Simulated Annealing for Shape Detection. Computer Vision and Image Understanding 61(1): 60-69 (1995)
20		Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri: Complexity Classes and Sparse Oracles. J. Comput. Syst. Sci. 50(3): 382-390 (1995)
19		Gian Carlo Bongiovanni, Pierluigi Crescenzi, Sergio De Agostino: Max Sat and Min Set Cover Approximation Algorithms are P-Complete. Parallel Processing Letters 5: 293-298 (1995)
18		Pierluigi Crescenzi, Christos H. Papadimitriou: Reversible Simulation of Space-Bounded Computations. Theor. Comput. Sci. 143(1): 159-165 (1995)
17		Giorgio Ausiello, Pierluigi Crescenzi, Marco Protasi: Approximate Solution of NP Optimization Problems. Theor. Comput. Sci. 150(1): 1-55 (1995)
	1994
16		Maurizio A. Bonuccelli, Pierluigi Crescenzi, Rossella Petreschi: Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings Springer 1994
15		Pierluigi Crescenzi, Luca Trevisan: On Approximation Scheme Preserving Reducability and Its Applications. FSTTCS 1994: 330-341
14		Pierluigi Crescenzi, Adolfo Piperno: Optimal-Area Upward Drawings of AVL Trees. Graph Drawing 1994: 307-317
13		Pierluigi Crescenzi, Luca Trevisan: Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract). WG 1994: 130-139
	1993
12		Pierluigi Crescenzi, Riccardo Silvestri: Sperner's Lemma and Robust Machines. Structure in Complexity Theory Conference 1993: 194-199
11		Pierluigi Crescenzi, Riccardo Silvestri: A Note on the Descriptive Complexity of Maximization. Inf. Process. Lett. 47(1): 11-15 (1993)
10		Pierluigi Crescenzi, Riccardo Silvestri: Average Measure, Descriptive Complexity and Approximation of Maximization Problems. Int. J. Found. Comput. Sci. 4(1): 15-30 (1993)
	1992
9		Pierluigi Crescenzi, Giuseppe Di Battista, Adolfo Piperno: A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. Comput. Geom. 2: 187-200 (1992)
8		Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri: A Uniform Approach to Define Complexity Classes. Theor. Comput. Sci. 104(2): 263-283 (1992)
	1991
7		Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri: Complexity Classes and Sparse Oracles. Structure in Complexity Theory Conference 1991: 102-108
6		Daniel P. Bovet, Pierluigi Crescenzi: Minimum-Delay Schedules in Layered Networks. Acta Inf. 28(5): 453-461 (1991)
5		Pierluigi Crescenzi, Alessandro Panconesi: Completeness in Approximation Classes Inf. Comput. 93(2): 241-262 (1991)
4		Pierluigi Crescenzi, C. Fiorini, Riccardo Silvestri: A Note on the Approximation of the MAX CLIQUE Problem. Inf. Process. Lett. 40(1): 1-5 (1991)
	1990
3		Pierluigi Crescenzi, Riccardo Silvestri: Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems. Inf. Process. Lett. 33(5): 221-226 (1990)
2		Daniel P. Bovet, Miriam Di Ianni, Pierluigi Crescenzi: Deadlock Prediction in the Case of Dynamic Routing. Int. J. Found. Comput. Sci. 1(3): 185-200 (1990)
	1989
1		Pierluigi Crescenzi, Alessandro Panconesi: Completeness in Approximation Classes. FCT 1989: 116-126

Coauthor Index

1	Sergio De Agostino	[19] [22] [33] [54]
2	Alexander E. Andreev	[22] [33]
3	Giorgio Ausiello	[17]
4	Giuseppe Di Battista	[9]
5	Hervé Baumann	[77]
6	Lorenzo Bettini	[65]
7	Gian Carlo Bongiovanni	[19] [21]
8	Maurizio A. Bonuccelli	[16]
9	Stefano Boschi	[74]
10	Daniel P. Bovet	[2] [6] [7] [8] [20] [27]
11	Michael Bruce-Lockhart	[75]
12	Leonardo Cecchi	[58] [65]
13	Andrea E. F. Clementi	[22] [27] [33] [43] [51] [52]
14	Elias Dahlhaus	[22] [33]
15	Leandro Dardini	[42]
16	Camil Demetrescu	[45]
17	Xiaotie Deng	[48]
18	Irene Finocchi	[45]
19	C. Fiorini	[4]
20	Pierre Fraigniaud	[77]
21	Giorgio Gambosi	[47] [60] [64] [66] [69]
22	Deborah Goldman	[35] [38] [39]
23	Federico Greco	[62] [73]
24	Roberto Grossi	[42] [46] [56] [57]
25	C. Guerra	[21]
26	Miriam Di Ianni	[2] [67] [73] [74]
27	Gaia Innocenti	[50] [55] [58] [59] [65] [66]
28	Giuseppe F. Italiano	[57]
29	Viggo Kann	[23] [25] [30] [41]
30	Alessandro Lazzoni	[67]
31	Elena Lodi	[46] [56]
32	Michele Loreti	[65] [68]
33	Alberto Del Lungo	[46] [56]
34	Federico Montecalvo	[63]
35	Angelo Monti	[52]
36	Gaia Nicosia	[60] [69]
37	Carlo Nocentini	[70] [71] [76]
38	Theodore S. Norvell	[75]
39	Linda Pagli	[46] [56]
40	Alessandro Panconesi	[1] [5]
41	Christos H. Papadimitriou	[18] [35] [38] [39] [48]
42	Paolo Penna	[26] [32] [34] [37] [47] [51] [52] [60] [64] [67] [69]
43	Rossella Petreschi	[16] [45]
44	Antonio Piccolboni	[35] [38] [39]
45	Andrea Pietracaprina	[71] [76]
46	Adolfo Piperno	[9] [14] [37]
47	Giuseppe Prencipe	[72]
48	Marco Protasi	[17]
49	Geppino Pucci	[71] [72] [76]
50	Rosario Pugliese	[68]
51	José D. P. Rolim	[22] [33]
52	Gianluca Rossi	[43] [46] [51] [53] [56] [63] [67] [73] [74]
53	Carlo Sandri	[71]
54	Riccardo Silvestri	[3] [4] [7] [8] [10] [11] [12] [20] [23] [25] [27] [28] [36] [41] [49] [52] [54]
55	Luca Trevisan	[13] [15] [23] [24] [25] [28] [29] [40] [41] [44] [49]
56	Walter Unger	[60] [69]
57	Paola Vocca	[51] [67] [73] [74]
58	Mihalis Yannakakis	[35] [38] [39]
59	Bülent Yener	[61]

Colors in the list of coauthors