Upward Drawings of Search Trees (Extended Abstract). - Pierluigi Crescenzi; Paolo Penna (WG, 1996)

Minimum-Area h-v Drawings of Complete Binary Trees. - Pierluigi Crescenzi; Paolo Penna (GD, 1997)

Proximity drawings of binary trees in polynomial area. - Paolo Penna; Paola Vocca (CCCG, 1998)

Proximity Drawings: Three Dimensions Are Better than Two. - Paolo Penna; Paola Vocca (GD, 1998)

Linear area upward drawings of AVL trees. - Pierluigi Crescenzi; Paolo Penna; Adolfo Piperno (Comput. Geom., 1998)

Strictly-upward Drawings of Ordered Search Trees. - Pierluigi Crescenzi; Paolo Penna (Theor. Comput. Sci., 1998)

Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks. - Andrea E. F. Clementi; Paolo Penna; Riccardo Silvestri (RANDOM-APPROX, 1999)

Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. - Alexander E. Andreev; Andrea E. F. Clementi; Paolo Penna; José D. P. Rolim (STACS, 1999)

A Note on Parallel Read Operations on Large Public Databases. - Gian Carlo Bongiovanni; Andrea E. F. Clementi; Paolo Penna (ICALP Satellite Workshops, 2000)

The Power Range Assignment Problem in Radio Networks on the Plane. - Andrea E. F. Clementi; Paolo Penna; Riccardo Silvestri (STACS, 2000)

Succinct Representations of Model Based Belief Revision. - Paolo Penna (STACS, 2000)

Parallel Read Operations Without Memory Contention - Alexander E. Andreev; Andrea E. F. Clementi; Paolo Penna; José D. P. Rolim (Electron. Colloquium Comput. Complex., 2000)

On the Complexity of Train Assignment Problems. - Thomas Erlebach; Martin Gantenbein; Daniel Hürlimann; Gabriele Neyer; Aris Pagourtzis; Paolo Penna; Konrad Schlude; Kathleen Steinhöfel; David Scot Taylor; Peter Widmayer (ISAAC, 2001)

On Computing Ad-hoc Selective Families. - Andrea E. F. Clementi; Pierluigi Crescenzi; Angelo Monti; Paolo Penna; Riccardo Silvestri (RANDOM-APPROX, 2001)

On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. - Andrea E. F. Clementi; Pierluigi Crescenzi; Paolo Penna; Gianluca Rossi; Paola Vocca (STACS, 2001)

Server Placements, Roman Domination and other Dominating Set Variants. - Aris Pagourtzis; Paolo Penna; Konrad Schlude; Kathleen Steinhöfel; David Scot Taylor; Peter Widmayer (IFIP TCS, 2002)

Online train disposition: to wait or not to wait? - Luzi Anderegg; Paolo Penna; Peter Widmayer (ATMOS, 2002)

On the approximability of two tree drawing conventions. - Paolo Penna (Inf. Process. Lett., 2002)

Improving Customer Proximity to Railway Stations. - Evangelos Kranakis; Paolo Penna; Konrad Schlude; David Scot Taylor; Peter Widmayer (CIAC, 2003)

Online Load Balancing Made Simple: Greedy Strikes Back. - Pierluigi Crescenzi; Giorgio Gambosi; Gaia Nicosia; Paolo Penna; Walter Unger (ICALP, 2003)

On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. - Andrea E. F. Clementi; Gurvan Huiban; Gianluca Rossi; Yann C. Verhoeven; Paolo Penna (IPDPS, 2003)

Noisy Data Make the Partial Digest Problem NP-hard. - Mark Cieliebak; Stephan J. Eidenbenz; Paolo Penna (WABI, 2003)

Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. - Christoph Ambühl; Andrea E. F. Clementi; Paolo Penna; Gianluca Rossi; Riccardo Silvestri (WAOA, 2003)

The Minimum Range Assignment Problem on Linear Radio Networks. - Andrea E. F. Clementi; Paolo Penna; Afonso Ferreira; Stephane Perennes; Riccardo Silvestri (Algorithmica, 2003)

Truthful Mechanisms for Generalized Utilitarian Problems. - Giovanna Melideo; Paolo Penna; Guido Proietti; Roger Wattenhofer; Peter Widmayer (IFIP TCS, 2004)

Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees. - Paolo Penna; Carmine Ventre (PE-WASUN, 2004)

