1

L. Addario-Berry, O. Amini, J.-S. Sereni and S. Thomassé.
Guarding art galleries: the extra cost for sculptures is linear.
In Proc. of the 11th Scandinavian Workshop on Algorithm Theory (SWAT 08), LNCS 5124, Springer, pp. 41-52, 2008.
[WP1.1]

 2

O. Akribopoulos, D. Bousis, D. Efstathiou, H. Koutsouridis, M. Logaras, A. Nafas, G. Oikonomou, I. Thireou, P. Kokkinos, G. Mylonas, and I. Chatzigiannakis.
A Software Platform for Developing Multi-player Pervasive Games Using Small Programmable Object Technologies.
In Proc. of the 5th International Conference on Mobile Ad-hoc and Sensor Systems (MASS 08), IEEE, 2008, to appear.
[WP6.2]

 3

O. Akribopoulos, M. Logaras, N. Vasilakis, P. Kokkinos, G. Mylonas, and I. Chatzigiannakis.
Using Wireless Sensor Networks to Develop Multi-player Games.
In Proc. of the 6th ACM Conference on Embedded Networked Sensor Systems, ACM, 2008, to appear.
[WP6.2]

 4

K. Alexakis.
Update Maintenance in Unstrutured Peer-to-Peer Systems.
Master Thesis, Department of Computer Science, University of Ioannina, 2008.
[WP2.1]

 5

C. Àlvarez, R. Cases, J. Díaz, J. Petit, M.Serna.
Communiction tree problems.
Theoretical Computer Science, vol. 381, pp. 197-217, 2007.
[WP5.2]

 6

C. Àlvarez, G. Francès.
The complexity of Pure Nash Equilibria in Weighted Max-Congestion Games.
Technical report, 2008.
[WP1.5]

 7

J. Alwen, A. Shelat and I. Visconti.
Collusion-Free Protocols in the Mediated Model.
In Proc. of the 28th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO 08), LNCS 5157, Springer, pp. 497-514, 2008.
[WP2.3, WP3.3, WP4.3]

 8

 O. Amini, F. Huc, I. Sau Valls and J. Zerovnik.
(l,k)-Routing on Plane Grids.
Technical report, 2008 (INRIA Research Report 6480).
[WP1.5, WP2.2]

 9

O. Amini, D. Peleg, S. Pérennes, I. Sau Valls and S. Saurabh.
Degree-Constrained Subgraph Problems: Hardness and Approximation Results.
In Proc. of the 6th International Workshop on Approximation and Online Algorithms (WAOA 08), 2008, to appear.
[WP1.1, WP2.2]

 10

O. Amini, I. Sau Valls and S. Saurabh.     
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.
In Proc. of the International Workshop on Exact and Parameterized Computation (IWPEC 08), LNCS 5008, Springer, pp. 13-29, 2008.
[WP1.1, WP2.2]

 11

C. Andersson, M. Kohlweiss, L. Martucci, and A. Panchenko.
A Self-certified and Sybil-Free Framework for Secure Digital Identity Domain Buildup.
In Proc. of the 2nd IFIP WG 11.2 International Workshop on Information Security Theory and Practices: Smart Devices, Convergence and Next Generation Networks (WISTP 08), LNCS 5019, Springer, pp. 64-77, 2008.
[WP4.2]

 12

M. Asté, F. Havet and C. Linhares-Sales.     
Grundy number and lexicographic product of graphs.
In Proc. of International Conference on Relations, Orders and Graphs: Interaction with Computer Science (ROGICS 08), 2008.
[WP1.1]

 13

S. Athanassopoulos, I. Caragiannis, and C. Kaklamanis.
Experimental evaluation of algorithms for energy-efficient broadcasting in ad hoc wireless networks.
Technical Report, 2008.
[WP5.1]

 14

V. Auletta, L. Moscardelli, P. Penna and G. Persiano.
Interference Games in Wireless Networks.
In Proc. of the 4th International Workshop On Internet And Network Economics (WINE 08), LNCS 5385, Springer, pp. 278-285, 2008.
[WP1.3, WP5.1, WP5.2]

 15

V. Auletta, P. Penna, G. Persiano and C. Ventre.
Alternatives to Truthfulness are Hard to Recognize.
In Proc. of the 1st International Symposium on Algorithmic Game Theory (SAGT 08), LNCS 4997, Springer, pp. 194-205, 2008.
[WP2.3, WP1.2]

 16

M. Backes, M. Hamerlik, A. Linari, M. Maffei, C. Tryfonopoulos, G. Weikum.
Anonymity and Censorship Resistance in Unstructured Overlay Networks.
Technical report, 2008
[WP3.1]

 17

M. Backes, M. Hamerlik, A. Linari, M. Maffei, C. Tryfonopoulos, and G. Weikum.
Anonymous and Censorship-resistant Content-sharing in Unstructured Overlays.  
In Proc. of the 27th ACM Symposium on Principles of Distributed Computing (PODC 08), ACM Press, pp. 429-429, 2008.
[WP3.1]

 18

K. Bairaktaris, I. Chatzigiannakis, V. Liagkou, and P. Spirakis.
Adaptive Probabilistic Secure Routing in Mobile Wireless Sensor Networks.
In Proc. of the 16th International Conference on Software, Telecommunications and Computer Networks (SoftCOM 08), IEEE, 2008, to appear. 
[WP4.3, WP5.3]

 19

L. Becchetti, U. Colesanti, A. Marchetti-Spaccamela, and A. Vitaletti.
Self-organized recommendation systems: Models and experimental analysis.
In Proc. of the IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008, to appear.
[WP1.2]

 20

M. Belenkiy, M. Chase, M. Kohlweiss, and A. Lisyanskaya.
P-signatures and Noninteractive Anonymous Credentials.
In Proc. of the 5th Theory of Cryptography Conference (TCC 08), LNCS 4948, Springer, pp. 356-374, 2008.
[WP4.2]

 21

E. Ben Hamida and G. Chelius.
A line-based data dissemination protocol for wireless sensor networks with mobile sink.
In Proc. of the IEEE International Conference on Communications (ICC 08), IEEE Computer Society, pp. 2201-2205, 2008.
[WP5.3]

 22

E. Ben Hamida, G. Chelius, A. Busson and E. Fleury.
Neighbor Discovery in multi-hop wireless networks: evaluation and dimensioning with interference considerations.
Discrete Mathematics and Theoretical Computer Science, 10(2), pp. 87-114, 2008.
WP[5.2]

 23

E. Ben Hamida, G. Chelius and J-M. Gorce.
Scalable versus Accurate Physical Layer Modeling in Wireless Network Simulations.
In Proc. of the 22nd ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation (PADS 08), 2008, to appear.
[WP5.1, WP5.2, WP5.3]

 24

E. Ben Hamida, G. Chelius and J-M. Gorce.
On the complexity of an Accurate and Precise Performance Evaluation of Wireless Networks Using Simulations.
In Proc. of the 11th ACM-IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM 08), 2008, to appear.
[WP5.1, WP5.2, WP5.3]

 25

