Brice Effantin
32
Documents
Publications
The b_q-coloring of graphsDiscrete Mathematics Letters, 2023, 12, pp.173-180. ⟨10.47443/dml.2023.098⟩
Article dans une revue
hal-04315094v1
|
|
|
Incidence, a Scoring Positional Game on GraphsDiscrete Mathematics, inPress, pp.113570. ⟨10.1016/j.disc.2023.113570⟩
Article dans une revue
hal-03837646v1
|
Diversified top-k search with relaxed graph simulationSocial Network Analysis and Mining, 2019, ⟨10.1007/s13278-019-0599-1⟩
Article dans une revue
hal-03118374v1
|
|
On the game coloring index of F+-decomposable graphsDiscrete Applied Mathematics, 2018, 236, pp.73-83
Article dans une revue
hal-01883462v1
|
|
|
A note on Grundy colorings of central graphsThe Australasian Journal of Combinatorics, 2017, 68 (3), pp.346-356
Article dans une revue
hal-01528755v1
|
|
A characterization of b-chromatic and partial Grundy numbers by induced subgraphsDiscrete Mathematics, 2016, 339 (8), pp.2157 - 2167. ⟨10.1016/j.disc.2016.03.011⟩
Article dans une revue
hal-01157902v2
|
[r,s,t]-colorings of graph productsGraphs and Combinatorics, 2014, 30 (5), pp.1135-1147
Article dans une revue
hal-01285320v1
|
|
Distance edge coloring of the Kronecker product of some graphsUtilitas Mathematica, 2014, 93, pp.179-192
Article dans une revue
hal-01285321v1
|
|
Coloring Based Approach for Matching Unrooted and/or Unordered TreesPattern Recognition Letters, 2013, 6, 34, pp.686-695. ⟨10.1016/j.patrec.2013.01.017⟩
Article dans une revue
hal-01339150v1
|
|
Distance edge coloring and collision-free communication in wireless sensor networksNetworks, 2013, 1, 62, pp.35-47. ⟨10.1002/net.21491⟩
Article dans une revue
hal-01339137v1
|
|
New Results about Set Colorings of GraphsThe Electronic Journal of Combinatorics, 2010, 17, pp.R173
Article dans une revue
hal-01285324v1
|
|
[r,s,t]-Coloring of Trees and Bipartite GraphsDiscrete Mathematics, 2009
Article dans une revue
hal-00385490v1
|
|
Discussion on the (partial) Grundy and b-chromatic numbers of graphsUtilitas Mathematica, 2008
Article dans une revue
hal-00267298v1
|
|
Grundy number of graphsDiscussiones Mathematicae Graph Theory, 2007, 27 (1), pp.5-18
Article dans une revue
hal-00174212v1
|
|
Exact values for the b-chromatic number of a power complete k-ary treeJournal of Discrete Mathematical Sciences and Cryptography, 2005, 8 (1), pp.117-129
Article dans une revue
hal-00381210v1
|
|
The b-chromatic number of power graphs of complete caterpillarsJournal of Discrete Mathematical Sciences and Cryptography, 2005, 8 (3), pp.483-502
Article dans une revue
hal-00173577v1
|
|
|
The b-chromatic number of power graphsDiscrete Mathematics and Theoretical Computer Science, 2003, Vol. 6 no. 1 (1), pp.45-54. ⟨10.46298/dmtcs.333⟩
Article dans une revue
hal-00958987v1
|
Fast top-k search with relaxed graph simulationThe 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Aug 2018, Barcelona, Spain
Communication dans un congrès
hal-01887427v1
|
|
Search and Aggregation in XML Documents28th International Conference on Database and Expert Systems Applications, Aug 2017, Lyon, France. pp.290-304
Communication dans un congrès
hal-01590605v1
|
|
GraphExploiter: Creation, Visualization and Algorithms on graphsIEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Aug 2015, Paris, France. pp.765-767
Communication dans un congrès
hal-01282644v1
|
|
On parameterized complexity to determine b-chromatic and partial Grundy numbersBordeaux Graph Workshop 2014, Nov 2014, Bordeaux, France
Communication dans un congrès
hal-02174532v1
|
|
A Graph Enrichment Based Clustering over Vertically Partitioned Data7th International Conference on Advanced Data Mining and Applications (ADMA 2011), Dec 2011, Beijing, China. pp.42-54, ⟨10.1007/978-3-642-25853-4_4⟩
Communication dans un congrès
hal-01285352v1
|
|
Distance-edge-coloring of power graphs8FCC'10, 2010, Paris, France
Communication dans un congrès
hal-00490510v1
|
|
A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph9th International Conference on Distributed Computing and Networking (ICDCN 2008), 2008, India. pp.209-214
Communication dans un congrès
hal-00188342v1
|
|
A fully dynamic distributed algorithm for a b-coloring of graphsThe 2008 IEEE International Symposium on Advances in Parallel and Distributed Computing Techniques (APDCT-08), 2008, Sydney, Australia
Communication dans un congrès
hal-00381213v1
|
|
[r,s,t]-coloring of Trees and Bipartite graphsBritish Combinatorial Conference 2007, BCC'2007, 2007, Reading, United Kingdom. pp.000
Communication dans un congrès
hal-00192135v1
|
|
An incremental distributed algorithm for a partial Grundy coloring of graphsThe Fifth International Symposium on Parallel and Distributed Processing and Applications (ISPA-07), 2007, Niagara Falls, Canada. pp.170-181
Communication dans un congrès
hal-00192132v1
|
|
An incremental distributed algorithm for a partial Grundy coloring of graphsColloque sur l'Optimisation et les systèmes d'Informations (COSI'07), 2007, Oran, Algeria. pp.000
Communication dans un congrès
hal-00192137v1
|
|
|
A Distributed Algorithm for a b-Coloring of a Graph4th International Symposium on Parallel and Distributed Processing and Applications, Dec 2006, Sorrento, Italy. pp.430-438
Communication dans un congrès
hal-00171173v1
|
Sum coloring of distance and circulant graphs7th International Colloquium on Graph Theory, 2005, Hyères, France. pp.239-244
Communication dans un congrès
hal-00174206v1
|
|
Generation of Unordered Binary TreesInternational Conference on Computational Science and its Applications 2004, 2004, Assisi, Italy. pp.648-655
Communication dans un congrès
hal-00174198v1
|
|
Generation of Valid Labeled Binary TreesInternational Conference on Computational Science and its Applications 2003, 2003, Montréal, Canada. pp.245-253
Communication dans un congrès
hal-00174194v1
|