List of Publications (dblp) (HAL)


Proceedings Edition         International Journals         Int. Conferences         National Conf.          Int. Conf. without Proceedings         Submitted         Theses

Conference Proceedings, Special Issues and Book Chapters

  • Spyros Angelopoulos, Nicolas Nisse and Dimitrios M. Thilikos (Eds.). Forewords: Special issue on Theory and Applications of Graph Searching Problems.
    Theor. Comput. Sci. 794: 1-2 (2019).
  • Nicolas Nisse, Network Decontamination. Chapter of Distributed Computing by Mobile Entities, P. Flocchini, G. Prencipe, and N. Santoro (Eds.), Springer, LNCS, Volume 11340 (2019)
  • Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse and Dimitrios M. Thilikos (Eds.). Forewords: Special issue on Theory and Applications of Graph Searching Problems.
    Theor. Comput. Sci. 655: 1 (2016)
  • Roberto Baldoni, Nicolas Nisse and Maarten van Steen (Eds.). Proc. of 17th Int. Conference On Principles Of DIstributed Systems (OPODIS), Springer, LNCS 8304, Nice, Dec. 2013.
  • Yann Busnel, Nicolas Nisse and Franck Rousseau (Eds.). Actes des 15es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, May 2013.
    • International Journals

  • [J58] Julio Araujo, Julien Bensmail, Victor Campos, Frédéric Havet, Ana Karolina Maia, Nicolas Nisse, Ana Silva. On finding the best and worst orientations for the metric dimension.
    Accepted in Algorithmica.
  • [J57] Frederic Giroire, Nicolas Nisse, Malgorzata Sulkowska and Thibaud Trolliet. Preferential attachment hypergraph with high modularity.
    Accepted in Network Science.
  • [J56] Ali Al Zoobi, David Coudert, and Nicolas Nisse. Space and time trade-off for the k shortest simple paths problem.
    Accepted in Journal of Experimental Algorithmics.
  • [J55] Claudio Carvalho, Jonas Costa, Raul Lopes, Ana Karolina Maia, Nicolas Nisse, Claudia Linhares Sales On the characterization of networks with multiple arc-disjoint branching flows.
    Discrete Mathematics and Theoretical Computer Science, 2023, vol. 25:1.
  • [J54] Fabricio Benevides, Jean-Claude Bermond, Hicham Lesfari, and Nicolas Nisse. Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation.
    Accepted in European Journal of Combinatorics.
  • [J53] Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse and Nacim Oijid. The Maker-Breaker Largest Connected Subgraph Game.
    Theoretical Computer Science, 943: 102-120, 2023.
  • [J52] Julien Bensmail, Fionn Mc Inerney and Nicolas Nisse. Metric Dimension: from Graphs to Oriented Graphs
    Discrete Applied Maths, 323: 28-42, 2022.
  • [J51] Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney and Nicolas Nisse. The Largest Connected Subgraph Game
    Algorithmica, 84(9): 2533-2555, 2022.
  • [J50] Julien Bensmail, Foivos Fioravantes, and Nicolas Nisse. On Proper Labellings of Graphs with Minimum Label Sum.
    Algorithmica, 84(4): 1030-1063, 2022.
  • [J49](french vulgarization review) Jean-Claude Bermond, Frédéric Giroire, and Nicolas Nisse. Graphes et télécommunications .
    Bibliothèque Tangente. Num. 75. La recherche opérationnelle. Des mathématiques pour décider et organiser, 2021.
  • [J48] Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between.
    Algorithmica, 83(5): 1459-1492, 2021.
  • [J47] Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, and Nicolas Nisse. Further Results on an Equitable 1-2-3 Conjecture.
    Discrete Applied Maths, Volume 297, pages 1-20, 2021.
  • [J46] Julien Bensmail, Bi Li, Binlong Li, Nicolas Nisse. On Minimizing the Maximum Color for the 1-2-3 Conjecture.
    Discrete Applied Maths, Volume 289, pages: 32-51, 2021.
  • [J45] Julien Bensmail, François Dross and Nicolas Nisse. Decomposing degenerate graphs into locally irregular subgraphs
    Graphs and Combinatorics Volume 36(6), pages 1869-1889, 2020.
  • [J44] Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse and Stéphane Pérennes. Sequential Metric Dimension
    Algorithmica, Volume 82(10): 2867-2901 (2020), online.
  • [J43] Guillaume Ducoffe, Sylvain Legay and Nicolas Nisse, On the complexity of computing the tree-breadth.
    Algorithmica, Volume 82(6): pages 1574-1600, 2020.
  • [J42] Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Study of a combinatorial game in graphs through Linear Programming
    Algorithmica, Volume 82(2): pages 212-244, 2020.
  • [J41] Frédéric Havet and Nicolas Nisse, Constrained ear decompositions in graphs and digraphs
    Discrete Mathematics and Theoretical Computer Science. Volume 21(4), 2019.
  • [J40] Kolja Knauer, Nicolas Nisse: Computing metric hulls in graphs.
    Discrete Mathematics and Theoretical Computer Science. Volume 21(1), 2019.
  • [J39] Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak. Centroidal localization game.
    Electronic Journal of Combinatorics, Volume 25(4): P4.62 (2018).
  • [J38] Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak. Localization game on geometric and planar graphs.
    Discrete Applied Maths. Volume 251, pages 30-39, 2018.
  • [J37] Nathann Cohen, Frédéric Havet, William Lochet and Nicolas Nisse, Subdivisions of oriented cycles in digraphs with large chromatic number.
    Journal of Graph Theory. Volume 89(4), pages 439-456, 2018.
  • [J36] Julien Bensmail, Valentin Garnero and Nicolas Nisse On improving matchings in trees, via bounded-length augmentations.
    Discrete Applied Maths. Volume 250, pages 110-129, 2018.
  • [J35] Julio Araujo, Guillaume Ducoffe, Nicolas Nisse and Karol Suchan, On interval number in cycle convexity.
    Discrete Mathematics and Theoretical Computer Science. Volume 20(1), 2018.
  • [J34] David Coudert, Guillaume Ducoffe, Nicolas Nisse and Mauricio Soto, On distance-preserving elimination orderings in graphs: complexity and algorithms.
    Discrete Applied Maths, Volume 243, pages 140-153, 2018.
  • [J33] Bi Li, Fatima Zahra Moataz, Nicolas Nisse and Karol Suchan, Minimum Size Tree-Decompositions.
    Discrete Applied Maths, Volume 245, pages 109-127, 2018.
  • [J32] Nathann Cohen, Nicolas Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes and Rudini Sampaio. Spy-Game on graphs: complexity and simple topologies
    Theoretical Computer Science, Volume 725, pages 1-15, 2018.
  • [J31] Nicolas Nisse, Alexandre Salch and Valentin Weber, Recovery of disrupted airline operations using k-Maximum Matching in Graphs.
    European Journal of Operational Research, 2017.
  • [J30] Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse and Stéphane Pérennes, Maintaining Balanced Trees For Structured Distributed Streaming Systems.
    Discrete Applied Maths, Volume 232, pages 176-188, 2017.
  • [J29] Sahel Sahhaf, Wouter Tavernier, Dimitri Papadimitriou, Davide Careglio, Alok Kumar, Christian Glacet, David Coudert, Nicolas Nisse, Lluis Fàbrega, Pere Vilà, Miguel Camelo, Pieter Audenaert, Didier Colle, and Piet Demeester, Routing at Large Scale: Advances and Challenges for Complex Networks.
    IEEE Network, Institute of Electrical and Electronics Engineers, pages 12-22, 2017.
  • [J28] Gianlorenzo D'Angelo, Alfredo Navarra and Nicolas Nisse. Gathering and Exclusive Searching on Rings under Minimal Assumptions.
    Distributed Computing, Volume 30(1), pages 17-48, 2017.
  • [J27] Lélia Blin, Janna Burman and Nicolas Nisse. Exclusive Graph Searching.
    Algorithmica, Volume 77(3), pages 942-969, 2017.
  • [J26] Euripides Markou, Nicolas Nisse and Stéphane Pérennes. Exclusive Graph Searching vs. Pathwidth.
    Information and Computation, Volume 252, pages 243-260, 2017.
  • [J25]David Coudert, Guillaume Ducoffe and Nicolas Nisse, To approximate treewidth, use treelength!.
    SIAM Journal of Discrete Maths, Volume 30(3), pages 1424-1436, 2016.
  • [J24] David Coudert, Dorian Mazauric and Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth.
    Journal of Experimental Algorithmics, Volume 21:1, 2016
  • [J23] Nicolas Nisse and Ronan Pardo Soares. On the monotonicity of Process Number.
    Discrete Applied Maths, Volume 210, pages 103-111, 2016
  • [J22] Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse and Karol Suchan. Computing on rings by oblivious robots: a unified approach for different tasks.
    Algorithmica, Volume 72(4), pages 1055-1096, 2015.
  • [J21] Adrian Kosowski, Bi Li, Nicolas Nisse and Karol Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
    Algorithmica, Volume 72(3), pages 758-777, 2015.
  • [J20] Frédéric Giroire, Ioannis Lamprou, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes and Ronan Pardo Soares. Connected Surveillance Game.
    Theoretical Computer Science, Volume 584, pages 131-143, 2015.
  • [J19] Florent Becker, Adrian Kosowski, Martin Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, and Ioan Todinca.
    Allowing each node to communicate only once in a distributed system: shared whiteboard models.
    Distributed Computing, Volume 28(3), pages 189-200, 2015.
  • [J18] Omid Amini, David Coudert, and Nicolas Nisse, Some Results on Non-deterministic Graph Searching in Trees.
    Theoretical Computer Science, Volume 580, pages 101-121, 2015.
  • [J17] Jean-Claude Bermond, Bi Li, Nicolas Nisse, Hervé Rivano and Min-Li Yu. Data Gathering and Personalized Broadcasting in Radio Grids with Interferences
    Theoretical Computer Science, Volume 562, pages 453-475, 2015.
  • [J16] Julio Araujo, Nicolas Nisse and Stéphane Pérennes. Weighted Coloring in Trees.
    SIAM Journal of Discrete Maths, Volume 28(4), pages 2029-2041, 2014.
  • [J15] Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric and Nicolas Nisse, To satisfy Impatient Web surfers is Hard.
    Theoretical Computer Science, Volume 526, pages 1-17, 2014.
  • [J14] Julio Araujo, Victor Campos, Frédéric Giroire, Nicolas Nisse, Leonardo Sampaio and Ronan Soares, On the hull number of some graph classes
    Theoretical Computer Science, Volume 475, pages 1-12, 2013.
  • [J13] Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro and Dimitrios M. Thilikos, Connected Graph Searching
    Information and Computation, Volume 219, pages 1-16, 2012.
  • [J12] Nicolas Nisse, Ivan Rapaport and Karol Suchan, Distributed computing of efficient routing schemes in generalized chordal graphs.
    Theoretical Computer Science, Volume 444(27), pages 17-27, 2012. (.bib)
  • [J11] Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno and Nicolas Nisse, Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
    Theoretical Computer Science, Volume 412(35), pages 4675-4687, 2011. (.bib)
  • [J10] Jérémie Chalopin, Victor Chepoi, Nicolas Nisse and Yann Vaxès, Cop and robber games when the robber can hide and ride.
    SIAM Journal of Discrete Maths, Volume 25(1), pages 333-359, 2011. (.bib)
  • [J9] Fedor V. Fomin, Petr Golovach, Jan Kratochvil, Nicolas Nisse and Karol Suchan, Pursuing a fast robber on a graph.
    Theoretical Computer Science, Volume 411(7-9), pages 1167-1181, 2010. (.bib)
  • [J8] Omid Amini, Frédéric Mazoit, Nicolas Nisse and Stéphan Thomassé, Submodular Partition Functions.
    Discrete Maths, Volume 309(20), pages 6000-6008, 2009.(.bib)
  • [J7] David Ilcinkas, Nicolas Nisse and David Soguet, The Cost of Monotonicity in Distributed Graph Searching.
    Distributed Computing, Volume 22(2), pages 117-127, 2009. (.bib)
  • [J6] Nicolas Nisse, Connected Graph Searching in Chordal Graphs.
    Discrete Applied Maths, Volume 157(12), pages 2603-2610, 2009.(.bib)
  • [J5] Nicolas Nisse and David Soguet, Graph Searching with Advice.
    Theoretical Computer Science, Volume 410(14), pages 1307-1318, 2009. (.bib)
  • [J4] Fedor V. Fomin, Pierre Fraigniaud and Nicolas Nisse, Non-Deterministic Graph Searching: From Pathwidth to Treewidth.
    Algorithmica, Volume 53(3), pages 358-373, 2009. (.bib)
  • [J3] Pierre Fraigniaud and Nicolas Nisse, Monotony Properties of Connected Visible Graph Searching.
    Information and Computation, Volume 206 (12), pages 1383-1393, 2008. (.bib)
  • [J2] Frédéric Mazoit and Nicolas Nisse, Monotonicity Property of Non-Deterministic Graph Searching.
    Theoretical Computer Science, Volume 399 (3), pages 169-178, 2008. (.bib)
  • [J1] Lélia Blin, Pierre Fraigniaud, Nicolas Nisse and Sandrine Vial, Distributed Chasing of Network Intruders by Mobile Agents.
    Theoretical Computer Science, Volume 399 (1-2), pages 12-37, 2008. (.bib)
    • International Conferences

  • [Ci49] Cinzia Di Giusto, Davide Ferre, Etienne Lozes and Nicolas Nisse. Weakly synchronous systems with three machines are Turing powerful.
    To appear in Proceedings of 17th International Conference on Reachability Problems (RP), 2023.
  • [Ci48] Frederic Giroire, Nicolas Nisse, Kostiantyn Ohulchanskyi, Malgorzata Sulkowska and Thibaud Trolliet. Preferential attachment hypergraph with vertex deactivation.
    To appear in Proceedings of 31st International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), 2023.
  • [Ci47] Thomas Dissaux, Foivos Fioravantes, Harmender Galhawat and Nicolas Nisse. Recontamination helps a lot to hunt a rabbit.
    To appear in Proceedings of 48th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2023.
  • [Ci46] Julio Araujo, Frédéric Havet, Claudia Linhares Sales, Nicolas Nisse and Karol Suchan. Semi-proper orientations of dense graphs.
    To appear in Proceedings of 12th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), 2023.
  • [Ci45] Julien Bensmail, Victor Campos, Ana Karolina Maia, Nicolas Nisse, Ana Silva. Deciding the Erdos-Pósa property in weakly 3-connected digraphs.
    To appear in Proceedings of 49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2023.
  • [Ci44] Thomas Dissaux and Nicolas Nisse. Pathlength of outerplanar graphs.
    In Proceedings of 15th Latin American Theoretical Informatics Symposium (LATIN), Springer, LNCS, 2022.
  • [Ci43] Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, and Nicolas Nisse. The Largest Connected Subgraph Game.
    In Proceedings of 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), LNCS 12911, pages 296-307, Springer, 2021.
  • [Ci42] Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, and Simon Nivelle. Treelength of Series-parallel graphs.
    In Proceedings of 11th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Elsevier, Volume 195, pages 30-38, 2021.
  • [Ci41] Ali Al Zoobi, David Coudert, and Nicolas Nisse. Space and time trade-off for the k shortest simple paths problem.
    In Proceedings of 19th Symposium on Experimental Algorithms (SEA), Vol. 160. LIPIcs. Schloss Dagstuhl, pp. 18:1-18:13, 2020.
  • [Ci40] Julien Bensmail, Foivos Fioravantes, Nicolas Nisse. On Proper Labellings of Graphs with Minimum Label Sum
    In Proceedings of 31st International Workshop on Combinatorial Algorithms (IWOCA), Springer LNCS 12126, pp. 56-68, 2020.
  • [Ci39] Julien Bensmail, Fionn Mc Inerney and Nicolas Nisse. Metric Dimension: from Graphs to Oriented Graphs
    In Proceedings of 10th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Elsevier, Electronic Note Discrete Maths, Belo Horizonte, Brazil, 2019.
  • [Ci38] Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Eternal Domination in Strong Grids
    In Proceedings of 11th International Conference on Algorithms and Complexity (CIAC), Springer LNCS 11485, pp. 311-322, Rome, Italy, 2019.
  • [Ci37] Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse and Stéphane Pérennes. Sequential Metric Dimension
    In Proceedings of 16th Workshop on Approximation and Online Algorithms (WAOA), Springer LNCS 11312, pp. 36-50, Helsinki, Finland, 2018.
  • [Ci36] Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Study of a combinatorial game in graphs through Linear Programming
    In Proceedings of 28th International Symposium on Algorithms and Computation (ISAAC), LIPIcs 92, Schloss Dagstuhl, pages 22:1-22:13, Phuket, Thailand, 2017.
  • [Ci35] Julien Bensmail, Valentin Garnero, Nicolas Nisse, Alexandre Salch and Valentin Weber, Recovery of disrupted airline operations using k-Maximum Matching in Graphs.
    In Proceedings of 9th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Elsevier, Electronic Note Discrete Maths, Vol. 62, pages 3-8, Marseille, France, 2017.
  • [Ci34] Guillaume Ducoffe, Sylvain Legay and Nicolas Nisse, On the complexity of computing the tree-breadth.
    In Proceedings of 27th International Workshop on Combinatorial Algorithms (IWOCA), pages 3-15, 2016.
  • [Ci33] Nathann Cohen, Mathieu Hilaire, Nicolas A. Martins, Nicolas Nisse and Stéphane Pérennes Spy-Game on graphs.
    In Proceedings of 8th International Conference on Fun with Algorithms (FUN), LIPIcs 49, Schloss Dagstuhl, pages 10:1-10:16, Maddalena Islands, Italy, 2016.
  • [Ci32] Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège and Nicolas Nisse Finding Paths in Grids with Forbidden Transitions.
    In Proceedings of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pages 154-168, Munich, Germany, 2015.
  • [Ci31] Bi Li, Fatima Zahra Moataz, Nicolas Nisse and Karol Suchan, Minimum Size Tree-Decompositions.
    In Proceedings of 8th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Elsevier, Electronic Note Discrete Maths 50, pages 21-27, Praia das Fontes, Ceara, Brazil, 2015.
  • [Ci30] Gianlorenzo D'Angelo, Xavier Défago and Nicolas Nisse. Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments.
    In Proceedings of the Second International Symposium on Computing and Networking (CANDAR), pages 50-59, IEEE, Shizuoka, Japan, 2014.
  • [Ci29] David Coudert, Dorian Mazauric and Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth.
    In Proceedings of the 13rd Symposium on Experimental Algorithms (SEA), Springer LNCS, pages 46-58, Copenhagen, Denmark, 2014.
  • [Ci28] Julio Araujo, Nicolas Nisse and Stéphane Pérennes. Weighted Coloring in Trees.
    In Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), Schloss Dagstuhl, pages 75-86, Lyon, France, 2014.
  • [Ci27] Gianlorenzo D'Angelo, Alfredo Navarra and Nicolas Nisse. Gathering and Exclusive Searching on Rings under Minimal Assumptions.
    In Proceedings of the 15th International Conference on Distributed Computing and Networking (ICDCN), LNCS, Springer, pages 149-164, Coimbatore, India, 2014.
  • [Ci26] Lélia Blin, Janna Burman and Nicolas Nisse. Exclusive Graph Searching.
    In Proceedings of 21st European Symposium on Algorithms (ESA), Springer LNCS 8125, pages 181-192, Sophia Antipolis, France, 2013.
  • [Ci25] Frédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes and Ronan Pardo Soares. Connected Surveillance Game.
    In Proceedings of the 20th Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS 8179, pages 68-79, Ischia, Italia, 2013.
  • [Ci24] Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse and Stéphane Pérennes, Maintaining Balanced Trees For Structured Distributed Streaming Systems.
    In Proceedings of the 20th Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS 8179, pages 177-188, Ischia, Italia, 2013.
  • [Ci23] Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse and Karol Suchan. A unified approach for different tasks on rings in robot-based computing systems.
    In Proceedings of the 15th Workshop on Advances in Parallel and Distributed Computational Models (APDCM), IEEE, IPDPS Workshop, pages 667-676, Boston, USA, 2013.
  • [Ci22] Nicolas Nisse and Ronan Pardo Soares. On the monotonicity of Process Number.
    In Proceedings of 7th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Elsevier, Electronic Note Discrete Maths 44, pages 141-147, Playa del Carmen, Mexico, 2013.
  • [Ci21] Lélia Blin, Janna Burman and Nicolas Nisse. Distributed Exclusive and Perpetual Tree Searching.
    Brief Announcement in Proceedings of 26th International Symposium on DIStributed Computing (DISC), Springer LNCS 7611, pages 407-408, Salvador, Bahia, Brazil, 2012.
  • [Ci20] Adrian Kosowski, Bi Li, Nicolas Nisse and Karol Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
    In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP), track C, Springer LNCS 7392, pages 610-622, Warwick, UK, 2012.
  • [Ci19] Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport and Karol Suchan. Allowing each node to communicate only once in a distributed system: shared whiteboard models.
    In Proceedings of 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 11-17, Pittsburgh, USA, 2012.
  • [Ci18] Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric and Nicolas Nisse, To satisfy Impatient Web surfers is Hard.
    In Proceedings of 6th International Conference on FUN with Algorithms (FUN), Springer LNCS 7288, pages 166-176, San Servolo Island, Venice, Italy, 2012.
  • [Ci17] Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse and Issam Tahiri. Reconfiguration with physical constraints in WDM networks.
    In Proceedings of Workshop on New Trends in Optical Networks Survivability (Netsurviv), IEEE, colocated with ICC, pages 6257-6261, Ottawa, Canada, 2012.
  • [Ci16] Florent Becker, Martin Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, and Ioan Todinca. Adding a referee to an interconnection network: What can(not) be computed in one round.
    In Proceedings of the 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, pages 508-514, Anchorage, USA, 2011. (.bib)
  • [Ci15] Nicolas Hanusse, David Ilcinkas, Adrian Kosowski and Nicolas Nisse, Locating a target with an agent guided by unreliable local advice.
    In Proceedings of 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 355-364, Zurich, Switzerland, 2010. (.bib)
  • [Ci14] Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno and Nicolas Nisse, Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
    In Proceedings of 5th International Conference on FUN with Algorithms (FUN), Springer LNCS 6099, pages 121-132, Ischia, Italy, 2010. (.bib)
  • [Ci13] Florian Huc, Christelle Molle-Caillouet, Nicolas Nisse, Stéphane Pérennes and Hervé Rivano, Stability of a local greedy distributed routing algorithm. (!! there is a mistake in this paper !!)
    In Proceedings of the 12th Workshop on Advances in Parallel and Distributed Computational Models (APDCM), IEEE, Atlanta, USA, 2010. (.bib)
  • [Ci12] Nicolas Nisse, Ivan Rapaport and Karol Suchan, Distributed computing of efficient routing schemes in generalized chordal graphs.
    In Proceedings of the 16th Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS 5869, pages 252-265, Piran, Slovenia, 2009. (.bib)
  • [Ci11] David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse and Jean Sébastien Sereni, Routing Reconfiguration/Process Number: Coping wih Two Classes of Services.
    In Proceedings of the 13th Conference on Optical Network Design and Modeling (ONDM), IEEE, Braunschweig, Germany, 2009. (slides) (.bib)
  • [Ci10] Jean-Claude.Bermond, Nicolas Nisse, Patricio Reyes and Hervé Rivano, Minimum delay Data Gathering in Radio Networks.
    In Proceedings of the 8th international conference on Ad Hoc Networks and Wireless (AdHoc-NOW), Springer LNCS 5793, pages  69-82, Murcia, Spain, 2009. (.bib)
  • [Ci9] David Coudert, Dorian Mazauric and Nicolas Nisse, On Rerouting Connection Requests in Networks with Shared Bandwidth.
    In Proceedings of the DIMAP Workshop on Algorithmic Graph Theory (AGT), Elsevier, Electronic Note Discrete Maths., Volume 32, pages 109-116, Warwick, UK, 2009. (slides) (.bib)
  • [Ci8] Nicolas Nisse and Karol Suchan, Fast Robber in Planar Graphs.
    In Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG),  Springer LNCS 5344, pages  312-323, Durham, UK, 2008. (.bib)
  • [Ci7] David Ilcinkas, Nicolas Nisse and David Soguet, The Cost of Monotonicity in Distributed Graph Searching.
    In Proceedings to the 11th International Conference On Principles Of Distributed Systems (OPODIS),  Springer LNCS 4878, pages  415-428, Guadeloupe, France, 2007. (slides) (.bib)
  • [Ci6] Frédéric Mazoit and Nicolas Nisse, Monotonicity Property of Non-Deterministic Graph Searching.
    In Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG),  Springer LNCS 4769, pages  33-44, Jena, Germany, 2007. (slides) (.bib)
  • [Ci5] Nicolas Nisse and David Soguet, Graph Searching with advice.
    In Proceedings of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO),  Springer LNCS 4474, pages  51-65, Castiglioncello, Italy, 2007. (slides) (.bib)
  • [Ci4] Lélia Blin, Pierre Fraigniaud, Nicolas Nisse and Sandrine Vial, Distributed Chasing of Network Intruders by Mobile Agents.
    In Proceedings of the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS 4056, pages  70-84, Chester, UK, 2006. (slides) (.bib)
  • [Ci3] Pierre Fraigniaud and Nicolas Nisse, Monotony Properties of Connected Visible Graph Searching.
    In Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Springer LNCS 4271, pages 229-240, Bergen, Norway, 2006. (slides) (.bib)
  • [Ci2] Pierre Fraigniaud and Nicolas Nisse, Connected Treewidth and Connected Graph Searching.
    In Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN), Springer LNCS 3887, pages  479-490, Valdivia, Chile, 2006. (slides) (.bib)
  • [Ci1] Fedor V. Fomin, Pierre Fraigniaud and Nicolas Nisse, Non-Deterministic Graph Searching: From Pathwidth to Treewidth.
    In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), Springer LNCS 3618, pages 364-375, Gdansk, Poland, 2005. (slides) (.bib)

    • National Conferences
  • [Cn30] Thomas Dissaux and Nicolas Nisse. Longueur Linéaire des graphes planaires extérieurs.
    In 24me Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Saclay, 2022.
  • [Cn29] Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, and Nacim Oijid. Une version Maker-Breaker du jeu du plus grand sous-graphe connexe.
    In 24me Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Saclay, 2022.
  • [Cn28] Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, and Simon Nivelle. Longueur Arborescente des Graphes Série-Parallèles.
    In 23me Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), La Rochelle, 2021.
  • [Cn27] Ali Al Zoobi, David Coudert, and Nicolas Nisse. De la difficulté de trouver des chemins dissimilaires.
    In 23me Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), La Rochelle, 2021.
  • [Cn26] Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, and Nicolas Nisse. Connexions! The Largest Connected Subgraph Game.
    In 23me Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), La Rochelle, 2021
  • [Cn25] Claudio Carvalho, Jonas Costa, Raul Lopes, Ana Karolina Maia, Nicolas Nisse, Claudia Linhares Sales Characterizing Networks Admitting k Arc-disjoint Branching Flows.
    In Anais do Encontro de Teoria da Computacao (ETC), Brazil, 2020.
  • [Cn24] Ali Al Zoobi, David Coudert, and Nicolas Nisse. Compromis espace-temps pour le problème de k plus courts chemins simples.
    In 22me Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Lyon, 2020.
  • [Cn23] Ali Al Zoobi, David Coudert, and Nicolas Nisse. On the top-k shortest paths with dissimilarity constraints.
    In congrès annuel de la société Francaise de Recherche Opérationnelle et d'Aide a la Décision (ROADEF), Montpellier, 2020.
  • [Cn22] Julien Bensmail, Fionn Mc Inerney and Nicolas Nisse. Dimension Métrique des Graphes Orientés
    In 21es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Saint Laurent de la Cabrerisse, 2019.
  • [Cn21] Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse and Stéphane Pérennes. Localiser une cible dans un graphe
    In 20es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Roscoff, 2018.
  • [Cn20] Nathann Cohen, Nicolas Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, Rudini Sampaio. Enquêter dans les graphes
    In 19es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Quiberon, 2017.
  • [Cn19] Nicolas Nisse, Alexandre Salch and Valentin Weber, Opérations aériennes et chaines augmentantes .
    In congrès annuel de la société Francaise de Recherche Opérationnelle et d'Aide a la Décision (ROADEF), Compiègne, 2016.
  • [Cn18] David Coudert, Guillaume Ducoffe and Nicolas Nisse, Structure vs métrique dans les graphes.
    In 17es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Beaune, 2015.
  • [Cn17] Nicolas Nisse, Alexandre Salch and Valentin Weber, Comment appliquer les chaines augmentantes pour atterrir à l'heure.
    In 17es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Beaune, 2015.
  • [Cn16] Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège and Nicolas Nisse On paths in grids with forbidden transitions.
    In 17es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Beaune, 2015.
  • [Cn15] Adrian Kosowski, Bi Li, Nicolas Nisse and Karol Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
    In 14es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 83-86, La Grande Motte, 2012.
  • [Cn14] Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric and Nicolas Nisse, Satisfaire un internaute impatient est difficile.
    In 14es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 79-82, La Grande Motte, 2012. (best paper award)
  • [Cn13] Lélia Blin, Janna Burman and Nicolas Nisse, Nettoyage perpétuel de réseaux.
    In 14es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 31-34, La Grande Motte, 2012.
  • [Cn12] Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse and Issam Tahiri. Reconfiguration avec contraintes physiques dans les réseaux WDM.
    In 13es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 17-20, Cap Estérel, 2011.
  • [Cn11] Florent Becker, Martin Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, and Ioan Todinca. Reconstruire un graphe en une ronde.
    In 13es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 31-34, Cap Estérel, 2011.
  • [Cn10] Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno and Nicolas Nisse, Tradeoffs in routing reconfiguration problems.
    In 12es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 119-122, Belle Dune, 2010. (slides) (.bib)
  • [Cn9] Nicolas Hanusse, David Ilcinkas, Adrian Kosowski and Nicolas Nisse, Comment battre la marche aléatoire en comptant ?.
    In 12es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 27-30, Belle Dune, 2010. (slides) (.bib)
  • [Cn8] Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes and Hervé Rivano, Fast Data Gathering in Radio Grid Networks.
    In 11es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 53-56, Carry-le-Rouet, 2009. (slides) (.bib)
  • [Cn7] David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse and Jean Sébastien Sereni, Reconfiguration dans les réseaux optiques.
    In 11es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 25-28, Carry-le-Rouet, 2009. (slides) (.bib)
  • [Cn6] Nicolas Nisse and Karol Suchan, Voleur véloce dans un réseau planaire.
    In 10es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 29-32, Saint Malo, 2008. (slides) (.bib)
  • [Cn5] David Ilcinkas, Nicolas Nisse and David Soguet, Le coût de la monotonie dans les stratégies d'encerclement réparti.
    In 10es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 33-36, Saint Malo, 2008. (best student paper award) (.bib)
  • [Cn4] Nicolas Nisse and David Soguet, Stratégies d'encerclement avec information.
    In 9es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel),  pages 49-52, île d'Oléron, 2007. (slides). (.bib)
  • [Cn3] Lélia Blin, Pierre Fraigniaud, Nicolas Nisse and Sandrine Vial, Encerclement réparti d'un fugitif dans un réseau par des agents mobiles.
    In 8es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 89-92, Trégastel, 2006. (slides) (.bib)
  • [Cn2] Fedor V. Fomin, Pierre Fraigniaud and Nicolas Nisse, Strategies d'encerclement non deterministes.
    In 8es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 81-84, Trégastel, 2006. (slides)(.bib)
  • [Cn1] Pierre Fraigniaud and Nicolas Nisse, Stratégies d'encerclement connexes dans un réseau.
    In 7es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 13-16, Presqu'île de Giens, 2005. (slides)(.bib)
    • International Conferences without Proceedings
  • Thomas Dissaux and Nicolas Nisse. Pathlength of outerplanar graphs
    11th International colloquium on graph theory and combinatorics (ICGT), Montpellier 2022
  • Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse and Stéphane Pérennes. Sequential Metric Dimension
    10th International colloquium on graph theory and combinatorics (ICGT), Lyon 2018
  • Nathann Cohen, Frédéric Havet, William Lochet and Nicolas Nisse, Subdivisions of oriented cycles in digraphs with large chromatic number.
    Bordeaux Graph Wokshop (BWG), Bordeaux, 2016.
  • Bi Li, Fatima Zahra Moataz and Nicolas Nisse, Minimum Size Tree-Decompositions.
    9th International colloquium on graph theory and combinatorics (ICGT), Grenoble 2014
  • Nicolas Nisse, Fractional Combinatorial Games.
    27th European Conference on Operational Research (EURO), 2013
  • Jérémie Chalopin, Victor Chepoi, Nicolas Nisse and Yann Vaxès, Cop and robber games when the robber can hide and ride (abstract).
    8th French Combinatorial Conference (FCC/ICGT), Orsay, 2010.(.bib)
  • Nicolas Nisse, Graph Searching and Graph Decompositions.
    24th European Conference on Operational Research (EURO), Lisboa, Portugal, 2010

    • Submitted papers
    to International Revues and Conferences
  • Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta and Amadeus Reinald, Reconfiguring dicolouring. Tech. rep. 2023.
  • Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud and Quentin Vermande: Problems, proofs, and disproofs on the inversion number. CoRR abs/2212.09188 (2022). Submitted to an international journal.
  • Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, and Simon Nivelle. Treelength of Series-parallel graphs, 2021. Journal version of LAGOS'21 submitted.
  • Ali Al Zoobi, David Coudert, and Nicolas Nisse. On the complexity of finding k shortest dissimilar paths in a graph, 2021. Submitted to an international revue.
  • Julien Bensmail, Victor Campos, Ana Karolina Maia, Nicolas Nisse, Ana Silva. Deciding the Erdos-Posa property in weakly 3-connected strong digraphs. 2023. Journal version to be submitted.
  • Thomas Dissaux, Foivos Fioravantes, Harmender Galhawat and Nicolas Nisse. Further results on the Hunter and Rabbit game through monotonicity. Tech. rep. 2023.
  • Eric Duchene, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau and Milos Stojakovic. Complexity of Maker-Breaker Games on Edge Sets of Graphs. Tech. rep. 2023. Submitted.
  • Julio Araujo, Victor Campos, Nicolas Nisse, Lucas Picasarri-Arrieta and Ignasi Sau, Reconfiguring dicolouring and directed widths. In progress.

    • to be Submitted... (I hope...)
  • Seong-Gyun Jeong, Yuliya Tarabalka, Nicolas Nisse and Josiane Zerubia. Inference of Curvilinear Structure based on Learning a Ranking Function and Graph Theory.
    Research Report, RR-8789, HAL, Sophia Antipolis, France, 2015.
  • Frédéric Giroire, Nicolas Nisse, Stéphane Pérennes and Ronan Pardo Soares. Fractional Combinatorial Games.
    Research Report, INRIA-RR8371, Sophia Antipolis, France, 2013.
  • Nicolas Hanusse, David Ilcinkas, Adrian Kosowski and Nicolas Nisse, How to beat the random walk when you have a clock?
    Research Report, INRIA-RR7210, Sophia Antipolis, France, Feb. 2010.
  • Pascal Berthomé, Tom Bouvier, Frédéric Mazoit, Nicolas Nisse and Ronan Pardo Soares A unified FPT Algorithm for Width of Partition Functions.
    Research Report, INRIA-RR8372, HAL, Sophia Antipolis, France, 2013.
    • Theses
    HDR (Habilitation à Diriger des Recherches) (in english): Algorithmic complexity Between Structure and Knowledge. How Pursuit-evasion Games help, May 26th, 2014, .pdf
    Ph.D. Thesis (in french): Les jeux des gendarmes et du voleur dans les graphes. Mineurs de graphes, stratégies connexes et approche distribuée., July 2nd 2007, .pdf, .ps (.bib)
    Master Thesis (in french): Expansion connexe dans les réseaux (2004) (.bib)