1

C. Àlvarez, M. Blesa and M. Serna.
The robustness of stability under link and node failures.
Technical report, 2007.
[WP1.4]

 2

C. Àlvarez, G. Frances.
Maximum Congestion Games on Networks: How can We Compute Their Equilibria?
Technical report, 2007.
[WP1.3]

 3

O. Amini, F. Giroire, F. Huc and S. Pérennes.
Minimal selectors and fault tolerant networks.
Networks, 2007, to appear.
[WP1.4]

 4

O. Amini, S. Griffiths and F. Huc.
4-cycles in mixing digraphs.
In Proc. of the 4th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 07), 2007, to appear.
[WP1.1]

 5

O. Amini, F. Huc, S. Pérennes.
On the pathwidth of planar graphs.
SIAM Journal of Discrete Mathematics, 2007, to appear.
[WP1.1]

 6

O. Amini, S. Pérennes and I. Sau.
Hardness of Approximating the Traffic Grooming Problem.
In Proc. of Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 07), pp. 45-48, 2007.
[WP2.2, WP1.5]

 7

O. Amini and S. Pérennes and I. Sau.
Hardness and Approximation of  Traffic Grooming.
In Proc. of the 18th International Symposium on Algorithms and Computation (ISAAC 07), LNCS, Springer, 2007, to appear.
[WP1.5, WP2.2]

 8

O. Amini and B. Reed.
List Colouring Constants of Triangle Free Graphs.
In Proc. of the 4th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 07), 2007, to appear.
[WP1.1]

9

A. Antoniou, I. Chatzigiannakis, A. Kinalis, G. Mylonas, S. Nikoletseas and A. Papageorgiou.
A Peer-to-Peer Environment for Monitoring Multiple Wireless Sensor Networks.
In Proc. of the 10th ACM/IEEE Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM 07), 2007, to appear. 
[WP6.2]

  10

S. Athanassopoulos, I. Caragiannis, and C. Kaklamanis.
Analysis of approximation algorithms for k-set cover using factor-revealing linear programs.
In Proc. of the 16th International Symposium on Fundamentals of Computation Theory (FCT 07), LNCS, Springer, 2007, to appear.
[WP1.5]

 11

V. Auletta, C. Blundo, S. Cimato, E. De Cristofaro, and G. Raimato.
Authenticated Web-Services: A WS-Security Based Implementation.
In Proc. of the 2007 International Conference on New Technologies, Mobility, and Security (NTMS 07), 2007, to appear.
[WP4.3]

 12

V. Auletta, C. Blundo, and E. De Cristofaro.
A J2ME transparent middleware to support HTTP connections over Bluetooth.
In Proc. of the 2nd IEEE International Conference on Systems and Networks Communications (ICSNC 07), 2007, to appear.
[WP4.3]

 13

V. Auletta, C. Blundo, E. De Cristofaro, and G. Raimato.
A Lightweight Framework for Web Services Invocation over Bluetooth.
In Proc. of the 4th IEEE International Conference on Web Services (ICWS 06), IEEE Computer Society, pp. 331-338, 2006.
[WP4.3]

 14

V. Auletta, C. Blundo, E. De Cristofaro, and G. Raimato.
Performance Evaluation for Web Services Invocation over Bluetooth.
In Proc. of the ACM International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks (PM2HW2N 06), ACM Press, pp. 1-8, 2006.
[WP4.3]

15

G. Ausiello, V. Bonifaci, and L. Laura.
The on-line asymmetric traveling salesman problem.
Journal of Discrete Algorithms, 2007. To appear. doi:10.1016/j.jda.2007.03.002.
[WP1.2, WP1.5]

 16

A. Bamis, A. Boukerche, I. Chatzigiannakis, and S. Nikoletseas.
A Mobility Aware Protocol Synthesis for Efficient Routing in Ad-Hoc Mobile Networks.
Computer Networks, 52(1), pp. 130-154, 2008.
[WP5.3]

 17

L. Becchetti, P. Boldi, C. Castillo, and A. Gionis.
Efficient Semi-Streaming Algorithms for Local Triangle Counting in Massive Graphs.
Technical report, 2007.
[WP1.2, WP1.5]

 18

L. Becchetti, C. Castillo, D. Donato, R. Baeza-Yates, and S. Leonardi.
Link Analysis for Web Spam Detection.
ACM Transactions on the Web, 2007, to appear.
[WP1.2, WP1.5]

 19

M. Bender, S. Michel, P. Triantafillou, G. Weikum.
Design Alternatives for Large-Scale Web Search: Alexander Great, Aeneas a Pioneer, and Anakin has the Force.
In Proc. of the 2007 ACM SIGIR Workshop on Large-Scale Distributed Systems for Information Retrieval, 2007, to appear.
[WP3.1]

 20

P.  Berenbrink, R. Elsässer and T. Friedetzky.
Efficient randomised broadcasting in random regular networks and Peer-to-Peer systems.
Technical report, 2007.
[WP3.2]

 21

J-C. Bermond, L. Braud and D. Coudert.
Traffic Grooming on the Path.
Theoretical Computer Science, Vol. 384(2-3), pp. 139-151, 2007.
[WP2.2]

 22

J-C. Bermond, R. Correa and M-L. Yu.
Optimal Gathering Protocols on Paths under Interference Constraints.
Technical report, 2007.
[WP3.3]

 23

J.-C. Bermond and M. Cosnard.
Minimum number of wavelengths equals load in a DAG without internal cycle.
In Proc. of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS 07), pp. 1-10, 2007.
[WP1.5, WP2.2]

 24

J.-C. Bermond, F. Giroire and S. Pérennes.
Design of Minimal Fault Tolerant On-Board Networks : Practical constructions.
In Proc. of the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 07), LNCS 4474, Springer, pp. 261-273, 2007.
[WP1.4]

 25

J.-C. Bermond, F. Havet, F. Huc and C. Linhares-Sales.
Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés.
In Proc. of Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 07), 2007.
[WP1.1]

 26

P. Bertasi, M. Bianco, A. Pietracaprina, and G. Pucci. 
Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer.
In Proc. of the 1st International Workshop on P2P, Parallel, Grid and Internet Computing (3PGIC 07), 2007, to appear. Also, in International Journal of Computational Intelligence Research, 4(1), pp. 1-8, 2008.
[WP6.2]

 27