P. Berenbrink, R. Elsässer and T. Friedetzky.
Efficient Randomised Broadcasting in Random Regular Networks with Applications in Peer-to-Peer Systems.
In Proc. of the 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 08), ACM Press, pp.155-164, 2008.
[WP3.2]
(recorded also as report No. 20 in 2nd Year reports as Technical report)

J.-C. Bermond, D. Coudert and B. Lévêque.
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring.
Journal of Interconnection Networks, 2008, to appear.
[WP1.5, WP2.2]

J.-C. Bermond, A. Ferreira, S. Pérennes and J. Peters.
Neighbourhood Broadcasting in Hypercubes.
SIAM Journal on Discrete Mathematics, 21(4), pp. 823-843, 2007.
[WP1.5, WP2.2]

J-C. Bermond, L. Gargano and A. A. Rescigno.
Gathering with minimum delay in tree sensor networks.
In Proc. of the 15th International Colloquium on Structural Information and Communication Complexity (SIROCCO 08), LNCS 5058, Springer, pp. 262-276, 2008.
[WP1.5, WP2.2, WP3.3]

J.-C. Bermond and M-L. Yu.
Optimal gathering algorithms in multi-hop radio tree networks with interferences.
In Proc. of the 7th International Conference on AD-HOC Networks & Wireless (ADHOC-NOW 08), LNCS 5198, Springer, pp. 204-217, 2008.
[WP1.5, WP2.2, WP3.3]

 30

C. Bertolli, J. Gabarró.
On the Cost of Task Re-Scheduling in Fault-Tolerant Task Parallel Computation.
In Proc. of the Workshop on Integrated Research in Grid Computing (CoreGRID 08), Crete University Press, pp. 275-286, 2008.
[WP1.4, WP3.4]

 31

C. Bertolli, M. Meneghin, J. Gabarró.
A Markov Model for Fault-Tolerant Task Parallel Computation.
In Proc. of the Workshop on Integrated Research in Grid Computing (CoreGRID 08), Crete University Press, 2008.
[WP1.3, WP1.4, WP3.4]

 32

S.N. Bhatt, G. Bilardi, and G. Pucci.
Area-time Tradeoffs for Universal VLSI Circuits.
Theoretical Computer Science, 2008, to appear.
[WP1.1]

 33

V. Bilo, I. Caragiannis, A. Fanelli, M. Flammini, C. Kaklamanis, G. Monaco, and L. Moscardelli.
Selfish routing.
Technical report, 2008.
[WP1.3]

 34

V. Bilo, A. Fanelli, M. Flammini and L. Moscardelli.
Graphical Congestion Games.
In Proc. of the 4th International Workshop On Internet And Network Economics (WINE 08), LNCS, Springer, 2008, to appear.
[WP1.3]

 35

B. Bioernstad.
A Workflow Approach to Stream Processing.
PhD dissertation, Computer Science Department, ETH Zurich, 2008.
[WP3.4]

 36

Y. Bleischwitz and F. Schoppmann.
Group-strategyproof cost sharing for metric fault tolerant facility location.
In Proc. of the 1st International Symposium on Algorithmic Game Theory  (SAGT 08), LNCS 4997, Springer, pp. 350-361, 2008.
[WP2.3]

 37

Y. Bleischwitz and F. Schoppmann.
New efficiency results for makespan cost sharing.
Information Processing Letters, 107(2), pp. 64-70, 2008.
[WP2.3]

 38

M. Blesa and M.Serna.
Adversarial Queueing Models for Continuous Network Dynamics in the presence of faults.
Technical report, 2008.
[WP1.4]

 39

C. Blundo, E. De Cristofaro, A. Del Sorbo, C. Galdi and G. Persiano.
A Distributed Implementation of the Certified Information Access Service.
In Proc. of the 13th European Symposium on Research in Computer Security (ESORICS 08), LNCS 5283, Springer, pp. 396-410, 2008.
[WP4.3]

 40

C. Blundo and C. Galdi.
Certified Information Access.
In Proc. of the 10th Spanish Meeting on Cryptology and Information Security (RECSI 08), SIGNE S.A., pp. 3-8, 2008.
[WP4.3]

 41

D. Bogdanov, S. Laur, J. Willemson.
Sharemind: a framework for fast privacy-preserving computations.
In Proc. of the 13th European Symposium on Research in Computer Security (ESORICS 08), LNCS, Springer, 2008, to appear.
[WP4.3]

 42

V. Bonifaci, P. Korteweg, A. Marchetti-Spaccamela, L.Stougie.
Minimizing flow time in the wireless gathering problem.
In Proc. of the 25th Symposium on Theoretical Aspects of Computer Science (STACS 08), Dagstuhl Seminar Proceedings 08001, pp. 109-120.
[WP1.5, WP2.2, WP3.3]

 43

S. Boschi, P. Crescenzi, M. Di Ianni, G. Rossi, and P. Vocca.
MOMOSE - A Mobility Model Simulation Environment for Mobile Wireless Ad-hoc Networks.
In Proc. of the 1st International Conference on Simulation Tools and Techniques for Communications, Networks and Systems (SIMUTools 08), 2008.
[WP5.3, WP5.1]

 44

S. Braghin, I. Nai Fovino, and A. Trombetta.
Advanced Trust Negotiation in Critical Infrastructures.
In Proc. of the 2008 International Conference on Infrastructure Systems, 2008, to appear.
[WP4.1]

 45

M. Bressan and E. Peserico.
Choose the damping, choose the ranking?
Technical report, 2008.
[WP1.2]

 46

A. Buldas, M. Niitsoo.
Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
In Proc. of the 2nd Conference on Provable Security (ProvSec 08), LNCS 5324, Springer, 2008, to appear.
[WP4.3]

 47

T. Calamoneri, A. Clementi, A. Monti, G. Rossi and R. Silvestri.
Minimum-energy broadcast  in random-grid ad-hoc networks: approximation and distributed algorithms.
In Proc. of the 11th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 08), 2008, to appear.
[WP1.5, WP5.1]

 48

I. Caragiannis.
Efficient coordination mechanisms for unrelated machine scheduling.
In Proc. of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), 2009, to appear.
[WP1.3, WP2.3, WP3.3]

 49

I. Caragiannis, J. A. Covey, M. Feldman, C. M. Homan, C. Kaklamanis, N. Karanikolas, A. D. Procaccia, and J. S. Rosenschein.
On the approximability of Dodgson and Young elections.
In Proc. of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), 2009, to appear.
[WP1.5, WP2.3]

 50

I. Caragiannis, M. Flammini, C. Kaklamanis, R. Klasing, and A. Navarra.
Energy consumption minization in ad hoc wireless, and multi-interface networks.
Technical Report, 2008.
[WP5.1]

 51

