Nicolas Nisse

Orcid: 0000-0003-4500-5078

According to our database1, Nicolas Nisse authored at least 95 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Digraph redicolouring.
Eur. J. Comb., February, 2024

2023
Finding the <i>k</i> Shortest Simple Paths: Time and Space Trade-offs.
ACM J. Exp. Algorithmics, December, 2023

Treelength of series-parallel graphs.
Discret. Appl. Math., December, 2023

On Finding the Best and Worst Orientations for the Metric Dimension.
Algorithmica, October, 2023

The Maker-Breaker Largest Connected Subgraph game.
Theor. Comput. Sci., 2023

Recovery of disrupted airline operations using <i>k</i>-maximum matching in graphs.
Eur. J. Oper. Res., 2023

Further results on the Hunters and Rabbit game through monotonicity.
CoRR, 2023

Redicolouring digraphs: directed treewidth and cycle-degeneracy.
CoRR, 2023

Complexity of Maker-Breaker Games on Edge Sets of Graphs.
CoRR, 2023

Deciding the Erdős-Pósa Property in 3-Connected Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Weakly Synchronous Systems with Three Machines Are Turing Powerful.
Proceedings of the Reachability Problems - 17th International Conference, 2023

Recontamination Helps a Lot to Hunt a Rabbit.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Preferential Attachment Hypergraph with Vertex Deactivation.
Proceedings of the 31st International Symposium on Modeling, 2023

Semi-proper orientations of dense graphs.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022
Preferential attachment hypergraph with high modularity.
Netw. Sci., December, 2022

Problems, proofs, and disproofs on the inversion number.
CoRR, 2022

On Proper Labellings of Graphs with Minimum Label Sum.
Algorithmica, 2022

The Largest Connected Subgraph Game.
Algorithmica, 2022

Pathlength of Outerplanar Graphs.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021
On minimizing the maximum color for the 1-2-3 Conjecture.
Discret. Appl. Math., 2021

Further results on an equitable 1-2-3 Conjecture.
Discret. Appl. Math., 2021

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

2020
Decomposing Degenerate Graphs into Locally Irregular Subgraphs.
Graphs Comb., 2020

On the Complexity of Computing Treebreadth.
Algorithmica, 2020

Study of a Combinatorial Game in Graphs Through Linear Programming.
Algorithmica, 2020

Sequential Metric Dimension.
Algorithmica, 2020

Space and Time Trade-Off for the k Shortest Simple Paths Problem.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

2019
Network Decontamination.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Preface to special issue on Theory and Applications of Graph Searching.
Theor. Comput. Sci., 2019

Metric Dimension: from Graphs to Oriented Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Computing metric hulls in graphs.
Discret. Math. Theor. Comput. Sci., 2019

Constrained ear decompositions in graphs and digraphs.
Discret. Math. Theor. Comput. Sci., 2019

Eternal Domination in Grids.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Spy-game on graphs: Complexity and simple topologies.
Theor. Comput. Sci., 2018

Subdivisions of oriented cycles in digraphs with large chromatic number.
J. Graph Theory, 2018

On interval number in cycle convexity.
Discret. Math. Theor. Comput. Sci., 2018

On distance-preserving elimination orderings in graphs: Complexity and algorithms.
Discret. Appl. Math., 2018

Localization game on geometric and planar graphs.
Discret. Appl. Math., 2018

On improving matchings in trees, via bounded-length augmentations.
Discret. Appl. Math., 2018

Centroidal Localization Game.
Electron. J. Comb., 2018

2017
Routing at Large Scale: Advances and Challenges for Complex Networks.
IEEE Netw., 2017

Exclusive graph searching vs. pathwidth.
Inf. Comput., 2017

Recovery of disrupted airline operations using k-Maximum Matching in graphs.
Electron. Notes Discret. Math., 2017

A unified approach for gathering and exclusive searching on rings under weak assumptions.
Distributed Comput., 2017

Maintaining balanced trees for structured distributed streaming systems.
Discret. Appl. Math., 2017

Exclusive Graph Searching.
Algorithmica, 2017

2016
Forewords: Special issue on Theory and Applications of Graph Searching Problems.
Theor. Comput. Sci., 2016

To Approximate Treewidth, Use Treelength!
SIAM J. Discret. Math., 2016

Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth.
ACM J. Exp. Algorithmics, 2016

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

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

Spy-Game on Graphs.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Connected surveillance game.
Theor. Comput. Sci., 2015

Data gathering and personalized broadcasting in radio grids with interference.
Theor. Comput. Sci., 2015

Non-deterministic graph searching in trees.
Theor. Comput. Sci., 2015

Minimum Size Tree-decompositions.
Electron. Notes Discret. Math., 2015

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

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

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

Finding Paths in Grids with Forbidden Transitions.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014
To satisfy impatient Web surfers is hard.
Theor. Comput. Sci., 2014

Weighted Coloring in Trees.
SIAM J. Discret. Math., 2014

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Gathering and Exclusive Searching on Rings under Minimal Assumptions.
Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments.
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).
, 2014

2013
On the hull number of some graph classes.
Theor. Comput. Sci., 2013

On the Monotonicity of Process Number.
Electron. Notes Discret. Math., 2013

Connected Surveillance Game.
Proceedings of the Structural Information and Communication Complexity, 2013

A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

2012
Distributed computing of efficient routing schemes in generalized chordal graphs.
Theor. Comput. Sci., 2012

Connected graph searching.
Inf. Comput., 2012

Brief Announcement: Distributed Exclusive and Perpetual Tree Searching.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Allowing each node to communicate only once in a distributed system: shared whiteboard models.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Reconfiguration with physical constraints in WDM networks.
Proceedings of IEEE International Conference on Communications, 2012

2011
Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
Theor. Comput. Sci., 2011

Cop and Robber Games When the Robber Can Hide and Ride.
SIAM J. Discret. Math., 2011

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

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010
Pursuing a fast robber on a graph.
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?
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Stability of a localized and greedy routing algorithm.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009
Graph searching with advice.
Theor. Comput. Sci., 2009

On Rerouting Connection Requests in Networks with Shared Bandwidth.
Electron. Notes Discret. Math., 2009

Submodular partition functions.
Discret. Math., 2009

The cost of monotonicity in distributed graph searching.
Distributed Comput., 2009

Connected graph searching in chordal graphs.
Discret. Appl. Math., 2009

Nondeterministic Graph Searching: From Pathwidth to Treewidth.
Algorithmica, 2009

Minimum Delay Data Gathering in Radio Networks.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, 2009

2008
Monotonicity of non-deterministic graph searching.
Theor. Comput. Sci., 2008

Distributed chasing of network intruders.
Theor. Comput. Sci., 2008

Monotony properties of connected visible graph searching.
Inf. Comput., 2008

Fast Robber in Planar Graphs.
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).
PhD thesis, 2007

2006
Connected Treewidth and Connected Graph Searching.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006


  Loading...