N. Santoro, E. Velazquez ENERGY RESTORATION IN MOBILE SENSOR NETWORKS (Book Chapter of) : Wireless Sensor and Robot Networks N. Mitton, D. Simplot-Ryl (Eds.), World Scientific 2014.

A. Casteigts, P. Flocchini, B. Mans, N. Santoro
Measuring temporal lags in delay-tolerant networks.
IEEE Transactions on Computers, 63(2): 397-410, 2014

J. Cai, P. Flocchini, N. Santoro
Decontaminating a network from a black virus.
International Journal of Networking and Computing, 63(2): 397-410, 2014

S. Das, P. Flocchini, G. Prencipe, N. Santoro
Synchronized dancing of oblivious chameleons.
7th International Conference on Fun with Algorithms (FUN), 113-124, 2014

M.H. Hesari, P. Flocchini, L. Narayanan, J. Opatrny, N. Santoro
Distributed barrier coverage with relocatable sensors.
21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 235-249, 2014

G.A. Di Luna, P. Flocchini, S.G. Chaudhuri, N. Santoro, G. Viglietta
Robots with lights: Overcoming obstructed visibility without colliding.
16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2014

G.A. Di Luna, P. Flocchini, F. Poloni, N. Santoro, G. Viglietta
The mutual visibility problem for oblivious robots.
26th Canadian Conference on Computational Geometry (CCCG), 2014

P. Flocchini, B. Mans, N. Santoro
On the exploration of time-varying networks.
Theoretical Computer Science, 469: 53-68, 2013.

P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro,
Computing without communicating: Ring exploration by asynchronous oblivious robots.
Algorithmica, 65(3): 562-583, 2013.

S. Dobrev, P. Flocchini, R. Kralovic, N. Santoro
Exploring an unknown dangerous graph using tokens.
Theoretical Computer Science, 472: 28-45, 2013.

A. Casteigts, P. Flocchini, E. Godard, N. Santoro, M. Yamashita
Expressivity of time-varying graphs.
19th International Symposium on Fundamentals of Computation Theory (FCT), 95-106, 2013.

G. Viglietta, P. Flocchini, N. Santoro, M. Yamashita
Rendezvous of two robots with constant memory.
20th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO), 189-200, 2013.

S. Das, E. Mesa, N. Santoro
Uniform dispersal of asynchronous finite-state mobile robots in presence of holes.
9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 228-243, 2013.

J. Cai, P. Flocchini, N. Santoro,
Network decontamination from a black virus
15th Work. on Advances in Parallel and Distributed Computational Models (APDCM) 696-705, 2013.

P. Flocchini, F. Luccio, L. Pagli, N. Santoro,
Optimal network decontamination with threshold immunity
8th International Conference on Algorithms and Complexity (CIAC) 234-245, 2013.

N. Santoro,
Mobility and computations: Open research directions (invited paper)
7th International Workshop on Algorithms and Computation (WALCOM) 1-3, 2013.

P. Flocchini, G. Prencipe, N. Santoro DISTRIBUTED COMPUTING BY OBLIVIOUS MOBILE ROBOTS Morgan & Claypool, 2012.

L. Barriere, P. Flocchini, F. V. Fomin, P. Fraigniaud, N. Nisse, N. Santoro, D. Thilikos
Connected graph searching
Information and Computation, 219: 1-16, 2012.

M. Cielibak, P. Flocchini, G. Prencipe, N. Santoro
Distributed computing by mobile robots: Gathering.
SIAM Journal on Computing, 41(4): 829-879, 2012.

P. Flocchini, D. Ilcinkas, N. Santoro
Ping pong in dangerous graphs: optimal black hole search with pebbles.
Algorithmica, 62(3-4): 1006-1033, 2012. (pdf)

P. Flocchini, M. Kellett, P. Mason, N. Santoro,
Searching for black holes in subways
Theory of Computing Systems, 50(1): 158-184, 2012. (pdf)

P. Flocchini, T. Mesa, L. Pagli, G. Prencipe, N. Santoro,
Distributed minimum spanning tree maintenance for transient node failures
IEEE Transactions on Computers,61(3): 408-414, 2012. (pdf)

A. Casteigts, P. Flocchini, W. Quattrociocchi, N. Santoro
Time-varying graphs and dynamic networks.
International Journal of Parallel, Emergent and Distributed Systems, 27: 346-359, 2012.

P. Flocchini, N. Santoro DISTRIBUTED SECURITY ALGORITMS FOR MOBILE AGENTS (Book Chapter of) : Mobile Agents in Networking and Distributed Computing J. Cao, S. Das (Eds.), Wiley 2012. (preliminary version - pdf)

S. Das, P. Flocchini, G. Prencipe, N. Santoro, M. Yamashita
The power of Lights: Synchronizing asynchronous robots using visible bits.
32nd International Conference on Distributed Computing Systems (ICDCS), 2012.

B. Balamohan, S. Dobrev, P. Flocchini, N. Santoro
Asynchronous exploration of an unknown anonymous dangerous graph with O(1) pebbles.
19th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO), 279-290, 2012.

P. Flocchini, M. Kellett, P. Mason, N. Santoro
Finding good coffee in Paris.
6th International Conference on Fun with Algorithms (FUN), 54-165, 2012.