I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos.
Improving the efficiency of load balancing games through taxes.
In Proc. of the 4th International Workshop on Internet and Network Economics (WINE 08), LNCS, Springer, 2008, to appear.
[WP1.3, WP2.3, WP3.3]

 52

I. Caragiannis, C. Kaklamanis, E. Kranakis, D. Krizanc, and A. Wiese.
Communication in wireless networks with directional antennas.
In Proc. of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 08), pp. 344- 351, 2008.
[WP5.2]

 53

I. Caragiannis and G. Monaco.
A 6/5-approximation algorithm for the maximum 3-cover problem.
In Proc. of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 08), LNCS 5162, Springer, pp. 205-216, 2008.
[WP1.5, WP2.2]

D. Cassioli, S. Persia, F. Vatalaro.
Performance Trade-Offs in Energy-Aware Geographic Routing for Low-Data Rate Location/Tracking Applications.
In Proc. of the 2007 Wireless Rural and Emergency Communications Comference (WRECOM 07), IEEE, 2007, to appear.
[WP5.1, WP5.2, WP6.2]

 55

I. Chatzigiannakis, G. Giannoulis, and P. Spirakis.
Energy and Time Efficient Scheduling of Tasks with Dependencies on Asymmetric Multiprocessors.
Technical report, 2008.
[WP3.3]

56

I. Chatzigiannakis, G. Giannoulis, and P. Spirakis.
Scheduling Tasks with Dependencies on Asymmetric Multiprocessors.
In Proc. of the 27th ACM Symposium on Principles of Distributed Computing (PODC 08), ACM Press, p. 454, 2008.
[WP3.3]

 57

I. Chatzigiannakis, C. Koninis, G. Prasinos, and C. Zaroliagis.
Distributed Simulation of Heterogeneous Systems of Small Programmable Objects and Traditional Processors.
In Proc. of the 6th ACM Workshop on Mobility Management and Wireless Access (MOBIWAC 08), ACM Press, pp. 52-59 2008.
[WP6.2]

 58

I. Chatzigiannakis, A. Kinalis, and S. Nikoletseas.
Efficient Data Propagation Strategies in Wireless Sensor Networks Using a Single Mobile Sink.
Computer Communications, 31(5), pp. 896-914, 2008.
[WP5.3]

 59

I. Chatzigiannakis, A. Kinalis, G. Mylonas, S. Nikoletseas, G. Prasinos, and C. Zaroliagis.
TRAILS, a Toolkit for Efficient, Realistic and Evolving Models of Mobility, Faults and Obstacles in Wireless Networks.
In Proc. of the 41th Annual ACM/IEEE Simulation Symposium (ANSS 08), ACM/IEEE, pp. 23-32, 2008.
[WP5.3]

 60

I. Chatzigiannakis, V. Liagkou, D. Salouros, and P. Spirakis.
A Security Model for Internet-based Digital Asset Management Systems.
In Proc. of the 2nd European Conference on Software Architecture (ECSA 08), LNCS 5292, Springer, pp. 326-329, 2008.
[WP4.1]

 61

I. Chatzigiannakis, V. Liagkou, and P. Spirakis.
A Trusted Architectural Model for Interconnecting Testbeds of Wireless Sensor Networks.
In Proc. of the 50th International Symposium ELMAR-2008, IEEE Computer Society, pp. 515-518, IEEE, 2008.  
[WP4.1, WP5.1, WP5.2]

 62

G. Christodoulou, E. Koutsoupias, A. Nanavati.
Coordination Mechanisms.
Technical report, 2008.
[WP1.3, WP2.3]

 63

G. Christodoulou, E. Koutsoupias, A. Vidali.
A Characterization of 2-Player Mechanisms for Scheduling.
In Proc. of the 16th Annual European Symposium on Algorithms (ESA 08), LNCS 5193, Springer, pp.297-307, 2008.
[WP2.3]

 64

G. Christodoulou, E. Koutsoupias, P. Spirakis.
On the performance of approximate equilibria in congestion games.
Technical report, 2008.
[WP1.3]

 65

A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri.
Flooding Time in edge-Markovian Dynamic Graphs.
In Proc. of the 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 08), 2008, to appear.   
[WP1.1, WP5.1, WP5.2, WP5.3]

 66

A. Clementi, A. Monti, F. Pasquale, and R. Silvestri.
Information Spreading in Stationary Markovian Evolving Graphs.
Technical report, 2008.
[WP1.1, WP5.1, WP5.2, WP5.3]

 67

M. Comas, M. Serna.
A coloring characterization for graph cover problems.
In Proc. of the Jornadas de Matemática Discreta y Algoritmia 2008, 2008.
[WP1.1, WP1.5]

R. Correa, F. Havet and J.-S. Sereni.
About a Brooks-type theorem for improper colouring.
Technical report, 2008.
[WP1.1]

G. Cortese, F. Morabito, F. Davide, A. Virgillito, R. Beraldi, V. Quema.
Data aggregation in large scale distributed system in Global Data Management.
Chapter in Global Data Management, IOS Press, pp. 53-78, 2006.
[WP2.2, WP6.1]

D. Coudert, F. Huc and D. Mazauric.
A distributed algorithm for computing and updating the process number of a forest.
Brief announcement in the 22nd International Symposium on Distributed Computing (DISC 08), LNCS, Springer, 2008, to appear.
[WP1.5, WP2.2]

D. Coudert, F. Huc and D. Mazauric.
Algorithme générique pour les jeux de capture dans les arbres.
In Proc. of the 10éme Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 08), 2008.
[WP1.5, WP2.2]

 72

D. Coudert, F. Huc, F. Peix, and M. E. Voge.
Reliability of connections in multilayer networks under Shared Risk Groups and costs constraints.
In Proc. of the IEEE International Conference on Communications (ICC 08), ON016, pp. 5170-5174, 2008.
[WP1.4]

D. Coudert, D. Mazauric.
Network reconfiguration using cops-and-robber games.
Technical report, 2008.
[WP1.5, WP2.2]

D. Coudert, J.-S. Sereni.
Characterization of graphs and digraphs with small process number.
Technical report, 2008.
[WP1.1, WP1.5, WP2.2]

 75

P. Crescenzi, M. Di Ianni, F. Greco, G. Rossi, and P. Vocca.
Making Role Assignment feasible: a polynomial-time algorithm for computing ecological colorings.
In Proc. of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 08), 2008, to appear.
[WP1.1, WP5.1]

O. Dalle, B.P. Zeigler and G.A. Wainer.
Extending DEVS to support multiple occurrence in component-based simulation.
In Proc. of the 2008 Winter Simulation Conference (WSC 08), 2008, to appear.
[WP6.2]

A. Detti, M. Leo, P. Loreti.
The VICOM system architecture for immersive services.
Technical report, 2007.
[WP6.2]

A. Detti, R. Zanetti, R. Pomposini.
A Cross Layer Version of OBAMP Based on a Proactive Routing: Description and MANET Test-bed.
In Proc. of the 2007 Wireless Rural and Emergency Communications (WRECOM 07), IEEE, 2007, to appear.
[WP6.2]

 79