A. Bertoldo.
FEMS: An Adaptive Finite Element Solver.
In Proc. of the 2007 International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC 07), 2007.
[WP 3.2]

 28

A. Bertoldo, M. Bianco, and G. Pucci.
A Static Parallel Multifrontal Solver for Finite Element Meshes.
In Proc. of the 4th International Symposium on Parallel and Distributed Processing and Applications (ISPA 06), LNCS 4330, Springer, pp. 734-746, 2006.
[WP3.2]

 29

G. Bilardi, K. Ekanadham, and P. Pattnaik.
The speculative prefetcher and evaluator processor for pipelined memory hierarchies.
In Proc. of the 4th International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA 06), IEEE Computer Press, pp. 29-43, 2006.
[WP3.2]

 30

G. Bilardi and A. Ferrante.
The role of terminal cost/reward in finite-horizon, discrete-time LQ optimal control.
Linear Algebra and Its Applications, Vol. 425, pp. 323-344, 2007.
[WP1.2]

 31

G. Bilardi, A. Pietracaprina, G. Pucci, F. Silvestri.
Network-Oblivious Algorithms.
In Proc. of the 21st International Parallel and Distributed Processing Symposium (IPDPS 07), IEEE, pp. 1-10, 2007.
[WP3.2]

 32

B. Biörnstad, C. Pautasso, G. Alonso.
Enforcing Web services business protocols at run-time: a process-driven approach.
International Journal of Web Engineering and Technology, Vol. 2, No. 4, pp. 396-411, 2006.
[WP3.4] 

 33

Y. Bleischwitz, B. Monien, and F. Schoppmann.
To be or not to be (served).
In Proc. of the 3rd International Workshop on Internet and Network Economics (WINE 07), LNCS 4858, Springer, pp. 515-528, 2007.
[WP2.3]

 34

Y. Bleischwitz, B. Monien, F. Schoppmann, and K. Tiemann.
The power of two prices: Beyond cross-monotonicity.
In Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 07), LNCS 4708, Springer, pp. 657-668, 2007.
[WP2.3]

 *

M. Blesa and C. Blum.
Finding edge-disjoint paths with artificial ant colonies.
Journal of Mathematical Modelling and Algorithms, 6(3):361-391, 2007.
[WP1.5]
(recorded also as report No. 39 in 1st Year reports as Technical report)

 *

M. Blesa, D. Calzada, A. Fernández, L. López, A.L. Martínez, A. Santos, M. Serna and C. Thraves.
Adversarial queueing model for continuous network dynamics.
Theory of Computing Systems, 2007, to appear.
[WP1.4]
(recorded also as report No. 41 in 1st Year reports as conference version in MFCS 2005 )

 35

C. Blundo, P. D' Arco, A. De Santis, D. R. Stinson.
On Unconditionally Secure Distributed Oblivious Transfer.
Journal of Cryptology, Vol. 3(20), pp. 323-373, 2007.
[WP4.3]

 36

C. Blundo and E. De Cristofaro.
A Bluetooth-based JXME infrastructure.
In Proc. of the 9th International Symposium on Distributed Objects, Middleware, and Applications (DOA 07), LNCS, Springer, 2007, to appear.
[WP4.3]

 37

C. Blundo, E. De Cristofaro, C. Galdi, G. Persiano.
Validating Orchestration of Web Services with BPEL and Aggregate Signatures.
In Proc. of the 2nd Italian Workshop on PRIvacy and SEcurity (PRISE 07), 2007, to appear.
[WP4.3]

 38

C. Blundo, E. De Cristofaro, A. Del Sorbo, C. Galdi,  G. Persiano.
Distributed Outsourcing of Computation on Private Data: A Distributed Implementation of the Certified Information Access Service.
Technical report, 2007.
[WP4.3]

 39

V. Bonifaci.
An adversarial queueing model for online server routing.
Theoretical Computer Science, Vol. 381(1-3), pp.280-287, 2007.
[WP1.2, WP3.3, WP1.5]

 40

S. Boschi, P. Crescenzi, M. Di Ianni, G. Rossi, P. Vocca.
Ecological Role Assignments and Mobility Models for Ad Hoc Wireless Networks.
Technical report, 2007.
[WP1.5, WP5.3]

 41

A, Buldas, A. Jürgenson.
Does secure time-stamping imply collision-free hash functions?
In Proc. of the 1st International Conference on Provable Security (ProvSec 07), LNCS 4784, Springer, pp.138-150, 2007.
[WP4.3]

 42

A. Buldas, S. Laur.
Knowledge-binding commitments with applications in time-stamping.
In Proc. of the 2007 International Conference on Theory and Practice of Public-Key Cryptography (PKC 07), LNCS 4450, Springer, pp. 150-165, 2007.
[WP4.3]

 43

A. Buldas, T. Mägi.
Practical security analysis of e-voting systems.
In Proc. of the 2nd International Workshop on Security (IWSEC 07), LNCS 4752, Springer, pp.320-335, 2007.
[WP4.1]

 *

T. Calamoneri, A. E. F. Clementi, M. Di Ianni, M. Lauria, A. Monti and R. Silvestri.
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks.
Theoretical Computer Science, 2007, to appear.
[WP1.1, WP1.5, WP5.1, WP5.2]
(recorded also as report No. 49 in 1st Year reports)

 44

T. Calamoneri and A. Clementi and E. Fusco and R. Silvestri.
Maximizing the number of broadcast operations in static random geometric ad-hoc networks.
Technical report, 2007.
[WP5.1]

 45

T. Calamoneri and A. Clementi and A. Monti and R. Silvestri.
Minimum Enegy Broadcast on Random Grids.
Technical report, 2007.
[WP5.1]

46

T. Calamoneri, E. Fusco, A. Shende, S. Shende.
Proxy Assignments for Filling Gaps in Wireless Ad-hoc Lattice Computers.
In Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO 07), LNCS, Springer, 2007, to appear.
[WP1.1, WP1.5, WP5.1, WP5.2]

 47

