M. Abdalla, A. Namprempre and G. Neven.
On the (im)possibility of blind message authentication codes.
Book chapter in Topics in Cryptology (CT-RSA 06), LNCS 3860, Springer, pp. 262–279, 2006.
[WP4.2]

A. Alkassar, E. Andreeva, and H. Lipmaa.
Efficient authenticated encryption for short packages.
In Jana Dittmann, editor, Sicherheit 2006: Sicherheit - Schutz und Zuverl assigkeit, Beitrage der 3. Jahrestagung des Fachbereichs Sicherheit der Gesel lschaft fur Informatik e.v. (GI), 20.-22. Februar 2006 in Magdeburg, volume 77 of LNI, pp. 270–278. GI, 2006.
[WP4.3]

3

S. Alouf, E. Altman, J. Galtier, J.-F. Lalande, and C. Touati.
Quasi-optimal resource allocation in multi-spot MFTDMA satellite networks.
In M. Cheng, Y. Li, and D.-Z. Du, editors, Combinatorial Optimization in Communication Networks, chapter 12, pp. 325–366. Kluwer Academic Publishers, 2006.
[WP2.2]

4

E. Altman, J. Galtier, and C. Touati.
Fair power and transmission rate control in wireless networks.
In Proc. of the 3rd Annual Conference on Wireless On demand Network Systems and Services, pp. 134–143, 2006.
[WP5.2]

J. Alwen, G. Persiano, A. Shelat, and I. Visconti.
Digital rational secure function evaluation.
Technical Report, 2006.
[WP4.3]

C. Ambühl, A. E. F. Clementi, P. Penna, G. Rossi and R. Silvesti.
On the approximability of the range assignment problem on radio networks in presence of selfish agents.
Theoretical Computer Science, 343(1-2): 27 - 41, 2005.
[WP1.3, WP1.5, WP2.3, WP5.1]

O. Amini, J.-C. Bermond, F. Giroire, F. Huc, and S. Pérennes.
Design of minimal fault tolerant networks: Asymptotic bounds.
In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 06), pp. 37–40, 2006.
[WP1.4]

V. Auletta, R. De Prisco, P. Penna, and G. Persiano.
Routing selfish unsplittable traffic.
Technical Report, 2006.
[WP1.3]

V. Auletta, R. De Prisco, P. Penna, G. Persiano, and C. Ventre.
New constructions of mechanisms with verification.
In Proc. of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP 06), LNCS 4051, Springer, pp. 507-608, 2006.
[WP1.3, WP2.3]

M. Backes and P. Laud.
Computationally sound secrecy proofs by mechanized  flow analysis.
In Proc. of the 2nd Workshop on Formal and Computational Cryptography, pp. 1–6, 2006. Also, in Proc. of the 13th ACM Conference on Computer and Communications Security (CCS 06), pp. 370-379, 2006.
[WP4.3]

A. Bamis, A. Boukerche, I. Chatzigiannakis and S. Nikoletseas.
A Mobility Sensitive Approach for Efficient Routing in Ad Hoc Mobile Networks.
In Proc. of the 9th ACM/IEEE Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM'06), ACM SIGSIM & IEEE Computer Society, pp.  357 - 364, 2006.
[WP5.3]

D. Bartha, P. Berthomé, M. Diallo, and A. Ferreira.
Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations.
Discrete Optimization, 3(3):195–205, September 2006.
[WP1.5, WP2.2]

L. Becchetti, C. Castillo, D. Donato, S. Leonardi, and R. Baeza-Yates.
Using rank propagation and probabilistic counting for link-based spam detection.
In Proc. of the ACM SIGIR Workshop on Adversarial Information Retrieval on the Web, pp. 1 - 9, 2006.
[WP1.2]

L. Becchetti, P. Korteweg, A. Marchetti-Spaccamela, M. Skutella, L. Stougie and A. Vitaletti.
Latency Constrained Aggregation in Sensor Networks.
In. Proc. of the 14th European Symposium on Algorithms (ESA 06), LNCS, Springer 2006, to appear.
[WP 5.2, WP3.3]

J. Becker, Z. Csizmadia, J. Galtier, A. Laugier, J. Szabó, and L. Szegő.
An integer programming approach to routing in daisy networks.
Networks, 47(2):116–121, 2006.
[WP2.2]

E. Ben Hamida, G. Chelius, and E. Fleury.
Revisiting Neighbor Discovery with Interferences Consideration.
In. Proc. of the 3rd ACM international workshop Modeling Analysis and Simulation of Wireless and Mobile Systems, ACM Press, pp. 74 - 81, 2006. 
[WP5.2]

M. Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer.
To infinity and beyond: P2P web search with MINERVA and MINERVA.
In Global Data Management, pp. 301-323, IOSPress, 2006.
[WP3.1]

J.-C. Bermond, C. Colbourn, D. Coudert, G. Ge, A. Ling, and X. Muñoz.
Traffic grooming in unidirectional WDM rings with grooming ratio C=6.
SIAM Journal on Discrete Mathematics, 19(2):523–542, 2005.
[WP2.2]

J.-C. Bermond, R. Corrêa, and J. Yu.
Gathering algorithms on paths under interference constraints.
In Proc. of the 6th Conference on Algorithms and Complexity, LNCS 3998, Springer, pp. 115–126, 2006.
[WP3.3]

J.-C. Bermond, M. Cosnard, D. Coudert, and S. Pérennes.
Optimal solution of the maximum all request path grooming problem.
In Proc. of the Advanced International Conference on Telecommunications (AICT 06), IEEE Computer Society, 2006.
[WP2.2]

J.-C. Bermond, D. Coudert, X. Muñoz, and I. Sau.
Traffic grooming in bidirectional WDM ring networks.
In Proc. of the IEEE/COST 293 annual conference on GRAphs and ALgorithms in communication networks, Vol. 3, pp. 19–22, June 2006.
[WP2.2]

J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes.
Gathering in specific radio networks.
In Proc. of the Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 06), pp. 85–88, 2006.
[WP3.3]

