Nombre de documents

130

CV de Nicolas Nisse


Communication dans un congrès58 documents

  • Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse. On the Complexity of Computing Treebreadth. Veli Mäkinen; Simon J. Puglisi; Leena Salmela. 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Aug 2016, Helsinki, Finland. Springer International Publishing, 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), pp.3-15, 2016, Combinatorial Algorithms. <http://iwoca2016.cs.helsinki.fi/>. <10.1007/978-3-319-44543-4_1>. <hal-01354996>
  • Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse. Subdivisions of oriented cycles in digraphs with large chromatic number. Bordeaux Graph Wokshop 2016, Nov 2016, Bordeaux, France. Proceedings of BGW 216 (Bordeaux Graph Wokshop 2016), pp.85-88, <http://bgw.labri.fr/2016/>. <hal-01411115>
  • Nathann Cohen, Mathieu Hilaire, Nicolas Martins, Nicolas Nisse, Stéphane Pérennes. Spy-Game on graphs. Erik D. Demaine and Fabrizio Grandoni. 8th International Conference on Fun with Algorithms, FUN 2016, 2016, La Maddalena, Maddalena Islands, Italy. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 8th International Conference on Fun with Algorithms (FUN 2016), 49, 2016, Leibniz International Proceedings in Informatics (LIPIcs). <10.4230/LIPIcs.FUN.2016.10>. <hal-01326446>
  • Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan. Minimum Size Tree-decompositions. LAGOS 2015 – VIII Latin-American Algorithms, Graphs and Optimization Symposium, May 2015, Beberibe, Ceará, Brazil. <hal-01162695>
  • Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse. Finding Paths in Grids with Forbidden Transitions. WG 2015, 41st International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2015, Munich, Germany. <hal-01162796>
  • Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse. On paths in grids with forbidden transitions. ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France. <hal-01142745>
  • Nicolas Nisse, Alexandre Salch, Valentin Weber. Comment appliquer les chaînes augmentantes pour atterrir a l'heure ?. ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France. <hal-01144674>
  • David Coudert, Guillaume Ducoffe, Nicolas Nisse. Structure vs métrique dans les graphes. ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France. <hal-01144694>
  • David Coudert, Dorian Mazauric, Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth. 13th International Symposium on Experimental Algorithms, 2014, Copenhagen, Denmark. 8504, pp.46-58, 2014, Lecture Notes in Computer Science. <hal-00966851>
  • Julio Araújo, Nicolas Nisse, Stéphane Pérennes. Weighted Coloring in Trees. 31st Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2014, Lyon, France. Dagstuhl Publishing, pp.75-86, 2014. <hal-00931523>
  • Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse. Gathering and Exclusive Searching on Rings under Minimal Assumptions. Mainak Chatterjee; Jian-Nong Cao; Kishore Kothapalli; Sergio Rajsbaum. 15th International Conference on Distributed Computing and Networking (ICDCN), Jan 2014, Coimbatore, India. Springer, 8314, pp.149-164, 2014, <10.1007/978-3-642-45249-9_10>. <hal-00931514>
  • Gianlorenzo D'Angelo, Xavier Défago, Nicolas Nisse. Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments. Second International Symposium on Computing and Networking (CANDAR), Dec 2014, Mt. Fuji, Shizuoka, Japan. 2014. <hal-01072723>
  • Bi Li, Fatima Zahra Moataz, Nicolas Nisse. Minimum Size Tree-Decompositions. 9th International colloquium on graph theory and combinatorics (ICGT), 2014, Grenoble, France. 2014. <hal-01023904>
  • Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan. A unified approach for different tasks on rings in robot-based computing systems. 15th Workshop on Advances in Parallel and Distributed Computational Models (IPDPS Workshop), May 2013, Boston, United States. pp.667-676, 2013. <hal-00845546>
  • Lélia Blin, Janna Burman, Nicolas Nisse. Exclusive Graph Searching. 21st European Symposium on Algorithms (ESA 2013), Sep 2013, Sophia Antipolis, France. Springer, 8125, pp.181-192, 2013, Lecture Notes in Computer Science. <10.1007/978-3-642-40450-4_16>. <hal-00845530>
  • Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes. Maintaining Balanced Trees For Structured Distributed Streaming Systems. 20th Colloquium on Structural Information and Communication Complexity (SIROCCO), Jul 2013, Ischia, Italy. LNCS 8179, pp.177-188, 2013, <10.1007/978-3-319-03578-9_15>. <hal-00845536>
  • Nicolas Nisse, Ronan Soares. On the Monotonicity of Process Number. 7th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Apr 2013, Mexico, Mexico. Elsevier, 44, pp.141-147, 2013. <hal-00845539>
  • Nicolas Nisse. Fractional Combinatorial Two-Player Games. 26th European Conference on Operational Research (EURO XXVI), 2013, Italy. <hal-00845550>
  • Frédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, Ronan Soares. Connected Surveillance Game. 20th Colloquium on Structural Information and Communication Complexity (SIROCCO), Jul 2013, Ischia, Italy. Springer, LNCS 8179, pp.68-79, 2013, Lecture Notes in Computer Science (LNCS). <hal-00845531>
  • Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, Issam Tahiri. Reconfiguration with physical constraints in WDM networks. Workshop on New Trends in Optical Networks Survivability, 2012, Canada. pp.5, 2012. <hal-00704199>
  • Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan. Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard Models. SPAA - 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012, United States. pp.7, 2012. <hal-00704200>
  • Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse. To Satisfy Impatient Web surfers is Hard. FUN: International Conference on FUN with Algorithms, Jun 2012, Venice, Italy. Springer, pp.166-176, 2012, 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012, Proceedings. <hal-00704201>
  • Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. ICALP - 39th International Colloquium on Automata, Languages and Programming, track C, 2012, United Kingdom. pp.610-622, 2012. <hal-00704202>
  • Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse. Satisfaire un internaute impatient est difficile. Mathieu, Fabien et Hanusse, Nicolas. 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La Grande Motte, France. 2012. <hal-00687102>
  • Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan. $k$-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. Mathieu, Fabien et Hanusse, Nicolas. AlgoTel - 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 2012, La Grande Motte, France. 2012. <hal-00687120>
  • Lélia Blin, Janna Burman, Nicolas Nisse. Nettoyage perpétuel de réseaux. Mathieu, Fabien et Hanusse, Nicolas. 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La Grande Motte, France. 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pp.4, 2012. <hal-00687134>
  • Lélia Blin, Janna Burman, Nicolas Nisse. Brief Announcement: Distributed Exclusive and Perpetual Tree Searching. DISC 2012 - 26th International Symposium on Distributed Computing, Oct 2012, Salvador, Brazil. Springer, 7611, pp.403-404, 2012, Lecture Notes in Computer Science. <10.1007/978-3-642-33651-5_29>. <hal-00741982>
  • Florent Becker, Martin Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, et al.. Adding a referee to an interconnection network: What can(not) be computed in one round.. 25th IEEE International Symposium on Parallel & Distributed Processing (IPDPS), 2011, Anchorage, United States. pp.508-514, 2011. <inria-00622976>
  • Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, Issam Tahiri. Reconfiguration avec contraintes physiques dans les réseaux WDM. Ducourthial, Bertrand et Felber, Pascal. 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 2011. <inria-00583829v2>
  • Florent Becker, Martin Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, et al.. Reconstruire un graphe en une ronde. Ducourthial, Bertrand et Felber, Pascal. 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 2011. <inria-00587250>
  • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno, Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Paola Boldi and Luisa Gargano. Fifth International conference on Fun with Algorithms (FUN 2010), Jun 2010, Ischia, Italy. Springer, 6099, pp.121-132, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-13122-6_14>. <inria-00495443>
  • Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse. Locating a Target with an Agent Guided by Unreliable Local Advice. PODC 2010, Jul 2010, Zurich, Switzerland. ACM New York, NY, USA, pp.355-364, 2010, <10.1145/1835698.1835781>. <hal-00516695>
  • Christelle Caillouet, Nicolas Nisse, Florian Huc, Stéphane Pérennes, Hervé Rivano. Stability of a Localized and Greedy Routing Algorithm. 12th IEEE Workshop in Parallel and Distributed Computational Models (IEEE APDCM 2010), in conjunction with IPDPS 2010, Apr 2010, Atlanta, United States. IEEE, 2010, Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on. <10.1109/IPDPSW.2010.5470832>. <inria-00466484>
  • Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse. Comment battre la marche aléatoire en comptant ?. Maria Gradinariu Potop-Butucaru et Hervé Rivano. 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. 2010. <inria-00475863>
  • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse. Tradeoffs in routing reconfiguration problems. Maria Gradinariu Potop-Butucaru et Hervé Rivano. 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. pp.0, 2010. <inria-00477413>
  • Nicolas Nisse. Graph Searching and Graph Decompositions. 24th European Conference on Operational Research (EURO) (2010), Jul 2010, Lisbon, Portugal. 2010. <inria-00482115>
  • Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès. Cop and robber games when the robber can hide and ride. 8th French Combinatorial Conference, Jun 2010, Orsay, France. 2010. <inria-00482117>
  • Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes, Hervé Rivano. Fast Data Gathering in Radio Grid Networks. Chaintreau, Augustin and Magnien, Clemence. AlgoTel, 2009, Carry-Le-Rouet, France. 2009. <inria-00376040>
  • Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes, Hervé Rivano. Minimum delay Data Gathering in Radio Networks. 8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now),, Sep 2009, Murcia, Spain. Springer Verlag, 5793, pp.69-82,, 2009, Lecture Notes in Computer Science,. <http://dx.doi.org/10.1007/978-3-642-04383-3_6>. <10.1007/978-3-642-04383-3_6>. <inria-00505522>
  • David Coudert, Dorian Mazauric, Nicolas Nisse. On Rerouting Connection Requests in Networks with Shared Bandwidth. DIMAP Workshop on Algorithmic Graph Theory (AGT), 2009, Warwick, United Kingdom. 32, 2009, Electronic Note Discrete Maths. <inria-00423452>
  • Nicolas Nisse, Ivan Rapaport, Karol Suchan. Distributed computing of efficient routing schemes in generalized chordal graphs. International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2009, Piran, Slovenia. 2009. <inria-00423454>
  • David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse, Jean-Sébastien Sereni. Reconfiguration dans les réseaux optiques. Chaintreau, Augustin and Magnien, Clemence. 11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2009, Carry-Le-Rouet, France. 2009. <inria-00383206>
  • David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse, Jean-Sébastien Sereni. Reconfiguration of the Routing in WDM Networks with Two Classes of Services. Conference on Optical Network Design and Modeling (ONDM), 2009, Braunschweig, Germany. 2009. <inria-00423453>
  • Nicolas Nisse, Karol Suchan. Voleur véloce dans un réseau planaire. David and Sebastien Tixeuil. 10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), 2008, Saint-Malo, France. pp.29-32, 2008. <inria-00374450>
  • David Ilcinkas, Nicolas Nisse, David Soguet. Le coût de la monotonie dans les stratégies d'encerclement réparti. David and Sebastien Tixeuil. 10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), 2008, Saint-Malo, France. pp.33-36, 2008. <inria-00374451>
  • Nicolas Nisse, Karol Suchan. Fast Robber in Planar Graphs. International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2008, Durham, United Kingdom. 2008. <inria-00423451>
  • Frédéric Mazoit, Nicolas Nisse. Monotonicity of Non-deterministic Graph Searching. International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2007, Dornburg, Germany. Springer Berlin / Heidelberg, 4769/2007, pp.33-44, 2007, Lecture Notes in Computer Science. <10.1007/978-3-540-74839-7>. <hal-00351481>
  • Nicolas Nisse, David Soguet. Stratégies d'encerclement avec information. 9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. 2007. <inria-00176935>
  • Nicolas Nisse, David Soguet. Graph Searching with advice. International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2007, Castiglioncello, Italy. 2007. <inria-00423450>
  • David Ilcinkas, Nicolas Nisse, David Soguet. The Cost of Monotonicity in Distributed Graph Searching. Eduardo Tovar, Philippas Tsigas, Hacène Fouchal. OPODIS 2007, Dec 2007, Pointe à Pitre, Guadeloupe, France. Springer Berlin / Heidelberg, 4878, pp.415-428, 2007, Lecture Notes in Computer Science. <10.1007/978-3-540-77096-1_30>. <hal-00341415>
  • Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. Distributed Chasing of Network Intruders. 13th International Colloquium on Structural Information and Communication Complexity, 2006, Chester, United Kingdom. 4056, pp.70-84, 2006, Lecture Notes in Computer Science. <10.1007/11780823_7>. <hal-01311355>
  • Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. Distributed Chasing of Network Intruders by Mobile Agents. Proceedings of the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), 2006, United Kingdom. 4056, pp.70--84, 2006, Lecture Notes in Computer Science. <10.1007/11780823_7>. <hal-00342000>
  • Fedor Fomin, Pierre Fraigniaud, Nicolas Nisse. Strategies d'encerclement non deterministes. 8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2006, France. pp.81-84, 2006. <hal-00421419>
  • Pierre Fraigniaud, Nicolas Nisse. Connected Treewidth and Connected Graph Searching. Latin American Theoretical Informatics Symposium (LATIN), 2006, Valdivia, Chile. 2006. <inria-00423448>
  • Pierre Fraigniaud, Nicolas Nisse. Monotony Properties of Connected Visible Graph Searching. International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2006, Bergen, Norway. 2006. <inria-00423449>
  • Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. Encerclement réparti d'un fugitif dans un réseau par des agents mobiles. Actes des Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 2006, France. pp.89--92, 2006. <hal-00342001>
  • Fedor Fomin, Pierre Fraigniaud, Nicolas Nisse. Non-Deterministic Graph Searching: From Pathwidth to Treewidth. Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2005, Poland. pp.364-375, 2005, <10.1007/11549345_32>. <hal-00421420>
  • Pierre Fraigniaud, Nicolas Nisse. Stratégies d'encerclement connexes dans un réseau. 7èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2005, France. pp.13-16, 2005. <hal-00421418>

