|
MASCOTTE no longer exists => visit the new project-team
Publications of N. Nisse
BACK TO MASCOTTE PUBLICATION INDEX
Publications of N. Nisse
-
J. Araujo,
V. Campos,
F. Giroire,
N. Nisse,
L. Sampaio,
and R. Soares.
On the hull number of some graph classes.
Theoretical Computer Science,
475:1-12,
2013.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Barrière,
P. Flocchini,
F. Fomin,
P. Fraigniaud,
N. Nisse,
N. Santoro,
and D. Thilikos.
Connected Graph Searching.
Information and Computation,
219:1-16,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse,
I. Rapaport,
and K. Suchan.
Distributed computing of efficient routing schemes in generalized chordal graphs.
Theoretical Computer Science,
444(27):17-27,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Chalopin,
V. Chepoi,
N. Nisse,
and Y. Vaxès.
Cop and robber games when the robber can hide and ride.
SIAM Journal of Discrete Maths.,
25(1):333-359,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
Theoretical Computer Science (TCS),
412(35):4675-4687,
August 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
P. A. Golovach,
J. Kratochvil,
N. Nisse,
and K. Suchan.
Pursuing a fast robber on a graph.
Theoretical Computer Science,
411(7-9):1167-1181,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Mazoit,
N. Nisse,
and S. Thomassé.
Submodular partition functions.
Discrete Mathematics,
309(20):6000-6008,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
P. Fraigniaud,
and N. Nisse.
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
Algorithmica,
53(3):358-373,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Ilcinkas,
N. Nisse,
and D. Soguet.
The Cost of Monotonicity in Distributed Graph Searching.
Distributed Computing,
22(2):117-127,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse.
Connected graph searching in chordal graphs.
Discrete Applied Mathematics,
157(12):2603-2610,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and D. Soguet.
Graph Searching with Advice.
Theoretical Computer Science,
410(14):1307-1318,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
P. Fraigniaud,
N. Nisse,
and S. Vial.
Distributed chasing of network intruders.
Theoretical Computer Science,
399(1-2):12-37,
2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Fraigniaud and N. Nisse.
Monotony Properties of Connected Visible Graph Searching.
Information and Computation,
206(12):1383-1393,
2008.
[Abstract] [bibtex-entry]
-
F. Mazoit and N. Nisse.
Monotonicity of non-deterministic graph searching.
Theoretical Computer Science,
399(3):169-178,
2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Becker,
A. Kosowski,
N. Nisse,
I. Rapaport,
and K. Suchan.
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power.
In 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
pages 11-17,
2012.
ACM.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Belhareth,
D. Coudert,
D. Mazauric,
N. Nisse,
and I. Tahiri.
Reconfiguration with physical constraints in WDM networks.
In IEEE ICC Workshop on New Trends in Optical Networks Survivability,
Ottawa, Canada,
pages 6346-6350,
June 2012.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
J. Burman,
and N. Nisse.
Brief Announcement: Distributed Exclusive and Perpetual Tree Searching.
In 26th International Symposium on Distributed Computing (DISC),
volume 7611,
pages 403-404,
2012.
Springer, LNCS.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
J. Burman,
and N. Nisse.
Nettoyage perpétuel de réseaux.
In 14es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 31-34,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
F. Giroire,
A. Jean-Marie,
D. Mazauric,
and N. Nisse.
Satisfaire un internaute impatient est difficile.
In 14es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 79-82,
2012.
Note: Best paper.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
F. Giroire,
A. Jean-Marie,
D. Mazauric,
and N. Nisse.
To Satisfy Impatient Web surfers is Hard.
In 6th International Conference on FUN with Algorithms (FUN),
volume 7288,
pages 166-176,
2012.
Springer, LNCS.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Kosowski,
B. Li,
N. Nisse,
and K. Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
In 14es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 83-86,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Kosowski,
B. Li,
N. Nisse,
and K. Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
In 39th International Colloquium on Automata, Languages and Programming (ICALP, track C),
volume 7392,
pages 610-622,
2012.
Springer, LNCS.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Becker,
M. Matamala,
N. Nisse,
I. Rapaport,
K. Suchan,
and I. Todinca.
Adding a referee to an interconnection network: What can(not) be computed in one round.
In 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS),
pages 508-514,
2011.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Becker,
M. Matamala,
N. Nisse,
I. Rapaport,
K. Suchan,
and I. Todinca.
Reconstruire un graphe en une ronde.
In Ducourthial,
Bertrand et Felber,
and Pascal, editors,
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Cap Estérel, France,
2011.
[WWW
] [Abstract] [bibtex-entry]
-
S. Belhareth,
D. Coudert,
D. Mazauric,
N. Nisse,
and I. Tahiri.
Reconfiguration avec contraintes physiques dans les réseaux WDM.
In Ducourthial et Bertrand et Felber et Pascal, editor,
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Cap Estérel, France,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Caillouet,
F. Huc,
N. Nisse,
S. Pérennes,
and H. Rivano.
Stability of a localized and greedy routing algorithm.
In 12th Workshop on Advances in Parallel and Distributed Computational Models,
pages 8p,
2010.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Chalopin,
V. Chepoi,
N. Nisse,
and Y. Vaxes.
Cop and robber games when the robber can hide and ride.
In 8th French Combinatorial Conference,
Orsay,
June 2010.
Note: Selection on abstract.
[Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
In P. Boldi and L. Gargano, editors,
Fifth International conference on Fun with Algorithms (FUN 2010),
volume 6099 of Lecture Notes in Computer Science,
Ischia Island, Italy,
pages 121-132,
June 2010.
Springer.
Note: Http://hal.inria.fr/inria-00495443.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs in routing reconfiguration problems.
In Maria Gradinariu Potop-Butucaru et Hervé Rivano, editor,
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Belle Dune France,
pages 4p,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Hanusse,
D. Ilcinkas,
A. Kosowski,
and N. Nisse.
Comment battre la marche aléatoire en comptant ?.
In 12ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'10),
pages 4p,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Hanusse,
D. Ilcinkas,
A. Kosowski,
and N. Nisse.
Locating a target with an agent guided by unreliable local advice.
In 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'10),
volume XXXX,
pages 10p,
2010.
ACM.
Note: To appear.
[PDF
] [Abstract] [bibtex-entry]
-
N. Nisse.
Graph Searching and Graph Decompositions.
In 24th European Conference on Operational Research (EURO),
Lisbon, Portugal,
pages 1p,
July 2010.
Note: Invited talk.
[WWW
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
N. Nisse,
P. Reyes,
and H. Rivano.
Fast Data Gathering in Radio Grid Networks.
In 11èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'09),
pages 4p,
June 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. C. Bermond,
N. Nisse,
P. Reyes,
and H. Rivano.
Minimum delay Data Gathering in Radio Networks.
In Proceedings of the 8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now),
volume 5793 of Lecture Notes in Computer Science,
pages 69-82,
2009.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
D. Mazauric,
N. Nisse,
and J-S. Sereni.
Reconfiguration dans les réseaux optiques.
In A. Chaintreau and C. Magnien, editors,
11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09),
Carry le Rouet,
pages 4p,
June 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
D. Mazauric,
N. Nisse,
and J-S. Sereni.
Reconfiguration of the Routing in WDM Networks with Two Classes of Services.
In 13th Conference on Optical Network Design and Modeling (ONDM),
Braunschweig, Germany,
pages 6p,
February 2009.
IEEE.
[WWW
] [Abstract] [bibtex-entry]
-
D. Coudert,
D. Mazauric,
and N. Nisse.
On Rerouting Connection Requests in Networks with Shared Bandwidth.
In DIMAP workshop on Algorithmic Graph Theory (AGT09),
volume 32 of Electronic Notes in Discrete Mathematics,
Warwick, UK,
pages 109-116,
March 2009.
Elsevier.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse,
I. Rapaport,
and K. Suchan.
Distributed computing of efficient routing schemes in generalized chordal graphs.
In Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume 5869 of Lecture Notes in Computer Science,
Piran, Slovenia,
pages 252-265,
2009.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
D. Ilcinkas,
N. Nisse,
and D. Soguet.
Le cout de la monotonie dans les stratégies d'encerclement réparti.
In 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08),
pages 4p,
2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and K. Suchan.
Fast Robber in Planar Graphs.
In Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG),
volume 5344 of Lecture Notes in Computer Science,
pages 33-44,
2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and K. Suchan.
Voleur véloce dans un réseau planaire.
In 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08),
pages 4p,
2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Ilcinkas,
N. Nisse,
and D. Soguet.
The Cost of Monotonicity in Distributed Graph Searching.
In OPODIS,
volume 4878 of Lecture Notes in Computer Science,
Guadeloupe, France,
pages 415-428,
December 2007.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Mazoit and N. Nisse.
Monotonicity of Non-deterministic Graph Searching.
In Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG),
volume 4769 of Lecture Notes in Computer Science,
Dornburg, Germany,
pages 33-44,
June 2007.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and D. Soguet.
Graph Searching with Advice.
In Proceedings of the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume 4474 of Lecture Notes in Computer Science,
Castiglioncello, Italy,
pages 51-65,
June 2007.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and D. Soguet.
Stratégies d'encerclement avec information.
In 9èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 49-52,
2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
P. Fraigniaud,
N. Nisse,
and S. Vial.
Distributed Chasing of Network Intruders.
In Proceeding of the 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume 4056 of Lecture Notes in Computer Science,
Chester, UK,
pages 70-84,
July 2006.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
P. Fraigniaud,
N. Nisse,
and S. Vial.
Encerclement réparti d'un fugitif dans un réseau par des agents mobiles..
In 8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 89-92,
2006.
[WWW
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
P. Fraigniaud,
and N. Nisse.
Strategies d'encerclement non deterministes.
In 8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 81-84,
2006.
[WWW
] [Abstract] [bibtex-entry]
-
P. Fraigniaud and N. Nisse.
Connected Treewidth and Connected Graph Searching.
In Proceeding of the 7th Latin American Symposium on Theoretical Informatics (LATIN),
pages 479-490,
2006.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Fraigniaud and N. Nisse.
Monotony Properties of Connected Visible Graph Searching.
In Proceedings of 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG),
volume 5911 of Lecture Notes in Computer Science,
Montpellier, France,
pages 229-240,
June 2006.
Springer.
[Abstract] [bibtex-entry]
-
F. V. Fomin,
P. Fraigniaud,
and N. Nisse.
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS),
pages 364-375,
2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Fraigniaud and N. Nisse.
Stratégies d'encerclement connexes dans un réseau.
In 7èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 13-16,
2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
G. Di Stefano,
A. Navarra,
N. Nisse,
and N. Suchan.
A unified approach for different tasks on rings in robot-based computing systems.
In 15th Workshop on Advances in Parallel and Distributed Computational Models (APDCM),
.
IEEE.
Note: To appear.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and R. Soares.
On The Monotonicity of Process Number.
In proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'13),
Electronic Notes in Discrete Mathematics,
Playa del Carmen, Mexico,
April.
[PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
J. Burman,
and N. Nisse.
Perpetual Graph Searching.
Technical report RR-7897,
INRIA,
February 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
G. Di Stefano,
A. Navarra,
N. Nisse,
and K. Suchan.
A unified approach for different tasks on rings in robot-based computing systems.
Technical report RR-8013,
INRIA,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Kosowski,
B. Li,
N. Nisse,
and K. Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
Technical report RR-7888,
INRIA,
February 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and R. Soares.
On The Monotonicity of Process Number.
Technical report RR-7003,
INRIA,
October 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
V. Campos,
F. Giroire,
N. Nisse,
L. Sampaio,
and R. Soares.
On the hull number of some graph classes.
Technical report RR-7567,
INRIA,
September 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Becker,
A. Kosowski,
N. Nisse,
I. Rapaport,
and K. Suchan.
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power.
Technical report RR-7746,
INRIA,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Belhareth,
D. Coudert,
D. Mazauric,
N. Nisse,
and I. Tahiri.
Reconfiguration with physical constraints in WDM networks.
Research Report RR-7850,
INRIA,
2011.
[WWW
] [PDF
]
Keywords:
Reconfiguration,
WDM,
NP-complete,
Physical Layer Impaiments..
[Abstract] [bibtex-entry]
-
F. Fomin,
F. Giroire,
A. Jean-Marie,
D. Mazauric,
and N. Nisse.
To Satisfy Impatient Web surfers is Hard.
Technical report RR-7740,
INRIA,
September 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Barrière,
P. Flocchini,
F. V. Fomin,
P. Fraigniaud,
N. Nisse,
N. Santoro,
and D. Thilikos.
Connected Graph Searching.
Research Report 7363,
INRIA,
August 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Becker,
M. Matamala,
N. Nisse,
I. Rapaport,
K. Suchan,
and I. Todinca.
Adding a referee to an interconnection network: What can(not) be computed in one round.
Research Report arXiv:1009.4447,
arXiv,
September 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Chalopin,
V. Chepoi,
N. Nisse,
and Y. Vaxès.
Cop and robber games when the robber can hide and ride..
Technical report INRIA-RR7178,
INRIA,
January 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Hanusse,
D. Ilcinkas,
A. Kosowski,
and N. Nisse.
How to beat the random walk when you have a clock?.
Research Report RR-7210,
INRIA,
February 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
N. Nisse,
P. Reyes,
and H. Rivano.
Fast Data Gathering in Radio Grid Networks.
Research Report RR-6851,
INRIA,
March 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks..
Technical report RR-7047,
INRIA,
September 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
D. Mazauric,
and N. Nisse.
Routing Reconfiguration/Process Number: Networks with Shared Bandwidth..
Technical report RR-6790,
INRIA,
January 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Huc,
C. Molle,
N. Nisse,
S. Perennes,
and H. Rivano.
Stability of a local greedy distributed routing algorithm.
Technical report RR-6871,
INRIA,
March 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Berthomé and N. Nisse.
A unified FPT Algorithm for Width of Partition Functions.
Research Report RR-6646,
INRIA,
September 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
D. Mazauric,
N. Nisse,
and J-S. Sereni.
Routing Reconfiguration/Process Number: Coping wih Two Classes of Services.
Research Report RR-6698,
INRIA,
October 2008.
[WWW
] [Abstract] [bibtex-entry]
-
N. Nisse,
K. Suchan,
and I. Rapaport.
Distributed computing of efficient routing schemes in generalized chordal graphs.
Technical report CMM-B-08/10-220,
CMM,
October 2008.
[PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
D. Coudert,
and N. Nisse.
Some Results on Non-deterministic Graph Searching in Trees.
Research Report INRIA-00174965,
INRIA,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Mazoit,
N. Nisse,
and S. Thomassé.
Submodular partition functions.
Technical report RR-1427-07,
LABRI, Univ. Bordeaux,
April 2007.
Note: Submitted in SIAM J. discrete Maths. [PDF
] [Abstract] [bibtex-entry]
BACK TO MASCOTTE PUBLICATION INDEX
Last modified: Thu Oct 10 14:10:02 2013
This document was translated from BibTEX by
bibtex2html
|