J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes.
Hardness and approximation of gathering in static radio networks.
In Proc. of the 4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW 06 - FAWN 06), IEEE Computer Society, pp. 75-79, 2006. Extended version in Parallel Processing Letters, 16(2):165–183, 2006.
[WP3.3]

J.-C. Bermond, F. Havet, and D. Tóth.
Fault tolerant on board networks with priorities.
Networks, 47(1):9–25, 2006.
[WP1.4]

J.-C. Bermond and M.-L. Yu.
Vertex disjoint routings of cycles over tori.
Networks, Vol. 49(3), pp. 217-225, 2007.
[WP1.4, WP2.2]

E. Bertino, A. Barghav-Spantzel, and A.C. Squicciarini.
Policy Languages for Digital Identity in Federation Systems.
In Proc. of 7th International Workshop on Policies for Distributed Systems and Networks (POLICY 06), IEEE Computer Society Press, 2006, to appear.
[WP4.1]

E. Bertino, J.Crampton, and F. Paci.
Access Control and Authorization Constraints for WS-BPEL.
In Proc. of the 2006 IEEE International Conference on Web Services (ICWS 06), IEEE Computer Society Press, 2006, to appear.
[WP4.1]

E. Bertino, A.C. Squicciarini, L. Martino, and F. Paci.
An adaptive access control model for web services.
The International Journal of Web Services Research, 3(3):27–60, 2006.
[WP4.1]

S. Bessy, F. Havet and E. Birmelé.
Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree.
Journal of Graph Theory, 2006, to appear.
[WP1.1, WP2.2]

A. Bhargav-Spantzel, A.C. Squicciarini, and E. Bertino.
Establishing and protecting digital identity in federation systems.
Journal of Computer Security, 14(3): 269–300, 2006.
[WP4.1]

R. Bhatti, E. Bertino, and A. Ghafoor. X-Federate.
A Policy Engineering Framework for Federated Access Management.
IEEE Transactions on Software Engineering, 32(5): 330–346, 2006.
[WP4.1]

G. Bilardi, A. Pietracaprina, G. Pucci.
Decomposable BSP: A Bandwidth-Latency Model for Parallel and Hierarchical Computation.
To appear in J. Reif and S. Rajasekaran eds, Handbook of Parallel Computing, CRC Press, 2007.
[WP3.2]

B. Bioernstad, C. Pautasso, G. Alonso.
Control the Flow: How to Safely Compose Streaming Services into Business Processes.
In Proc. of the 2006 IEEE International Conference on Services Computing (SCC 06), IEEE Computer Society, pp. 206-213, 2006
[WP3.4]

Y. Bleischwitz and B. Monien.
Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines.
In Proc.of the 6th Italian Conference on Algorithms and Complexity, LNCS 3998, Springer, pp. 175-186, 2006.
[WP2.3]

Y. Bleischwitz, B. Monien, F. Schoppmann, and K. Tiemann.
Group-strategyproof mechanisms without free riders for non-submodular cost-functions.
Technical Report, 2006.
[WP2.3]

M. Blesa.
Deciding stability in packet-switched FIFO networks under the Adversarial Queuing model in polynomial time.
In Proc. of the 19th International Symposium on Distributed Computing (DISC 05), LNCS 3724, Springer, pp. 429-441, 2005.
[WP1.4]

M. Blesa.
Stability in Communication Networks under Adversarial Models.
PhD thesis, Dept. de Llenguatges i Sistemes Informatics, Technical University of Catalonia, 2006.
[WP1.4]

M. Blesa and C. Blum.
A nature-inspired algorithm for the disjoint paths problem.
In Proc. of the 9th International Workshop on Nature Inspired Distributed Computing (NIDISC 06), IEEE Computer Society press, 2006, to appear.
[WP1.5]

M. Blesa and C. Blum.
Finding edge-disjoint paths with artificial ant colonies.
Technical Report, 2005.
[WP1.5]

M. Blesa and C. Blum.
On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization.
Chapter in Approximation Algorithms and Metaheuristics, Taylor & Francis Books (CRC Press), Boca Raton, Florida, 2006, to appear.
[WP1.5]

M. Blesa, D. Calzada, A. Fernández, L. López, A.L. Martínez, A. Santos, and   M. Serna.
Adversarial queueing model for continuous network dynamics.
In Proc. of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 05), LNCS 3618, Springer, pp. 144-155, 2005.
[WP1.4]

C. Blundo, C. Galdi, and G. Persiano.
Low-randomness constant-round private XOR computations.
International Journal of Information Security, 2006.
[WP4.3]

V. Bonifaci, P. Korteweg, A. Marchetti-Spaccamela and L. Stougie.
An Approximation Algorithm for the Wireless Gathering Problem.
In Proc. of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 06), LNCS 4059, Springer, pp. 328-338, 2006.
[WP3.3]

O.Bonorden, J.Gehweiler and F.Meyer auf der Heide.
A Web Computing Environment for Parallel Algorithms in Java.
In Proc. of 6th International Conference on Parallel  Processing and Applied Mathematics (PPAM 06), pp.801-808, 2005.
[WP3.2]

O.Bonorden, J.Gehweiler and F.Meyer auf der Heide.
Load Balancing Strategies in a Web Computing Environment.
In Proc. of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM 06), pp.839-846, 2005.
[WP3.2]

A. Buldas, P. Laud, J. Priisalu, M. Saarepera, and J. Willemson.
Rational choice of security measures via multi-parameter attack trees.
In Proc. of the 1st International Workshop on Critical Information Infrastructures Security (CRITISA 06), 2006, to appear.
[WP4.3]

A. Buldas, P. Laud, M. Saarepera, and J. Willemson.
Universally Composable Time-Stamping Schemes with Audit.
In Proc. of the 8th Information Security (ISC 05), LNCS 3650, Springer, pp. 359–373, 2005.
[WP4.3]

