Nicolas Nisse

According to our database, Nicolas Nisse authored at least 99 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Digraph redicolouring.

Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald

Eur. J. Comb., February, 2024

Preface to special issue on theory and applications of Graph Searching.

Spyros Angelopoulos, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos

Theor. Comput. Sci., 2024

Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation.

Fabricio Benevides, Jean-Claude Bermond, Hicham Lesfari, Nicolas Nisse

Eur. J. Comb., 2024

Redicolouring digraphs: Directed treewidth and cycle-degeneracy.

Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau

Discret. Appl. Math., 2024

The Graph Coloring Game on 4⨉n-Grids.

Caroline Brosse, Nicolas Almeida Martins, Nicolas Nisse, Rudini Menezes Sampaio

CoRR, 2024

2023

Finding the <i>k</i> Shortest Simple Paths: Time and Space Trade-offs.

Ali Al Zoobi, David Coudert, Nicolas Nisse

ACM J. Exp. Algorithmics, December, 2023

Treelength of series-parallel graphs.

Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle

Discret. Appl. Math., December, 2023

On Finding the Best and Worst Orientations for the Metric Dimension.

Júlio Araújo, Julien Bensmail, Victor A. Campos, Frédéric Havet, Ana Karolinna Maia, Nicolas Nisse, Ana Silva

Algorithmica, October, 2023

The Maker-Breaker Largest Connected Subgraph game.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid

Theor. Comput. Sci., 2023

Recovery of disrupted airline operations using <i>k</i>-maximum matching in graphs.

Nicolas Nisse, Alexandre Salch, Valentin Weber

Eur. J. Oper. Res., 2023

From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows.

Cláudio Carvalho, Jonas Costa, Raul Lopes, Ana Karolinna Maia, Nicolas Nisse, Cláudia Linhares Sales

Discret. Math. Theor. Comput. Sci., 2023

Further results on the Hunters and Rabbit game through monotonicity.

Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse

CoRR, 2023

Complexity of Maker-Breaker Games on Edge Sets of Graphs.

Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Milos Stojakovic

CoRR, 2023

Deciding the Erdős-Pósa Property in 3-Connected Digraphs.

Julien Bensmail, Victor A. Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Weakly Synchronous Systems with Three Machines Are Turing Powerful.

Cinzia Di Giusto, Davide Ferré, Étienne Lozes, Nicolas Nisse

Proceedings of the Reachability Problems - 17th International Conference, 2023

Recontamination Helps a Lot to Hunt a Rabbit.

Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Preferential Attachment Hypergraph with Vertex Deactivation.

Frédéric Giroire, Nicolas Nisse, Kostiantyn Ohulchanskyi, Malgorzata Sulkowska, Thibaud Trolliet

Proceedings of the 31st International Symposium on Modeling, 2023

Semi-proper orientations of dense graphs.

J. Araujo, Frédéric Havet, Cláudia Linhares Sales, Nicolas Nisse, Karol Suchan

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Preferential attachment hypergraph with high modularity.

Frédéric Giroire, Nicolas Nisse, Thibaud Trolliet, Malgorzata Sulkowska

Netw. Sci., December, 2022

Metric dimension: From graphs to oriented graphs.

Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse

Discret. Appl. Math., 2022

Problems, proofs, and disproofs on the inversion number.

Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud, Quentin Vermande

CoRR, 2022

On Proper Labellings of Graphs with Minimum Label Sum.

Julien Bensmail, Foivos Fioravantes, Nicolas Nisse

Algorithmica, 2022

The Largest Connected Subgraph Game.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse

Algorithmica, 2022

Pathlength of Outerplanar Graphs.

Thomas Dissaux, Nicolas Nisse

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

On minimizing the maximum color for the 1-2-3 Conjecture.

Julien Bensmail, Bi Li, Binlong Li, Nicolas Nisse

Discret. Appl. Math., 2021

Further results on an equitable 1-2-3 Conjecture.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse

Discret. Appl. Math., 2021

Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between.

Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes

Algorithmica, 2021

2020

Decomposing Degenerate Graphs into Locally Irregular Subgraphs.

Julien Bensmail, François Dross, Nicolas Nisse

Graphs Comb., 2020

On the Complexity of Computing Treebreadth.

Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse

Algorithmica, 2020

Study of a Combinatorial Game in Graphs Through Linear Programming.

Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes

Algorithmica, 2020

Sequential Metric Dimension.

Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes

Algorithmica, 2020