Sharing the Cost of Multicast Transmissions in Wireless Networks. - Paolo Penna; Carmine Ventre (SIROCCO, 2004)

How to route and tax selfish unsplittable traffic. - Vincenzo Auletta; Roberto De Prisco; Paolo Penna; Pino Persiano (SPAA, 2004)

Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines. - Vincenzo Auletta; Roberto De Prisco; Paolo Penna; Giuseppe Persiano (STACS, 2004)

More Powerful and Simpler Cost-Sharing Methods. - Paolo Penna; Carmine Ventre (WAOA, 2004)

Proximity drawings in polynomial area and volume. - Paolo Penna; Paola Vocca (Comput. Geom., 2004)

On-line algorithms for the channel assignment problem in cellular networks. - Pilu Crescenzi; Giorgio Gambosi; Paolo Penna (Discret. Appl. Math., 2004)

On the Power Assignment Problem in Radio Networks. - Andrea E. F. Clementi; Paolo Penna; Riccardo Silvestri (Mob. Networks Appl., 2004)

Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. - Pilu Crescenzi; Miriam Di Ianni; Alessandro Lazzoni; Paolo Penna; Gianluca Rossi; Paola Vocca (ADHOC-NOW, 2005)

Free-Riders in Steiner Tree Cost-Sharing Games. - Paolo Penna; Carmine Ventre (SIROCCO, 2005)

XOR-Based Schemes for Fast Parallel IP Lookups. - Gian Carlo Bongiovanni; Paolo Penna (Theory Comput. Syst., 2005)

On the approximability of the range assignment problem on radio networks in presence of selfish agents. - Christoph Ambühl; Andrea E. F. Clementi; Paolo Penna; Gianluca Rossi; Riccardo Silvestri (Theor. Comput. Sci., 2005)

Partial Digest is hard to solve for erroneous input data. - Mark Cieliebak; Stephan J. Eidenbenz; Paolo Penna (Theor. Comput. Sci., 2005)

New Constructions of Mechanisms with Verification. - Vincenzo Auletta; Roberto De Prisco; Paolo Penna; Giuseppe Persiano; Carmine Ventre (ICALP (1), 2006)

The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms. - Paolo Penna; Carmine Ventre (STACS, 2006)

An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. - Angelo Monti; Paolo Penna; Riccardo Silvestri (WG, 2007)

On-line load balancing made simple: Greedy strikes back. - Pilu Crescenzi; Giorgio Gambosi; Gaia Nicosia; Paolo Penna; Walter Unger (J. Discrete Algorithms, 2007)

Routing selfish unsplittable traffic. - Vincenzo Auletta; Roberto De Prisco; Paolo Penna; Giuseppe Persiano (ACM Trans. Algorithms, 2007)

Interference Games in Wireless Networks. - Vincenzo Auletta; Luca Moscardelli; Paolo Penna; Giuseppe Persiano (WINE, 2008)

Guest editors' introduction. - Paolo Penna; S. S. Ravi (ACM SIGMOBILE Mob. Comput. Commun. Rev., 2008)

Private Capacities in Mechanism Design. - Vincenzo Auletta; Paolo Penna; Giuseppe Persiano (MFCS, 2009)

Pseudonyms in Cost-Sharing Games. - Paolo Penna; Florian Schoppmann; Riccardo Silvestri; Peter Widmayer (WINE, 2009)

The power of verification for one-parameter agents. - Vincenzo Auletta; Roberto De Prisco; Paolo Penna; Giuseppe Persiano (J. Comput. Syst. Sci., 2009)

On designing truthful mechanisms for online scheduling. - Vincenzo Auletta; Roberto De Prisco; Paolo Penna; Giuseppe Persiano (Theor. Comput. Sci., 2009)

Strongly polynomial-time truthful mechanisms in one shot. - Paolo Penna; Guido Proietti; Peter Widmayer (Theor. Comput. Sci., 2009)

Online Train Disposition: To Wait or Not to Wait? - Luzi Anderegg; Paolo Penna; Peter Widmayer (Robust and Online Large-Scale Optimization, 2009)