A. Buldas and S. Laur.
Do broken hash functions affect the security of time-stamping schemes?
In Proc. of the 4th International Conference on Applied Cryptography and Network Security (ACNS 06), LNCS 3989, Springer, pp. 50–65, 2006.
[WP4.3]

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.
In Proc. of  the 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO 06), LNCS 4056, Springer, pp. 227-239, 2006.
[WP1.1, WP1.5, WP5.1, WP5.2]

I. Caragiannis, C. Galdi, and C. Kaklamanis.
Basic Computations in Wireless Networks.
In Proc. of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 05), LNCS 3827, Springer, pp. 533-542, 2005.
[WP5.1]

I. Caragiannis, C. Galdi, and C. Kaklamanis.
Network Load Games.
In Proc. of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 05), LNCS 3827, Springer, pp. 809-818, 2005.
[WP1.3]

I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli.
Tight bounds for selfish and greedy load balancing.
In Proc. of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP 06), LNCS 4051, Part I, Springer, pp. 311-322, 2006.
[WP1.2, WP1.3]

I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos.
Taxes for linear atomic congestion games.
In Proc. of the 14th Annual European Symposium on Algorithms (ESA 06), LNCS 4168, pp. 184-195, 2006.
[WP1.3, WP2.3]

I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and E. Papaioannou.
Scheduling to maximize participation.
In Proc. of the 2nd Symposium on Trustworthy Global Computing (TGC 06), LNCS 4661, Springer, pp. 218-232, 2006.
[WP1.2, WP1.3, WP3.3]

J. Carretero and  F. Xhafa.
Using Genetic Algorithms for Scheduling Jobs in Large Scale Grid Applications.
Journal of Technological and Economic Development, 12(1): 11-17, 2006.
[WP3.2, WP3.3]

E. Casalicchio, F. Morabito, G. Cortese, F. Davide.
A Novel Approach to Adaptive Content-based Subscription Management in DHT-based Overlay Networks.
Journal of Grid Computing, Springer Netherlands, 4(3):343-353, June 2006.
[WP6.1]

E. Casalicchio, F. Morabito, F. Davide, S. Tucci.
Events monitoring and distribution in complex systems under severe stress operating conditions.
In Proc. of the International Workshop on Complex Networks and Infrastructure Protection (CNIP 06), Rome, Italy, March 2006. 
[WP6.1]

D. Catalano, Y. Dodis, and I. Visconti.
Mercurial commitments: Minimal assumptions and efficient constructions.
In Proc. of the 3rd Theory of Cryptography Conference (TCC 06), LNCS 2876, Springer, pp. 120–144, 2006.
[WP4.3]

R. Chand, L. Liquori, and M. Cosnard.
Resource discovery in the Arigatoni model.
In Proc. of the 6th International Workshop on Innovative Internet Community Systems (I²CS 06), LNCS, Springer, 2006, to appear.
[WP2.1]

I. Chatzigiannakis, A. Kinalis and S. Nikoletseas.
Adaptive Techniques for Proactive Collision Avoidance for Multi-path Data Propagation in Wireless Sensor Networks.
In Performance Evaluation, Elsevier, 2006, to appear.
[WP5.1]

I. Chatzigiannakis, A. Kinalis and S. Nikoletseas.
Adaptive Energy Management for Incremental Deployment of Heterogeneous Wireless Sensors.
Theory of Computing Systems, 42(1), pp. 42-72, 2008.
[WP5.1]

I. Chatzigiannakis, A. Kinalis and S. Nikoletseas.
Efficient and Robust Data Dissemination using Limited Extra Network Knowledge.
In Proc. of the 2nd IEEE/ACM International Conference on Distributed Computing in Sensor Systems (DCOSS 06), LNCS 4026, Springer, pp. 218-233, 2006.
[WP5.1, WP5.3]

I. Chatzigiannakis, A. Kinalis and S. Nikoletseas.
Priority Based Adaptive Coordination of Wireless Sensors and Actors.
In Proc. of the 2nd ACM Workshop on QoS and Security for Wireless and Mobile Networks (Q2SWINET 06), IEEE Computer Society, 2006, to appear.
[WP5.1]

I. Chatzigiannakis, A. Kinalis and S. Nikoletseas.
Sink Mobility Protocols for Data Collection in Wireless Sensor Networks.
In Proc. of the 4th ACM Workshop on Mobility Management and Wireless Access (MOBIWAC 06), ACM Press, pp. 52-59, 2006.
[WP5.1, WP5.3]

I. Chatzigiannakis, P. Kokkinos and C. Zaroliagis.
Routing Protocols for Efficient Communication in Wireless Ad-hoc Networks.
In Proc. of the 3rd ACM Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN 06), 2006.
[WP5.1]

I. Chatzigiannakis, E. Konstantinou, V. Liagkou and P. Spirakis.
Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks.
In Proc. of the 2nd Workshop on Cryptography for Ad hoc Networks (WCAN 06), Electronic Notes in Theoretical Computer Science, 171(1), pp. 17-31, 2007.
[WP5.1, WP4.3]

I. Chatzigiannakis, E. Konstantinou, V. Liagkou and P. Spirakis.
Agent-based Distributed Group Key Establishment in Wireless Sensor Networks.  
Technical Report, 2006.
[WP5.1, WP4.3]

I. Chatzigiannakis, G. Mylonas and S. Nikoletseas.
Modeling and Evaluation of the Effect of Obstacles on the Performance of Wireless Sensor Networks.
In Proc. of the 39th Annual ACM/IEEE Simulation Symposium (ANSS 06), IEEE Computer Society, 00:pp. 50-60, 2006.
[WP5.3]

I. Chatzigiannakis, G. Mylonas and S. Nikoletseas.
The Architecture of a Generic Application Environment for Wireless Sensor Networks Accessible via Internet.
In Proc. of the 5th IEEE Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP 06), pp. 574-578, 2006.
[WP6.1]

