1

O. Akribopoulos, M. Logaras, N. Vasilakis, P. Kokkinos, G. Mylonas, I. Chatzigiannakis and P. Spirakis.
Developing Multiplayer Pervasive Games and Networked Interactive Installations using Ad hoc Mobile Sensor Nets.
In Proc. of the 5th International Conference on Advances in Computer Entertainment Technology (ACE 09), ACM, Vol. 422, pp. 174-181, 2009.
[WP5.3]

E. Altman, P. Nain, and J-C. Bermond.
Distributed storage management of evolving files in delay tolerant ad hoc networks.
In INFOCOM 2009, IEEE, pp. 1431-1439, 2009.
[WP2.2, WP5.2]

C. Àlvarez, A. Duch, M. Serna, D. Thilikos.
Pure Nash equilibria in search games.
Technical report, 2010.
[WP1.3]

C. Alvarez  and M. Serna.
On the proper intervalization of colored caterpillar trees.
Theoretical Informatics and Applications, Vol. 43, pp. 667-686, 2009.
[WP1.5]

J. Alwen, J. Katz, Y. Lindell, G. Persiano, A. Shelat, and I. Visconti.
Collusion-free multiparty computation in the mediated model.
In Proc. of the 29th Annual International Cryptology Conference (CRYPTO 09), LNCS 5677, Springer, pp. 524-540, 2009.
[WP4.3]

 6

O. Amini, L. Esperet, and J. van den Heuvel.
A unified approach to distancetwo colouring of planar graphs.
In Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), ACM, 2009, to appear.
[WP1.1]

 7

O. Amini, F. Mazoit, N. Nisse, and S. Thomassé.
Submodular partition functions.
Discrete Mathematics, 309(20), pp. 6000-6008, 2009.
[WP1.1]

J. Anderson, C. Diaz, J. Bonneau, and F. Stajano.
Privacy-Enabling Social Networking over Untrusted Networks.
In Proc. of the 2nd ACM Workshop on Online Social Networks (WOSN 09), pp. 1-6, 2009.
[WP4.2]

C. M. Angelopoulos and S. Nikoletseas.
Accelerated Sensory Data Collection by Greedy or Aggregate Mobility-based Topology Ranks.
In the Proc. of the 6th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN 2009), pp. 63-70, 2009.
[WP5.3, WP5.2]

C. M. Angelopoulos, S. Nikoletseas and D. Patroumpa.
Studying sink mobility via efficient random walks in wireless sensor networks.
Technical report, 2009.
[WP5.3]

J. Araujo, N. Cohen, F. Giroire, and F. Havet.
Good edge-labelling of graphs.
In Proc. of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 09), Electronic Notes in Discrete Mathematics, Elsevier, 2009, to appear.
[WP1.5]

S. Athanassopoulos.
Efficient algorithms for energy allocation in wireless networks.
PhD Thesis. Department of Computer Engineering and Informatics, University of Patras, Greece, June, 2009.
[WP5.1]

S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, M. Kyropoulou.
An improved approximation bound for spanning star forest and color saving.
In Proc. of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 09), LNCS 5734, Springer, pp. 90-101, 2009.
[WP1.5]

S. Athanassopoulos, Ι. Caragiannis, C. Kaklamanis, and E. Papaioannou.
Energy-efficient communication in multi-interface wireless networks.
In Proc. of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 09), LNCS 5734, Springer, pp. 102-111, 2009.
[WP5.1]

V. Auletta, C. Blundo, and E. De Cristofaro.
HTTP over bluetooth: a J2ME experience.
IARIA International Journal On Advances in Telecommunications, 1(1), pp. 57-66, 2008.
[WP4.3]

V. Auletta, R. De Prisco, P. Penna, and G. Persiano.
On designing truthful mechanisms for online scheduling.
Theoretical Computer Science, 410(36), pp. 3348-3356, 2009.
[WP2.3]

V. Auletta, R. De Prisco, P. Penna, and G. Persiano.
The power of verification for one-parameter agents.
Journal of Computer and System Sciences, 75(3), pp. 190-211, 2009.
[WP2.3]

V. Auletta, P. Penna and G. Persiano.
Private capacities in mechanism design.
In Proc. of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 09), LNCS 5734, Springer, pp. 112-123, 2009.
[WP1.2, WP2.3]

R. N. Balla, J. Nešetřil, and A. Pultr.
Dualities in full homomorphisms.
European Journal of Combinatorics, 31(1), pp. 106-119, 2010.
[WP1.1]

N. Bansal, A. Caprara, K. Jansen, L. Prädel and M. Sviridenko.
A Structural Lemma in 2-Dimensional Packing, and its Implications on Approximability.
In Proc. of the 20th International Symposium on Algorithms and Computation (ISAAC 09), LNCS 5878, Springer, pp. 77-86, 2009.
[WP3.3]

D. Barman, J. Chandrashekar, N. Taft, M. Faloutsos, L. Huang, and F. Giroire.
Debating it monoculture for end host intrusion detection.
In Proc. of the ACM SIGCOMM Workshop on Research on Enterprise Networking (WREN 09), ACM, pp. 27-36, 2009.
[WP2.2]

H. Baumann, P. Crescenzi, and P. Fraigniaud.
Parsimonious Flooding in Dynamic Graphs.
In Proc. of the 28th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 09), ACM, pp. 260-269, 2009.
[WP5.1, WP5.3, WP1.1]

L. Becchetti, P. Boldi, C. Castillo, and A. Gionis.
Efficient Algorithms for Large-Scale Local Triangle Counting.
ACM Transactions on Knowledge Discovery from Data, 2009, to appear.
[WP1.2]

L. Becchetti and E. Koutsoupias.
Competitive analysis of aggregate max in windowed streaming.
In Proc. of the 36th International Colloquium on Automata, Languages and Programming (ICALP 09), LNCS 5556, Springer, pp. 156-170, 2009.
[WP1.2, WP1.5]

P. Berenbrink, C. Cooper, R. Elsässer, T. Radzik, and T. Sauerwald.
Speeding up random walks with neighbourhood exploration.
In Proc. of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 10),
ACM, pp. 1422-1435, 2010.
[WP3.2]

J.-C. Bermond, C.J. Colbourn, L. Gionfriddo, G. Quattrocchi, and I. Sau.
Drop cost and wavelength optimal two-period grooming with ratio 4.
SIAM Journal on Discrete Mathematics, 2010, to appear.
[WP2.2]

