 | 2009 |
| 16 |  | Jean-Claude Bermond,
Nicolas Nisse,
Patricio Reyes,
Hervé Rivano:
Minimum Delay Data Gathering in Radio Networks.
ADHOC-NOW 2009: 69-82 |
| 15 |  | Fedor V. Fomin,
Pierre Fraigniaud,
Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
Algorithmica 53(3): 358-373 (2009) |
| 14 |  | Nicolas Nisse:
Connected graph searching in chordal graphs.
Discrete Applied Mathematics 157(12): 2603-2610 (2009) |
| 13 |  | David Coudert,
Dorian Mazauric,
Nicolas Nisse:
On Rerouting Connection Requests in Networks with Shared Bandwidth.
Electronic Notes in Discrete Mathematics 32: 109-116 (2009) |
| 12 |  | Nicolas Nisse,
David Soguet:
Graph searching with advice.
Theor. Comput. Sci. 410(14): 1307-1318 (2009) |
| 2008 |
| 11 |  | Nicolas Nisse,
Karol Suchan:
Fast Robber in Planar Graphs.
WG 2008: 312-323 |
| 10 |  | Pierre Fraigniaud,
Nicolas Nisse:
Monotony properties of connected visible graph searching.
Inf. Comput. 206(12): 1383-1393 (2008) |
| 9 |  | Lélia Blin,
Pierre Fraigniaud,
Nicolas Nisse,
Sandrine Vial:
Distributed chasing of network intruders.
Theor. Comput. Sci. 399(1-2): 12-37 (2008) |
| 8 |  | Frédéric Mazoit,
Nicolas Nisse:
Monotonicity of non-deterministic graph searching.
Theor. Comput. Sci. 399(3): 169-178 (2008) |
| 2007 |
| 7 |  | David Ilcinkas,
Nicolas Nisse,
David Soguet:
The Cost of Monotonicity in Distributed Graph Searching.
OPODIS 2007: 415-428 |
| 6 |  | Nicolas Nisse,
David Soguet:
Graph Searching with Advice.
SIROCCO 2007: 51-65 |
| 5 |  | Frédéric Mazoit,
Nicolas Nisse:
Monotonicity of Non-deterministic Graph Searching.
WG 2007: 33-44 |
| 2006 |
| 4 |  | Pierre Fraigniaud,
Nicolas Nisse:
Connected Treewidth and Connected Graph Searching.
LATIN 2006: 479-490 |
| 3 |  | Lélia Blin,
Pierre Fraigniaud,
Nicolas Nisse,
Sandrine Vial:
Distributed Chasing of Network Intruders.
SIROCCO 2006: 70-84 |
| 2 |  | Pierre Fraigniaud,
Nicolas Nisse:
Monotony Properties of Connected Visible Graph Searching.
WG 2006: 229-240 |
| 2005 |
| 1 |  | Fedor V. Fomin,
Pierre Fraigniaud,
Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
MFCS 2005: 364-375 |