Alternatives to truthfulness are hard to recognize. - Vincenzo Auletta; Paolo Penna; Giuseppe Persiano; Carmine Ventre (Auton. Agents Multi Agent Syst., 2011)

A response to "Mechanism Design with Partial Verification and Revelation Principle". - Vincenzo Auletta; Paolo Penna; Giuseppe Persiano; Carmine Ventre (Auton. Agents Multi Agent Syst., 2011)

Reversibility and Mixing Time for Logit Dynamics with Concurrent Updates - Vincenzo Auletta; Diodato Ferraioli; Francesco Pasquale; Paolo Penna; Giuseppe Persiano (CoRR, 2012)

Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. - Paolo Penna; Carmine Ventre (ACM Trans. Comput. Theory, 2012)

Data Delivery by Energy-Constrained Mobile Agents. - Jérémie Chalopin; Shantanu Das 001; Matús Mihalák; Paolo Penna; Peter Widmayer (ALGOSENSORS, 2013)

Logit Dynamics with Concurrent Updates for Local Interaction Games. - Vincenzo Auletta; Diodato Ferraioli; Francesco Pasquale; Paolo Penna; Giuseppe Persiano (ESA, 2013)

Optimal collusion-resistant mechanisms with verification. - Paolo Penna; Carmine Ventre (Games Econ. Behav., 2014)

On Sampling Simple Paths in Planar Graphs According to Their Lengths. - Sandro Montanari; Paolo Penna (MFCS (2), 2015)

Logit Dynamics with Concurrent Updates for Local Interaction Potential Games. - Vincenzo Auletta; Diodato Ferraioli; Francesco Pasquale; Paolo Penna; Giuseppe Persiano (Algorithmica, 2015)

Mechanisms for Scheduling with Single-Bit Private Values. - Vincenzo Auletta; George Christodoulou 001; Paolo Penna (Theory Comput. Syst., 2015)

Imperfect Best-Response Mechanisms. - Diodato Ferraioli; Paolo Penna (Theory Comput. Syst., 2015)

Core-periphery clustering and collaboration networks. - Pierluigi Crescenzi; Pierre Fraigniaud; Zvi Lotker; Paolo Penna (ASONAM, 2016)

On Computing the Total Displacement Number via Weighted Motzkin Paths. - Andreas Bärtschi; Barbara Geissmann; Daniel Graf 001; Tomas Hruz; Paolo Penna; Thomas Tschager (IWOCA, 2016)

Bribeproof Mechanisms for Two-Values Domains. - Matús Mihalák; Paolo Penna; Peter Widmayer (SAGT, 2016)

Convergence to Equilibrium of Logit Dynamics for Strategic Games. - Vincenzo Auletta; Diodato Ferraioli; Francesco Pasquale; Paolo Penna; Giuseppe Persiano (Algorithmica, 2016)

Local Distributed Algorithms for Selfish Agents. - Simon Collet; Pierre Fraigniaud; Paolo Penna (CoRR, 2016)

Sort well with energy-constrained comparisons. - Barbara Geissmann; Paolo Penna (CoRR, 2016)

Sequential Solutions in Machine Scheduling Games. - Paul Giessler; Akaki Mamageishvili; Matús Mihalák; Paolo Penna (CoRR, 2016)

Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games. - Akaki Mamageishvili; Paolo Penna (Oper. Res. Lett., 2016)

Truthful Mechanisms for Delivery with Agents. - Andreas Bärtschi; Daniel Graf 001; Paolo Penna (ATMOS, 2017)

Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy. - Cong Chen 004; Paolo Penna; Yinfeng Xu (COCOA (2), 2017)

Sorting with Recurrent Comparison Errors. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna (ISAAC, 2017)

Energy-Efficient Delivery by Heterogeneous Mobile Agents. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Daniel Graf 001; Jan Hackfeld; Paolo Penna (STACS, 2017)

Truthful Mechanisms for Delivery with Mobile Agents. - Andreas Bärtschi; Daniel Graf 001; Paolo Penna (CoRR, 2017)

No truthful mechanism can be better than n approximate for two natural problems. - Stefano Leucci 001; Akaki Mamageishvili; Paolo Penna (CoRR, 2017)

Equilibria of Games in Networks for Local Tasks. - Simon Collet; Pierre Fraigniaud; Paolo Penna (OPODIS, 2018)