J. Camenisch, S. Hohenberger, M. Kohlweiss, A. Lysyanskaya, and M. Meyerovich.
How to win the clone wars: Efficient periodic n-times anonymous authentication.
In Proc. of the 13th ACM Conference on Computer and Communications Security (CCS 06), ACM Press, pp. 201-210, 2006.
[WP4.2]

48

I. Caragiannis.
Wavelength management in WDM rings to maximize the number of connections.
In Proc. of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS 07), LNCS, Springer, 2007, to appear.
[WP2.2]

 49

I. Caragiannis.
Better bounds for online load balancing on unrelated machines.
In Proc. of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 08), 2008, to appear.
[WP1.2, WP2.3, WP3.3]

 50

Ι. Caragiannis, A. Fishkin, C. Kaklamanis, E. Papaioannou.
A tight bound for online coloring of disk graphs.
Theoretical Computer Science, Vol. 384(2-3), pp. 152-160, 2007.
[WP1.2, WP2.2, WP5.1]

 51

I. Caragiannis, A. Fishkin, C. Kaklamanis, E. Papaioannou.
Randomized Online Algorithms and Lower Bounds for Computing Large Independent Sets in Disk Graphs.
Discrete Applied Mathematics, Vol. 155 (2), pp. 119-136, 2007.
[WP1.2, WP2.2, WP5.1]

52

I. Caragiannis, M. Flammini, and L. Moscardelli.
An exponential improvement to the MST heuristic for minimum energy broadcasting in ad hoc wireless networks.
In Proc. of the 34th International Colloquium on Automata, Languages, and Programming (ICALP 07), LNCS, Springer, 2007, to appear.
[WP5.1]

 53

I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos.
Minimum energy Communication in ad hoc wireless networks: A survey.
Chapter in Handbook of Parallel Computing: Models, Algorithms, and Applications, Chapter 39, pp. 1-18, Chapman & Hall/CRC Computer & Information Science Series, 2007.
[WP5.1]

 54

Ι. Caragiannis, C. Kaklamanis, E. Papaioannou.
Competitive Algorithms and Lower Bounds for Online Randomized Call Control in Cellular Networks.
Networks, 2008, to appear.
[WP1.2, WP2.2, WP5.1]

 55

I. Caragiannis, C. Kaklamanis, E. Papaioannou.
Online call admission control in wireless cellular networks.
Handbook of Parallel Computing: Models, Algorithms, and Applications, Chapter 38, pp. 1-19, Chapman & Hall/CRC Computer & Information Science Series, 2007.
[WP1.2, WP2.2, WP5.1]

 56

D. Catalano and I. Visconti.
Hybrid commitments and their applications to zero-knowledge proof systems.
Theoretical Computer Science, Vol. 375(1- 3), pp. 229-260, 2007.
[WP4.3]

 57

R. Chand, M. Cosnard and L. Liquori.
Powerful resource discovery for Arigatoni overlay network.
In Future Generation Computer Systems, 1(21), pp. 31-38, 2008.
[WP2.1]

 58

R. Chand, L. Liquori and M. Cosnard.
Improving Resource Discovery in the Arigatoni Overlay Network.
In Proc. of the International Conference on Architecture of Computing Systems (ARCS 07), LNCS 4419, Springer, pp. 98-111, 2007.
[WP2.1]

 59

I. Chatzigiannakis.
Communication Algorithms for Ad Hoc Mobile Networks Using Random Walks.
Encyclopedia of Algorithms, Springer, ISBN 978-0-387-30770-1, pp. 161-165, 2008. 
[WP5.3]

60

I. Chatzigiannakis, A. Kinalis and S. Nikoletseas.
Fault-tolerant and efficient data propagation in wireless sensor networks using local, additional network information.
Journal of Parallel and Distributed Computing, 67(4), pp. 456-473, 2007.  
[WP5.3]

 61

I. Chatzigiannakis, A. Kinalis, S. Nikoletseas and J. Rolim.
Fast and Energy Efficient Sensor DataCollection by Multiple Mobile Sinks.
In Proc. of the 5th ACM International Workshop on Mobility Management and Wireless Access (MobiWac 07), 2007, to appear.
[WP5.3] 

*

I. Chatzigiannakis, E. Konstantinou, V. Liagkou and P. Spirakis.
Agent-based Distributed Group Key Establishment in Wireless Sensor Networks.
In Proc. of the IEEE International Workshop on Trust, Security, and Privacy for Ubiquitous Computing (TSPUC 07), 2007, to appear.
[WP4.3, WP5.3]
(recorded also as report No. 67 in 1st Year reports as Technical report)

 62

I. Chatzigiannakis, G. Mylonas and S. Nikoletseas.
50 ways to build your application: A Survey of Middleware and Systems for Wireless Sensor Networks.
In Proc. of the 12th IEEE Conference on Emerging Technologies and Factory Automation (ETFA 07), IEEE Industrial Electronics Society, pp. 466-473, 2007.
[WP5.3, WP6.1]

 63

I. Chatzigiannakis, G. Mylonas and S. Nikoletseas.
A Model for Obstacles to be used in Simulations of Wireless Sensor Networks and its Application in studying Routing Protocol Performance.
Simulation: Transactions of the Society for Modeling and Simulation International, 2007. 
[WP5.2]

64

I. Chatzigiannakis and A. Strikos.
A Decentralized Intrusion Detection System for Increasing Security of Wireless Sensor Networks.
In Proc. of the 12th IEEE Conference of Emerging Technologies and Factory Automation (ETFA 07), IEEE Industrial Electronics Society, pp. 1408-1411, 2007. 
[WP4.3, WP5.3]

 *

Y. Chen and E. Fleury.
A Distributed Policy Scheduling for Wireless Sensor Networks.
In Proc. of 26th Annual IEEE Conference on Computer Communications (Infocom 07), 2007, to appear.
[WP5.1]
(recorded also as report No. 76 in 1st Year reports as Technical report)

 65

Y. Chen and E. Fleury.
Backbone-based scheduling for data dissemination in wireless sensor networks with mobile sinks.
In Proc. 4th ACM SIGACT-SIGOPS International Workshop on Foundations of Mobile Computing (DIAL M-POMC), 2007.
[WP5.1]

 *