I. Chatzigiannakis, G. Mylonas, P. Spirakis, A. Antoniou, A. Kinalis, S. Papadogeorgos, G. Anisios and S. Nikoletseas.
System - Tales from the Invasion of Global Networks and Overlay Computers into Sensor-oogle.
Poster Paper in Proc. of the 25th ACM Symposium on Principles of Distributed Computing (PODC 06), 2006.
[WP5.1]

I. Chatzigiannakis and S. Nikoletseas.
Combined Data Propagation and Energy Management in Wireless Sensor Networks.
Technical Report, 2006.
[WP5.1]

I. Chatzigiannakis, S. Nikoletseas and A. Strikos.
Experimental Evaluation of the Performance of Multi-hop Wireless Sensor Networks.
In Proc. of the 5th IEEE Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP 06), pp. 579-582, 2006.
[WP5.1]

I. Chatzigiannakis, I. Pefkianakis and S. Nikoletseas.
A Probabilistic Multipath Algorithm for Fault-Tolerant Data Propagation in Multisink Wireless Sensor.
Technical Report, 2006.
[WP5.1]

C. Chaudet, E. Fleury, I. Guérin-Lassous, H. Rivano, and M.-E. Voge.
Optimal positioning of active and passive monitoring devices.
In Proc. of the 2005 ACM conference on Emerging Network Experiments and technology (CoNEXT 05), pp. 71-82, 2005.
[WP1.5, WP5.2]

C. Chaudet, I. Guerin Lassous and J. Zerovnik.
A Distributed Algorithm for Bandwidth Allocation in Ad Hoc Networks.
Technical Report, 2005.
[WP1.5]

Y. Chen and E. Fleury.
A Distributed Policy Scheduling for Wireless Sensor Networks.
In Proc. of the 26th IEEE International Conference on Computer Communications (INFOCOM 07), 2007, to appear.
[WP5.1]

Y. Chen, E.Fleury and V.Syrotiuk.
A Topology Transparent Duty Cycling for Wireless Sensor Networks.
Technical Report, 2006.
[WP5.1]

S. Choplin, A. Jarry, and S. Pérennes.
Virtual network embedding in the cycle.
Discrete Applied Mathematics, 145(3):368–375, 2005.
[WP1.5]

G. Christodoulou, E. Koutsoupias, A. Vidali.
A lower bound for scheduling mechanisms.
In Proc. of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), 2007, to appear.
[WP1.3, WP2.3, WP3.3]

G. Christodoulou, V. S. Mirrokni, and A. Sidiropoulos.
Convergence and approximation in potential games.
In Proc. of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS 06), LNCS 3884, Springer, pp. 349 – 360, 2006.
[WP1.3]

A.E.F. Clementi, M. Di Ianni, M. Lauria, A. Monti, G. Rossi, and R. Silvestri.
Divide and Conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances.
Theoretical Computer Science, to appear.
[WP1.1, WP1.5, WP5.1]

A.E.F. Clementi, M. Di Ianni, M. Lauria, A. Monti, G. Rossi, and R. Silvestri.
Greedy is bad for the bounded-hop MST problem on random Euclidean instances.
Technical Report, 2006.
[WP1.5]

A.E.F. Clementi, M. Di Ianni, M. Lauria, A. Monti, G. Rossi and R. Silvestri.
A Distributed Protocol for the Bounded-Hops Converge-cast in Ad-Hoc Networks.
In Proc. of the 5th International Conference on Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW 06), 2006, to appear.
[WP1.1, WP1.2, WP1.5, WP5.1]

A. Clementi, A. Monti, F. Pasquale, R. Silvestri.
Fast Radio Broadcasting On Dynamic Random Graphs.
Technical Report, 2006.
[WP1.4, WP5.3]

M. Cosnard, L. Liquori and R. Chand.
Virtual organisations in Arigatoni: the formal model.
In Proc. of the International Workshop on Developpment in Computational Models (DCM 06), Electronic Notes in Theoretical Computer Science, Vol. 171(3), pp. 55-75, 2007.
[WP2.1]

D. Coudert, P. Datta, S. Pérennes, H. Rivano, and M-E. Voge.
Shared risk resource group: Complexity and approximability issues.
Parallel Processing Letters, Vol. 17(2), pp. 169-184, 2007.
[WP1.4, WP2.2]

D. Coudert, F. Huc, and J.-S. Sereni.
Pathwidth of outerplanar graphs.
Journal of Graph Theory, Vol. 55(1), pp. 27-41, 2007.
[WP1.1]

D. Coudert, S. Pérennes, H. Rivano, and M.-E. Voge.
Shared risk resource groups and survivability in multilayer networks.
In Proc. of the IEEE/COST 293 annual conference on GRAphs and ALgorithms in communication networks, 3: 235–238, 2006.
[WP1.4, WP2.2]

P. Crescenzi, M. Di Ianni, A. Lazzoni, P. Penna, G. Rossi and P. Vocca.
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks.
In Proc. of the 4th International Conference on Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW 05), LNCS 3738, Springer, pp. 4-17, 2005.
[WP1.2, WP2.3, WP5.1]

O. Dalle.
OSA: an Open Component-based Architecture for Discrete-event Simulation.
In Proc. of the 20th European Conference on Modeling and Simulation (ECMS 06), pp. 253–260, 2006.
[WP2.3]

G. Danezis.
Breaking four mix-related schemes based on universal re-encryption.
In Proc. of the 9th Information Security Conference (ISC 06), LNCS 4176, Springer, 2006.
[WP4.2]

G. Danezis and R. Clayton.
Route fingerprinting in anonymous communications.
In Proc. of the IEEE International Conference on Peer-to-Peer Computing (P2P 06). IEEE Computer Society, 2006, to appear. 
[WP4.2]

G. Danezis and B. Laurie.
Private yet abuse resistant open publishing.
Technical Report, 2006.
[WP6.1]

J. Diaz, F. Grandoni, and  A. Marchetti Spaccamela.
Balanced Cut Approximation in Random Geometric Graphs.
In Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 06), LNCS, Springer, 2006, to appear.
[WP5.2]

