The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paolo Penna: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  50. Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. [Citation Graph (, )][DBLP]


  51. Private Capacities in Mechanism Design. [Citation Graph (, )][DBLP]


  52. Optimal collusion-resistant mechanisms with verification. [Citation Graph (, )][DBLP]


  53. An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. [Citation Graph (, )][DBLP]


  54. Interference Games in Wireless Networks. [Citation Graph (, )][DBLP]


  55. Pseudonyms in Cost-Sharing Games. [Citation Graph (, )][DBLP]


  56. Alternatives to Truthfulness Are Hard to Recognize. [Citation Graph (, )][DBLP]


Search in 0.038secs, Finished in 0.042secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002