J-C. Bermond, M. Cosnard, and S. Pérennes.
Directed acyclic graphs with unique path property.
Technical report, 2009.
[WP1.5]

J-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, H. Rivano, I. Sau, and F. Solano Donado.
MPLS label stacking on the line network.
In IFIP Networking, LNCS 5550, Springer, pp. 809-820, 2009.
[WP2.2]

J-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, and F. Solano Donado.
Designing hypergraph layouts to GMPLS routing strategies.
In Proc. of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO 09), LNCS 5869, Springer, 2009.
[WP2.2]

J-C. Bermond, D. Coudert, and J. Peters.
Online distributed traffic grooming on path networks.
Technical report, 2009. ( Report RR-6833, INRIA, February 2009.)
[WP2.2]

J-C. Bermond, D. Mazauric, and P. Nain.
Algorithmes distribués d'ordonnancement dans les réeseaux sans-fil.
In Proc. of the 10es Journées Doctorales en Informatique et Réseaux (JDIR 09), 2009.
[WP3.3]

J-C. Bermond, X. Muñoz, and I. Sau.
Traffic Grooming in Bidirectional WDM Ring Networks.
Technical report, 2009.
[WP2.2]

J-C. Bermond, N. Nisse, P. Reyes, and H. Rivano.
Fast data gathering in radio grid networks.
In Proc. of the 11es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel 09), 2009.
[WP2.2, WP3.3]

J-C. Bermond, N. Nisse, P. Reyes, and H. Rivano.
Minimum delay data gathering in radio grid networks.
In Proc. of the 8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now 09), LNCS 5793, Springer, pp. 69-82, 2009.
[WP2.2, WP3.3]

O. Bernardi, L. Esperet, M. Pergel, and T. Vyskočil.
On the boxicity of bipartite graphs.
Technical report, 2010.
[WP1.1, WP6.2]

P. Bertasi, M. Bonazza, N. Moretti and E. Peserico.
PariSync: Clock Synchronization in P2P Networks.
In Proc. of the International IEEE Symposium on Precision Clock Synchronization for Measurement,
Control and Communication (ISPCS 09), IEEE, pp. 23-28, 2009.
[WP1.2]

E. Bertino, S. Braghin, F. Paci, A. Squicciarini, and A. Trombetta.
Group-based negotiation in p2p systems.
IEEE Transaction on Parallel and Distributed Systems, 2010, to appear.
[WP4.1]

G. Bilardi, K. Ekanadham, and P. Pattnaik.
On approximating the ideal random access machine by physical machines.
Journal of the ACM, 56(5), pp. 1-55, 2009.
[WP3.2]

G. Bilardi, A. Pietracaprina, G. Pucci, M. Scquizzato, F. Silvestri.
Network-Oblivious Algorithms.
SIAM Journal on Computing, 2010, to appear.
[WP3.2]

V. Bilo, I. Caragiannis, A. Fanelli, M. Flammini, C. Kaklamanis, G. Monaco, and L. Moscardelli.
Game-theoretic approaches to optimization problems in communication networks.
Chapter in Graphs and Algorithms in Communication Networks, A. M. C. Koster and Z. Munioz (eds.), Springer, pp. 241-263, 2009.
[WP1.3]

M. Blesa and M. Weinard.
Stability under FIFO in adversarial Queing: Characterization and linear time algorithms.
Technical report, 2010.
[WP1.4]

C. Blum and M. Blesa.
Solving the KCT Problem: Large-scale Neighborhood Search and Solution Merging.
Optimization Techniques for Solving Complex Problems, chapter 23, pp. 401-415, Viley Inc., 2009.
[WP1.4]

C. Blum, M. López-Ibáñez and M. Blesa.
Beam Search for the Longest Common Subsequence Problem.
Computers & Operations Research}, 36(12), pp. 3178-3186, 2009.
[WP1.5]

C. Blum, M. Yábar-Vallès and M. Blesa.
An ant colony optimization algorithm for DNA sequencing by hybridization.
Computers & Operations Research, 35(11), pp. 3620-3635, 2008.
[WP1.5]

C. Blundo and S. Cimato.
A simple role mining algorithm.
In Proc. of the 25th ACM Symposium On Applied Computing (SAC 10), ACM, pp. 1960-1964, 2010.
[WP4.3]

C. Blundo, S. Cimato, S. De Capitani di Vimercati, A. De Santis, S. Foresti, S. Paraboschi, and P. Samarati.
Managing key hierarchies for access control enforcement: Heuristic approaches.
Computer and Security, 2010, to appear. Preliminary version in Proc. of the 24th IFIP TC 11 International Information Security Conference (SEC 09), IFIP 297, Springer, pp. 364-375, 2009.
[WP4.3]

C. Blundo, V. Iovino, and G. Persiano.
Private-key hidden vector encryption with key confidentiality.
In Proc. of the 8th International Conference on Cryptology and Network Security (CANS 09), LNCS 5888, Springer, pp. 259-277, 2009.
[WP4.3]

D. Bogdanov, R. Jagomagis, S. Laur.
Privacy-preserving Histogram Computation and Frequent Itemset Mining with Sharemind.
Technical report, 2009.
[WP4.3]

D. Bogdanov, R. Sassoon.
Privacy-preserving collaborative filtering with Sharemind.
Technical report, 2008.
[WP4.3]

S. Boschi, P. Crescenzi, M. Di Ianni, C. Nocentini, G. Rossi, and P. Vocca.
MOMOSE A Mobility Model Simulation Environment for Mobile Wireless Ad-hoc Networks.
Technical report, 2009.
[WP5.2, WP5.3]

A. Boukerche, D. Efstathiou and S. Nikoletseas.
Adaptive, Direction-Aware Data Dissemination for Diverse Sensor Mobility.
In Proc. of the 7th ACM/IEEE International Symposium on Mobility Management and Wireless Access Protocols (MobiWac 09), ACM Press, pp. 50-57, 2009.
[WP5.3]

D. Borsetti, C. Casetti, C. Chiasserini, and L. Liquori.
Content Discovery in Heterogeneous Mobile Networks.
In Heterogeneous Wireless Access Networks: Architectures and Protocols, Springer, pp. 419-438, 2008.
[WP5.3]

S. Braghin, G. Baldini, I. Nai Fovino, and A. Trombetta.
Adaptive and Distributed Access Control in Cognitive Radio Networks.
In Proc. of the 24th IEEE International Conference on Advanced Information Networking and Applications (AINA 10), 2010, to appear.
[WP4.1]