Y. Chen, E. Fleury and V. Syrotiuk.
Topology-Transparent Duty Cycling for Wireless Sensor Networks.
In Proc. of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS 07), pp. 1-10, 2007.
[WP5.1]
(recorded also as report No. 77 in 1st Year reports as Technical report)

 66

J. Chlebikova and K. Jansen.
The d-precoloring problem for k-degenerate graphs.
Discrete Mathematics, Vol. 307, pp. 2042-2052, 2007.
[WP3.3]

 67

G. Christodoulou, E. Koutsoupias, and A. Kovacs.
Mechanism Design for Fractional Scheduling on Unrelated Machines.
In Proc. of the 34th International Colloquium on Automata, Languages, and Programming (ICALP 07), pp. 40-52, 2007.
[WP1.3, WP2.3]

 68

A.E.F. Clementi, M. Di Ianni, M. Lauria, A. Monti, G. Rossi, R. Silvestri.
On the bounded-hop MST problem on random Euclidean instances.
Theoretical Computer Science, Vol. 384, pp. 161-167, 2007.
[WP1.1, WP 1.5, WP5.1,]

 69

A. Clementi and A. Monti and F. Pasquale and R. Silvestri.
Optimal Gossiping in Geometric Radio Networks in Presence of Dynamical Faults.
In Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 07), LNCS 4708, Springer, pp. 430-441,2007.
[WP1.1, WP5.1, WP5.3]

 70

A. Clementi and A. Monti and F. Pasquale and R. Silvestri.
Communication in Dynamic Radio Networks.
In Proc. of the 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 07), 2007, to appear.
[WP1.5, WP5.1, WP5.2]

 71

U. M. Colesanti, C. Crociani and A. Vitaletti.
On the Accuracy of OMNeT++ in the Wireless Sensor Networks Domain: Simulation vs Testbed.
In Proc. of the 4th ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN 07), 2007.
[WP5.2, WP5.3]

 72

M. Comas, M.Serna.
Vertex fusion under diameter constraints.
In Proc. of the 4th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 07), 2007, to appear. Also, Electronic Notes in Discrete Mathematics, 2007.
[WP1.5]

 73

D. Coudert and F. Huc and F. Peix and M-E. Voge.
On Minimizing the Average Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints.
Technical report, 2007.
[WP1.4, WP2.2]

 74

P. Crescenzi, M. Di Ianni, F. Greco, G. Rossi, P. Vocca.
On the Existence of Ecological Colorings.
Technical report, 2007.
[WP1.1, WP1.5, WP5.1, WP5.3]

 75

P. Crescenzi, C. Nocentini, A. Pietracaprina, G. Pucci, and C. Sandri.
On the Connectivity of Bluetooth-Based Ad Hoc Networks.
In Proc. of Euro-Par 2007, LNCS 4641, Springer, pp. 944–953, 2007.
[WP1.1, WP5.1]

 76

O. Dalle.
Component-based Discrete Event Simulation Using the Fractal Component Model.
In Proc. of the 14th AI, Simulation and Planning in High Autonomy Systems (AIS 07) - 3rd Conceptual Modeling and Simulation Conference (CMS 07), pp. 213—218, 2007.
[WP6.1]

 77

O. Dalle.
The OSA Project: an Example of Component Based Software Engineering Techniques Applied to Simulation.
In Proc. of the 2007 Summer Computer Simulation Conference (SCSC 07), pp. 1155-1162, 2007 (Invited paper).
[WP6.1]

 78

O. Dalle and C. Mrabet.
An Instrumentation Framework for component-based simulations based on the Separation of Concerns paradigm.
In Proc. of the 6th EUROSIM Congress on Modelling and Simulation (EUROSIM 07), 2007, to appear.
[WP6.1]

 79

O. Dalle and G. Wainer.
An Open Issue on Applying Sharing Modeling Patterns in DEVS.
CDROM of the 2007 Summer Computer Simulation Conference (SCSC 07), 2007 (short paper).
[WP6.1]

 80

G. Danezis and C. Diaz.
Space-Efficient Private Search. 
In Proc. of the 11th International Conference on Financial Cryptography and Data Security (FC 07), LNCS, Springer, 2007, to appear.
[WP4.2]

 81

G. Danezis, C. Diaz, S. Faust, E. Käsper, C. Troncoso and B. Preneel.
Efficient Negative Databases from Cryptographic Hash Functions.
In Proc. of the 10th Information Security Conference (ISC 07), LNCS, Springer, 2007, to appear.
[WP4.2]

 82

E. De Cristofaro.
A Secure and Privacy-Protecting Aggregation Scheme for Sensor Networks.
In Proc. of the IEEE International Workshop “From Theory to Practice in Wireless Sensor Networks” (T2PWSN), 2007.
[WP4.3]

 83

A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung.
On Monotone Formula Composition of Perfect Zero-Knowledge Languages.
SIAM Journal on Computing, 2007, to appear.
[WP4.2]

 84

A. Del Sorbo, C. Galdi, G. Persiano.
Distributed Certified Information Access for Mobile Devices, Smart Cards, Mobile and Ubiquitous Computing Systems.
In Proc. of the 1st IFIP TC6 / WG 8.8 / WG 11.2 International Workshop (WISTP), Heraklion, Crete, Greece, May 9-11, 2007.
[WP4.3]

 85

J. Díaz, Z. Lotker, M. Serna.
The distant-2 chromatic number of random proximity and random geometric graphs.
Information Processing Letters, 2007, to appear.
[WP5.2]

 86

F. Diedrich and K. Jansen.
Faster and Simpler Approximation Algorithms for Mixed Packing and Covering Problems.
Theoretical Computer Science, vol. 377, pp. 181-204, 2007.
[WP3.3]

 *

F. Diedrich, R. Harren, K. Jansen, R. Thöle, and H. Thomas.
Approximation Algorithms for 3D Orthogonal Knapsack.
In Proc. of the 4th Annual Conference on Theory and Applications of Models of Computation (TAMC 07), LNCS 4484, Springer, pp. 34-45, 2007.
[WP3.3]
(recorded also as report No. 98 in 1st Year reports as Technical report)

 *