P. Flocchini, M. Kellett, P. Mason, N. Santoro
Fault-tolerant exploration of an unknown dangerous graph by scattered agents.
14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2012.

P. Flocchini, G. Prencipe, N. Santoro COMPUTING BY MOBILE ROBOTIC SENSORS (Book Chapter of) : Theoretical Aspects of Distributed Computing in Sensor Networks S. Nikoletseas, J. Rolim (Eds.), Springer 2011. (preliminary version - pdf)

M. Duckham, D. Nussbaum, J.-R. Sack, N. Santoro,
Efficient decentralized computation of the topology of spatial regions
IEEE Transactions on Computers, 60(8): 1100-1113, 2011.

X. Li, H. Frey, N. Santoro, I. Stojmenovic
Strictly localized sensor self-deployment for optimal focused coverage
IEEE Transactions on Mobile Computing, 10(11): 1520-1533, 2011. (pdf)

P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro,
How many oblivious robots can explore a line.
Information Processing Letters, 111(20): 1027-1031, 2011. (pdf)

B. Gfeller, N. Santoro, and P. Widmayer
A distributed algorithm for finding all best swap edges of a minimum diameter spanning tree.
IEEE Transactions on Dependable and Secure Computing, 8(1): 1-12, 2011. (pdf)

L. Barriere, P. Flocchini, E. Mesa-Barrameda, N. Santoro,
Uniform scattering of autonomous mobile robots in a grid
Int. Journal of Foundations of Computer Science, 22(3): 679-697, 2011.

B. Balamohan, P. Flocchini, A. Miri, N. Santoro
Time optimal algorithms for black hole search in rings.
Discrete Mathematics, Algorithms and Applications, 3(4): 1-15, 2011. (pdf)

A.-R. Mawlood-Yunis, M. Weiss, N. Santoro
A reference model for semantic peer-to-peer networks.
Journal of Data Semantics, 15: 37-65, 2011. (pdf)

A. Casteigts, P. Flocchini, W. Quattrociocchi, N. Santoro
Time-varying graphs and dynamic networks.
10th International Conference on Adhoc Networks and Wireless (ADHOC-NOW), 346-359, 2011. (pdf)

A. Casteigts, P. Flocchini, B. Mans, N. Santoro
Measuring temporal lags in delay-tolerant networks.
25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2011. (pdf)

B. Balamohan, P. Flocchini, A. Miri, N. Santoro
Improving the optimal bounds for black hole search in rings.
18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 198-209, 2011.

F. Amblard, A. Casteigts, P. Flocchini, W. Quattrociocchi, N. Santoro
On the temporal analysis of scientific network evolution.
3rd International Conference on Computational Aspects of Social Networks (CASON), 2011.

N. Santoro, W. Quattrociocchi, P. Flocchini, A. Casteigts, F. Amblard
Time-varying graphs and social network analysis: Temporal indicators and metrics.
3rd AISB Social Networks and Multiagent Systems Symposium (SNAMAS) , 32-38, 2011.

E. Velazquez, N. Santoro
Neighbour selection and sensor knowledge: Proactive approach for the frugal feeding problem in wireless sensor networks.
3rd International Conference on Ad Hoc Networks (ADHOCNETS), 2011.

P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro
Remembering without memory: Tree exploration by asynchronous oblivious robots.
Theoretical Computer Science, 411 (14-15): 1583-1598, 2010. (pdf)

A.-R. Mawlood-Yunis, M. Weiss, N. Santoro
From P2P to reliable semantic P2P systems.
Peer-to-Peer Networking and Applications, 3 (4), 363-, 2010. (pdf)

D. Nussbaum, N. Santoro
On the message complexity of global computations.
14th International Conference on Principles of Distributed Systems (OPODIS), 427-442, 2010.

S. Das, P. Flocchini, N. Santoro, M. Yamashita
On the computational power of oblivious robots: forming a series of geometric patterns.
29th ACM Symposium on Principles of Distributed Computing (PODC), 2010.

J. Chalopin, P. Flocchini, B. Mans and N. Santoro
Network exploration by silent and oblivious robots.
36th International Workshop on Graph Theoretic Concepts in Computer Science (WG), 2010.

B. Balamohan, P. Flocchini, A. Miri, N. Santoro
Time optimal algorithms for black hole search in rings.
4th International Conference on Combinatorial Optimization and Applications (COCOA), 58-71, 2010. (pdf)

A. Casteigts, P. Flocchini, B. Mans, N. Santoro
Deterministic computations in time-varying graphs: broadcasting under unstructured mobility.
6th IFIP International Conference on Theoretical Computer Science (TCS), 2010. (pdf)

E. Velazquez, N. Santoro
Mobility-based strategies for energy restoration in wireless sensor networks.
6th International Conference on Mobile Ad-hoc and Sensor Networks (MSN), 2010.

P. Flocchini, M. Kellett, P. Mason, N. Santoro,
Mapping an unfriendly subway system
International Conference on Fun with Algorithms (FUN), 190-201, 2010. (pdf)

E. Velazquez, N. Santoro
Efficient robot-based energy maintenance in wireless sensor networks.
5th IEEE International Symposium on Wireless Pervasive Computing, 2010.

E. Velazquez, N. Santoro, Mark Lanthier
Pro-active strategies for the frugal feeding problem in wireless sensor networks.
The 2nd International ICST Conference on Sensor Systems and Software, 2010.