C. Diaz, E. Kosta, H. Dekeyser, M. Kohlweiss, and G. Nigusse.
Privacy preserving electronic petitions.
Technical report, 2008.
[WP4.2]

 80

C. Diaz, C. Troncoso, and B. Preneel.
A Framework for the Analysis of Mix-Based Steganographic File Systems.
In Proc. of the 13th European Symposium on Research in Computer Security (ESORICS 08), LNCS 5283, Springer, pp. 428-445, 2008.
[WP4.2]

81

D. Diaz, C. Troncoso, and A. Serjantov.
On the Impact of Social Network Profiling on Anonymity.
In Proc. of the 8th Privacy Enhancing Technologies Symposium (PETS 08), LNCS 5134, Springer, pp. 44-62, 2008.
[WP4.2]

 82

G. Di Crescenzo and I. Visconti.
On Defining Proofs of Knowledge in the Bare Public Key Model.
In Proc. of the 10th Italian Conference on Theoretical Computer Science (ICTCS 07), World Scientific, pp. 187-198, 2007.
[WP4.3]

 83

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

 84

F. Diedrich, B. Kehden and F. Neumann.
Multi-objective problems in terms of relational algebra.
In Proc. of the 10th International Conference on Relational Methods in Computer Science (RelMiCS/AKA 08), LNCS 4988, Springer, pp. 84-98, 2008.
[WP3.3]

 85

F. Diedrich and F. Neumann.
Using Fast Matrix Multiplication in Bio-inspired Computation for Complex Optimization Problems.
In Proc. of of the 2008 IEEE Congress on Evolutionary Computation (CEC 08), IEEE Press, pp. 3828-3833, 2008.
[WP3.3]

 86

M. Drosou, K.  Stefanidis and E. Pitoura.
Preferential Publish/Subscribe.
In Proc. of the 2nd International Workshop on Personalized Access, Profile Management and Context Awareness: Databases (PersDB 08), 2008.
[WP2.1]

 87

D. Dumrauf and B. Monien.
On the Road to PLS-Completeness: 8 Agents in a Singleton Congestion Game.
In Proc. of the 4th International Workshop on Internet and Network Economics  (WINE 08), LNCS 5385, Springer, pp. 94-108, 2009.
[WP1.1, WP1.2]

 88

D. Dumrauf, B. Monien and K. Tiemann.
MultiProcessor Scheduling is PLS-complete.
In Proc. of the 42nd Hawaii International Conference on System Sciences (HICSS-42 09), (CD-ROM and online), IEEE Computer Society, p. 269, 2009.
[WP1.1, WP1.2]

 89

Z. Dvořák.
Asymptotical structure of combinatorial objects.
PhD thesis, Faculty of Mathematics and Physics, Charles University, Prague, 2007.
[WP1.1]

 90

Z. Dvořák.
On forbidden subdivision characterization of graph classes.
European Journal of Combinatorics, 29(5), pp. 1321-1332,  2008.
[WP1.1]

 91

Z. Dvořák, T. Kaiser, D. Král' and J.-S. Sereni.
A note on antisymmetric flows in graphs.
Technical report, 2008.
[WP1.1]

 92

R. Elsässer, L. Gasieniec and T. Sauerwald.
On Radio Broadcasting in Random Geometric Graphs.
In Proc. of the 22nd International Symposium on Distributed Computing (DISC 08), LNCS 5218, Springer, pp. 212-226, 2008.
[WP3.2, WP5.3]

 93

R. Elsässer, U. Lorenz and T. Sauerwald.
Agent-Based Randomized Broadcasting in Large Networks.
Discrete Applied Mathematics, Volume 155, pp. 150-160, 2007.
[WP3.2]

 94

R. Feldmann, M. Mavronicolas and A. Pieris.
Facets of the Fully Mixed Nash Equilibrium Conjecture.
In Proc. of the 1st International Symposium on Algorithmic Game Theory (SAGT 08), LNCS 4997, Springer, pp. 145-157, 2008.
[WP1.5]

 95

A. Fernandez Anta, C. Georgiou, and M. A. Mosteiro.
Designing Mechanisms for Reliable Internet-based Computing.
In Proc. of the 7th IEEE International Symposium on Network Computing and Applications (IEEE NCA08), IEEE computer Society, pp. 325-324, 2008.
[WP2.3]

96

A. Ferreira, A. Goldman and J. Monteiro.
On the evaluation of shortest journeys in dynamic networks.
In Proc. of the 6th IEEE International Symposium on Network Computing and Applications (NCA 07), pp. 3-10, 2007 (Invited Paper).
[W2.2, WP5.3]

 97

A. Fishkin, O. Gerber, K. Jansen and R. Solis-Oba.
On packing rectangles with resource augmentation: maximizing the profit.
Algorithmic Operations Research, 3, 2008.
[WP3.3]

 98

A. Fishkin, K. Jansen and M. Mastrolilli.
Grouping techniques for scheduling problems: simpler and faster.
Algorithmica 51(2), pp. 183-199, 2008.
[WP3.3]

 99

D. Fotakis, A. Kaporis, and P. Spirakis.
Atomic Congestion Games: Fast, Myopic and Concurrent.
In Proc. of the 1st International Symposium on Algorithmic Game Theory (SAGT 08), LNCS 4997, Springer, pp. 121-132, 2008.
[WP3.3]

 100

A. Fotiadou.
Continuous Skyline Queries in Distributed Systems.
Master Thesis, Department of Computer Science, University of Ioannina, 2008.
[WP2.1]

 101

K. Fotiadou and E. Pitoura.
BITPEER: Continuous Subspace Skyline Computation with Distributed Bitmap Indexes.
In Proc. of the 2008 International Workshop on Data Management in Peer-to-Peer Systems (DaMaP 08), ACM press, pp. 35-42, 2008.
[WP2.1]

 102

G. Francès.
The Complexity of Pure Nash Equilibria in Weighted Max-Congestion Games.
Master Thesis, UPC, 2008.
[WP1.5]

 103

J. Freixas, X. Molinero, M. Olsen and M. Serna.
The Complexity of Testing Properties of Simple Games.
Technical report, 2008.
[WP1.3]

 104

J. Gabarró, A. García, M. Serna.
On the Complexity of Equilibria Problems in Angel-Daemon Games.
In Proc. of the 14th Annual International Conference on Computing and Combinatorics (COCOON 08), LNCS 5092, Springer, pp. 31-40, 2008.
[WP1.3, WP1.4]

 105

J. Gabarró, A. García, M. Serna, P. Kilpatrick, A. Stewart.
Analysing Orchestrations with Risk Profiles and Angel-Daemon Games.
In Proc. of the Workshop on Integrated Research in Grid Computing (CoreGRID 08), Crete University Press, pp. 346-358, 2008.
[WP1.3, WP1.4]

 106