F. Diedrich and K. Jansen.
An Approximation Algorithm for the General Mixed Packing and Covering Problem.
In Proc. of the International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 07), LNCS 4614, Springer, pp. 128-139, 2007.
[WP3.3]
(recorded also report No. 97 in 1st Year reports  as Technical report)

 87

F. Diedrich, K. Jansen, F. Pascual, and D. Trystram.
Approximation Algorithms for Scheduling with Reservations.
In Proc. of the 14th International Conference on High Performance Computing (HiPC 07), LNCS, Springer, 2007, to appear.
[WP3.3]

 88

F. Diedrich and U. M. Schwarz.
A Framework for Scheduling with Online Availability.
In Proc. of the 13th International European Conference on Parallel and Distributed Computing (Euro-Par 07), LNCS 4641, Springer, pp. 205-213, 2007.
[WP3.3]

 89

B. Doerr, T. Friedrich, and T. Sauerwald.
Quasirandom rumor spreading.
In Proc. of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 08), ACM Press, pp. 773-781, 2008.
[WP3.2]

 90

C. Efthymiou and P. Spirakis.
Randomly Colouring Sparse Random Graphs using a Constant number of colours.
Technical report, 2007. 
[WP1.1] 

 91

R. Elsässer and A. Neubert.
New random graph models for real world networks.
Technical report, 2007
[WP3.2]

 92

R. Elsässer and T. Sauerwald.
Broadcasting vs. mixing and information dissemination on Cayley graphs.
In Proc. of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS 07), LNCS 4393, Springer, pp. 163-174, 2007.
[WP3.2]

 93

R. Elsässer and T. Sauerwald.
The power of memory in randomized broadcasting.
In Proc. of the 19th Annual ACM/SIAM Symposium on Discrete Algorithms  (SODA 08), ACM Press, pp. 218-227, 2008.
[WP3.2]

 94

J. Gabarró, A. García, M. Clint, P. Kilpatrick, A. Stewart.
Bounded Site Failures: an Approach to Unreliable Grid Environments.
(Presented at CoreGRID Workshop on Grid Programming Model Grid and P2P Systems Architecture Grid Systems, Tools and Environments, Institute of Computer Science Foundation for Research and Technology - Hellas Heraklion - Crete, Greece, June 12-13, 2007)
Technical report, 2007.
[WP1.4]

 95

S. Gago.
Eigenvalues of scale free graphs.
Technical report, 2007.
[WP1.1]

 96

S. Gago and D. Schlatter.
Bounded expansion in complex networks.
Technical report, 2007.
[WP1.1]

 97

J. Gehweiler and G. Schomaker.
Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries.
In Proc. of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT 06), IEEE Computer Society, pp. 51-62, 2006.
[WP3.2]

 98

C. Gomes and G. Huiban.
Multiobjective Analysis in Wireless Mesh Networks.
In Proc. of the 15th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 07), 2007, to appear.
[WP1.5, WP2.2, WP5.2]

 99

C. Gomes, C. Molle, P. Reyes and H. Rivano.
Placement Optimal de points d'accès dans les réseaux radio maillés.
In Proc. of Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 07), 2007.
[WP2.2, WP5.2]

 100

J. A. Gonzalez, M. Serna and F. Xhafa.
A hyper-heuristic for scheduling independent jobs in computational grids.
In Proc. of the 3rd International Conference on Software and Data Technologies (ICSOFT 07), pp. 128-135, 2007.
[WP3.3]

 101

E. B. Hamida, G. Chelius and A. Busson.
Neighbor discovery in multi-hop wireless networks: evaluation and dimensioning with interferences considerations.
Technical report, 2007.
[WP5.2]

 102

F. Havet.
Choosability of the square of planar subcubic graphs with large girth.
Discrete Mathematics, 2007, to appear.
[WP1.1]

 103

F. Havet, J. van den Heuvel, C. McDiarmid and B. Reed.
List colouring squares of planar graphs.
In Proc. of the 2007 European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 07), 2007, to appear.
[WP1.1]

*

F. Havet, R. J. Kang, and J.-S. Sereni.
Improper colouring of unit disk graphs.
Technical report, 2007.
[WP1.1, WP5.3]
(recorded also as report No. 123 in 1st Year reports)

104

F. Havet, B. Reed and J.-S. Sereni.
L(2,1)-labellings of graphs.
In Proc. of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 08), pp. 621-630, 2008.
[WP1.1, WP5.1, WP5.2]

105

F. Havet, J.-S. Sereni and R. Škrekovski.
3-facial colouring of plane graphs.
SIAM Journal of Discrete Mathematics, 22(1), pp. 231-247, 2008.
[WP1.1]

 106

J. Hladký, D. Král’, J.-S. Sereni, and M. Stiebitz.
List colorings with measurable sets.
Technical report, 2007.
[WP1.1]

 107

F. Honsell and M. Lenisa and L. Liquori.
A Framework for Defining Logical Frameworks.
Computation, Meaning and Logic. Articles dedicated to Gordon Plotkin, Electronic Notes in Theoretical Computer Science, Vol. 172, pp. 399-436, Elsevier, 2007.
[WP2.1]

 108

F. Huc and C. Linhares-Sales and H. Rivano.
The Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks.
In Proc. of the 4th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 07), 2007, to appear.
[WP1.1, WP5.2]

 109

G. Huiban and P. Datta.
Multi-Metrics Reconfiguration in Core WDM Networks.
In Proc. of the 6th International Workshop on the Design of Reliable Communication Networks (DRCN 07), SEE, 2007, to appear.
[WP1.5, WP2.2]

 *

K. Jansen and R. Solis-Oba.
New approximability results for 2-dimensional packing problems.
In Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 07), 2007, to appear.
[WP3.3]
(recorded also as report No. 129 in 1st Year reports as Technical report)

 110

K. Jansen and G. Zhang.
Maximizing the total profit of rectangles packed into a rectangle.
Algorithmica, Vol. 47, pp. 323-342, 2007.
[W3.3]

 111

E. Kasper, S. Nikova, V. Nikov.
Strongly Multiplicative Hierarchical Threshold Secret Sharing.
In Proc. of the 2007 International Conference on Information Theoretic Security (ICITS 07), LNCS, Springer, 2007, to appear.
[WP4.3]

 112

