S-packing colorings of cubic graphs N Gastineau, O Togni Discrete Mathematics 339 (10), 2461-2470, 2016 | 60* | 2016 |
On the packing chromatic number of subcubic outerplanar graphs N Gastineau, P Holub, O Togni Discrete Applied Mathematics 255, 209-221, 2019 | 32 | 2019 |
Dichotomies properties on computational complexity of S-packing coloring problems N Gastineau Discrete Mathematics 338 (6), 1029-1041, 2015 | 32 | 2015 |
Subdivision into i-packings and S-packing chromatic number of some lattices N Gastineau, H Kheddouci, O Togni arXiv preprint arXiv:1505.07781, 2015 | 31 | 2015 |
Completely independent spanning trees in some regular graphs B Darties, N Gastineau, O Togni Discrete Applied Mathematics 217, 163-174, 2017 | 27 | 2017 |
Distributed leader election and computation of local identifiers for programmable matter N Gastineau, W Abdou, N Mbarek, O Togni Algorithms for Sensor Systems: 14th International Symposium on Algorithms …, 2019 | 21 | 2019 |
Packing colorings of subcubic outerplanar graphs B Brešar, N Gastineau, O Togni Aequationes mathematicae 94 (5), 945-967, 2020 | 19 | 2020 |
On S-packing edge-colorings of cubic graphs N Gastineau, O Togni Discrete Applied Mathematics 259, 63-75, 2019 | 19 | 2019 |
A characterization of b-chromatic and partial Grundy numbers by induced subgraphs B Effantin, N Gastineau, O Togni Discrete Mathematics 339 (8), 2157-2167, 2016 | 16 | 2016 |
Completely independent spanning trees for enhancing the robustness in ad-hoc networks A Moinet, B Darties, N Gastineau, JL Baril, O Togni 2017 IEEE 13th International Conference on Wireless and Mobile Computing …, 2017 | 15 | 2017 |
Exact distance graphs of product graphs B Brešar, N Gastineau, S Klavžar, O Togni Graphs and Combinatorics 35 (6), 1555-1569, 2019 | 12 | 2019 |
On the family of r-regular graphs with Grundy number r+ 1 N Gastineau, H Kheddouci, O Togni Discrete Mathematics 328, 5-15, 2014 | 9 | 2014 |
Leader election and local identifiers for three‐dimensional programmable matter N Gastineau, W Abdou, N Mbarek, O Togni Concurrency and Computation: Practice and Experience 34 (7), e6067, 2022 | 8 | 2022 |
Information fusion-based approach for studying influence on Twitter using belief theory L Azaza, S Kirgizov, M Savonnet, É Leclercq, N Gastineau, R Faiz Computational social networks 3, 1-26, 2016 | 8 | 2016 |
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees B Darties, N Gastineau, O Togni Discrete Applied Mathematics 236, 124-136, 2018 | 6 | 2018 |
Coloring of the dth power of the face-centered cubic grid N Gastineau, O Togni arXiv preprint arXiv:1806.08136, 2018 | 3 | 2018 |
Limit of generalized belief fusion operator S Kirgizov, N Gastineau, L Azaza Preprint: http://www. kirgizov. link/publications/azaza-limit/doc/limit. pdf, 2016 | 3 | 2016 |
Completely independent spanning trees in some regular networks B Darties, N Gastineau, O Togni arXiv preprint arXiv:1409.6002, 2014 | 3 | 2014 |
On a vertex-edge marking game on graphs B Brešar, N Gastineau, T Gologranc, O Togni Annals of Combinatorics 25, 179-194, 2021 | 1 | 2021 |
Almost disjoint spanning trees B Darties, N Gastineau, O Togni Bordeaux Graph Workshop BGW, 2016 | | 2016 |