Inversions from Sorting with Distance-Based Errors. - Barbara Geissmann; Paolo Penna (SOFSEM, 2018)

On the approximation guarantee of obviously strategyproof mechanisms. - Diodato Ferraioli; Adrian Meier; Paolo Penna; Carmine Ventre (CoRR, 2018)

No truthful mechanism can be better than n approximate for two natural problems. - Stefano Leucci 001; Akaki Mamageishvili; Paolo Penna (Games Econ. Behav., 2018)

The price of anarchy and stability in general noisy best-response dynamics. - Paolo Penna (Int. J. Game Theory, 2018)

Independent Lazy Better-Response Dynamics on Network Games. - Paolo Penna; Laurent Viennot (CIAC, 2019)

Obviously Strategyproof Mechanisms for Machine Scheduling. - Diodato Ferraioli; Adrian Meier; Paolo Penna; Carmine Ventre (ESA, 2019)

Optimal Sorting with Persistent Comparison Errors. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna (ESA, 2019)

Dual-Mode Greedy Algorithms Can Save Energy. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna; Guido Proietti (ISAAC, 2019)

Exact Recovery for a Family of Community-Detection Generative Models. - Luca Corinzia; Paolo Penna; Luca Mondada; Joachim M. Buhmann (ISIT, 2019)

Automated Optimal OSP Mechanisms for Set Systems - The Case of Small Domains. - Diodato Ferraioli; Adrian Meier; Paolo Penna; Carmine Ventre (WINE, 2019)

Novel Paradigm for the design of Obviously Strategyproof Mechanisms. - Diodato Ferraioli; Adrian Meier; Paolo Penna; Carmine Ventre (ICTCS, 2020)

Online scheduling of jobs with favorite machines. - Cong Chen 004; Paolo Penna; Yinfeng Xu (Comput. Oper. Res., 2020)

Solving Zero-Sum Games through Alternating Projections. - Ioannis Anagnostides; Paolo Penna (CoRR, 2020)

A Robust Framework for Analyzing Gradient-Based Dynamics in Bilinear Games. - Ioannis Anagnostides; Paolo Penna (CoRR, 2020)

Optimal Dislocation with Persistent Errors in Subquadratic Time. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna (Theory Comput. Syst., 2020)

On maximum-likelihood estimation in the all-or-nothing regime. - Luca Corinzia; Paolo Penna; Wojciech Szpankowski; Joachim M. Buhmann (ISIT, 2021)

Two-Way Greedy: Algorithms for Imperfect Rationality. - Diodato Ferraioli; Paolo Penna; Carmine Ventre (WINE, 2021)

Optimal Clustering in Stable Instances Using Combinations of Exact and Noisy Ordinal Queries. - Enrico Bianchi; Paolo Penna (Algorithms, 2021)

Statistical and computational thresholds for the planted k-densest sub-hypergraph problem. - Luca Corinzia; Paolo Penna; Wojciech Szpankowski; Joachim M. Buhmann (AISTATS, 2022)

Improving Explainability of Disentangled Representations using Multipath-Attribution Mappings. - Lukas Klein; João B. S. Carvalho; Mennatallah El-Assady; Paolo Penna; Joachim M. Buhmann; Paul F. Jaeger (MIDL, 2022)

New Constructions of Obviously Strategyproof Mechanisms. - Diodato Ferraioli; Adrian Meier; Paolo Penna; Carmine Ventre (Math. Oper. Res., 2023)

Single-token vs Two-token Blockchain Tokenomics. - Aggelos Kiayias; Philip Lazos; Paolo Penna (CoRR, 2024)

Serial Monopoly on Blockchains with Quasi-patient Users. - Paolo Penna; Manvir Schneider (CoRR, 2024)

Reward Schemes and Committee Sizes in Proof of Stake Governance. - Georgios Birmpas; Philip Lazos; Evangelos Markakis; Paolo Penna (CoRR, 2024)

Sequential solutions in machine scheduling games. - Cong Chen 004; Paul Giessler; Akaki Mamageishvili; Matús Mihalák; Paolo Penna (J. Sched., 2024)

Airdrop Games. - Sotiris Georganas; Aggelos Kiayias; Paolo Penna (CoRR, 2025)