Nicolas Nisse
Nicolas Nisse
Inria, France
Verified email at inria.fr
TitleCited byYear
Pursuing a fast robber on a graph
FV Fomin, PA Golovach, J Kratochvíl, N Nisse, K Suchan
Theoretical Computer Science 411 (7-9), 1167-1181, 2010
762010
Connected treewidth and connected graph searching
P Fraigniaud, N Nisse
Latin American Symposium on Theoretical Informatics, 479-490, 2006
542006
Connected graph searching
L Barrière, P Flocchini, FV Fomin, P Fraigniaud, N Nisse, N Santoro, ...
Information and Computation 219, 1-16, 2012
402012
Distributed chasing of network intruders
L Blin, P Fraigniaud, N Nisse, S Vial
International Colloquium on Structural Information and Communication …, 2006
392006
On the hull number of some graph classes
J Araujo, V Campos, F Giroire, N Nisse, L Sampaio, R Soares
Theoretical Computer Science 475, 1-12, 2013
382013
Cop and robber games when the robber can hide and ride
J Chalopin, V Chepoi, N Nisse, Y Vaxès
Siam Journal on Discrete Mathematics 25 (1), 333-359, 2011
382011
Distributed chasing of network intruders
L Blin, P Fraigniaud, N Nisse, S Vial
Theoretical Computer Science 399 (1-2), 12-37, 2008
382008
Distributed chasing of network intruders
L Blin, P Fraigniaud, N Nisse, S Vial
Theoretical Computer Science 399 (1-2), 12-37, 2008
382008
Distributed chasing of network intruders
L Blin, P Fraigniaud, N Nisse, S Vial
Theoretical Computer Science 399 (1-2), 12-37, 2008
382008
Graph searching with advice
N Nisse, D Soguet
Theoretical Computer Science 410 (14), 1307-1318, 2009
362009
Submodular partition functions
O Amini, F Mazoit, N Nisse, S Thomassé
Discrete Mathematics 309 (20), 6000-6008, 2009
342009
The cost of monotonicity in distributed graph searching
D Ilcinkas, N Nisse, D Soguet
Distributed Computing 22 (2), 117-127, 2009
332009
The cost of monotonicity in distributed graph searching
D Ilcinkas, N Nisse, D Soguet
Distributed Computing 22 (2), 117-127, 2009
332009
Reconfiguration of the routing in WDM networks with two classes of services
D Coudert, F Huc, D Mazauric, N Nisse, JS Sereni
2009 International Conference on Optical Network Design and Modeling, 1-6, 2009
292009
Nondeterministic graph searching: From pathwidth to treewidth
FV Fomin, P Fraigniaud, N Nisse
Algorithmica 53 (3), 358-373, 2009
282009
Monotony properties of connected visible graph searching
P Fraigniaud, N Nisse
Information and Computation 206 (12), 1383-1393, 2008
272008
Nondeterministic graph searching: From pathwidth to treewidth
FV Fomin, P Fraigniaud, N Nisse
Mathematical Foundations of Computer Science 2005, 364-375, 2005
272005
Adding a referee to an interconnection network: What can (not) be computed in one round
F Becker, M Matamala, N Nisse, I Rapaport, K Suchan, I Todinca
2011 IEEE International Parallel & Distributed Processing Symposium, 508-514, 2011
252011
To satisfy impatient web surfers is hard
FV Fomin, F Giroire, A Jean-Marie, D Mazauric, N Nisse
Theoretical Computer Science 526, 1-17, 2014
242014
k-chordal graphs: From cops and robber to compact routing via treewidth
A Kosowski, B Li, N Nisse, K Suchan
Automata, Languages, and Programming, 610-622, 2012
242012
The system can't perform the operation now. Try again later.
Articles 1–20