N. Kemmidas.
Ring structured node hierararchies for P2P systems based on RDF schemes.
Technical report, 2007.
[WP2.1]

 113

K. Kollias.
Non-preemptive coordination mechanisms for identical machine scheduling games.
Technical report, 2007.
[WP1.3]

 114

G. Koloniari and E. Pitoura.
A Clustered Index Approach to Distributed XPath Processing.
Technical report, 2007.
[WP2.1]

 115

G. Koloniari and E. Pitoura.
Distributed Approximate XPath Processing.
Technical report, 2007.
[WP2.1]

 116

A. Kinalis and S. Nikoletseas.
Scalable Data Collection Protocols for Wireless Sensor Networks with Multiple Mobile Sinks.
In Proc. of the 40th Annual Simulation Symposium (ANSS 07), pp. 60-72, 2007.  
[WP5.3]

 117

A. Kinalis, J. Rolim, S. Nikoletseas and I. Chatzigiannakis.
Fast and Energy Efficient Sensor Data Collection by Multiple Mobile Sinks.
Technical report, 2007. 
[WP5.3]

 118

C. Konstantopoulos, C. Kaklamanis.
Optimal Hypercube Simulation on the Partitioned Optical Passive Stars Network.
Journal of Supercomputing, Vol. 42(2), pp. 165-180, 2007.
[WP2.2, WP1.5]

 119

S. Kontogiannis, P. Panagopoulou and P. Spirakis.
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games.
In Proc. of the 2nd Workshop on Internet and Network Economics (WINE 06), LNCS 4286, Springer, pp. 286-296, 2006. 
[WP1.3]

 120

E. Koutsoupias, P. Panagopoulou and P. Spirakis.
Selfish Load Balancing under Partial Knowledge.
In Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 07), 2007, to appear.
[WP1.2, WP1.3]

 121

E. Koutsoupias and A. Vidali.
A Lower Bound of 1+phi for Truthful Scheduling Mechanisms.
In Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 07), pp. 454-464, 2007.
[WP1.3, WP2.3]

 122

P. Korteweg, A. Marchetti-Spaccamela, L. Stougie and A. Vitaletti.
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs.
In Proc. of the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 07), LNCS 4474, Springer, pp. 139–150, 2007.
[WP1.5, WP5.2]

 123

L. Kowalik, J.-S. Sereni, and R. Skrekovski.
Total colouring of plane graphs with maximum degree nine.
Technical report, 2007.
[WP1.1]

 124

D. Král’, E. Macajova, O. Pangrac, A. Raspaud, J.-S. Sereni and M. Skoviera.
Projective, affine, and abelian colourings of cubic graphs.
Technical report, 2007.
[WP1.1]

 125

D. Král’, E. Macajova, A. Por and J.-S. Sereni.
Characterization results for Steiner triple systems and their application to edge-colorings of cubic graphs.
Technical report, 2007.
[WP1.1]

 126

G. Kun and J. Nešetřil.
NP by means of lifts and shadows.
In Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 07), LNCS 4708, Springer, pp. 171- 181, 2007.
[WP1.1]

 127

V. Liagkou, E. Makri, P. Spirakis and Y. Stamatiou.
Trust in global computing systems as a limit property emerging from short range random interactions.
In Proc. of the Second International Conference on Availability, Reliability and Security (ARES 07), IEEE Computer Society, pp. 741-748, 2007.  
[WP4.1] 

 128

V. Liagkou, E. Makri, P. Spirakis and Y. Stamatiou.
On the asymptotic behaviour of formal logic based trust models.
In Proc. of the 11th Panhellenic Conference on Informatics with international participation (PCI 07), New Technologies Publications, pp. 141-150, 2007. 
[WP4.1] 

 129

V. Liagkou, E. Makri, P. Spirakis and Y. Stamatiou.
Collusion resistant key predistribution schemes and schemes with group identification properties.
Technical report, 2007. 
[WP4.3] 

 130

V. Liagkou, E. Makri, P. Spirakis and Y. Stamatiou.
The "Digital Territory" as a complex system of interacting agents, emergent properties and technologies. 
Technical report, 2007. 
[WP1.1] 

 131

N. Lichiardopol, A. Por and J.-S. Sereni.
A step towards the Bermond-Thomassen conjecture about disjoint cycles in digraphs.
Technical report, 2007.
[WP1.1]

 132

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, to appear.
[WP5.1]

 133

L. Liquori and M. Cosnard.
Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems.
In Proc. of the 3rd Symposium on Trustworthy Global Computing (TGC 07), LNCS, Springer, 2007, to appear.
[WP2.1]

 134

L. Liquori and M. Cosnard.
Weaving Arigatoni with a Graph Topology.
In Proc. of the 2007 International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 07), IEEE Computer Society Press, 2007, to appear.
[WP2.1]

 135

L. Liquori and A. Spiwack.
FeatherTrait: A Modest Extension of Featherweight Java.
ACM Transaction on Programming Languages and Systems (TOPLAS), ACM Press, 2007, to appear.
[WP2.1]

 136

M. Mavronicolas, I. Milchtaich, B. Monien and K. Tiemann.
Congestion Games with Player-Specific Constants.
In Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 07), LNCS 4708, Springer, pp. 633-644, 2007.
[WP1.2]

 137

M. Mavronicolas,  B. Monien and V. G. Papadopoulou.
How Many Attackers Can Selfish Defenders Catch?
In Proc.of the 41st Annual Hawaii International Conference on System Science (HICSS 08), pp. 470-480, 2008.[WP 1.4]

 138

M. Mavronicolas, B. Monien and K. Wagner.
Weighted Boolean Formula Games.
In Proc. of the 3rd International Workshop on Internet and Network Economics (WINE 07), 2007, to appear.
[WP 1.3]

 139

M. Mavronicolas and V. G. Papadopoulou.
Facility Location Games.
Technical report, 2007.
[WP 1.1]

 140

H. Meyerhenke and T. Sauerwald.
Analyzing Disturbed Diffusion on Networks.
In Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 06),  LNCS 4288, Springer, pp. 429-438, 2006.
[WP3.2]

 141

H. Meyerhenke and S. Schamberger.
A Parallel Shape Optimizing Load Balancer.
In Proc. of Euro-Par 2006, LNCS 4128, Springer, pp. 232–242, 2006.
[WP3.2]

 142