Rapport39 documents

  • Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse. On computing tree and path decompositions with metric constraints on the bags. [Research Report] RR-8842, INRIA Sophia Antipolis - Méditerranée; LRI - CNRS, University Paris-Sud. 2016, pp.66. <hal-01254917>
  • Julio Araujo, Guillaume Ducoffe, Nicolas Nisse, Karol Suchan. On interval number in cycle convexity. [Research Report] Inria Sophia Antipolis; I3S. 2016. <hal-01394201>
  • Nathann Cohen, Mathieu Hilaire, Nicolas Martins, Nicolas Nisse, Stéphane Pérennes. Spy-Game on graphs. [Research Report] RR-8869, Inria. 2016. <hal-01279339>
  • Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse. Subdivisions of oriented cycles in digraphs with large chromatic number. [Research Report] RR-8865, LRI - CNRS, University Paris-Sud; LIP - ENS Lyon; INRIA Sophia Antipolis - I3S. 2016, pp.25. <hal-01277578>
  • Seong-Gyun Jeong, Yuliya Tarabalka, Nicolas Nisse, Josiane Zerubia. Inference of Curvilinear Structure based on Learning a Ranking Function and Graph Theory. [Research Report] RR-8789, Inria Sophia Antipolis. 2015. <hal-01214932>
  • Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse. Finding Paths in Grids with Forbidden Transitions. [Research Report] Inria Sophia Antipolis; Univeristé Nice Sophia Antipolis; CNRS. 2015. <hal-01115395>
  • Nicolas Nisse, Alexandre Salch, Valentin Weber. Recovery of disrupted airline operations using k-Maximum Matching in Graphs. [Research Report] RR-8679, Inria Sophia Antipolis; INRIA. 2015. <hal-01116487>
  • David Coudert, Dorian Mazauric, Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth. [Research Report] RR-8470, INRIA. 2014, pp.301. <hal-00943549>
  • David Coudert, Guillaume Ducoffe, Nicolas Nisse. Diameter of Minimal Separators in Graphs. [Research Report] RR-8639, Inria Sophia Antipolis; I3S; INRIA. 2014, pp.16. <hal-01088423v2>
  • Gianlorenzo D'Angelo, Xavier Défago, Nicolas Nisse. Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments. [Research Report] RR-8614, Inria. 2014. <hal-01073368>
  • Euripides Markou, Nicolas Nisse, Stéphane Pérennes. Exclusive Graph Searching vs. Pathwidth. [Research Report] RR-8523, INRIA. 2014. <hal-00980877>
  • Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan. Size-Constrained Tree Decompositions. [Research Report] INRIA Sophia-Antipolis. 2014. <hal-01074177>
  • Fedor Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos. Report on GRASTA 2014. [Research Report] 6th Workshop on GRAph Searching, Theory and Applications. 2014. <hal-01084230>
  • Pascal Berthomé, Tom Bouvier, Frédéric Mazoit, Nicolas Nisse, Ronan Pardo Soares. An Unified FPT Algorithm for Width of Partition Functions. [Research Report] RR-8372, INRIA. 2013. <hal-00865575v2>
  • Frédéric Giroire, Nicolas Nisse, Stéphane Pérennes, Ronan Pardo Soares. Fractional Combinatorial Two-Player Games. [Research Report] RR-8371, INRIA. 2013. <hal-00865345v2>
  • Jean-Claude Bermond, Bi Li, Nicolas Nisse, Hervé Rivano, Min-Li Yu. Data Gathering and Personalized Broadcasting in Radio Grids with Interferences. [Research Report] RR-8218, INRIA. 2013. <hal-00783198v2>
  • Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes. Maintaining Balanced Trees For Structured Distributed Streaming Systems. [Research Report] RR-8309, INRIA. 2013. <hal-00824269>
  • Julio Araujo, Nicolas Nisse, Stéphane Pérennes. Weighted Coloring in Trees. [Research Report] RR-8249, INRIA. 2013. <hal-00794622v2>
  • Frédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, Ronan Pardo Soares. Connected Surveillance Game. [Research Report] RR-8297, INRIA. 2013, pp.22. <hal-00820271>
  • Omid Amini, David Coudert, Nicolas Nisse. Some Results on Non-deterministic Graph Searching in Trees. [Research Report] 2013, pp.27. <inria-00174965v3>
  • Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse. Robot Searching and Gathering on Rings under Minimal Assumptions. [Research Report] RR-8250, INRIA. 2013. <hal-00794921>
  • Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan. A unified approach for different tasks on rings in robot-based computing systems. [Research Report] RR-8013, INRIA. 2012. <hal-00716761>
  • Nicolas Nisse, Ronan Soares. On The Monotonicity of Process Number. [Research Report] RR-8132, INRIA. 2012, pp.17. <hal-00745587>
  • Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. INRIA. 2012. <hal-00671861v4>
  • Lélia Blin, Janna Burman, Nicolas Nisse. Perpetual Graph Searching. [Research Report] INRIA. 2012. <hal-00675233>
  • Fedor Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse. To Satisfy Impatient Web surfers is Hard. [Research Report] RR-7740, LIRMM; INRIA. 2011, pp.20. <inria-00625703v2>
  • Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, Issam Tahiri. Reconfiguration with physical constraints in WDM networks. [Research Report] RR-7850, INRIA. 2011. <hal-00654111>
  • Julio Araujo, Victor Campos, Frédéric Giroire, Nicolas Nisse, Leonardo Sampaio, et al.. On the hull number of some graph classes. [Research Report] RR-7567, INRIA. 2011, pp.19. <inria-00576581v2>
  • Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan. Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power. [Research Report] RR-7746, INRIA. 2011. <inria-00627910>
  • Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse. How to beat the random walk when you have a clock?. [Research Report] RR-7210, INRIA. 2010, pp.19. <inria-00458808>
  • Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès. Cop and robber games when the robber can hide and ride. [Research Report] RR-7178, INRIA. 2010, pp.44. <inria-00448243v3>
  • Florent Becker, Martin Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, et al.. Adding a referee to an interconnection network: What can(not) be computed in one round.. [Research Report] 2010, pp.14. <inria-00528733>
  • Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, et al.. Connected Graph Searching. [Research Report] RR-7363, INRIA. 2010. <inria-00508888>
  • David Coudert, Dorian Mazauric, Nicolas Nisse. Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.. [Research Report] RR-6790, INRIA. 2009, pp.12. <inria-00350025>
  • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse. Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks. [Research Report] RR-7047, INRIA. 2009. <inria-00421140v4>
  • Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes, Hervé Rivano. Fast Data Gathering in Radio Grid Networks. [Research Report] RR-6851, INRIA. 2009. <inria-00363908v4>
  • Florian Huc, Christelle Molle, Nicolas Nisse, Stéphane Pérennes, Hervé Rivano. Stability of a local greedy distributed routing algorithm. [Research Report] RR-6871, INRIA. 2009. <inria-00366441v2>
  • Pascal Berthomé, Nicolas Nisse. A unified FPT Algorithm for Width of Partition Functions. [Research Report] RR-6646, INRIA. 2008, pp.36. <inria-00321766>
  • David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse, Jean-Sébastien Sereni. Routing Reconfiguration/Process Number: Coping wih Two Classes of Services. [Research Report] RR-6698, INRIA. 2008, pp.15. <inria-00331807>

