default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Gastineau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Nicolas Gastineau
, Wahabou Abdou, Nader Mbarek, Olivier Togni:
Leader election and local identifiers for three-dimensional programmable matter. Concurr. Comput. Pract. Exp. 34(7) (2022)- 2021
- [j11]Nicolas Gastineau, Olivier Togni:
Coloring of the dth power of the face-centered cubic grid. Discuss. Math. Graph Theory 41(4): 1001-1020 (2021) - 2020
- [i12]Nicolas Gastineau, Wahabou Abdou, Nader Mbarek, Olivier Togni:
Leader Election And Local Identifiers For 3D Programmable Matter. CoRR abs/2010.09286 (2020)
2010 – 2019
- 2019
- [j10]Nicolas Gastineau, Premysl Holub, Olivier Togni:
On the packing chromatic number of subcubic outerplanar graphs. Discret. Appl. Math. 255: 209-221 (2019) - [j9]Nicolas Gastineau, Olivier Togni:
On S-packing edge-colorings of cubic graphs. Discret. Appl. Math. 259: 63-75 (2019) - [j8]Bostjan Bresar, Nicolas Gastineau, Sandi Klavzar, Olivier Togni:
Exact Distance Graphs of Product Graphs. Graphs Comb. 35(6): 1555-1569 (2019) - 2018
- [j7]Benoît Darties, Nicolas Gastineau, Olivier Togni:
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees. Discret. Appl. Math. 236: 124-136 (2018) - [c2]Nicolas Gastineau, Wahabou Abdou, Nader Mbarek, Olivier Togni:
Distributed Leader Election and Computation of Local Identifiers for Programmable Matter. ALGOSENSORS 2018: 159-179 - [i11]Nicolas Gastineau, Olivier Togni:
Coloring of the dth power of the face-centered cubic grid. CoRR abs/1806.08136 (2018) - [i10]Nicolas Gastineau, Wahabou Abdou, Nader Mbarek, Olivier Togni:
Distributed leader election and computation of local identifiers for programmable matter. CoRR abs/1807.10461 (2018) - 2017
- [j6]Benoît Darties, Nicolas Gastineau, Olivier Togni:
Completely independent spanning trees in some regular graphs. Discret. Appl. Math. 217: 163-174 (2017) - [c1]Axel Moinet, Benoît Darties, Nicolas Gastineau, Jean-Luc Baril, Olivier Togni:
Completely independent spanning trees for enhancing the robustness in ad-hoc Networks. WiMob 2017: 63-70 - [i9]Benoît Darties, Nicolas Gastineau, Olivier Togni:
Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees. CoRR abs/1702.08289 (2017) - [i8]Nicolas Gastineau, Premysl Holub, Olivier Togni:
On packing chromatic number of subcubic outerplanar graphs. CoRR abs/1703.05023 (2017) - [i7]Nicolas Gastineau, Olivier Togni:
On S-packing edge-colorings of cubic graphs. CoRR abs/1711.10906 (2017) - 2016
- [j5]Brice Effantin, Nicolas Gastineau, Olivier Togni:
A characterization of b-chromatic and partial Grundy numbers by induced subgraphs. Discret. Math. 339(8): 2157-2167 (2016) - [j4]Nicolas Gastineau, Olivier Togni:
S-packing colorings of cubic graphs. Discret. Math. 339(10): 2461-2470 (2016) - 2015
- [j3]Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni:
Subdivision into i-packings and S-packing chromatic number of some lattices. Ars Math. Contemp. 9(2): 321-344 (2015) - [j2]Nicolas Gastineau:
Dichotomies properties on computational complexity of S-packing coloring problems. Discret. Math. 338(6): 1029-1041 (2015) - [i6]Brice Effantin, Nicolas Gastineau, Olivier Togni:
A characterization of b-chromatic and partial Grundy numbers by induced subgraphs. CoRR abs/1505.07780 (2015) - [i5]Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni:
Subdivision into i-packings and S-packing chromatic number of some lattices. CoRR abs/1505.07781 (2015) - 2014
- [b1]Nicolas Gastineau:
Partitionnement, recouvrement et colorabilité dans les graphes. (Partitionability, coverability and colorability in graphs). University of Burgundy, Dijon, France, 2014 - [j1]Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni:
On the family of r-regular graphs with Grundy number r+1. Discret. Math. 328: 5-15 (2014) - [i4]Nicolas Gastineau, Olivier Togni:
S-Packing Colorings of Cubic Graphs. CoRR abs/1403.7495 (2014) - [i3]Benoît Darties, Nicolas Gastineau, Olivier Togni:
Completely Independent Spanning Trees in Some Regular Graphs. CoRR abs/1409.6002 (2014) - 2013
- [i2]Nicolas Gastineau:
On the Complexity of the S-coloring problem. CoRR abs/1312.5280 (2013) - [i1]Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni:
On the family of r-regular graphs with Grundy number r + 1. CoRR abs/1312.6503 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