A. Buldas, A. Jurgenson, M. Niitsoo.
Efficiency Bounds for Adversary Constructions in Black-Box Reductions.
In Proc. of the 14th Australasian Conference Information Security and Privacy (ACISP 09), LNCS 5594, Springer, pp.264-275, 2009.
[WP4.3]

A. Buldas, S. Laur, M. Niitsoo.
Oracle Separation in the Non-Uniform Model.
In Proc. of the 2009 ProvSec 2009 (ProvSec 09), LNCS 5848, Springer, pp 230-244, 2009.
[WP4.3] 

T. Calamoneri, A. Clementi, E. G. Fusco and R. Silvestri.
Maximizing the number of Broadcast Operations in Random geometric ad-hoc Wireless Networks.
IEEE Transanctions on Parallel and Distributed Systems, 2009, to appear.
[WP5.1]

I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, and H. Rivano.
Fractional path coloring in bounded degree trees with applications.
Algorithmica, 2009, to appear.
[WP1.5, WP2.2]

I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou.
On low-envy truthful allocations.
In Proc. of the 1st International Conference on Algorithmic Decision Theory (ADT 09), LNAI 5783, pp. 111-119, 2009.
[WP2.3]

I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou.
The efficiency of fair division.
In Proc. of the 5th Workshop on Internet and Network Economics (WINE 09), LNCS 5929, Springer, pp. 475-482, 2009.
[WP2.3]

I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, M. Kyropoulou, and E. Papaioannou.
The impact of altruism on the efficiency of atomic congestion games.
In Proc. of the 5th Symposium on Trustworthy Global Computing (TGC 10), LNCS, Springer, 2010, to appear.
[WP1.3]

I. Caragiannis, C. Kaklamanis, N. Karanikolas, and A. D. Procaccia.
Socially desirable approximations for Dodgson's voting rule.
Technical report, 2010.
[WP2.3]

J. Chalopin and V. Chepoi and N. Nisse and Y. Vaxès.
Cop and robber games when the robber can hide and ride.
Technical report, 2010.
[WP1.5]

I. Chatzigiannakis, C. Koninis, G. Mylonas, U. Colesanti, A. Andrea.
A Peer-to-Peer Framework for Globally-Available Sensor Networks and its Application in Building Management.
In Proc. of the 2nd International Workshop on Sensor Network Engineering (IWSNE 09), 2009.
[WP5.1]

R. Chowdhury, F. Silvestri, B. Blakeley, and V. Ramachandram.
Oblivious Algorithms for Multicores and Networks of Processors.
In Proc. of the 24th  IEEE International Parallel and Distributed Processing Symposium (IPDPS 10), 2010, to appear.
[WP3.2]

V. Ciancaglini, L. Liquori, L. Vanni.
CarPal: interconnecting overlay networks for a community-driven shared mobility.
In Proc. of the 5th Symposium on Trustworthy Global Computing (TGC 10), LNCS, Springer, 2010, to appear.
[SP6]

T. Cinkler, D. Coudert, M. Flammini, G. Monaco, L. Moscardelli, X. Mu~noz, I. Sau, M. Shalom, and S. Zaks.
Traffic Grooming: Combinatorial Results and Practical Resolutions.
Chapter in Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks, volume XXVII of EATCS Texts in Theoretical Computer Science, Springer, pp. 63-94, 2009.
[WP2.2]

A. Clementi, A. Monti, F. Pasquale, and R. Silvestri.
Broadcasting in Dynamic Radio Networks. 
Journal of Computer and System Sciences, 75(4), pp. 213-230, 2009. 
[WP5.3, WP1.1, WP1.5]

A. Clementi, A. Monti, F. Pasquale, and R. Silvestri.
Information Spreading in Stationary Markovian Evolving Graphs.
In Proc. of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS 09), IEEE, pp. 1-12, 2009.
[WP5.3, WP5.1, WP1.1]

A. Clementi, F. Pasquale, and R. Silvestri.
MANETS: High mobility can make up for low transmission power.
In Proc. of the 36th International Colloquium on Automata, Languages and Programming (ICALP 09), LNCS 5556, Springer, pp. 387-398, 2009.
[WP5.1, WP5.3, WP1.1]

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse.
Trade-offs when optimizing lightpaths reconfiguration in WDM networks.
Technical report, 2009. (Technical Report RR-7047, INRIA, September 2009.)
[WP2.2]

N. Cohen, F. V. Fomin, G. Gutin, E. J. Kim, S. Saurabh, and A. Yeo.
Algorithm for finding vertex out-trees and its application to internal out-branching problem.
In COCOON 09, pp. 37-46, 2009.
[WP1.1]

N. Cohen and F. Havet.
Planar graphs with maximum degree Δ9 are (Δ+1)-edge-choosable.
Technical report, 2009.
[WP1.1]

N. Cohen, F. Havet, and T. Muller.
Acyclic edge-colouring of planar graphs.
In Proc. of the 2009 European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 09), Vol. 34, pp. 417-421, 2009.
[WP1.1]

D. Coudert, F. Giroire, and I. Sau.
Edge-simple circuits through 10 ordered vertices in square grids.
In Proc. of the 20th International Workshop on Combinatorial Algorithms (IWOCA 09), LNCS 5874, Springer, pp. 134-145, 2009.
[WP1.1]

D. Coudert, F. Huc, and D. Mazauric.
Computing and updating the process number in trees.
In Proc. of the 12th International Conference On Principles Of Distributed Systems (OPODIS 09), LNCS 5401, Springer, pp. 546-550, 2008.
[WP2.2]

D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J-S. Sereni.
Reconfiguration dans les réseaux optiques.
In Proc. of the 11es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 09), pp. 25-28, 2009.
[WP2.2]

D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J-S. Sereni.
Reconfiguration of the routing in WDM networks with two classes of services.
In Proc. of the 13th Conference on Optical Network Design and Modeling (ONDM 09), IEEE, 2009.
[WP2.2]

D. Coudert, D. Mazauric, and N. Nisse.
On rerouting connection requests in networks with shared bandwidth.
In Proc. of the DIMAP workshop on Algorithmic Graph Theory (AGT 09), Vol. 32 of Electronic Notes in Discrete Mathematics, Elsevier, pp. 109-116, 2009.
[WP1.5, WP2.2]