Space and Time Trade-Off for the k Shortest Simple Paths Problem.

Ali Al Zoobi, David Coudert, Nicolas Nisse

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

2019

Network Decontamination.

Nicolas Nisse

Proceedings of the Distributed Computing by Mobile Entities, 2019

Preface to special issue on Theory and Applications of Graph Searching.

Spyros Angelopoulos, Nicolas Nisse, Dimitrios M. Thilikos

Theor. Comput. Sci., 2019

Computing metric hulls in graphs.

Kolja Knauer, Nicolas Nisse

Discret. Math. Theor. Comput. Sci., 2019

Constrained ear decompositions in graphs and digraphs.

Frédéric Havet, Nicolas Nisse

Discret. Math. Theor. Comput. Sci., 2019

Eternal Domination in Grids.

Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Spy-game on graphs: Complexity and simple topologies.

Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, Rudini M. Sampaio

Theor. Comput. Sci., 2018

Subdivisions of oriented cycles in digraphs with large chromatic number.

Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse

J. Graph Theory, 2018

On interval number in cycle convexity.

Júlio Araújo, Guillaume Ducoffe, Nicolas Nisse, Karol Suchan

Discret. Math. Theor. Comput. Sci., 2018

Minimum size tree-decompositions.

Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan

Discret. Appl. Math., 2018

On distance-preserving elimination orderings in graphs: Complexity and algorithms.

David Coudert, Guillaume Ducoffe, Nicolas Nisse, Mauricio Soto

Discret. Appl. Math., 2018

Localization game on geometric and planar graphs.

Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak

Discret. Appl. Math., 2018

On improving matchings in trees, via bounded-length augmentations.

Julien Bensmail, Valentin Garnero, Nicolas Nisse

Discret. Appl. Math., 2018

Centroidal Localization Game.

Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak

Electron. J. Comb., 2018

2017

Routing at Large Scale: Advances and Challenges for Complex Networks.

Sahel Sahhaf, Wouter Tavernier, Dimitri Papadimitriou, Davide Careglio, Alok Kumar, Christian Glacet, David Coudert, Nicolas Nisse, Lluís Fàbrega, Pere Vilà, Miguel Camelo, Pieter Audenaert, Didier Colle, Piet Demeester

IEEE Netw., 2017

Exclusive graph searching vs. pathwidth.

Euripides Markou, Nicolas Nisse, Stéphane Pérennes

Inf. Comput., 2017

Recovery of disrupted airline operations using k-Maximum Matching in graphs.

Julien Bensmail, Valentin Garnero, Nicolas Nisse, Alexandre Salch, Valentin Weber

Electron. Notes Discret. Math., 2017

A unified approach for gathering and exclusive searching on rings under weak assumptions.

Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse

Distributed Comput., 2017

Maintaining balanced trees for structured distributed streaming systems.

Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes

Discret. Appl. Math., 2017

Exclusive Graph Searching.

Lélia Blin, Janna Burman, Nicolas Nisse

Algorithmica, 2017

2016

Forewords: Special issue on Theory and Applications of Graph Searching Problems.

Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos

Theor. Comput. Sci., 2016

To Approximate Treewidth, Use Treelength!

David Coudert, Guillaume Ducoffe, Nicolas Nisse

SIAM J. Discret. Math., 2016

Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth.

David Coudert, Dorian Mazauric, Nicolas Nisse

ACM J. Exp. Algorithmics, 2016

On the monotonicity of process number.

Nicolas Nisse, Ronan Pardo Soares

Discret. Appl. Math., 2016

Progressive Tree-like Curvilinear Structure Reconstruction with Structured Ranking Learning and Graph Algorithm.

Seong-Gyun Jeong, Yuliya Tarabalka, Nicolas Nisse, Josiane Zerubia

CoRR, 2016

On computing tree and path decompositions with metric constraints on the bags.

Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse

CoRR, 2016

Spy-Game on Graphs.

Nathann Cohen, Mathieu Hilaire, Nicolas Almeida Martins, Nicolas Nisse, Stéphane Pérennes

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

Connected surveillance game.

Frédéric Giroire, Ioannis Lamprou, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, R. Soares

Theor. Comput. Sci., 2015

Data gathering and personalized broadcasting in radio grids with interference.

Jean-Claude Bermond, Bi Li, Nicolas Nisse, Hervé Rivano, Min-Li Yu

Theor. Comput. Sci., 2015

Non-deterministic graph searching in trees.

Omid Amini, David Coudert, Nicolas Nisse

