2009 |
56 | EE | Vincenzo Auletta,
Roberto De Prisco,
Paolo Penna,
Giuseppe Persiano:
The power of verification for one-parameter agents.
J. Comput. Syst. Sci. 75(3): 190-211 (2009) |
55 | EE | Paolo Penna,
Guido Proietti,
Peter Widmayer:
Strongly polynomial-time truthful mechanisms in one shot.
Theor. Comput. Sci. 410(17): 1607-1615 (2009) |
2008 |
54 | EE | Paolo Penna,
Carmine Ventre:
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions.
ESA 2008: 708-719 |
53 | EE | Vincenzo Auletta,
Paolo Penna,
Giuseppe Persiano,
Carmine Ventre:
Alternatives to Truthfulness Are Hard to Recognize.
SAGT 2008: 194-205 |
52 | EE | Vincenzo Auletta,
Luca Moscardelli,
Paolo Penna,
Giuseppe Persiano:
Interference Games in Wireless Networks.
WINE 2008: 278-285 |
2007 |
51 | EE | Angelo Monti,
Paolo Penna,
Riccardo Silvestri:
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem.
WG 2007: 154-165 |
50 | EE | Vincenzo Auletta,
Roberto De Prisco,
Paolo Penna,
Giuseppe Persiano:
Routing selfish unsplittable traffic.
ACM Transactions on Algorithms 3(4): (2007) |
49 | EE | 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 |
48 | EE | Vincenzo Auletta,
Roberto De Prisco,
Paolo Penna,
Giuseppe Persiano,
Carmine Ventre:
New Constructions of Mechanisms with Verification.
ICALP (1) 2006: 596-607 |
47 | EE | Paolo Penna,
Carmine Ventre:
The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms.
STACS 2006: 337-348 |
46 | EE | Paolo Penna,
Guido Proietti,
Peter Widmayer:
Strongly Polynomial-Time Truthful Mechanisms in One Shot.
WINE 2006: 377-388 |
2005 |
45 | EE | 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 |
44 | EE | Paolo Penna,
Carmine Ventre:
Free-Riders in Steiner Tree Cost-Sharing Games.
SIROCCO 2005: 231-245 |
43 | EE | Vincenzo Auletta,
Roberto De Prisco,
Paolo Penna,
Giuseppe Persiano:
On Designing Truthful Mechanisms for Online Scheduling.
SIROCCO 2005: 3-17 |
42 | EE | Christoph Ambühl,
Andrea E. F. Clementi,
Paolo Penna,
Gianluca Rossi,
Riccardo Silvestri:
On the approximability of the range assignment problem on radio networks in presence of selfish agents.
Theor. Comput. Sci. 343(1-2): 27-41 (2005) |
41 | EE | Mark Cieliebak,
Stephan Eidenbenz,
Paolo Penna:
Partial Digest is hard to solve for erroneous input data.
Theor. Comput. Sci. 349(3): 361-381 (2005) |
40 | EE | Gian Carlo Bongiovanni,
Paolo Penna:
XOR-Based Schemes for Fast Parallel IP Lookups.
Theory Comput. Syst. 38(4): 481-501 (2005) |
2004 |
39 | EE | Vincenzo Auletta,
Roberto De Prisco,
Paolo Penna,
Giuseppe Persiano:
The Power of Verification for One-Parameter Agents.
ICALP 2004: 171-182 |
38 | | Giovanna Melideo,
Paolo Penna,
Guido Proietti,
Roger Wattenhofer,
Peter Widmayer:
Truthful Mechanisms for Generalized Utilitarian Problems.
IFIP TCS 2004: 167-180 |
37 | EE | Paolo Penna,
Carmine Ventre:
Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees.
PE-WASUN 2004: 61-68 |
36 | EE | Paolo Penna,
Carmine Ventre:
Sharing the Cost of Multicast Transmissions in Wireless Networks.
SIROCCO 2004: 255-266 |
35 | EE | Vincenzo Auletta,
Roberto De Prisco,
Paolo Penna,
Pino Persiano:
How to route and tax selfish unsplittable traffic.
SPAA 2004: 196-205 |
34 | EE | Vincenzo Auletta,
Roberto De Prisco,
Paolo Penna,
Giuseppe Persiano:
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines.
STACS 2004: 608-619 |
33 | EE | Paolo Penna,
Carmine Ventre:
More Powerful and Simpler Cost-Sharing Methods.
WAOA 2004: 97-110 |
32 | EE | Paolo Penna,
Paola Vocca:
Proximity drawings in polynomial area and volume.
Comput. Geom. 29(2): 91-116 (2004) |
31 | EE | 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) |
30 | EE | Andrea E. F. Clementi,
Paolo Penna,
Riccardo Silvestri:
On the Power Assignment Problem in Radio Networks.
MONET 9(2): 125-140 (2004) |
2003 |
29 | EE | Gian Carlo Bongiovanni,
Paolo Penna:
XOR-Based Schemes for Fast Parallel IP Lookups.
CIAC 2003: 238-250 |
28 | EE | Evangelos Kranakis,
Paolo Penna,
Konrad Schlude,
David Scot Taylor,
Peter Widmayer:
Improving Customer Proximity to Railway Stations.
CIAC 2003: 264-276 |
27 | EE | Pierluigi Crescenzi,
Giorgio Gambosi,
Gaia Nicosia,
Paolo Penna,
Walter Unger:
Online Load Balancing Made Simple: Greedy Strikes Back.
ICALP 2003: 1108-1122 |
26 | EE | Andrea E. F. Clementi,
Gurvan Huiban,
Gianluca Rossi,
Yann C. Verhoeven,
Paolo Penna:
On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks.
IPDPS 2003: 222 |
25 | | Christoph Ambühl,
Andrea E. F. Clementi,
Paolo Penna,
Gianluca Rossi,
Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
SIROCCO 2003: 1-16 |
24 | EE | Mark Cieliebak,
Stephan Eidenbenz,
Paolo Penna:
Noisy Data Make the Partial Digest Problem NP-hard.
WABI 2003: 111-123 |
23 | EE | Christoph Ambühl,
Andrea E. F. Clementi,
Paolo Penna,
Gianluca Rossi,
Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
WAOA 2003: 248-251 |
22 | EE | Andrea E. F. Clementi,
Paolo Penna,
Afonso Ferreira,
Stephane Perennes,
Riccardo Silvestri:
The Minimum Range Assignment Problem on Linear Radio Networks.
Algorithmica 35(2): 95-110 (2003) |
2002 |
21 | | Aris Pagourtzis,
Paolo Penna,
Konrad Schlude,
Kathleen Steinhöfel,
David Scot Taylor,
Peter Widmayer:
Server Placements, Roman Domination and other Dominating Set Variants.
IFIP TCS 2002: 280-291 |
20 | EE | Luzi Anderegg,
Paolo Penna,
Peter Widmayer:
Online train disposition: to wait or not to wait?
Electr. Notes Theor. Comput. Sci. 66(6): (2002) |
19 | EE | Paolo Penna:
On the approximability of two tree drawing conventions.
Inf. Process. Lett. 82(5): 237-242 (2002) |
2001 |
18 | EE | Thomas Erlebach,
Martin Gantenbein,
Daniel Hürlimann,
Gabriele Neyer,
Aris Pagourtzis,
Paolo Penna,
Konrad Schlude,
Kathleen Steinhöfel,
David Scot Taylor,
Peter Widmayer:
On the Complexity of Train Assignment Problems.
ISAAC 2001: 390-402 |
17 | EE | Andrea E. F. Clementi,
Pierluigi Crescenzi,
Angelo Monti,
Paolo Penna,
Riccardo Silvestri:
On Computing Ad-hoc Selective Families.
RANDOM-APPROX 2001: 211-222 |
16 | EE | 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 |
2000 |
15 | EE | Pierluigi Crescenzi,
Giorgio Gambosi,
Paolo Penna:
On-line algorithms for the channel assignment problem in cellular networks.
DIAL-M 2000: 1-7 |
14 | | Andrea E. F. Clementi,
Afonso Ferreira,
Paolo Penna,
Stephane Perennes,
Riccardo Silvestri:
The Minimum Range Assignment Problem on Linear Radio Networks.
ESA 2000: 143-154 |
13 | | Gian Carlo Bongiovanni,
Andrea E. F. Clementi,
Paolo Penna:
A Note on Parallel Read Operations on Large Public Databases.
ICALP Satellite Workshops 2000: 123-134 |
12 | EE | Paolo Penna:
Succinct Representations of Model Based Belief Revision.
STACS 2000: 205-216 |
11 | EE | Andrea E. F. Clementi,
Paolo Penna,
Riccardo Silvestri:
The Power Range Assignment Problem in Radio Networks on the Plane.
STACS 2000: 651-660 |
10 | EE | Alexander E. Andreev,
Andrea E. F. Clementi,
Paolo Penna,
José D. P. Rolim:
Parallel Read Operations Without Memory Contention
Electronic Colloquium on Computational Complexity (ECCC) 7(53): (2000) |
9 | EE | Andrea E. F. Clementi,
Paolo Penna,
Riccardo Silvestri:
On the power assignment problem in radio networks
Electronic Colloquium on Computational Complexity (ECCC) 7(54): (2000) |
1999 |
8 | | Andrea E. F. Clementi,
Paolo Penna,
Riccardo Silvestri:
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks.
RANDOM-APPROX 1999: 197-208 |
7 | EE | Alexander E. Andreev,
Andrea E. F. Clementi,
Paolo Penna,
José D. P. Rolim:
Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines.
STACS 1999: 68-77 |
1998 |
6 | EE | Paolo Penna,
Paola Vocca:
Proximity drawings of binary trees in polynomial area.
CCCG 1998 |
5 | EE | Paolo Penna,
Paola Vocca:
Proximity Drawings: Three Dimensions Are Better than Two.
Graph Drawing 1998: 275-287 |
4 | | Pierluigi Crescenzi,
Paolo Penna,
Adolfo Piperno:
Linear area upward drawings of AVL trees.
Comput. Geom. 9(1-2): 25-42 (1998) |
3 | EE | Pierluigi Crescenzi,
Paolo Penna:
Strictly-upward Drawings of Ordered Search Trees.
Theor. Comput. Sci. 203(1): 51-67 (1998) |
1997 |
2 | | Pierluigi Crescenzi,
Paolo Penna:
Minimum-Area h-v Drawings of Complete Binary Trees.
Graph Drawing 1997: 371-382 |
1996 |
1 | | Pierluigi Crescenzi,
Paolo Penna:
Upward Drawings of Search Trees (Extended Abstract).
WG 1996: 114-125 |