M. Gairing, B. Monien and K. Tiemann.
Selfish Routing with Incomplete Information.
Theory of Computing Systems, 42(1), pp. 91-130, 2008.
[WP1.2]

 107

M. Gairing, B. Monien and A. Woclaw.
A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines.
Theoretical Computer Science, vol. 380, pp. 87-99, 2007.
[WP3.3]

 108

M. Gairing and F. Schoppmann.
Total Latency in Singleton Congestion Games.
In Proc. of the 3rd International Workshop on Internet and Network Economics (WINE 07), LNCS 4858, Springer, pp. 381-387, 2007.
[WP1.3]

J. Galtier.
New algorithms to compute the strength of a graph.
Technical report, 2008.
[WP1.5, WP2.2]

 110

B. Gierlichs, C. Troncoso, C Diaz, B. Preneel, I. Verbauwhede.
Revisiting a Combinatorial Approach Toward Measuring Anonymity.
In Proc. of the 2008 Workshop on Privacy in the Electronic Society (WPES 08), ACM Press, 2008, to appear.
[WP4.2]

R. Giuliano, P. Loreti, F. Mazzenga, C. Monti.
Analysis of Fractional Frequency Reuse Planning Strategy for WiMAX Systems.
In Proc. of the 2007 Wireless Rural and Emergency Communications (WRECOM 07), IEEE, 2007, to appear.
[WP5.1, WP6.2]

C. Gomes, G. Huiban and H. Rivano.
A Branch-and-Price Approach to the Bandwidth Allocation Problem in Wireless Networks.
In Proc. of the 2008 International Symposium on Combinatorial Optimization (CO 08), p. 44, 2008.
[WP2.2, WP5.1]

C. Gomes, C. Molle and P. Reyes.
Optimal Design of Wireless Mesh Networks.
In Proc. of the 9èmes Journées Doctorales en Informatique et Réseaux (JDIR 08), 2008.
[WP2.2, WP5.2]

C. Gomes, S. Pérennes, P. Reyes and H. Rivano.
Bandwidth Allocation in Radio Grid Networks.
In Proc. of the 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel 08), 2008, to appear.
[WP2.2, WP5.1]

C. Gomes, S. Pérennes and H. Rivano.
Joint Gathering and Coloring problem in Wireless Mesh Networks.
Technical report, 2008.
[WP2.2, WP5.2]

 116

F. Grandoni, A. Gupta, S. Leonardi, P. Miettinen, and P. Sankowski.
Set covering with our eyes closed.
In Proc. of the 49th IEEE Symposium on Foundations of Computer Science (FOCS 08), 2008, to appear.
[WP1.2, WP1.5]

 117

F. Havet, M. Klazar, J. Kratochǐl, D. Kratsch and M. Liedloff.
Exact Algorithms for L(2,1)-labeling of Graphs.
Technical report, 2008.
[WP1.1, WP5.1, WP5.2]

 118

F. Havet, B. Reed and J.-S. Sereni.
L(p,1)-labelling of graphs.
Technical report, 2008.
[WP1.1, WP5.1, WP5.2]

 119

T. Heinis, G. Alonso.
Efficient Lineage Tracking for Scientific Workflows.
In Proc. of the 2008 ACM SIGMOD International Conference on Management of Data (SIGMOD 08), ACM Press, pp. 1007-1018, 2008.
[WP3.4]

 120

T. Heinis, C. Pautasso.
Automatic Configuration of an Autonomic Controller: An Experimental Study with Zero-Configuration Policies.
In Proc. of the 5th IEEE International Conference on Autonomic Computing (ICAC 08), IEEE Computer Society, pp. 67-76, 2008.
[WP3.4]

F. Havet, D. Král, J.-S. Sereni and R. Ŝkrekovski.
Facial colorings using Hall's Theorem.
Technical report, 2008.
[WP1.1]

F. Havet, S. Thomassé and A. Yeo.
Hoang-Reed conjecture for tournaments.
Discrete Mathematics, 308(15), pp. 3412-3415, 2008.
[WP1.1]

 123

F. Havet and M.-L. Yu.
(p,1)-total labelling of graphs.
Discrete Mathematics, 308(4), pp. 496-513, 2008.
[WP1.1]

L. Hogie, G. Danoy, P. Bouvry and F. Guinand.
A Context-Aware Broadcast Protocol for Mobile Wireless Networks.
In Proc. of the 2nd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 08), 2008, to appear.
[WP2.2, WP5.3]

T. Inzerilli, M. Leo, A. M. Vegni, P. G. Bosco.
Extended UPnP Network Infrastructure Supporting Collaborative Applications.
In Proc. of the 2007 Wireless Rural and Emergency Communications (WRECOM 07), IEEE, 2007, to appear.
[WP6.2]

 126

V. Iovino and G. Persiano.
Hidden-Vector Encryption with Groups of Prime Order.
In Proc. of the 2nd International Conference on Pairing-based Cryptography (Pairing 08), LNCS 5209, Springer, pp. 75-88, 2008.
[WP4.3]

 127

K. Jansen.
Parameterized approximation scheme for the multiple knapsack problem.
In Proc. of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), 2009, to appear.
[WP3.3]

 128

K. Jansen and R. Solis-Oba.
A polynomial time approximation scheme for the square packing problem.
In Proc. of the 13th Conference on Integer Programming and Combinatorial Optimization (IPCO 08), LNCS 5035, Springer, pp. 184-198, 2008.
[WP3.3]

 129

K. Jansen and H. Zhang.
Approximation algorithms for general packing problems and their application to the multicast congestion problem.
Mathematical Programming, 114(1), pp. 183-206, 2008.
[WP3.3]

 130

D. Kalles, A. Kaporis, and P. Spirakis.
Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games.
In Proc. of 7th International Workshop on Experimental Algorithms (WEA 08), LNCS 5038, Springer, pp. 181-193, 2008.  
[WP1.3]

 131

M. Kalochristianakis, V. Gkamas, G. Mylonas, S. Nikoletseas, J. Rolim, and E. Varvarigos.
The Design of an Open and Integrated Sensor Network Management Platform.
In Proc. of the 11th IEEE Asia-Pacific Network Operations and Management Symposium (APNOMS 08), IEEE Computer Society, 2008, to appear.
[WP5.3]

 132

F. Kardoš, D. Král', J. Miškuf and J.-S. Sereni.
Fullerene graphs have exponentially many perfect matchings.
Technical report, 2008.
[WP1.1]

 133

A. Kinalis, S. Nikoletseas.
Adaptive Redundancy for Data Propagation Exploiting Dynamic Sensory Mobility.
In Proc. of the 11th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 08), ACM Press, 2008, to appear. 
[WP5.3]

134

A. Kinalis, S. Nikoletseas, and D. Patroumpa.
Efficient sensory data collection by random walks with adaptive stop times.
Technical report, 2008.
[WP5.2, WP5.3]

 135