HDR1 document

  • Nicolas Nisse. Algorithmic complexity: Between Structure and Knowledge How Pursuit-evasion Games help.. Data Structures and Algorithms [cs.DS]. Université Nice Sophia Antipolis, 2014. <tel-00998854>

Thèse1 document

  • Nicolas Nisse. Jeux des gendarmes et du voleur dans les graphes. Mineurs de graphes, stratgies connexes, et approche distribue.. Autre [cs.OH]. Université Paris Sud - Paris XI, 2007. Français. <tel-00168818>

Article dans une revue28 documents

  • Gianlorenzo D 'Angelo, Alfredo Navarra, Nicolas Nisse. A unified approach for Gathering and Exclusive Searching on rings under weak assumptions. Distributed Computing, Springer Verlag, 2016, <http://link.springer.com/article/10.1007/s00446-016-0274-y?wt_mc=Internal.Event.1.SEM.ArticleAuthorOnlineFirst>. <hal-01326473>
  • Nicolas Nisse, Ronan Pardo Soares. On the Monotonicity of Process Number. Discrete Applied Mathematics, Elsevier, 2016, Discrete Applied Mathematics, 210, pp.103-111. <hal-01345240>
  • Lélia Blin, Janna Burman, Nicolas Nisse. Exclusive Graph Searching. Algorithmica, Springer Verlag, 2016, <http://link.springer.com/article/10.1007%2Fs00453-016-0124-0>. <10.1007/s00453-016-0124-0>. <hal-01266492>
  • David Coudert, Dorian Mazauric, Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth. ACM Journal of Experimental Algorithmics, 2016, 21 (1), pp.23. <10.1145/2851494>. <hal-01266496>
  • David Coudert, Guillaume Ducoffe, Nicolas Nisse. To Approximate Treewidth, Use Treelength!. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2016, 30 (3), pp.13. <10.1137/15M1034039>. <hal-01348965>
  • Frédéric Giroire, Ioannis Lamprou, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, et al.. Connected Surveillance Game. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 584, pp.131-143. <hal-01163170>
  • Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan. Computing on rings by oblivious robots: a unified approach for different tasks. Algorithmica, Springer Verlag, 2015, 72 (4), pp.1055-1096. <hal-01168428>
  • Omid Amini, David Coudert, Nicolas Nisse. Non-deterministic graph searching in trees. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 580, pp.101-121. <10.1016/j.tcs.2015.02.038>. <hal-01132032>
  • Jean-Claude Bermond, Bi Li, Nicolas Nisse, Hervé Rivano, Min-Li Yu. Data gathering and personalized broadcasting in radio grids with interference. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 562, pp.453-475. <10.1016/j.tcs.2014.10.029>. <hal-01084996>
  • Florent Becker, Adrian Kosowski, Martin Matamala, Nicolas Nisse, Ivan Rapaport, et al.. Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Computing, Springer Verlag, 2015, 28 (3), pp.189-200. <10.1007/s00446-014-0221-8>. <hal-01163186>
  • Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. Algorithmica, Springer Verlag, 2015, 72 (3), pp.758-777. <hal-01163494>
  • Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse. To satisfy impatient Web surfers is hard. Journal of Theoretical Computer Science (TCS), Elsevier, 2014, 526, pp.1-17. <10.1016/j.tcs.2014.01.009>. <hal-00966985>
  • Julio Araujo, Nicolas Nisse, Stéphane Pérennes. Weighted Coloring in Trees. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2014, 28 (4), pp.2029 - 2041. <10.1137/140954167>. <hal-01109194>
  • Julio Araujo, Victor Campos, Frédéric Giroire, Nicolas Nisse, Leonardo Sampaio, et al.. On the hull number of some graph classes. Theoretical Computer Science, Elsevier, 2013, 475, pp.1-12. <10.1016/j.tcs.2012.12.035>. <hal-00770650>
  • Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, et al.. Connected Graph Searching. Information and Computation, Elsevier, 2012, 219, pp.1-16. <hal-00741948>
  • Nicolas Nisse, Ivan Rapaport, Karol Suchan. Distributed computing of efficient routing schemes in generalized chordal graphs. Theoretical Computer Science, Elsevier, 2012, 444 (27), pp.17-27. <hal-00741970>
  • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno, Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theoretical Computer Science, Elsevier, 2011, 412 (35), pp.4675-4687. <10.1016/j.tcs.2011.05.002>. <inria-00592507>
  • Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès. Cop and robber games when the robber can hide and ride. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2011, 25 (1), pp.333-359. <inria-00622957>
  • Fedor V. Fomin, Petr A. Golovach, Jan Kratochvil, Nicolas Nisse, Karol Suchan. Pursuing a fast robber on a graph. Theoretical Computer Science, Elsevier, 2010, 411 (7-9), pp.1167-1181. <10.1016/j.tcs.2009.12.010>. <inria-00476686>
  • Nicolas Nisse. Connected Graph Searching in Chordal Graphs. Discrete Applied Mathematics, Elsevier, 2009, 157 (12), pp.2603-2610. <10.1016/j.dam.2008.08.007>. <hal-00421414>
  • David Ilcinkas, Nicolas Nisse, David Soguet. The Cost of Monotonicity in Distributed Graph Searching. Distributed Computing, Springer Verlag, 2009, 22 (2), pp.117-127. <10.1007/s00446-009-0089-1>. <hal-00412063>
  • Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé. Submodular Partition Functions. Discrete Mathematics, Elsevier, 2009, 309, pp.6000-6008. <10.1016/j.disc.2009.04.033>. <lirmm-00432698>
  • Fedor Fomin, Pierre Fraigniaud, Nicolas Nisse. Non-Deterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica, Springer Verlag, 2009, 53 (3), pp.358-373. <10.1007/s00453-007-9041-6>. <hal-00421417>
  • Nicolas Nisse, David Soguet. Graph Searching with Advice. Theoretical Computer Science, Elsevier, 2009, 410 (14), pp.1307-1318. <10.1016/j.tcs.2008.08.020>. <hal-00421415>
  • Pierre Fraigniaud, Nicolas Nisse. Monotony Properties of Connected Visible Graph Searching. Information and Computation, Elsevier, 2008, 206 (12), pp.1383-1393. <10.1016/j.ic.2008.09.002>. <hal-00421416>
  • Frédéric Mazoit, Nicolas Nisse. Monotonicity of non-deterministic graph searching. Journal of Theoretical Computer Science (TCS), Elsevier, 2008, 399, pp.169--178. <hal-00306321>
  • Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. Distributed chasing of network intruders. Theoritical Computer Science, 2008, 399 (1-2), pp.12-37. <hal-01310347>
  • Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. Distributed Chasing of Network Intruders by Mobile Agents.. Theoretical Computer Science, Elsevier, 2008, 399, pp.12--37. <hal-00341368>

Pré-publication, Document de travail1 document

  • Seong-Gyun Jeong, Yuliya Tarabalka, Nicolas Nisse, Josiane Zerubia. Progressive Tree-like Curvilinear Structure Reconstruction with Structured Ranking Learning and Graph Algorithm. 2016. <hal-01414864>

Direction d'ouvrage, Proceedings2 documents

  • Roberto Baldoni, Nicolas Nisse, Maarten Van Steen. Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS). Roberto Baldoni and Nicolas Nisse and Maarten van Steen. 8304, Springer, pp.280, 2013, Lecture Notes in Computer Science, 978-3-319-03849-0. <hal-00931478>
  • Yann Busnel, Nicolas Nisse, Franck Rousseau. Actes des 15es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel). Yann Busnel and Nicolas Nisse and Franck Rousseau. France. Univ. Nantes, pp.130, 2013. <hal-00931481>