A. Monti, P. Penna, R. Silvestri.
An Equivalent Version of the Caccetta Haggkvist Conjecture in an Online Load Balancing Problem.
In Proc. of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 07), LNCS 4769, Springer, pp. 154-165, 2007.
[WP1.1, WP 1.5]

 143

L. Moraru, P. Leone, S. Nikoletseas and J. Rolim.
Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms.
In Proc. of the 3rd ACM International Workshop on QoS and Security for Wireless and Mobile Networks (Q2SWINET 07), ACM Press, pp. 31-38, 2007.
[WP5.1, WP5.2]

 144

T. Müller, A. Por and J.-S. Sereni.
Bounding the boundary by the minimum and maximum degree.
Technical report, 2007.
[WP1.1]

 *

T. Müller and J.-S. Sereni.
Identifying and Locating-Dominating codes in (random) geometric networks.
Technical report, 2007.
[WP1.1, WP5.1, WP5.2, WP5.3]
(recorded also as report No. 186 in 1st Year reports as Technical report)

 145

J. Nešetřil and Y. Nigussie.
On finite duality of minor closed classes.
Technical report, 2007.
[WP1.1]

 146

J. Nešetřil and P. O. de Mendez.
Fraternal augmentations, arrangeability and linear ramsey numbers.
Technical report, 2007.
[WP1.1]

 147

J. Nešetřil and P. O. de Mendez.
Induced matchings and induced paths in graphs.
Technical report, 2007.
[WP1.1]

 148

J. Nešetřil and P. O. de Mendez.
Tree-depth and colorings of hypergraphs.
Technical report, 2007.
[WP1.1]

 149

J. Nešetřil and M. Siggers.
Combinatorial proof that subprojective constraint satisfaction problems are NP-complete.
In Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 07), LNCS 4708, Springer, pp. 159- 170, 2007.
[WP1.1]

 150

S. Nikoletseas, C. Raptopoulos, and P. Spirakis.
The Second Eigenvalue of Random Walks on Symmetric Random Intersection Graphs.
In Proc. of the International Conference on Algebraic Informatics (CAI 07), 2007, to appear.
[WP5.1] 

 151

S. Nikoletseas, C. Raptopoulos, and P. Spirakis.
Expander Properties and the Cover Time of Random Intersection Graphs.
In Proc. of the International Symposium on Mathematical Foundations of Computer Science (MFCS 07), 2007, to appear.
[WP5.1]

 152

S. Nikoletseas and P. Spirakis.
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects.
In Proc. of the 3rd International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 07), LNCS, Springer, 2007, to appear.
[WP5.2]

 153

S. Norine and J.-S. Sereni.
Graphs with full rank 3-color matrix and few 3-colorings.
Technical report, 2007.
[WP1.1]

 154

R. Ostrovsky, G. Persiano, I. Visconti.
Constant-Round Concurrent Non-Malleable Commitments and Decommitments.
Technical report, 2007.
[WP4.3]

 155

P. Panagopoulou and P. Spirakis.
Full and Local Information in Distributed Decision Making.
In Proc. of the 5th Workshop on Approximation and Online Algorithms (WAOA 07), LNCS, Springer, 2007, to appear. 
[WP1.2, WP1.3] 

 156

P. Panagopoulou and P. Spirakis.
Approximate and well-supported approximate Nash equilibria of random bimatrix games.
In Proc. of the 11th Panhellenic Conference on Informatics (PCI 07), New Technologies Publications, pp. 569-578, 2007. 
[WP1.3] 

 157

C. Pautasso, T. Heinis, G. Alonso.
Autonomic Resource Provisioning for Software Business Processes.
Information and Software Technology, Vol. 49(1), pp. 65-80, 2007.
[WP3.4]

 158

P. Penna and C. Ventre.
Optimal collusion resistant mechanisms with verification.
In Proc. of 10th ACM Conference on Electronic Commerce (EC 09), 2009, pp. 147-156,2009.
[WP1.3, WP2.3]

 159

E. Peserico and L. Pretto.
Hits can converge slowly in rank.
Technical report, 2007.
[WP1.2]

 160

E. Peserico and L. Pretto.
What does it mean to converge in rank?
Technical report, 2007
[WP1.2]

 161

E. Peserico and L. Rudolph.
Routing with constant stretch and constant bits/node on any network you can build.
Technical report, 2007.
[WP1.2]

 162

A. Pietracaprina, and F.Vandin.
Efficient Incremental Mining of Top-K Frequent Closed Itemsets.
In Proc. of the 10th International Conference on Discovery Science (DS 07), LNCS, Springer, 2007.
[WP1.5]

 163

E. Pitoura and P. K. Chrysanthis.
Caching and Replication in Mobile Data Management.
IEEE Data Engineering Bulletin, 2007.
[WP2.1]

*

O. Powell, P. Leone, J. Rolim. 
Energy Optimal Data Propagation in Wireless Sensor Networks.
Journal of Parallel and Distributed Computing, Vol. 67(3), pp. 302-317, 2007.
[WP5.2]
(recorded also as report No. 183 in 1st Year reports as Technical report)

 164

O. Powell, L. Moraru and J.-M. Seigneur.
TrustMIX: Trustworthy MIX for Energy Saving in Sensor Networks.
In Computing Research Repository (CoRR) of Distributed, Parallel and Cluster Computing, 2007. Technical report, 2007.
[WP5.2]

 165

O. Powell and S. Nikoletseas.
Geographic Routing Around Obstacles in Wireless Sensor Networks.
In Computing Research Repository (CoRR) of Distributed, Parallel and Cluster Computing, 2007, ref. cs.DC/0703094. Technical report, 2007.
[WP5.2]

 166

O. Powell and S. Nikoletseas.
Simple and Efficient Geographic Routing around Obstacles for Wireless Sensor Networks.
In Proc, of the 6th International Workshop on Experimental Algorithms (WEA 07), LNCS, Spinger, 2007, to appear.
[WP5.2] 

 167

O. Powell, J.-M. Seigneur and L. Moraru.
Trustworthily Forwarding Sensor Networks Information to the Internet.
In Proc. of the International Conference on Emerging Security Information, Systems and Technologies (SECURWARE 07), 2007, to appear.
[WP5.2]