D. Coudert, N. Nepomuceno, and H. Rivano.
Joint optimization of routing and radio configuration in fixed wireless networks.
In Proc. of the 11es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 09), pp. 49-52, 2009.
[WP2.2, WP5.3]

D. Coudert, N. Nepomuceno, and H. Rivano.
Minimizing energy consumption by Power-Efficient radio configuration in fixed broadband wireless networks.
In Proc. of the 1st IEEE WoWMoM Workshop on Hot Topics in Mesh Networking (HotMESH 09), IEEE, 2009.
[WP2.2, WP5.3]

D. Coudert and N. Nepomuceno and H. Rivano.
Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks.
Computer Communications, 2010, to appear.
[WP2.2, WP5.3]

P. Crescenzi, M. Di Ianni, A. Marino, D. Merlini, G. Rossi, and P. Vocca.
Manhattan Path Based RWP Mobility Models: Spatial Node Distribution and Smooth Movement.
Technical report, 2009.
[WP1.1, WP5.1, WP5.2, WP5.3]

P. Crescenzi, M. Di Ianni, A. Marino, G. Rossi, and P. Vocca.
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.
In Proc. of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO 09), 2009, to appear.
[WP1.1, WP5.1, WP5.2, WP5.3]

O. Dalle, F. Giroire, J. Monteiro, and S. Pérennes.
Analyse des corrélations entre pannes dans les systémes de stockage pair-à-pair.
In Proc. of the 11es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (Algotel 09), 2009. (Best Student Paper Award.)
[WP2.2]

O. Dalle, F. Giroire, J. Monteiro, and S. Pérennes.
Analysis of failure correlation impact on peer-to-peer storage systems.
In Proc. of the 9th IEEE International Conference on Peer-to-Peer Computing (P2P 09), pp. 184-193, 2009.
[WP2.2]

G. Danezis, C. Diaz, E. Käsper and C. Troncoso.
The wisdom of Crowds: attacks and optimal constructions.
In Proc. of the 14th European Symposium on Research in Computer Security (ESORICS 09), pp. 406-423, 2009.
[WP4.2]

G. Danezis and C. Troncoso.
Vida: How to use Bayesian inference to de-anonymize persistent communications.
In Proc. of the 9th International Symposium on Private Enhancing Technologies (PETS 09), LNCS 5672, Springer, pp. 56 - 72, 2009.
[WP4.2]

Y. De Mulder, K. Wouters, and B. Preneel.
Anonymous ID-based Group Key Agreement Scheme applied in Virtual Private Ad Hoc Networks.
In Proc. of the 3rd Benelux Workshop on Information and System Security (WISSec 08), 2008.
[WP4.2] 

Y. Desmedt, H. Lipmaa and D. Hieu Phan.
Hybrid Damgard Is CCA1-Secure under The DDH Assumption.
In Proc. of the 7th International Conference on Cryptology and Network Security (CANS 08), LNCS 5339, Springer, pp 18-30, 2008.
[WP4.3]

G. Di Crescenzo and H. Lipmaa.
3-Message NP Arguments in The BPK Model with Optimal Soundness And Zero-Knowledge.
In Proc. of the  19th International Symposium on Algorithms and Computation (ISAAC 08), LNCS 5369, Springer, pp. 616-628, 2008.
[WP4.3]

C. Diaz, E. Kosta, H. Dekeyser, M. Kohlweiss, and G. Nigusse.
Privacy Preserving Electronic Petitions.
Journal of Identity in the Information Society, Vol. 1(1), pp. 203-219, 2008.
[WP4.2]

J. Diaz, M. Serna and D. Thilikos.
Efficient algorithms for counting parameterized list H-Colorings.
Journal of Computer and System Sciences, 74(5), pp. 919-937, 2008.
[WP1.5]

F. Diedrich and K. Jansen.
Improved approximation algorithms for scheduling with fixed jobs.
In Proc. of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA 09), ACM, pp. 675-684, 2009.
[WP3.3]

F. Diedrich, K. Jansen, U. M. Schwarz and D. Trystram
A survey on approximation algorithms for scheduling with machine unavailability.
In Proc. of Algorithmics of Large and Complex Networks 2009, LNCS 5515, Springer, pp. 50-64, 2009.
[WP3.3]

B. Doerr, T. Friedrich, M. Künnemann, and T. Sauerwald.
Quasirandom rumor spreading: An experimental analysis.
In Proc. of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX 09), SIAM, pp. 145-153, 2009.
[WP3.2]

B. Doerr, T. Friedrich, and T. Sauerwald.
Quasirandom rumor spreading: Expanders, push vs. pull, and robustness.
In Proc. of the 36th International Colloquium on Automata, Languages and Programming (ICALP 09), LNCS 5556, Springer, pp. 366-377, 2009.
[WP3.2]

M. Dramitinos and I. Guérin Lassous.
Auction-based Bandwidth Allocation Mechanisms for Wireless Future Internet.
Technical report, 2010.
[WP1.5, WP2.2, WP5.1]

M. Dramitinos, R. Vannier and I. Guérin Lassous.
A Performance Evaluation Framework for Fair Solution in Ad-Hoc Networks.
In Proc. of the 12th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 09), 2009, to appear.
[WP1.5, WP5.1]

M. Drosou and E. Pitoura.
Comparing Diversity Heuristics.
Technical report, 2009.
[WP2.1]

M. Drosou and E. Pitoura.
Diversity over Continuous Data.
IEEE Data Engineering Bulletin, 32(4), pp. 49-56, 2009.
[WP2.1]

M. Drosou, K. Stefanidis and E. Pitoura.
Preference-Aware Publish/Subscribe Delivery with Diversity.
In Proc. of the 3rd ACM International Conference on Distributed Event-Based Systems (DEBS 09), ACM, Article no. 6, 2009. 
[WP2.1]

D. Efstathiou, A. Koutsopoulos, and S. Nikoletseas.
Energy efficient, direction aware routing in wireless sensor networks.
Technical report, 2010.
[WP5.1]

D. Efstathiou and S. Nikoletseas.
Efficient detection of a mobile sink with lightweight flooding.
Technical report, 2009.
[WP5.3]

N. Eggemann, F. Havet, and S. Noble.
k-l(2,1)-labelling for planar graphs is NP-complete for k>=4.
Discrete Applied Mathematics, 2010, to appear.
[WP1.1]

R. Elsässer, T. Sauerwald.
Cover Time and Broadcast Time.
In Proc. of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS 09), pp. 373-384, 2009.
[WP3.2]