C. Diaz, B. Preneel.
Accountable Anonymous Communication.
Chapter in Security, Privacy and Trust in Modern Data Management, Springer, pp. 239-256, 2007.
[WP4.2]

M. Di Ianni, F. Ferrante, and G. Rossi.
A heuristical approach to the Broadcast Assignment Problem in Mobile Wireless Networks.
Technical Report, 2006.
[WP5.3]

F. Diedrich and K. Jansen.
An Approximation Algorithm for the General Mixed Packing and Covering Problem.
Technical Report, 2006.
[WP3.3]

F. Diedrich, R. Harren, K. Jansen, R. Thöle, H. Thomas.
Approximation Algorithms for 3D Orthogonal Knapsack.
Technical Report, 2006.
[WP3.3]

F. Diedrich and U. M. Schwarz.
A General Probabilistic Framework for Online Formulations of Classical Scheduling Problems.
Unpublished Manuscript, 2006. Technical Report, 2006.
[WP3.3]

V. V. Dimakopoulos and E. Pitoura.
On the Performance of Flooding-Based Resource Discovery.
IEEE Transactions on Parallel and Distributed Systems, 17(11): 1242-1252, 2006.
[WP2.1]

T. Dimitriou, S. Nikoletseas and P. Spirakis.
The Infection Time of Graphs.
Discrete Applied Mathematics, 2006, to appear.
[WP1.5, WP5.3]

D. Dumrauf and M. Gairing.
Price of Anarchy for Polynomial Wardrop Games.
In Proc. of the 2nd International Workshop on Internet and Network Economics (WINE 06), LNCS 4286, Springer, pp. 319-330, 2006.
[WP3.3]

B. Duran, F. Xhafa.
The effects of two replacement strategies on a genetic algorithm for scheduling jobs on computational grids.
In Proc. of the 2006 ACM Symposium on Applied Computing (SAC 06), ACM Press, pp. 960-961, 2006.
[WP3.2, WP3.3]

E. Elkind and H. Lipmaa.
Hybrid voting protocols and hardness of manipulation.
In Proc. of the 16th International Symposium on Algorithms and Computation (ISAAC 05), LNCS 3827, Springer, pp. 206–215, 2005.
[WP4.3]

R.Elsässer.
On randomized broadcasting in power law networks.
In Proc. of the 20th International Symposium on Distributed Computing (DISC 06), pp.371-385, 2006.
[WP3.2]

R.Elsässer.
On the communication complexity of randomized broadcasting in random-like graphs.
In Proc. of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 06), pp.148-157, 2006.
[WP3.2]

R.Elsässer.
Toward the eigenvalue power law.
In Proc. of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 06), pp.351-362, 2006.
[WP3.2]

R.Elsässer and T.Sauerwald.
On the runtime and robustness of randomized broadcasting.
To appear In Proc. of the 17th International Symposium on Algorithms and Computations (ISAAC 06), 2006.
[WP3.2]

J. Esteve, F. Xhafa.
Juxta-CAT: A JXTA-based Platform for Distributed Computing. 
In Proc. of the 2006 ACM International Conference on Principles and Practice of Programming in Java (PPPJ 06), ACM Press, pp. 72-81, 2006.
[WP3.2, WP3.3]

R. Feldmann, M. Mavronicolas and A. Pieris.
Some Development on the Fully Mixed Nash Equilibrium Conjecture.
Technical Report, 2006.
[WP 1.3]

A. Fernández, C. Georgiou, L. Lopez, A. Santos. 
Reliably Executing Tasks in the Presence of Untrusted Entities.
In Proc. of the 25th IEEE Symposium on Reliable Distributed Systems (SRDS 06), to appear.
[WP1.4]

A. Ferrante, G. Parlato, F. Sorrentino, and C. Ventre.
Fast payment schemes for truthful mechanisms with verification.
Technical Report, University of Salerno, 2006.
Technical Report, 2006.
[WP1.3]

A. Ferreira, A. Goldman, and J. Monteiro.
Performance evaluation of dynamic networks using an evolving graph combinatorial model.
In Proc. of the 2nd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 06), IEEE Computer Society, pp. 173–180, 2006.
[WP5.2]

M. Flammini, R. Klasing, A. Navarra, and S. Pérennes.
Improved approximation results for the minimum energy broadcasting problem in wireless ad hoc networks.
Algorithmica, 2006, to appear.
[WP3.3]

M. Flammini, R. Klasing, A. Navarra, and S. Pérennes.
Tighter bounds for the minimum energy broadcasting problem.
Wireless Networks, 2006, to appear.
[WP3.3]

M. Flammini, L. Moscardelli, A. Navarra, and S. Pérennes.
Asymptotically optimal solutions for small world graphs.
In Proc. of the 19th International Symposium on Distributed Computing (DISC 05), LNCS 3724, Springer, pp. 414–428, 2005.
[WP1.5]

M. Flammini, A. Navarra, and S. Pérennes.
The real approximation factor of the MST heuristic for the minimum energy broadcasting.
ACM Journal of Experimental Algorithmics, 2006, to appear.
[WP3.3]

J. Foniok, J. Nesetril, C. Tardiff.
Generalised dualities and finite maximal antichains.
In Proc. of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 06), LNCS 4271, Springer, pp. 27-36, 2006.
[WP1.1]

J. Galtier.
Analysis of the slotted non-persistent CSMA protocol with poissonian packet size using a semi-markov graph representation.
In Proc. of the 8th International Conference on Transparent Optical Networks, 3: 258–262, IEEE Computer Society, 2006.
[WP5.2]

C. Georgiou, T. Pavlides, and A. Philippou.
Network Uncertainty in Selfish Routing.
In CD-ROM Proc. of the 20th IEEE International Parallel and Distributed Processing Symposium, 2006.
[WP 1.3]

B. Goncalves, N. Mitton and I. Guerin Lassous.
Comparison of two SelfOrganization and Hierarchical Routing Protocols for Ad Hoc Networks.
In Proc. of the 2nd International Conference on Mobile AdHoc and Sensor Networks, (MSN 06), 2006, to appear.
[WP6.2]