Theor. Comput. Sci., 2015

Allowing each node to communicate only once in a distributed system: shared whiteboard models.

Florent Becker, Adrian Kosowski, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca

Distributed Comput., 2015

k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth.

Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan

Algorithmica, 2015

Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks.

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan

Algorithmica, 2015

Finding Paths in Grids with Forbidden Transitions.

Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014

To satisfy impatient Web surfers is hard.

Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse

Theor. Comput. Sci., 2014

Weighted Coloring in Trees.

Júlio Araújo, Nicolas Nisse, Stéphane Pérennes

SIAM J. Discret. Math., 2014

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth.

David Coudert, Dorian Mazauric, Nicolas Nisse

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Gathering and Exclusive Searching on Rings under Minimal Assumptions.

Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse

Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments.

Gianlorenzo D'Angelo, Xavier Défago, Nicolas Nisse

Proceedings of the Second International Symposium on Computing and Networking, 2014

Algorithmic complexity: Between Structure and Knowledge How Pursuit-evasion Games help. (Complexité algorithmique: entre structure et connaissance. Comment les jeux de poursuite peuvent apporter des solutions).

Nicolas Nisse

, 2014

2013

On the hull number of some graph classes.

Júlio Araújo, Victor A. Campos, Frédéric Giroire, Nicolas Nisse, Leonardo Sampaio Rocha, R. Soares

Theor. Comput. Sci., 2013

Connected Surveillance Game.

Frédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, Ronan Pardo Soares

Proceedings of the Structural Information and Communication Complexity, 2013

A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems.

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan

Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

2012

Distributed computing of efficient routing schemes in generalized chordal graphs.

Nicolas Nisse, Ivan Rapaport, Karol Suchan

Theor. Comput. Sci., 2012

Connected graph searching.

Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, Dimitrios M. Thilikos

Inf. Comput., 2012

Brief Announcement: Distributed Exclusive and Perpetual Tree Searching.

Lélia Blin, Janna Burman, Nicolas Nisse

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Allowing each node to communicate only once in a distributed system: shared whiteboard models.

Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Reconfiguration with physical constraints in WDM networks.

Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, Issam Tahiri

Proceedings of IEEE International Conference on Communications, 2012

2011

Tradeoffs in process strategy games with application in the WDM reconfiguration problem.

Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse

Theor. Comput. Sci., 2011

Cop and Robber Games When the Robber Can Hide and Ride.

Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès

SIAM J. Discret. Math., 2011

Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power

Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan

CoRR, 2011

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round.

Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010

Pursuing a fast robber on a graph.

Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan

Theor. Comput. Sci., 2010

Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock?

Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Stability of a localized and greedy routing algorithm.

Christelle Caillouet, Florian Huc, Nicolas Nisse, Stéphane Pérennes, Hervé Rivano

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009

Graph searching with advice.

Nicolas Nisse, David Soguet

Theor. Comput. Sci., 2009

On Rerouting Connection Requests in Networks with Shared Bandwidth.

David Coudert, Dorian Mazauric, Nicolas Nisse

Electron. Notes Discret. Math., 2009

Submodular partition functions.

Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé

Discret. Math., 2009

The cost of monotonicity in distributed graph searching.

David Ilcinkas, Nicolas Nisse, David Soguet

Distributed Comput., 2009

Connected graph searching in chordal graphs.

Nicolas Nisse

Discret. Appl. Math., 2009

Nondeterministic Graph Searching: From Pathwidth to Treewidth.

Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse

Algorithmica, 2009

Minimum Delay Data Gathering in Radio Networks.

Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes, Hervé Rivano

Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, 2009

2008

Monotonicity of non-deterministic graph searching.

Frédéric Mazoit, Nicolas Nisse

Theor. Comput. Sci., 2008

Distributed chasing of network intruders.

Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial

Theor. Comput. Sci., 2008

Monotony properties of connected visible graph searching.

Pierre Fraigniaud, Nicolas Nisse

Inf. Comput., 2008

Fast Robber in Planar Graphs.

Nicolas Nisse, Karol Suchan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2007

Jeux des gendarmes et du voleur dans les graphes. Mineurs de graphes, stratgies connexes, et approche distribue. (Graph searching and related problems. Graph Minors, connected search strategies, and distributed approach).

Nicolas Nisse

PhD thesis, 2007

2006

Connected Treewidth and Connected Graph Searching.

Pierre Fraigniaud, Nicolas Nisse

Proceedings of the LATIN 2006: Theoretical Informatics, 2006