A. Kirsch, M. Mitzenmacher, A. Pietracaprina, G. Pucci, E. Upfal, and F. Vandin.
A Rigorous Statistical Approach for Identifying Significant Itemsets.
Technical report, 2008.
[WP1.2]

R. Klasing, N. Morales and S. Pérennes.
On the Complexity of Bandwidth Allocation in Radio Networks.
Theoretical Computer Science, 406(3), pp. 225-239, 2008.
[WP2.2, WP5.1]

 137

G. Koloniari and E. Pitoura.
A Recall-Based Cluster Formation Game in Peer-to-Peer Systems.
Technical report, 2008.
[WP2.1] 

 138

G. Koloniari and E. Pitoura.
Distributed Structural Relaxation of XPath Queries.
In Proc. of the IEEE 25th International Conference onData Engineering (ICDE 09), IEEE Computer Society, 2009, to appear.
[WP2.1] 

 139

G. Koloniari and E. Pitoura.
Recall-Based Cluster Reformulation by Selfish Peers.
In Proc. of the 4th International Workshop on Networking Meets Databases (NetD 08), IEEE Computer SOciety, pp. 200-205, 2008.
[WP2.1] 

 140

D. Král', E. Máčajová, A. Pór and J.-S. Sereni.
Characterization of affine Steiner triple systems and Hall triple systems.
In Proc. of the 2007 European Conference on Combinatorics, Graph Theory and Applications (EuroComb 07), Electronic Notes in Discrete Mathematics, vol. 29, pp. 17-21, 2007.
[WP1.1]

 141

D. Král', E. Máčajová, A. Pór and J.-S. Sereni,
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems.
In Proc. of the 2007 European Conference on Combinatorics, Graph Theory and Applications (EuroComb 07), Electronic Notes in Discrete Mathematics, vol. 29, pp. 23-27, 2007.
[WP1.1]

 142

D. Král', O. Prangrác, J.-S. Sereni and R. Škrekovski.
Long cycles in fullerene graphs.
Journal of Mathematical Chemistry, 2008, to appear.
[WP1.1]

 143

D. Král', J.-S. Sereni and M. Stiebitz.
A new lower bound on the number of perfect matchings in cubic graphs.
Technical report, 2008.
[WP1.1]

 144

G. Kun, J. Nešetřil.
Forbidden lifts NP and CSP for combinatorists.
European Journal of Combinatorics, vol. 4, pp. 930-945,  2008.
[WP1.1]

 145

P. Laud, L. Ngo.
Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library.
In Proc. of the 2nd Conference on Provable Security (ProvSec 08), LNCS 5324, Springer, 2008, to appear. Also, Also, Cryptology ePrint Archive: Report 2008/367.
[WP4.1]

K. Lillis and E. Pitoura.
Cooperative XPath Caching.
In Proc. of the 2008 ACM SIGMOD international conference on Management of Data, pp. 327-338, 2008.
[WP2.1, WP3.1]

L. Liquori, D. Borsetti, C. Casetti and C. Chiasserini.
An Overlay Architecture for Vehicular Networks.
In Proc. of the 7th International Conference on Networking (IFIP 08), LNCS 4982, Springer, pp. 60-71, 2008.
[WP2.1, WP5.3]

L. Liquori and B. Serpette.
iRho: An Imperative Rewriting-calculus.
In Mathematical Structures in Computer Science, 18(3), pp. 467-500, 2008.
[WP2.1]

 149

A. Marculescu, S. Nikoletseas, O. Powell, and J. Rolim.
Efficient Tracking of Moving Targets by Passively Handling Traces in Sensor Networks.
In Proc. of the 51st IEEE International Global Communications Conference (GLOBECOM 08), 2008, to appear.
[WP5.2]

 150

L. Martucci, C. Andersson, M. Kohlweiss, A. Panchenko.
Self-certified Sybil-Free Pseudonyms.
In Proc. of the 1st ACM conference on Wireless Network Security (ACM WiSec 08), ACM Press, pp. 154-159, 2008.
[WP4.2]

 151

M. Mavronicolas, B. Monien, V. G. Papadopoulou and F. Schoppman.
Voronoi Games on Cycle Graphs.
In Proc. of the 33nd International Symposium on Mathematical Foundations of Computer Science (MFCS 08), LNCS 5162, Springer, pp. 503-514, 2008.
[WP 1.3]

 152

M. Mavronicolas, B. Monien, V. G. Papadopoulou, F. Schoppman and T. Tscheuschner.
Voronoi Games on Surfaces  and Graphs.
In Proc. of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 08), LNCS 5162, Springer, pp. 503-514, 2008.
[WP 1.1]

 153

M. Mavronicolas and  V. G. Papadopoulou.
The Good, the Bad and the Ugly.
Technical report, 2008.
[WP 1.4]

 154

M. Mavronicolas and T. Sauerwald.
The Impact of Randomization in Smoothing Networks.
In Proc. of the 27th Annual ACM Symposium on Principles of Distributed Computing (PODC 08), ACM, pp. 345-354, 2008.
[WP 3.3]

 155

F. Mazzenga, R. Giuliano.
Performance Evaluation of UWB Networks Using Detect and Avoid Procedures.
In Proc. of the 2007 Wireless Rural and Emergency Communications (WRECOM 07), IEEE, 2007
[WP6.2]

 156

H. Meyerhenke.
Disturbed Diffusive Processes for Solving Partitioning Problems on Graphs.
PhD thesis, Universität Paderborn, 2008.
[WP3.2]

 157

H. Meyerhenke, B. Monien, and T. Sauerwald.
A new diffusion-based multilevel algorithm for computing graph partitions of very high quality.
In Proc. of the 22nd International Parallel and Distributed Processing Symposium (IPDPS 08), IEEE Computer Society, 2008. (Winner of the Best Algorithms Paper Award)
[WP3.2]

 158

C. Molle, F. Peix, S. Pérennes and H. Rivano.
Formulation en Coupe/Rounds pour le Routage dans les réseaux radio maillés.
In Proc. of the 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel 08), 2008.
[WP2.2, WP5.2]

 159

C. Molle, F. Peix and H. Rivano.
An optimization framework for the joint routing and scheduling in wireless mesh networks.
In Proc. of the 19th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 08), 2008, to appear.
[WP2.2, WP5.2]

 160

C. Molle, F. Peix and H. Rivano.
Génération de colonnes pour le routage et l'ordonnancement dans les réseaux radio maillés.
In Proc. of the Colloque francophone sur l'ingénierie des protocoles (CFIP 08), 2008 (Student best paper award).
[WP2.2, WP5.2]

 161

C. Molle and M.-E. Voge.
Influence des acquittements sur la capacité des réseaux radio maillés.
In Proc. of the 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel 08), 2008.
[WP2.2, WP5.1]

 162

B. Monien, R. Preis and S. Schamberger.
Approximation Algorithms for Multilevel Graph Partitioning.
Handbook of Approximation Algorithms and Metaheuristics, Taylor & Francis Group,  pp. 60.1-60.15, 2007.
[WP3.2]

 163