F. Havet, R. J. Kang, T. Mueller, J-S. Sereni.
Circular Choosability.
Technical Report, 2006
[WP1.1]

F. Havet, R. J. Kang, and J.-S. Sereni.
Improper colouring of unit disk graphs.
In Proc. of the 7th International Conference on Graph Theory (ICGT 05), of Electronic Notes in Discrete Mathematics, Vol. 22, pp. 123–128, Elsevier, 2005.
[WP1.1]

F. Havet and J.-S. Sereni.
Improper choosability of graphs and maximum average degree.
Journal of Graph Theory, 52(3):181–199, 2006.
[WP1.1]

T. Heinis, C. Pautasso, G. Alonso.
Mirroring Resources or Mapping Requests: implementing WS-RF for Grid workflows. 
In Proc. of the 6th IEEE International Symposium on Cluster Computing and the Grid (CCGrid 06), IEEE Computer Society, 2006, to appear.
[WP3.4]

J. Hubicka, J. Nesetril.
Finite Paths are Universal.
Order, 22(1):21-40, 2005.
[WP1.1, WP3.3]

J. Hubicka, J.Nesetril.
Finite Presentation of Homogeneous Graphs, Posets and Ramsey Classes.
Israel Journal of Mathematics, 149: 21-44, The Hebrew University Magnes Press, 2005.
[WP1.1]

K. Jansen and R. Solis-Oba.
An asymptotic approximation algorithm for 3D-strip packing.
In Proc. of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA 06), ACM Press, pp. 143-152, 2006.
[WP3.3]

K. Jansen and R. Solis-Oba.
New approximability results for 2-dimensional packing problems.
Technical Report, 2006.
[WP3.3]

K. Jansen and R. Solis-Oba.
Packing rectangles with profits.
Technical Report, 2006.
[WP3.3]

K. Jansen and H. Zhang.
Scheduling malleable tasks with precedence constraints.
In Proc. of the 17th Annual ACM Symposium on Parallel Algorithms (SPAA 05), pp. 86-95, 2005.
[WP3.3]

K. Jansen and H. Zhang.
An approximation algorithm for scheduling malleable tasks under general precedence constraints.
In Proc. of the 16th International Symposium on Algorithms and Computation (ISAAC 05), LNCS 3827, Springer, pp. 236-245, 2005.
[WP3.3]

A. Jarry, P. Leone, O. Powell and J. Rolim.  
An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks.
In Proc. of the 2nd International Conference (DCOSS 06), LNCS 4026, Springer, pp. 405-421, 2006.
[WP5.2]

R. J. Kang, T. Müller, and J.-S. Sereni.
Improper colouring of (random) unit disk graphs.
Discrete Mathematics, 2006, to appear. Also, in Proc. of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 05), Discrete Mathematics and Theoretical Computer Science, pp. 193–198, September 2005.
[WP1.1]

R. Klasing, Z. Lotker, A. Navarra, and S. Pérennes.
From balls and bins to points and vertices.
In Proc. of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 05), LNCS 3827, Springer, pp. 757–766, 2005.
[WP5.1]

M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas, P. Valtr.
Topics in Discrete Mathematics.
Dedicated to Jarik Nesetril on the Occasion of his 60th birthday, Series: Algorithms and Combinatorics, Vol. 26, Springer, p. 627, 2006.
[WP3.3]

G. Koloniari and E. Pitoura.
Workload-Aware Clustering of XML Peers.
In Proc. of the 2006 International Conference on Intelligent Systems And Computing: Theory And Applications (ISYC 06), 2006, to appear. 
[WP2.1]

P. Laud.
Secrecy types for a simulatable cryptographic library.
In Proc. of the 12th ACM Conference on Computer and Communications Security (CCS 05), ACM Press, pp. 26–35, 2005.
[WP4.3]

S. Laur, H. Lipmaa, and T. Mielikainen.
Private itemset support counting.
In Proc. of the 6th International Conference on Information and Communication Security (ICICS 05), LNCS 3783, Springer, pp. 97–111, 2005.
[WP4.3]

S. Laur, H. Lipmaa, and T. Mielikainen.
Cryptographically private support vector machines.
In Proc. of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 06), ACM Press, pp. 618–624, 2006.
[WP4.3]

P. Leone, L. Moraru, O. Powell, J. Rolim.
A Localization Algorithm for Wireless Ad-hoc Sensor Networks with Traffic Overhead Minimization by Emission Inhibition.
In Proc. of the 2nd International Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors 06), LNCS, Springer, 2006, to appear.
[WP5.2]

P. Leone and S. Nikoletseas and J. Rolim.  
An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensor Networks.
In Proc. of the 1st International Conference on Distributed Computing in Sensor Systems (DCOSS), LNCS, 3560, Springer, pp. 35-48, 2005.
[WP5.2]

E. Leontiadis, V.V. Dimakopoulos and E. Pitoura.
Creating and Maintaining Replicas in Unstructured Peer-to-Peer Systems.
In Proc. of the 2006 European Conference on Parallelism (Euro-Par 06), 2006, to appear.
[WP2.1, WP2.2, WP3.1]

Y. Li, H. Lipmaa, and D. Pei.
On delegatability of four designated verifier signatures.
In Proc. of the 6th International Conference on Information and Communication Security (ICICS 05), LNCS 3783, Springer, pp. 61–71, 2005.
[WP4.3]

V. Liagkou, E. Makri, P. Spirakis and Y. Stamatiou.
The threshold behavior of the fixed radius random graph model and applications to the key management problem of sensor networks.
In Proc. of the 2nd Intl Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 06), LNCS, Springer, 2006, to appear.
[WP5.1, WP4.3]

A. Linari, G. Weikum.
Efficient Peer-to-Peer Semantic Overlay Networks based on Statistical Language Models.
In Proc. of the 2006 International Workshop on Information Retrieval in Peer-to-Peer Networks (P2PIR), 2006, to appear.
[WP3.1]