R. Elsässer and T. Sauerwald.
Tight bounds for the cover time of multiple random walks.
In Proc. of the 36th International Colloquium on Automata, Languages and Programming (ICALP 09), LNCS 5556, Springer, pp. 415-426, 2009.
[WP3.2]

L. Esperet, J. Gimbel, and A. King.
Covering line graphs with equivalence relations.
Technical report, 2009.
[WP1.1]

L. Esperet, D. Gonçalves, and A. Labourel.
Coloring a set of touching strings.
In Proc. 5th European Conference on Combinatorics, Graph Theory, and Applications (EuroComb 09), 2009.
[WP1.1]

L. Esperet, F. Kardoš, and D. Kráľ.
Cubic bridgeless graphs have more than a linear number of perfect matchings.
In Proc. 5th European Conference on Combinatorics, Graph Theory, and Applications (EuroComb 09), 2009. Also in: Electronic Notes on Discrete Mathematics, 34, pp. 411-415, 2009.
[WP1.1]

L. Esperet, F. Kardoš, and R. Škrekovski.
Seagulls in planar graphs.
Technical report, 2009.
[WP1.1]

L. Esperet, D. Kráľ, P. Škoda, and R. Škrekovski.
An improved linear bound on the number of perfect matchings in cubic graphs.
Technical report, 2008.
[WP1.1]

R. Feldmann, M. Mavronicolas, B. Monien.
Nash Equilibria for Voronoi Games on Transitive Graphs.
In Proc. of the 5th International Workshop on Internet and Network Economics (WINE 09), LNCS 5929, Springer, pp. 280-291, 2009.
[WP1.3]

L. Filipponi, A. Vitaletti, I. Chatzigiannakis, G. Mylonas.
WSNFuse: accessing Wireless Sensor Networks as a Filesystem.
Technical report, 2010.
[WP6.3, WP5.1]

F. V. Fomin and P. A. Golovach and J. Kratochvi­l and N. Nisse and K. Suchan.
Pursuing a fast robber on a graph.
Theoretical Computer Science, 2010, to appear.
[WP1.5]

J. Foniok, J. Nešetřil, A. Pultr, and C. Tardiff.
Dualities and pairs in heyting algebras.
Technical report, 2010.
[WP1.1]

J. Foniok, J. Nešetřil, and C. Tardiff.
Interlacing adjoints on directed graphs.
Technical report, 2010.
[WP1.1]

J. Foniok, J. Nešetřil, and C. Tardiff.
Path homomorphisms, graphs coloring and boolean matrices.
Journal of Graph Theory, 2010, to appear.
[WP1.1]

D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, and P. Spirakis. 
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.
Theoretical Computer Science, 410(36), pp. 3305-3326, 2009.
[WP1.3]

P. Fraigniaud and N. Nisse.
Monotony properties of connected visible graph searching.
Information and Computation, 206(12), pp. 1383-1393, 2008.
[WP1.5]

J. Freixas, X. Molinero, M. Olsen, M. Serna.
On the complexity of problems on simple games.
Technical report, 2009.
[WP1.3]

T. Friedrich and T. Sauerwald.
Near-perfect load balancing by randomized rounding.
In Proc. of the 41st ACM Symposium on Theory of Computing (STOC 09), ACM, pp. 121-130, 2009.
[WP3.2]

T. Friedrich, T. Sauerwald, and D. Vilenchik.
Smoothed analysis of balancing networks.
In Proc. of the 36th International Colloquium on Automata, Languages and Programming (ICALP 09), LNCS 5556, Springer, pp. 472-483, 2009.
[WP3.2]

J. Gabarro, A. Garcia and M.Serna.
The complexity of game equivalence under local isomorphism.
Technical report, 2010.
[WP1.3]

J. Gabarro, A. Garcia, M.Serna.
The complexity of game isomorphism.
Technical report, 2009.
[WP1.3]

J. Gabarro, P. Kilpatrick, M. Serna and A. Stewart.
Stressed web environments as strategic games: Risk profiles and Weltanschauungs.
Technical report, 2010.
[WP1.4, WP1.3]

J. Gehweiler and H. Meyerhenke.
A distributed diffusive heuristic for clustering a virtual p2p supercomputer.
Technical report, 2010.
[WP3.2]

C. Georgiou, T. Pavlides, and A. Philippou.
Selfish Routing in the Presence of Network Uncertainty.
Parallel Processing Letters, Vol. 19, No. 1, pp. 141-157, 2009.
[WP 1.3]

 P. Giotakis.
Erasure Coding for XML Documents in P2P Systems.
Master Thesis. Technical Report MT-2009-26. Department of Computer Science, University of Ioannina, Greece.
[WP2.1]

F. Giroire.
Order statistics and estimating cardinalities of massive data sets.
Discrete Applied Mathematics, 157(2), pp. 406-427, 2009.
[WP1.5]

F. Giroire, J. Monteiro, and S. Pérennes.
P2P storage systems: How much locality can they tolerate?
In Proc. of the 34th IEEE Conference on Local Computer Networks (LCN 09), pp. 320-323, 2009.
[WP2.2]

C. Gomes and J. Galtier.
Optimal and fair transmission rate allocation problem in multi-hop cellular networks.
In Proc. of the 8th International Conference on AD-HOC Networks & Wireless (ADHOC-NOW 09), LNCS 5793, Springer, pp. 327-340, 2009.
[WP5.1]

C. Gomes, S. Pérennes, and H. Rivano.
Bottleneck analysis for routing and call scheduling in multi-hop wireless networks.
In Proc. of the 4th IEEE Workshop on Broadband Wireless Access (BWA 08), 2008.
[WP2.2, WP5.1]

D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé.
Spanning galaxies in digraphs.
In Proc. of the 2009 European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 09), Vol. 34, pp. 139-143, 2009.
[WP1.1]

 134

T. Heinis.
Workflow-based services: infrastructure for scientific applications.
PhD dissertation, ETH, 2009.
[WP3.4]

F. Havet, S. Jendrol', R. Soták, and E. Skrabul'aková.
Facial non-repetitive edge-colouring of plane graphs.
Technical report, 2009. (Research Report 6873, INRIA, March 2009.)
[WP1.1]

F. Havet and S. Thomassé.
Complexity of (p,1)-total labelling.
Dicrete Applied Mathematics, 157, pp. 2859-2870, 2009.
[WP1.1]

