[Ci25] Frédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes and Ronan Pardo Soares. Connected Surveillance Game.
to appear in Proceedings of the 20th Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS, 2013.

[Ci24] Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse and Stéphane Pérennes, Maintaining Balanced Trees For Structured Distributed Streaming Systems.
to appear in Proceedings of the 20th Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS, 2013.

[Ci23] Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse and Karol Suchan. A unified approach for different tasks on rings in robot-based computing systems.
In Proceedings of the 15th Workshop on Advances in Parallel and Distributed Computational Models (APDCM), IEEE, 2013.

[Ci22] Nicolas Nisse and Ronan Pardo Soares. On the monotonicity of Process Number.
In Proceedings of 7th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Elsevier, to appear in Electronic Note Discrete Maths, 2013.

[Ci21] Lélia Blin, Janna Burman and Nicolas Nisse. Distributed Exclusive and Perpetual Tree Searching.
Brief Announcement in Proceedings of 26th International Symposium on DIStributed Computing (DISC), Springer LNCS 7611, pages 407-408, 2012.

[Ci20] Adrian Kosowski, Bi Li, Nicolas Nisse and Karol Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP), track C, Springer LNCS 7392, pages 610-622, 2012.

[Ci19] Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport and Karol Suchan. Allowing each node to communicate only once in a distributed system: shared whiteboard models.
In Proceedings of 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 11-17, 2012.

[Ci18] Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric and Nicolas Nisse, To satisfy Impatient Web surfers is Hard.
In Proceedings of 6th International Conference on FUN with Algorithms (FUN), Springer LNCS 7288, pages 166-176, 2012.

[Ci17] Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse and Issam Tahiri. Reconfiguration with physical constraints in WDM networks.
In Proceedings of Workshop on New Trends in Optical Networks Survivability (Netsurviv), IEEE, colocated with ICC, pages 6257-6261, 2012.

[Ci16] Florent Becker, Martin Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, and Ioan Todinca. Adding a referee to an interconnection network: What can(not) be computed in one round.
In Proceedings of the 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, pages 508-514, 2011. (.bib)

[Ci15] Nicolas Hanusse, David Ilcinkas, Adrian Kosowski and Nicolas Nisse, Locating a target with an agent guided by unreliable local advice.
In Proceedings of 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 355-364, 2010. (.bib)

[Ci14] Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno and Nicolas Nisse, Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
In Proceedings of 5th International Conference on FUN with Algorithms (FUN), Springer LNCS 6099, pages 121-132, 2010. (.bib)

[Ci13] Florian Huc, Christelle Molle-Caillouet, Nicolas Nisse, Stéphane Pérennes and Hervé Rivano, Stability of a local greedy distributed routing algorithm.
In Proceedings of the 12th Workshop on Advances in Parallel and Distributed Computational Models (APDCM), IEEE, 2010. (.bib)

[Ci12] Nicolas Nisse, Ivan Rapaport and Karol Suchan, Distributed computing of efficient routing schemes in generalized chordal graphs.
In Proceedings of the 16th Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS 5869, pages 252-265, 2009. (.bib)

[Ci11] David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse and Jean Sébastien Sereni, Routing Reconfiguration/Process Number: Coping wih Two Classes of Services.
In Proceedings of the 13th Conference on Optical Network Design and Modeling (ONDM), IEEE, 2009. (slides) (.bib)

[Ci10] Jean-Claude.Bermond, Nicolas Nisse, Patricio Reyes and Hervé Rivano, Minimum delay Data Gathering in Radio Networks.
In Proceedings of the 8th international conference on Ad Hoc Networks and Wireless (AdHoc-NOW), Springer LNCS 5793, pages  69-82, 2009. (.bib)

[Ci9] David Coudert, Dorian Mazauric and Nicolas Nisse, On Rerouting Connection Requests in Networks with Shared Bandwidth.
In Proceedings of the DIMAP Workshop on Algorithmic Graph Theory (AGT), Elsevier, Electronic Note Discrete Maths., Volume 32, pages 109-116, 2009. (slides) (.bib)

[Ci8] Nicolas Nisse and Karol Suchan, Fast Robber in Planar Graphs.
In Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG),  Springer LNCS 5344, pages  312-323, 2008. (.bib)

[Ci7] David Ilcinkas, Nicolas Nisse and David Soguet, The Cost of Monotonicity in Distributed Graph Searching.
In Proceedings to the 11th International Conference On Principles Of Distributed Systems (OPODIS),  Springer LNCS 4878, pages  415-428, 2007. (slides) (.bib)

[Ci6] Frédéric Mazoit and Nicolas Nisse, Monotonicity Property of Non-Deterministic Graph Searching.
In Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG),  Springer LNCS 4769, pages  33-44, 2007. (slides) (.bib)

[Ci5] Nicolas Nisse and David Soguet, Graph Searching with advice.
In Proceedings of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO),  Springer LNCS 4474, pages  51-65, 2007. (slides) (.bib)

[Ci4] Lélia Blin, Pierre Fraigniaud, Nicolas Nisse and Sandrine Vial, Distributed Chasing of Network Intruders by Mobile Agents.
In Proceedings of the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS 4056, pages  70-84, 2006. (slides) (.bib)

[Ci3] Pierre Fraigniaud and Nicolas Nisse, Monotony Properties of Connected Visible Graph Searching.
In Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Springer LNCS 4271, pages 229-240, 2006. (slides) (.bib)

[Ci2] Pierre Fraigniaud and Nicolas Nisse, Connected Treewidth and Connected Graph Searching.
In Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN), Springer LNCS 3887, pages  479-490, 2006. (slides) (.bib)

[Ci1] Fedor V. Fomin, Pierre Fraigniaud and Nicolas Nisse, Non-Deterministic Graph Searching: From Pathwidth to Treewidth.
In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), Springer LNCS 3618, pages 364-375, 2005. (slides) (.bib)

---