B. Monien and K. Tiemann.
Routing and Scheduling with Incomplete Information.
In Proc. of the 21st International Symposium on Distributed Computing (DISC 07), LNCS 4731, Springer, pp. 1-2, 2007.
[WP1.2]

J. Monteiro.
The use of evolving graph combinatorial model in routing protocols for dynamic networks.
In Proc. of the XV Concurso Latinoamericano de Tesis de Maestría (CLEI 08), pp. 41-57, 2008. (Third prize in the CLEI 08 Master’s Thesis Contests.)
[WP2.2, WP5.3]

 165

L. Moraru, P. Leone, S. Nikoletseas and J. Rolim.
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks.
In Proc. of the 7th International Conference on Ad-Hoc Networks & Wireless (Ad-HocNow 08), LNCS, Springer, 2008, to appear.
[WP2.2, WP5.1, WP5.2]

 166

L. Moraru, P. Leone, S. Nikoletseas and J. Rolim.
Path Quality Detection Algorithms for Near Optimal Geographic Routing in Sensor Networks with Obstacles.
Wireless Communications and Mobile Computing, pp. 1–13, 2008.
[WP2.2, WP5.1, WP5.2]

 167

T. Müller, A. Pór and J.-S. Sereni.
Frame of graphs and graphs with four boundary points.
Technical report, 2008.
[WP1.1]

 168

T. Müller, A. Por and J.-S. Sereni.
Lower bounding the boundary of a graph in terms of its maximum or minimum degree.
Discrete Mathematics, 2008, to appear.
[WP1.1]
(recorded also as report No. 144 in 2nd Year reports as Technical report)

X. Muñoz and I. Sau Valls.
Traffic Grooming in Unidirectional WDM Rings with Bounded-Degree Request Graph.
In Proc. of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 08), 2008, to appear.
[WP2.2]

 170

J. Nešetřil
Many facets of dualities.
Technical report, 2008.
[WP1.1]

 171

J. Nešetřil, Y. Nigussie.
Finite Dualities and Map-Critical Graphs on a Fixed Surface.
Technical report, 2008.
[WP1.1]

 172

J. Nešetřil, P. Ossona~de Mendez.
First Order Properties on Nowhere Dense Structures.
Technical report, 2008.
[WP1.1]

 173

J. Nešetřil, P. Ossona de Mendez.
Grad and Classes with Bounded Expansion: I. Decompositions.
European Journal of Combinatorics, 29(3), pp. 760-776, 2008.
[WP1.1]

 174

J. Nešetřil, P. Ossona de Mendez.
Grad and classes with bounded expansion: Algorithmic aspects.
European Journal of Combinatorics, 29(3), pp. 777-791, 2008.
[WP1.1]

 175

J. Nešetřil, P. Ossona de Mendez.
Grad and classes with bounded expansion: Restricted graph homomorphism dualities.
European Journal of Combinatorics, 29(4), pp. 1012-1024, 2008.
[WP1.1]

 176

J. Nešetřil, P.Ossona de Mendez.
On nowhere dense graphs.
Technical report, 2008.
[WP1.1]

 177

J. Nešetřil, P. Ossona~de Mendez.
Structural Properties of Sparse Graphs.
Technical report, 2008.
[WP1.1]

 178

J. Nešetřil, M. Siggers, L. Zadori.
A Combinatorial Constraint Satisfaction Problem Dichotomy Classification Conjecture.
Technical report, 2008.
[WP1.1]

S. Nikoletseas, O. Powell and J. Rolim.
Geographic Routing of Sensor Data around Voids and Obstacles.
Chapter in Intelligent Techniques forWarehousing and Mining Sensor Network Data, 2008, to appear.
[WP5.2, WP5.3]

 180

S. Nikoletseas, C. Raptopoulos, and P. Spirakis.
On the Independence Number and Hamiltonicity of Uniform Random Intersection Graphs.
Technical report, 2008.
[WP5.1]

 181

R. Ostrovsky, G. Persiano, I. Visconti.
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model.
In Proc. of the 35th International Colloquium on Automata, Languages and Programming (ICALP 08), LNCS 5126, Springer, pp. 548-559, 2008.
[WP4.3]

 182

P. Panagopoulou, and P. Spirakis.
A Game Theoretic Approach for Efficient Graph Coloring.
In Proc. of the 19th International Symposium on Algorithms and Computation (ISAAC 08), 2008, to appear.
[WP1.3]

J. X. Parreira, C. Castillo, D. Donato, S. Michel, and G. Weikum.
The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network. 
VLDB Journal, 17(2), pp. 291–313, 2008.
[WP3.1]

 184

J-X. Parreira, S. Michel, G. Weikum.
Efficiently Handling Dynamics in Distributed Link Based Authority Analysis.
In Proc. of the 9th International Conference on Web Information Systems Engineering (WISE 08), LNCS 5175, Springer, pp. 36-49, 2008.
[WP3.1]

 185

P. Penna and C. Ventre.
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions.
In Proc. of the 16th Annual European Symposium on Algorithms (ESA 08), LNCS 5193, Springer, pp. 708-719, 2008.
[WP2.3, WP1.2]

 186

S. Persia, D. Cassioli D, F. Vatalaro, F. Ananasso.
Cross-Layer Design of a LDR-L/T UWB Sensor Network.
In Proc. of the 10th International Symposium on Spread Spectrum Techniques and Applications (ISSSTA 08), IEEE Computer Society, pp. 572-576, 2008.
[WP6.2]

 187

E. Peserico and L. Pretto.
HITS can converge slowly, but not too slowly, in score and in rank.
Technical report, 2008.
[WP1.2]

 188

E. Peserico, L.Pretto.
The rank convergence of HITS can be slow.
Technical report, 2008.
[WP1.2]

 189

A. Pettarin.
On the Diameter of Bluetooth-Based Ad-Hoc Networks.
Master Thesis, Deptartment of Information Engineering, Universita di Padova, Italy.
[WP1.1]

 190

O.Powell.
Passive and lightweight target tracking for sensor networks.
Invited paper in the ProSense adjunct workshop proceedings of DCOSS 08, 2008.
[WP5.2]

 191

P. Raftopoulou, E. Petrakis, C. Tryfonopoulos, and G. Weikum.
Information Retrieval and Filtering over Self-Organising Digital Libraries.
In Proc. of the 12th European Conference on Research and Advanced Technology for Digital Libraries (ECDL 08), LNCS 5173, Springer, pp. 320-333, 2008.
[WP3.1]

 192

T. Razafindralambo and I. Guérin Lassous.
SBA: A Simple Backoff Algorithm.
Technical report, 2008.
[WP5.1]

J. Ribault and O. Dalle.
Enabling advanced simulation scenarios with new software engineering techniques.
In Proc. of the 20th European Modeling and Simulation Symposium (EMSS 08), 2008, to appear.
[WP6.2]

 194