S. Holder.
Replication in Unstructured Networks with Availability Constraints.
Master's Thesis, Saarland University and Max-Planck Institute for Informatics, Saarbrücken, Germany, 2008.
[WP3.1]

F. Honsell, M. Lenisa, L. Liquori, and I. Scagnetto.
A conditional logical framework.
In Proc. of the 3rd International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 08), LNCS 5330, Springer, pp. 143-157, 2008.
[WP2.1]

J. Hubička and J. Nešetřil.
Homomorphism and embedding universal structures for restricted classes.
Technical report, 2010.
[WP1.1]

J. Hubička and J. Nešetřil.
On characterization of homomorphism and embedding universal graphs.
Technical report, 2010.
[WP1.1]

F. Huc, A. Jarry, P. Leone, J. Rolim, L. Moraru, S. Nikoletseas.
Early Obstacle Detection and Avoidance for All to All Traffic Pattern in Wireless Sensor Networks.
In Proc. of the 5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 09), LNCS 5804, Springer, pp. 102-115, 2009. 
[WP5.2]

F. Huc, C. Caillouet, N. Nisse, S. Pérennes, and H. Rivano.
Stability of a localized and greedy routing algorithm.
In Proc. of the 12th Workshop on Advances in Parallel and Distributed Computational Models (APDCM 10), 2010, to appear.
[WP2.2]

D. Ilcinkas, N. Nisse, and D. Soguet.
The cost of monotonicity in distributed graph searching.
Distributed Computing, 22(2), pp. 117-127, 2009.
[WP1.5]

K. Jansen.
An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables.
In Proc. of the 36th International Colloquium on Automata, Languages and Programming (ICALP 09), LNCS 5555, Springer pp. 562-573, 2009.
[WP3.3]

K. Jansen.
Parameterized approximation scheme for the multiple knapsack problem.
In Proc. of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA 09), ACM, pp. 665-674, 2009. Also, in: SIAM Journal on Computing, 2010, to appear.
[WP3.3]

K. Jansen and M. Mastrolilli.
Scheduling unrelated parallel machines: linear programming strikes back.
Technical report, 2009.
[WP3.3]

K. Jansen and C. Otte.
Approximation Algorithms for Multiple Strip Packing.
In Proc. of the 7th Workshop on Approximation and Online Algorithms (WAOA 09), LNCS, Springer, 2009, to appear.
[WP3.3]

K. Jansen and L. Prädel.
How to maximize the total area of rectangles packed into a rectangle?
Technical report, 2009.
[WP3.3]

K. Jansen, L. Prädel and U. M. Schwarz.
Two for One: Tight approximation of 2D Bin Packing.
In Proc. of the 20th  Workshop on Algorithms and Data Structures (WADS 09), LNCS 5664, Springer, pp. 399-410, 2009.
[WP3.3]

K. Jansen and R. Solis-Oba.
Approximation algorithms for scheduling jobs with chain precedence constraints.
International Journal of Foundations of Computer Science, 2009, to appear.
[WP3.3]

K. Jansen and R. Solis-Oba.
Rectangle packing with one-dimensional resource augmentation.
Discrete Optimization, Vol. 6, pp. 310-323, 2009.
[WP3.3]

T. Kaiser, A. King, and D. Kráľ.
Fractional total colourings of graphs of high girth.
KAM-Serie 2009-944, Charles University, Prague, 2009.
[WP1.1]

M. Kalochristianakis, V. Gkamas, G. Mylonas, S. Nikoletseas, J. Rolim, E. Varvarigos.
An Open and Integrated Management Platform for Wireless Sensor Networks.
In Proc. of the 9th International Symposium on Autonomous Decentralized Systems (ISADS 09), IEEE, pp. 495-498, 2009.
[WP5.3]

M. Karagiannis, I. Chatzigiannakis, J. Rolim.
WSNGE: A Platform for Simulating Complex Wireless Sensor Networks Supporting Rich Network Visualization and Online Interactivity.
In Proc. of the 42nd Annual ACM/IEEE Simulation Symposium (ANSS 09), SCS/ACM 2009.
[WP5.2]

N. Karanikolas.
Computational issues in social choice: a study of Dodgson elections.
MSc thesis, Dept. of Computer Engineering and Informatics, University of Patras, 2008.
[WP1.5, WP2.3]

S. Khalfallah, C. Sarr, I. Guérin Lassous.
Dynamic Bandwidth Management in IEEE 802.11-Based Multihop Wireless Networks.
Technical report, 2010.
[WP1.5, WP2.2, WP5.1]

157

A. Kinalis and S. Nikoletseas.
Adaptive Data Dissemination in Mobile Sensor Networks.
Journal of Interconnection Networks, 2009, to appear.
[WP5.3]

A. Kinalis, S. Nikoletseas, D. Patroumpa and J. Rolim.
Biased Sink Mobility with Adaptive Stop Times for Low Latency Data Collection in Sensor Networks.
In Proc. of the 52nd IEEE International Global Communications Conference (GLOBECOM 09), 2009.
[WP5.3]

A. Kirsch, M. Mitzenmacher, A. Pietracaprina, G. Pucci, E. Upfal, and F. Vandin.
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets.
In Proc. of 28th ACM-PODS, ACM, pp. 117-126, 2009.
[WP1.2]

M. Kirschner, P. Schengbier, T. Tscheuschner.
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games.
In Proc. of the 8th International Symposium on Experimental Algorithms (SEA 09), LNCS 5526, Springer, pp. 173-184, 2009.
[WP3.1]

G. Koloniari.
Indexing and Clustering for Efficient Query Evaluation in peer-to-peer Systems.
PhD Thesis. Technical Report PD-2009-3. Department of Computer Science, University of Ioannina, Greece, July 2009.
[WP2.1]

G. Koloniari and E. Pitoura.
Structural Relaxation over Distributed Collections of XML Documenst.
Technical report, 2009.
[WP2.1]

D. Kráľ, E. Máčajová, J. Mazák, and J.-S. Sereni.
Circular edge-colorings of cubic graphs with girth six.
Electronic Notes Discrete Mathematics, 34, pp. 525- 529, 2009.
[WP1.1]

M. Kyropoulou.
Fairness issues in allocation problems for goods and chores.
MSc thesis, Dept. of Computer Engineering and Informatics, University of Patras, 2010.
[WP2.3]