168

T. Razafindralambo, I. Guérin Lassous, L. Iannone and S. Fdida.
Dynamic and Distributed Packet Aggregation to Solve the Performance Anomaly in 802.11 Wireless Networks.
Communication Networks, 2007, to appear.
[WP2.2, WP5.2]

 169

C. Sarr, C. Chaudet, G. Chelius and I. Guérin Lassous.
Available Bandwidth Estimation for  IEEE 802.11-based Ad Hoc networks.
Technical report, 2007.
[WP5.1]

 170

C. Sarr and I. Guérin Lassous.
Estimating Average End-to-End Delays in IEEE 802.11 Multihop Wireless Networks.
Technical report, 2007.
[WP5.1]

 171

I. Sau, and J. Žerovnik.
Optimal Permutation Routing on Mesh Networks.
In Proc. of the 2007 International Network Optimization Conference (INOC 07), 2007, to appear.
[WP1.5]

 172

T. Sauerwald.
On Mixing and Edge Expansion Properties in Randomized broadcasting.
In Proc. of the 18th International Symposium on Algorithms and Computation (ISAAC 2007), pages 196-207, 2007. (Co-Winner of the Best Student Paper Award)
[WP3.2]

 173

S. Schiffner, M. Kohlweiss.
Privacy Friendly SybilGuard.
In Proc. of the 2nd Benelux Workshop on Information and System Security, 2007, to appear.
[WP4.2]

 174

U. Schwarz.
Tightness Results for Malleable Task Scheduling Algorithms.
In Proc. of the 7th International Conference of Parallel Programming and Applied Mathematics (PPAM 07), LNCS, Springer, 2007, to appear.
[WP3.3]

 175

M. Serna and F. Xhafa.
Parallel approximation to high multiplicity scheduling problems via smooth multi-valued quadratic programming.
Theoretical Informatics and Applications, 2007, to appear.
[WP3.3]

 176

P. Skyvalidas.
Replication of XML Documents Using Replication Routing Indexes in Unstructured p2p Systems.
Technical report, 2007.
[WP2.1]

 177

P. Skyvalidas, E. Pitoura, and V.V. Dimakopoulos.
Replication Routing Indexes for XML Documents.
In Proc. of the 5th International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P 07), 2007, to appear.
[WP2.1]

178

M. Sozio.
Maximizing the Success Probability and Expected Access Time for File Search in Unstructured P2P Networks.
Technical report, 2007.
[WP3.1]

 179

P. Spirakis, A. Kaporis, and D. Fotakis.
Atomic congestion games: fast, myopic and concurrent.
Technical report, 2007. 
[WP1.2, WP1.3]

 180

A. Squicciarini, A. Trombetta and E. Bertino.
k-anonymous attribute-based access control.
Technical report, 2007.
[WP2.1]

 181

A. C. Squicciarini, A. Trombetta and E. Bertino.
Supporting Robust and Secure Interactions in Open Domains through Recovery of Trust Negotiations.
In Proc of the 27th IEEE International Conference on Distributed Computing Systems (ICDCS 07), IEEE Computer Society, pp. 57-67, 2007.
[WP2.1]

 182

C. Troncoso, C. Diaz, O. Dunkelman and B. Preneel.
Traffic Analysis Attacks on a Continuously-Observable Steganographic File System. 
In Proc. of the 9th Information Hiding (IH 07), LNCS, Springer, 2007, to appear.
[WP4.2]

 183

C. Tryfonopoulos, C. Zimmer, G. Weikum, M. Koubarakis.
Architectural Alternatives for Information Filtering in Structured Overlays.
Internet Computing, IEEE Computer Society, pp. 16-26, 2008.
[WP3.1]

 184

R. Vannier.
Steady state load balancing on distributed platforms.
Technical report, 2007.
[WP1.5]

 185

V. Velichkov, M. Knezevic.
Proof-of-concept implementation of an anonymous voip.
Technical report, 2007.
[WP4.2]

 186

S. Voulgaris, M. van Steen.
Hybrid Dissemination: Adding Determinism to Probabilistic Multicasting in Large-Scale P2P Systems.
In Proc. of the 8th International Middleware Conference (Middleware 07), 2007, to appear.
[WP3.1]

 187

F. Xhafa, E. Alba and B. Dorronsoro.
Efficient batch job scheduling in grids using cellular memetic algorithms.
In Proc. of the 10th International Workshop on  Nature Inspired Distributed Computing (NIDISC 07) held in conjunction with The 21th IEEE/ACM International Parallel and Distributed Processing Symposium  (IPDPS 07), 2007.
[WP3.3]

 188

F. Xhafa, L. Barolli, A. Durresi.
Batch mode scheduling in grid systems.
International Journal of Web and Grid Services, Vol. 3(1), pp. 19–37, 2007.
[WP3.3]

 189

F. Xhafa, J. Carretero, A. Abraham.
Genetic algorithm-based schedulers for grid computing systems.
International Journal of Innovative Computing, Information and Control, Vol. 3(5), pp. 1-19, 2007.
[WP3.3]

 190

F. Xhafa, J. Carretero, L. Barolli, A. Durresi.
Immediate mode scheduling in grid systems.
International Journal of Web and Grid Services, Vol. 3(2), pp. 219–236, 2007.
[WP3.3]

191

C. Zimmer, S. Bedathur, and G. Weikum.
Standing on the Shoulders of Peers: Caching in Peer-to-Peer Search.
Technical report, 2007.
[WP3.1]

 192

C. Zimmer, C. Tryfonopoulos, K. Berberich, G. Weikum, M. Koubarakis.
Node Behavior Prediction for Large-Scale Approximate Information Filtering.
In Proc. of the 2007 ACM SIGIR Workshop on Large-Scale Distributed Systems for Information Retrieval, 2007, to appear.
[WP3.1]

 193

C. Zimmer, C. Tryfonopoulos, G. Weikum.
MinervaDL: An Architecture for Informtion Retrieval and Filtering in Distributed Digital Libraries.
In Proc. of the 11th European Conference on Research and Advanced Technology for Digital Libraries (ECDL 07), 2007, to appear.
[WP3.1]