Folgen
Paolo Penna
Paolo Penna
IOG
Bestätigte E-Mail-Adresse bei iohk.io - Startseite
Titel
Zitiert von
Zitiert von
Jahr
On the complexity of computing minimum energy consumption broadcast subgraphs
AEF Clementi, P Crescenzi, P Penna, G Rossi, P Vocca
STACS 2001: 18th Annual Symposium on Theoretical Aspects of Computer Science …, 2001
3022001
On the power assignment problem in radio networks
AEF Clementi, P Penna, R Silvestri
Mobile Networks and Applications 9, 125-140, 2004
2402004
Hardness results for the power range assignment problem in packet radio networks
AEF Clementi, P Penna, R Silvestri
International Workshop on Randomization and Approximation Techniques in …, 1999
2251999
The power range assignment problem in radio networks on the plane
AEF Clementi, P Penna, R Silvestri
STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science …, 2000
1072000
Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks
AEF Clementi, G Huiban, P Penna, G Rossi, YC Verhoeven
Proceedings of the 3rd Workshop on Approximation and Randomization …, 2002
1062002
Topological design, routing, and handover in satellite networks
A Ferreira, J Galtier, P Penna
Handbook of wireless networks and mobile computing, 473-493, 2002
802002
Deterministic truthful approximation mechanisms for scheduling related machines
V Auletta, R De Prisco, P Penna, G Persiano
STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science …, 2004
792004
The minimum range assignment problem on linear radio networks
AEF Clementi, A Ferreira, P Penna, S Perennes, R Silvestri
Algorithms-ESA 2000: 8th Annual European Symposium Saarbrücken, Germany …, 2000
582000
Server placements, Roman domination and other dominating set variants
A Pagourtzis, P Penna, K Schlude, K Steinhöfel, DS Taylor, P Widmayer
Foundations of Information Technology in the Era of Network and Mobile …, 2002
492002
Noisy data make the partial digest problem NP-hard
M Cieliebak, S Eidenbenz, P Penna
International Workshop on Algorithms in Bioinformatics, 111-123, 2003
462003
A worst-case analysis of an MST-based heuristic to construct energy-efficient broadcast trees in wireless networks
AEF Clementi, P Crescenzi, P Penna, G Rossi, P Vocca
Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer …, 2001
442001
Convergence to equilibrium of logit dynamics for strategic games
V Auletta, D Ferraioli, F Pasquale, P Penna, G Persiano
Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011
422011
On-line algorithms for the channel assignment problem in cellular networks
P Crescenzi, G Gambosi, P Penna
Discrete Applied Mathematics 137 (3), 237-266, 2004
392004
Data delivery by energy-constrained mobile agents
J Chalopin, S Das, M Mihal’ák, P Penna, P Widmayer
Algorithms for Sensor Systems: 9th International Symposium on Algorithms and …, 2014
372014
The minimum range assignment problem on linear radio networks
EF Clementi, Penna, Ferreira, Perennes, Silvestri
Algorithmica 35, 95-110, 2003
372003
On the complexity of train assignment problems
T Erlebach, M Gantenbein, D Hürlimann, G Neyer, A Pagourtzis, P Penna, ...
International Symposium on Algorithms and Computation, 390-402, 2001
362001
Optimal collusion-resistant mechanisms with verification
P Penna, C Ventre
Games and Economic Behavior 86, 491-509, 2014
342014
On the approximation ratio of the MST based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks
AK Clementi, G Huiban, G Rossi, YC Verhoeven, P Penna
Proceedings International Parallel and Distributed Processing Symposium, 8 pp., 2003
332003
Energy consumption in radio networks: Selfish agents and rewarding mechanisms
C Ambühl, AEF Clementi, P Penna, G Rossi, R Silvestri
Approximation and Online Algorithms: First International Workshop, WAOA 2003 …, 2004
322004
On computing ad-hoc selective families
AEF Clementi, P Crescenzi, A Monti, P Penna, R Silvestri
International Workshop on Randomization and Approximation Techniques in …, 2001
312001
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20