P. Laud, M. Roos.
Formal Analysis of the Estonian Mobile-ID Protocol.
In Proc. of the 14th Nordic Conference on Secure IT Systems (Nordsec 09), LNCS 5838, Springer, pp. 271-286, 2009.
[WP4.1]

P. Laud, I. Tsahhirov.
A user interface for a game-based protocol verification tool.
In Proc. of the 6th International Workshop on Formal Aspects in Security and Trust (FAST 09), 2009.
[WP4.1]

P. Leone, S. Nikoletseas and J. Rolim.
Stochastic Models and Adaptive Algorithms for Energy Balance in Sensor Networks.
Theory of Computing, 2009, to appear.
[WP5.1, WP5.2]

Z. Li and I. Sau.
Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph.
In Proc. of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 09), LNCS 5911, Springer, pp. 250-261, 2010. (Best student paper award)
[WP2.2] 

H. Lipmaa.
First CPIR Protocol with Data-Dependent Computation.
In Proc. of the 12th International Conference of Information Security ad Cryptology (ICISC 09), LNCS 5984, Springer, 2009.
[WP4.3]

H. Lipmaa.
New Communication-Efficient Oblivious Transfer Protocols Based on Pairings.
In Proc. of the 2008 Information Security Conference (ISC 08), LNCS 5222, Springer, pp 441-454, 2008.
[WP4.3]

H. Lipmaa and B. Zhang.
Efficient Generalized Selective Private Function Evaluation with Applications in Biometric Authentication.
In Proc. of the 5th China International Conference on Information Security and Cryptology (Inscrypt 09), 2009.
[WP4.3]

L. Liquori, C. Tedeschi, and F. Bongiovanni.
Babelchord: a social tower of DHT-based overlay networks.
In Proc. of the 2009 IEEE Symposium on Computers and Communications (ISCC 09), pp. 307-312, 2009.
[WP2.1]

L. Liquori, C. Tedeschi, L. Vanni, F. Bongiovanni, V. Ciancaglini, and B. Marinkovic.
Synapse: A Scalable Protocol for Interconnecting Heterogeneous Overlay Networks.
In Proc. of the 9th International Conference on Networking, LNCS, Springer, 2010, to appear.
[SP6]

F. M. Manshade.
Fast Distributed Algorithm for Replication in Unstructured P2P Networks.
Master's Thesis, Saarland University and Max-Planck Institute for Informatics, Saarbrücken, Germany, 2009.
[WP3.1]

J-C. Maureira, D. Dujovne, and O. Dalle.
Generation of realistic 802.11 interferences in the Omnet++ INET framework based on real traffic measurements.
In Proc. of the 2nd International Workshop on Omnet++, 2009.
[WP5.3]

J-C. Maureira, D. Dujovne, and O. Dalle.
Network Provisioning for High Speed Vehicles Moving along Predictable Routes - Part 1: Spiderman Handover.
Technical report, 2009. (Research Report RR-6850, INRIA, April 2009.)
[WP5.3]

J-C. Maureira, P. Uribe, O. Dalle, T. Asahi, and J. Amaya.
Component based approach using omnet++ for train communication modeling.
In Proc. of the of 9th International Conference on ITS Telecommunication, 2009.
[SP6]

M. Mavronicolas, V. Papadopoulou, A. Philippou and P. Spirakis.
A Graph-Theoretic Network Security Game.
International Journal of Autonomous and Adaptive Communications Systems, Vol. 1, No. 4 pp. 390-410, 2008.
[WP 1.4] 

M. Mavronicolas and A. Pieris.
The Cubic Maximum Social Cost Verifies the Fully Mixed Nash Equilibrium Conjecture.
Technical report, 2009.
[WP1.5]

M. Mavronicolas, T. Sauerwald.
A Randomized, O(log w)-Depth 2-Smoothing Network.
In Proc. of the 21st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 09), ACM, pp. 178-187, 2009.
[WP2.3, WP3.2, WP3.3]

H. Meyerhenke, B. Monien, S. Schamberger.
Graph Partitioning and Disturbed Diffusion.
Parallel Computing, 2010, to appear.
[WP3.2]

C. Molle, F. Peix, S. Pérennes, and H. Rivano.
Optimal routing and call scheduling in wireless mesh networks with localized information.
In Proc. of the 4th Symposium on Trustworthy Global Computing (TGC 08), LNCS 5474, Springer, pp. 171-185, 2008.
[WP2.2, WP5.2]

C. Molle and M-E. Voge.
Effects of the acknowledgment traffic on the capacity of wireless mesh networks.
In Proc. of the 69th IEEE Vehicular Technology Conference (VTC 09-Spring), 2009.
[WP2.2, WP5.1]

L. Moraru.
Geographic routing with obstacle detection and svoidance in wireless sensor networks.
PhD thesis, University of Geneva, 2009.
[WP5.2]

G. Muratore, U. M. Schwarz and G. J. Woeginger.
Parallel machine scheduling with nested job assignment restrictions.
Operations Research Letters, 38 (1), pp. 47-50, 2010.
[WP3.3]

 186

J. Nešetřil and P. Ossona de Mendez.
Counting homomorphisms in sparse graphs.
Electronic Notes Discrete Mathematics, 34(1), pp. 393-397, 2009.
[WP1.1]

 187

J. Nešetřil and P. Ossona de Mendez.
From sparse graphs to nowhere dense structures: Decompositions, independence, dualities and limits.
In Proc. of the 5th European Congress of Mathematics, 2010, to appear.
[WP1.1]

 188

J. Nešetřil and P. Ossona de Mendez.
Linear size induced matchings in clone-free sparse graphs.
Technical report, 2010.
[WP1.1]

 189

J. Nešetřil and P. Ossona de Mendez.
Sparsity (graphs, structures, algorithms).
Book, Birkhäuser Verlag, pp. 1-350, 2010, to appear.
[WP1.1]

190

J. Nešetřil, P. Ossona de Mendez, and D. Wood.
Characterizations and examples of graph classes with bounded expansion.
Technical report, 2010.
[WP1.1]

S. Nikoletseas, C. Raptopoulos, and P. Spirakis.
Colouring Non-Sparse Random Intersection Graphs.
In Proc. of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 09), LNCS 5734, Springer, pp. 600-611, 2009.
[WP5.2, WP5.1]

S. Nikoletseas, C. Raptopoulos and P. Spirakis.
Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions.
In Proc. of the 23rd IEEE International Parallel & Distributed Processing Symposium (IPDPS 09), pp. 1-11, 2009.
[WP5.2, WP5.1]

