#### Filter Results:

- Full text PDF available (32)

#### Publication Year

2005

2019

- This year (11)
- Last 5 years (44)
- Last 10 years (93)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Florent Becker, MartÃn Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
- IEEE International Parallel & Distributedâ€¦
- 2011

In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we consider is a restriction of theâ€¦ (More)

- Omid Amini, FrÃ©dÃ©ric Mazoit, Nicolas Nisse, StÃ©phan ThomassÃ©
- Discrete Mathematics
- 2009

Adapting the method introduced in Graph Minors X [6], we propose a new proof of the duality between the bramble-number of a graph and its tree-width. This proof is based on a new definition ofâ€¦ (More)

- Fedor V. Fomin, FrÃ©dÃ©ric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse
- Theor. Comput. Sci.
- 2014

A transition in a graph is a pair of adjacent edges. Given a graph G = (V,E), a set of forbidden transitions F âŠ† E Ã— E and two vertices s, t âˆˆ V , we study the problem of finding a path from s to tâ€¦ (More)

- Pierre Fraigniaud, Nicolas Nisse
- LATIN
- 2006

Goal In a contaminated network, an invisible omniscient arbitrary fast fugitive ; a team of searchers ; We want to find a strategy that catch the fugitive using the fewest searchers as possible. Goalâ€¦ (More)

- FrÃ©dÃ©ric Mazoit, Nicolas Nisse
- WG
- 2007

In graph searching, a team of searchers is aiming at capturing a fugitive moving in a graph. In the initial variant, called invisible graph searching, the searchers do not know the position of theâ€¦ (More)

- Nicolas Nisse, Ivan Rapaport, Karol Suchan
- Theor. Comput. Sci.
- 2012

Efficient algorithms for computing routing tables should take advantage of the particular properties arising in large scale networks. Two of them are of particular interest: low (logarithmic)â€¦ (More)

We define and study the following two-player game on a graph G. Let k âˆˆ Nâˆ—. A set of k guards is occupying some vertices of G while one spy is standing at some node. At each turn, first the spy mayâ€¦ (More)

- Fedor V. Fomin, Petr A. Golovach, Jan KratochvÃl, Nicolas Nisse, Karol Suchan
- Theor. Comput. Sci.
- 2010

The Cops and Robbers game is played on undirected graphs where a group of cops tries to catch a robber. The game was defined independently by Winkler-Nowakowski and Quilliot in the 1980s and sinceâ€¦ (More)

We study the problem of finding a destination node <i>t</i> by a mobile agent in an unreliable network having the structure of an unweighted graph, in a model first proposed by Hanusse <i>et al</i>â€¦ (More)