H. Lipmaa.
An oblivious transfer protocol with log-squared communication.
In Proc. of the 8th Information Security (ISC 05), LNCS 3650, Springer, pp. 314–328, 2005.
[WP4.3]

L. Liquori.
iRho: the software: [system description].
In Proc. of the 1st International Workshop on Developments in Computational Models (DCM 05), Electronic Notes in Theoretical Computer Science, 135(3):85–94, 2006.
[WP2.1]

L. Liquori, F. Honsell, and R. Redamalla.
A language for verification and manipulation of web documents.
In Proc. of the 2006 International workshop on Automated Specification and Verification of Web Systems (WWV 06), Electronic Notes in Theoretical Computer Science, 157(2): 67–78, 2006.
[WP2.1]

T. Luczak, J. Nesetril.
When is a random graph projective?
European Journal of Combinatorics, 27(7):1147-1154, 2006.
[WP1.1]

M. Mastrogiovanni, C. Petrioli, M. Rossi, A. Vitaletti and M. Zorzi.
Integrated data delivery and interest dissemination techniques for wireless sensor networks.
In Proc. of the 49th Annual IEEE Global Telecommunications Conference (GLOBECOM 06), 2006, to appear.
[WP 5.3]

M. Mavronicolas, L. Michael, V. G. Papadopoulou, A. Philippou and P. G. Spirakis.
The Price of Defense.
In Proc. of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 06), 2006, to appear.
[WP1.4, WP4.3]

M. Mavronicolas, L. Michael and P. Spirakis.
Computing on a Partially Eponymous Ring.
In Proc. of the 10th International Conference On Principles Of Distributed Systems (OPODIS 06), 2006, to appear.
[WP 1.1]

M. Mavronicolas, V. Papadopoulou, G. Persiano, A. Philippou and P. Spirakis.
The Price of Defense and Fractional Matchings.
In Proc. of the 8th International Conference on Distributed Computing and Networking (ISDCN 06), 2006, to appear.
[WP1.4, WP4.3]

M. Mavronicolas, V. G. Papadopoulou, A. Philippou, P. G. Spirakis.
Network Game with Attacker and Protector Entities.
In Proc. of the 16th International Symposium Algorithms and Computation (ISAAC 05), LNCS 3827, Springer, pp. 288-297, 2005.
[WP1.4]

M. Mavronicolas, P. N. Panagopoulou and P. G. Spirakis.
A Cost Mechanism for Fair Pricing of Resource Usage.
In Proc. of the 1st Workshop on Internet and Network Economics (WINE 05), LNCS 3828, Springer, pp. 210-224, 2005.
[WP1.3, WP5.1]

V.Mazalov, B.Monien, F.Schoppmann, and K.Tiemann.
Wardrop Equilibria and Prize of Stability for Bottleneck Games with Splittable Traffic.
In Proc. of the 2nd International Workshop on Internet and Network Economics (WINE 06), LNCS 4286, pp. 331-342, 2006.
[WP1.3]

P. Mazzoleni, E. Bertino, B. Crispo, and S. Sivasubramanian.
XACML Policy Integration Algorithms.
In Proc. of the 11th ACM Symposium on Access Control Models and Methodologies (SACMAT 06), ACM Press, pp. 219-227, 2006.
[WP4.1]

M. Mecella, M. Ouzzani, F. Paci, and E. Bertino.
Access Control Enforcement for Conversation-based Web Services.
In Proc. of the 15th International World Wide Web Conference (WWW 06), ACM Press, pp. 257-266, 2006.
[WP4.1]

S. Michel, P. Triantafillou, G. Weikum.
MINERVA Infinity: A Scalable Efficient Peer-to-Peer Search Engine.
In Proc. of the ACM/IFIP/USENIX 6th International Middleware Conference (Middleware 05), LNCS 3790, Springer, pp. 60-81, 2005.
[WP3.1]

N. Mitton, A. Busson and E. Fleury.
Analysis of the Self-Organization in Wireless Multi-Hops Networks.
RR INRIA, 2004.
Technical Report, 2006.
[WP1.5]

N. Mitton, A. Busson and E. Fleury.
Efficient Broadcasting in Self-Organizing Sensor Networks.
International Journal of Distributed Sensor Networks, 2(2): 161 – 187, 2006.
[WP1.5]

N. Mitton, E. Fleury, I. Lassous, B. Sericola, and S. Tixeuil.
Fast Convergence in Self-Stabilizing Wireless Networks.
In Proc. of the 12th International Conference on Parallel and Distributed Systems (ICPADS 06), IEEE Computer Society, pp. 31-38, 2006.
[WP5.3]

J. Nesetril, P. Ossona de Mendez.
Folding.
Journal of Combinatorial Theory Series B, 96(5):730-739, Academic Press, Inc., 2006.
[WP1.1]

J. Nesetril, P. Ossona de Mendez.
Linear time low tree-width partitions and algorithmic consequences.
In Proc. of the 38th Annual ACM Symposium on Theory of Computing (STOC 06), ACM 2006, pp. 391-400, 2006.
[WP1.1]

J. Nesetril, P. Ossona de Mendez.
Tree-depth, subgraph coloring and homomorphism bounds.
European Journal of Combinatorics, 27(6):1022-1041, 2006.
[WP1.1]

T. Neumann, M. Bender, S. Michel, G. Weikum.
A Reproducible Benchmark for P2P Retrieval.
In Proc. of the of the First International Workshop on Performance and Evaluation of Data Management Systems, (ExpDB 06), in cooperation with ACM SIGMOD, pp. 1-8, 2006.
[WP3.1]

S. Nikoletseas, C. Raptopoulos and P. Spirakis.
The Survival of the Weakest in Networks.
In Proc. of the 4th Workshop on Approximation and Online Algorithms (WAOA 06), LNCS, Springer, 2006, to appear.
[WP1.1, WP5.3]

