| 2009 |
|---|
| 13 | EE | Fedor V. Fomin,
Pierre Fraigniaud,
Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
Algorithmica 53(3): 358-373 (2009) |
| 12 | EE | Nicolas Nisse,
David Soguet:
Graph searching with advice.
Theor. Comput. Sci. 410(14): 1307-1318 (2009) |
| 2008 |
|---|
| 11 | EE | Nicolas Nisse,
Karol Suchan:
Fast Robber in Planar Graphs.
WG 2008: 312-323 |
| 10 | EE | Pierre Fraigniaud,
Nicolas Nisse:
Monotony properties of connected visible graph searching.
Inf. Comput. 206(12): 1383-1393 (2008) |
| 9 | EE | Lélia Blin,
Pierre Fraigniaud,
Nicolas Nisse,
Sandrine Vial:
Distributed chasing of network intruders.
Theor. Comput. Sci. 399(1-2): 12-37 (2008) |
| 8 | EE | Frédéric Mazoit,
Nicolas Nisse:
Monotonicity of non-deterministic graph searching.
Theor. Comput. Sci. 399(3): 169-178 (2008) |
| 2007 |
|---|
| 7 | EE | David Ilcinkas,
Nicolas Nisse,
David Soguet:
The Cost of Monotonicity in Distributed Graph Searching.
OPODIS 2007: 415-428 |
| 6 | EE | Nicolas Nisse,
David Soguet:
Graph Searching with Advice.
SIROCCO 2007: 51-65 |
| 5 | EE | Frédéric Mazoit,
Nicolas Nisse:
Monotonicity of Non-deterministic Graph Searching.
WG 2007: 33-44 |
| 2006 |
|---|
| 4 | EE | Pierre Fraigniaud,
Nicolas Nisse:
Connected Treewidth and Connected Graph Searching.
LATIN 2006: 479-490 |
| 3 | EE | Lélia Blin,
Pierre Fraigniaud,
Nicolas Nisse,
Sandrine Vial:
Distributed Chasing of Network Intruders.
SIROCCO 2006: 70-84 |
| 2 | EE | Pierre Fraigniaud,
Nicolas Nisse:
Monotony Properties of Connected Visible Graph Searching.
WG 2006: 229-240 |
| 2005 |
|---|
| 1 | EE | Fedor V. Fomin,
Pierre Fraigniaud,
Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
MFCS 2005: 364-375 |