S. Nikoletseas, J. Rolim and P. Leone.
Energy Balanced Data Propagation in Wireless Sensor Networks.
Chapter in the Book "Theoretical Aspects of Distributed Computing in Sensor Networks", Springer, 2010.
[WP5.2]

S. Nikoletseas and P. Spirakis.
Probabilistic Data Propagation.
Chapter in the Book "Theoretical Aspects of Distributed Computing in Sensor Networks", Springer, 2010.
[WP5.1, WP5.3]

S. Nikoletseas and P. Spirakis.
Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks.
Algorithms Journal, Volume 2(1), pp. 121-157, 2009.
[WP5.2, WP5.3]

V. Nikov, and S. Nikova.
Secret Sharing and Error Correcting.
In NATO Advanced Research Workshop on Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, IOS Press, pp. 28-39, 2009.
[WP4.2]

S. Nikova, V. Nikov.
Efficient Perfectly Secure Verifiable Secret Sharing and Distributed Commitment Schemes.
In Proc. of the International Workshop on Coding and Cryptography (WCC 09), 2009.
[WP4.2]

N. Nisse, I. Rapaport, and K. Suchan.
Distributed computing of efficient routing schemes in generalized chordal graphs.
In Proc. of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO 09), LNCS 5869, Springer, 2009.
[WP1.5]

C. Nocentini, P. Crescenzi and L. Lanzi.
Performance Evaluation of a Chord-based JXTA Implementation.
In Proc. of the 1st International Conference on Advances in P2P Systems (AP2PS 09), IEEE, pp. 7-12, 2009.
[WP6.2, WP6.3, WP6.4]

M. Ntetsika.
Replication and Consistency Maintenance in Unstructured Peer-to-Peer Systems with Power-Law Topology.
Master Thesis. Technical Report MT-2009-21. Department of Computer Science, University of Ioannina, Greece.
[WP2.1]

R. Ostrovsky, G. Persiano, and I. Visconti.
Simulation-based concurrent non-malleable commitments and decommitments.
In Proc. of the 6th Theory of Cryptography Conference on the Theory of Cryptography (TCC 09), LNCS 5444, Springer, pp. 91-108, 2009.
[WP4.3]

P. Penna, F. Schoppmann, R. Silvestri, and P. Widmayer.
Pseudonyms in cost-sharing games.
In Proc. of the 5th International Workshop on Internet and Network Economics (WINE 09), LNCS 5929, Springer pp. 256–267, 2009.
[WP1.2, WP2.3]

E. Peserico.
(More) efficient pruning of ad-hoc wireless networks.
In Proc. of the 28th Annual ACM Symposium on Principles of Distributed Computing (PODC 09), ACM, pp. 320-321, 2009.
[WP1.1, SP5]

E. Peserico and L. Pretto.
Score and Rank Convergence of HITS.
In Proc. of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 09), ACM, pp. 770-771, 2009.
[WP1.2]

A. Pettarin.
Upper bounding the schedule length in SINR graphs with randomly-distributed nodes. 
Technical report, 2009.
[WP1.1, SP5]

A. Pettarin, A. Pietracaprina, G. Pucci.
On the Expansion and Diameter of Bluetooth-Like Topologies. 
In Proc. of the 17th European Symposium on Algorithms (ESA 09), LNCS 5757, Springer, pp. 528-539, 2009.
[WP1.1, SP5]

H. Rivano, F. Theoleyre, and F. Valois.
A framework for the capacity evaluation of multihop wireless networks.
In Proc. of the 2009 Conference on Ad Hoc and Sensor Wireless networks (AHSWN 09), 2009, to appear.
[WP2.2, WP5.1]

I. Sau and D. M. Thilikos.
On Self-Duality of Branchwidth in Graphs of Bounded Genus.
In Proc. of the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW 09), 2009.
[WP1.1]

I. Sau and D. M. Thilikos.
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs.
In Proc. of the DIMAP workshop on Algorithmic Graph Theory (AGT 09), Vol. 32 of Electronic Notes in Discrete Mathematics, Elsevier, pp. 59-66, 2009.
[WP1.5]

S. Schiffner and S. Clauss.
Using linkability information to attack mix-based anonymity services.
In Proc. of the 9th International Symposium on Private Enhancing Technologies (PETS 09), LNCS 5672, Springer, pp. 94-107, 2009.
[WP4.2]

S. Schiffner, S. Clauss and S. Steinbrecher.
Privacy and liveliness for reputation systems.
In Proc. of the 6th European Workshop on Public Key Services, Applications and Infrastructures (EUROPKI 09), 2009, to appear.
[WP4.2]

U. M. Schwarz.
Approximation algorithms for restricted assignment on intervals.
Technical report, 2010.
[WP3.3]

A. Silva, P. Reyes, and M. Debbah.
Congestion in randomly deployed wireless Ad-Hoc and sensor networks.
In Proc. of the 2009 International Conference on Ultra Modern Telecommunications, 2009.
[WP5.3]

F. Silvestri.
Oblivious computations on memory and network hierarchies.
PhD thesis. Dipartimento di Ingegneria dell'Informazione Università di Padova, 2009.
[WP3.2]

F. Solano Donado and J. Moulierac.
Routing in all-optical label switched-based networks with small label spaces.
In Proc. of the 13th IFIP/IEEE Conference on Optical Network Design and Modeling (ONDM 09), 2009.
[WP2.2]

D. Souravlias, M. Drosou, K. Stefanidis and E. Pitoura.
On Novelty in Publish/Subscribe Delivery.
In Proc. of the 4th International Workshop on Ranking in Databases (DBRank 2010), in conjunction with the ICDE 2010 Conference, 2010, to appear.
[WP2.1]

A. Stewart, J. Gabarro.
Reasoning framework for service-based orchestration.
Technical report, 2010.
[WP1.4]

R. Talviste, D. Bogdanov.
An improved method for privacy-preserving web-based data collection.
Technical report, 2009.
[WP4.3]

C. Troncoso and G. Danezis.
The Bayesian Analysis of Mix Networks.
In Proc. of the 16th ACM Conference on Computer and Communications Security (CCS 09), pp. 369-379, 2009.
[WP4.2]

C. Ventre and I. Visconti.
Co-sound zero-knowledge with public keys.
In Proc. of the 2nd International Conference on Cryptology in Africa (AFRICACRYPT 09), LNCS 5580, Springer, pp. 287-304, 2009.
[WP4.3]