Nicolas Gastineau

According to our database, Nicolas Gastineau authored at least 18 papers between 2013 and 2022.

Collaborative distances:

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

2022

Leader election and local identifiers for three-dimensional programmable matter.

Nicolas Gastineau, Wahabou Abdou, Nader Mbarek, Olivier Togni

Concurr. Comput. Pract. Exp., 2022

2021

Coloring of the <i>d^th</i> power of the face-centered cubic grid.

Nicolas Gastineau, Olivier Togni

Discuss. Math. Graph Theory, 2021

2020

Leader Election And Local Identifiers For 3D Programmable Matter.

Nicolas Gastineau, Wahabou Abdou, Nader Mbarek, Olivier Togni

CoRR, 2020

2019

Exact Distance Graphs of Product Graphs.

Bostjan Bresar, Nicolas Gastineau, Sandi Klavzar, Olivier Togni

Graphs Comb., 2019

On S-packing edge-colorings of cubic graphs.

Nicolas Gastineau, Olivier Togni

Discret. Appl. Math., 2019

On the packing chromatic number of subcubic outerplanar graphs.

Nicolas Gastineau, Premysl Holub, Olivier Togni

Discret. Appl. Math., 2019

2018

Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees.

Benoît Darties, Nicolas Gastineau, Olivier Togni

Discret. Appl. Math., 2018

Coloring of the dth power of the face-centered cubic grid.

Nicolas Gastineau, Olivier Togni

CoRR, 2018

Distributed Leader Election and Computation of Local Identifiers for Programmable Matter.

Nicolas Gastineau, Wahabou Abdou, Nader Mbarek, Olivier Togni

Proceedings of the Algorithms for Sensor Systems, 2018

2017

Completely independent spanning trees in some regular graphs.

Benoît Darties, Nicolas Gastineau, Olivier Togni

Discret. Appl. Math., 2017

Completely independent spanning trees for enhancing the robustness in ad-hoc Networks.

Axel Moinet, Benoît Darties, Nicolas Gastineau, Jean-Luc Baril, Olivier Togni

Proceedings of the 13th IEEE International Conference on Wireless and Mobile Computing, 2017

2016

S-packing colorings of cubic graphs.

Nicolas Gastineau, Olivier Togni

Discret. Math., 2016

A characterization of b-chromatic and partial Grundy numbers by induced subgraphs.

Brice Effantin, Nicolas Gastineau, Olivier Togni

Discret. Math., 2016

2015

Dichotomies properties on computational complexity of S-packing coloring problems.

Nicolas Gastineau

Discret. Math., 2015

Subdivision into i-packings and S-packing chromatic number of some lattices.

Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni

Ars Math. Contemp., 2015

2014

Partitionnement, recouvrement et colorabilité dans les graphes. (Partitionability, coverability and colorability in graphs).

Nicolas Gastineau

PhD thesis, 2014

On the family of r-regular graphs with Grundy number r+1.

Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni

Discret. Math., 2014

2013

On the Complexity of the S-coloring problem.

Nicolas Gastineau

CoRR, 2013