D. Richerby, D. Thilikos.
Searching for a visible, lazy fugitive.
In Proc. of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 08), LNCS, Springer, 2008, to appear.
[WP1.1]

195

C. Sarr, C. Chaudet, G. Chelius, I. Guérin-Lassous.
Bandwidth Estimation for IEEE 802.11-based Ad Hoc Networks.
IEEE Transactions on Mobile Computing, 7(10), pp. 1228-1241, 2008.
[WP5.1]
(recorded also as report No. 169 in 2nd Year reports as Technical report)

I. Sau Valls and J. Žerovnik.
An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks.
Discrete Mathematics and Theoretical Computer Science, 10(3), pp. 49–62, 2008.
[WP1.5]

 197

T. Sauerwald.
Randomized Protocols for Information Dissemination.
PhD thesis, Universität Paderborn, 2008.
[WP3.2]

 198

T. Sauerwald and D. Sudholt.
Self-Stabilizing Cuts in Synchronous Networks.
In Proc. of the 15th International Colloquium on Structural Information and Communication Complexity (SIROCCO 08), LNCS 5058, Springer, pp. 234-246, 2008.
[WP3.2]

 199

A. Scherrer, P. Borgnat, E. Fleury, J-L. Guillaume, and C. Robardet.
Description and simulation of dynamic mobility networks.
Computer Network, 2008, to appear.
WP[5.3]

 200

S. Schiffner.
Sybilguard on Real World Graphs.
Technical report, 2008.
[WP4.2]

 201

F. Schoppmann.
The Power of Small Coalitions in Cost Sharing.
In Proc. of the 4th International Workshop on Internet and Network Economics (WINE 08), LNCS 5385, Springer, pp. 665-674, 2009.
[WP2.3]

 202

U. Schwarz.
Online scheduling on semi-related machines.
Information Processing Letters, 108(1), pp.38-40, 2008.
[WP3.3]

 203

J.-S. Sereni.
Equitable colourings of graphs with bounded density and given girth.
Technical report, 2008.
[WP1.1]

 204

J.-S. Sereni.
Randomly colouring graphs (a combinatorial view).
Computer Science Reviews, 2(2), pp. 63-95, 2008
[WP1.1]

 205

F. Silvestri.
On the Limits of Cache-Oblivious Rational Permutations.
Theoretical Computer Science, 402(2-3):221-233, 2008
[WP3.2]

F. Silvestri.
Network-Oblivious Algorithms for the Gaussian Elimination Paradigm.
Technical report, 2008.
[WP3.2]

 207

M. Sozio, T. Crecelius, J-X. Parreira, G. Weikum.
Good Guys vs. Bad Guys: Countering Cheating in Peer-to-Peer Authority Computations over Social Networks.
In Proc. of the 11th International Workshop on the Web and Databases (WebDB 08), 2008.
[WP3.1]

 208

M. Sozio, T. Crecelius, J. X. Parreira, and G. Weikum.
The Good, the Bad, the Ugly, and the Beautiful (P2P Authority Computation with Malicious Peers, Its Problems, and a Solution).
Technical report, 2008.
[WP3.1]

 209

M. Sozio, T. Neumann, G. Weikum.
Near-Optimal Dynamic Replication in Unstructured Peer-to-Peer Networks.
In Proc. of the 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 08), ACM Press, pp. 281-290, 2008.
[WP3.1]

 210

A. Squicciarini, A. Trombetta, E. Bertino, S. Braghin.
Identity-based Long Running Negotiations.
In Proc. of the 4th ACM Workshop on Digital Identity Management (DIM 08), 2008, to appear.
[WP4.1, WP4.2]

 211

K. Stamkopoulos, E. Pitoura and P. Vassiliadis and A. Zarras.
Scheduling the Deployment of Composite Web  Services.
Journal of Database Management, Special Issue on XML Data Services: Technology Evolution and Challenges, 2008, to appear.
[WP3.4]

 212

A. Stewart, M. Clint, T. Harmer, P. Kilpatrick, R.H. Perrott, J. Gabarró.
Assessing the Reliability and Cost of Web and Grid Orchestrations.
In Proc. of the 3rd International Conference on Availability, Reliability and Security (ARES 08), IEEE Computer Society, pp. 428-433, 2008.
[WP1.4]

 213

R. Thöle and K. Jansen.
Approximation algorithms for scheduling parallel jobs: breaking the approximation ratio of 2.
In Proc. of the 35th International Colloquium on Automata, Languages and Programming (ICALP 08), LNCS 5125, Springer, pp. 234-245, 2008.
[WP3.3]

 214

C. Troncoso, D. De Cock, and B. Preneel.
Improving Secure Long-Term Archival of Digitally Signed Documents.
In Proc. of the 4th International Workshop on Storage Security and Survivability (StorageSS 08), ACM Press, 2008, to appear.
[WP4.2]

 215

C. Troncoso, B. Gierlichs, B. Preneel and I. Verbauwhede.
Perfect Matching Disclosure Attacks.
In Proc. of the 8th Privacy Enhancing Technologies Symposium (PETS 08), LNCS 5134, Springer, pp. 2-23, 2008.
[WP4.2]

 216

H. Tsaknakis, P. Spirakis, D. Kanoulas.
Performance evaluation of a descent algorithm for bi-matrix games.
Technical report, 2008.
[WP1.3]

 217

R. Vannier, I. Guérin Lassous.
Towards a practical and fair rate allocation for multihop wireless networks based on a simple node model.
In Proc. of the 11th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 08), 2008, to appear.
WP[5.1]

 218

F. Vatalaro.
Towards Context Aware Communications.
Telecom Italia Internal Bulletin, vol. 16, N.2, pp. 106-111, 2007.
[WP6.2]

 219

C. Ventre and I. Visconti.
Completely Non-malleable Encryption Revisited.
In Proc. of the 11th International Workshop on Practice and Theory in Public-Key Cryptography (PKC 08), LNCS 4939, Springer, pp. 65-84, 2008
[WP4.3]

 220

C. Zimmer, S. Bedathur, and G. Weikum.
Flood Little, Cache More: Effective Result-Reuse in P2P IR Systems.
In Proc. of 13th International Conference on Database Systems for Advanced Applications (DASFAA 08), LNCS 4947, Springer, pp. 235-250, 2008.
[WP3.1]

 221

C. Zimmer, J. Heinz, C. Tryfonopoulos, and G. Weikum.
P2P Information Retrieval and Filtering with MAPS.
In Proc. of the 8th International Conference on Peer-to-Peer Computing (P2P 08), IEEE Computer Society, pp. 84-85, 2008.
[WP3.1]

 222

C. Zimmer, C. Tryfonopoulos and G. Weikum.
Exploiting Correlated Keywords to Improve Approximate Information Filtering.
In Proc. of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 08), ACM Press, pp. 323-330, 2008.
[WP3.1]