S. Nikoletseas, C. Raptopoulos and P. Spirakis.
The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs.
Theory of Computing Systems, 2006, to appear.
[WP1.1, WP5.1]

V. Nikov, S. Nikova, and B. Preneel.
A weakness in some oblivious transfer and zero-knowledge protocols.
Advances in Cryptology - ASIACRYPT 06, LNCS, Springer, 2006, to appear.
[WP4.2]

R. Ostrovsky, G. Persiano, and I. Visconti.
Concurrent Non-Malleable Witness Indistinguishability and its Applications.
Electronic Colloquium on Computational Complexity, Cryptology ePrint Archive, Report 2006/256, 2006.
[WP4.3]

P. N. Panagopoulou and P. G. Spirakis.
Local Information and Randomization in Decision Making.
Technical Report, 2006.
[WP5.1]

C. Pautasso, G. Alonso.
Parallel Computing Patterns for Grid Workflows.
In Proc. of the 2006 Workshop on Workflows in support for Large-Scale Science (WORKS 06), 2006, to appear.
[WP3.4]

C. Pautasso, T. Heinis, G. Alonso.
JOpera: Autonomic Service Orchestration.
IEEE Data Engineering Bulletin (Special Issue on Self-Managing Database Systems), A. Ailamaki (Ed.), Vol. 29, No. 3, pp. 32-39, 2006.
[WP3.4]

P. Penna, G. Proietti, and P. Widmayer.
Strongly polynomial-time truthful mechanisms in one shot.
In Proc. of the International Workshop on Internet and Network Economics (WINE 06), LNCS, Springer, 2006, to appear.
[WP1.3]

P. Penna and C. Ventre.
The algorithmic structure of group strategyproof budget-balanced cost-sharing mechanisms.
In Proc. of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS 06), LNCS 3884, Springer, pp. 337 – 348, 2006.
[WP1.3]

G. Persiano and I. Visconti.
On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model.
In Proc. of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 06), LNCS 4162, Springer, 2006.
[WP4.3]

E. Peserico.
P2P Economies.
Poster session of SIGCOMM 2006.
[WP1.2]

E. Peserico and L. Rudolph.
Robust Network Connectivity: when it's the big picture that matters.
In Proc. of the Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/Performance 06), ACM Press, pp. 299-310, 2006.
[WP1.2]

A. Pietracaprina, G. Pucci, and F. Silvestri.
Cache-Oblivious Simulation of Parallel Programs.
In Proc. of the 2006 Workshop on Advances in Parallel and Distributed Computational Models (APDCM 06), 2006, to appear.
[WP3.2]

E. Pitoura, P. Chrysanthis and G. Samaras.
Distributed Databases and Transaction Processing.
Book Chapter in Mobile Agents in Networking and Distributing Computing, S. K. Das and J. Cao, eds, John Wiley & Sons, Inc, 2006, to appear.
[WP2.1, WP2.2]

E. Pitoura, C. Turker and G. Samaras.
Seamless Consistency.
Book Chapter in Mobile Middleware, P. Bellavista and A Corradi, eds, CRC Press, 2006, to appear.
[WP2.1, WP2.2]

O. Powell, P. Leone, J. Rolim.  
Energy Optimal Data Propagation in Wireless Sensor Networks.
Technical Report, 2006.
[WP5.2]

H. Rivano, F. Théoleyre, and F. Valois.
Capacity evaluation framework and validation of self-organized routing schemes.
In IEEE 3rd International Workshop on Wireless Ad-hoc and Sensor Networks (IWWAN 06), 2006, to appear.
[WP5.2]

I. Sau Valls.
Minimizing the number of ADMs in WDM optical rings with traffic grooming.
Master's thesis, Universite Polytechnique de Barcelone, Espagne, 2006.
[WP2.2]

J-S. Sereni, T. Mueller.
Identifying codes in random geometric networks.
Technical Report, 2006
[WP1.1]

F. Silvestri.
On the Limits of Cache-Oblivious Matrix Transposition.
In Proc. of the 2nd Workshop on Trustworthy Global Computing (TGC 06), LNCS, Springer, 2006, to appear.
[WP3.2]

A.C. Squicciarini, A. Bhargav-Spantzel, A. Czeskis, and E. Bertino.
Traceable and Automatic Compliance of Privacy Policies in Federated Digital Identity Management.
In Proc. of the 2006 Workshop on Privacy Enhancing Technologies (PET 06), 2006, to appear.
[WP4.1]

I. Tšahhirov and P. Laud.
Digital signature in automatic analyses for  confidentiality against active adversaries.
In Proc. of the 10th Nordic Workshop on Secure IT Systems (Nordsec 05), pp. 29–41, 2005.
[WP4.3]

C. Ventre.
Mechanisms with Verification for Any Finite Domain.
In the Proc. of the 2nd international Workshop on Internet & Network Economics (WINE 06), 2006, to appear.
[WP1.3, WP2.3]

I. Visconti.
Efficient Zero Knowledge on the Internet.
In Proc. of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 06), LNCS 4052, Springer, pp. 22–33, 2006.
[WP4.3]

M.-E. Voge.
Graphes colorés - arbre couvrant coloré.
In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 06), pp. 41–44, 2006.
[WP1.4, WP2.2]

M.-E. Voge.
How to transform a multilayer network into a colored graph.
In IEEE ICTON/COST 293 annual conference on GRAphs and ALgorithms in communication networks, Nottingham, June 2006.
[WP1.4, WP2.2]

J. Willemson.
On the Gordon and Loeb Model for Information Security Investment.
In Proc. of the 5th Workshop on the Economics of Information Security (WEIS 06), 2006, to appear.
[WP4.3]

F. Xhafa.
A Tabu Search Algorithm for Job Scheduling on Computational Grids.
European Chapter on Combinatorial Optimization & CO (ECCO XIX - CO 2006) Joint Meeting,
Faculty of Engineering University of Porto, Porto, Portugal May 11-13, 2006.
[WP3.2, WP3.3]