default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrice Effantin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j12]Abdelmalek Habi
, Brice Effantin, Hamamache Kheddouci:
Diversified top-k search with relaxed graph simulation. Soc. Netw. Anal. Min. 9(1): 55:1-55:15 (2019)- [c11]Abdelmalek Habi, Brice Effantin, Hamamache Kheddouci:
La simulation relaxée de graphes pour la recherche de motifs. EGC 2019: 401-406 - 2018
- [j11]Clément Charpentier, Brice Effantin, Gabriela Paris:
On the game coloring index of -decomposable graphs. Discret. Appl. Math. 236: 73-83 (2018) - [c10]Abdelmalek Habi, Brice Effantin, Hamamache Kheddouci:
Fast Top-k Search with Relaxed Graph Simulation. ASONAM 2018: 495-502 - 2017
- [j10]Brice Effantin:
A note on Grundy colorings of central graphs. Australas. J Comb. 68: 346-356 (2017) - [c9]Abdelmalek Habi, Brice Effantin, Hamamache Kheddouci:
Search and Aggregation in XML Documents. DEXA (1) 2017: 290-304 - 2016
- [j9]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) - 2015
- [c8]Victor Lequay, Alexis Ringot, Mohammed Haddad, Brice Effantin, Hamamache Kheddouci:
GraphExploiter: Creation, Visualization and Algorithms on graphs. ASONAM 2015: 765-767 - [i1]Brice Effantin, Nicolas Gastineau, Olivier Togni:
A characterization of b-chromatic and partial Grundy numbers by induced subgraphs. CoRR abs/1505.07780 (2015) - 2014
- [j8]Lyes Dekar, Brice Effantin, Hamamache Kheddouci:
[r, s, t]-Colorings of Graph Products. Graphs Comb. 30(5): 1135-1147 (2014) - 2013
- [j7]Kaouther Drira, Hamida Seba, Brice Effantin, Hamamache Kheddouci:
Distance edge coloring and collision-free communication in wireless sensor networks. Networks 62(1): 35-47 (2013) - [j6]Saïd Yahiaoui, Mohammed Haddad, Brice Effantin, Hamamache Kheddouci:
Coloring based approach for matching unrooted and/or unordered trees. Pattern Recognit. Lett. 34(6): 686-695 (2013) - 2011
- [c7]Khalid Benabdeslem, Brice Effantin, Haytham Elghazel:
A Graph Enrichment Based Clustering over Vertically Partitioned Data. ADMA (1) 2011: 42-54 - 2010
- [j5]J. P. Boutin, Éric Duchêne, Brice Effantin, Hamamache Kheddouci, Hamida Seba:
New Results about Set Colorings of Graphs. Electron. J. Comb. 17(1) (2010) - [j4]Lyes Dekar, Brice Effantin, Hamamache Kheddouci:
[r, s, t]-coloring of trees and bipartite graphs. Discret. Math. 310(2): 260-269 (2010)
2000 – 2009
- 2008
- [c6]Huang Sun, Brice Effantin, Hamamache Kheddouci:
A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph. ICDCN 2008: 209-214 - [c5]Shuang Liu, Brice Effantin, Hamamache Kheddouci:
A Fully Dynamic Distributed Algorithm for a B-Coloring of Graphs. ISPA 2008: 657-662 - 2007
- [j3]Brice Effantin, Hamamache Kheddouci:
Grundy number of graphs. Discuss. Math. Graph Theory 27(1): 5-18 (2007) - [c4]Lyes Dekar, Brice Effantin, Hamamache Kheddouci:
An Incremental Distributed Algorithm for a Partial Grundy Coloring of Graphs. ISPA 2007: 170-181 - 2006
- [c3]Brice Effantin, Hamamache Kheddouci:
A Distributed Algorithm for a b-Coloring of a Graph. ISPA 2006: 430-438 - 2005
- [j2]Brice Effantin, Hamamache Kheddouci:
Sum coloring of distance and circulant graphs. Electron. Notes Discret. Math. 22: 239-244 (2005) - 2004
- [c2]Brice Effantin:
Generation of Unordered Binary Trees. ICCSA (3) 2004: 648-655 - 2003
- [j1]Brice Effantin, Hamamache Kheddouci:
The b-chromatic number of power graphs. Discret. Math. Theor. Comput. Sci. 6(1): 45-54 (2003) - [c1]Brice Effantin:
Generation of Valid Labeled Binary Trees. ICCSA (1) 2003: 245-253
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-11-07 20:34 CET 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:
