Nombre de documents

76

Mickael Montassier


Short bio: I received the PhD degree from the University of Bordeaux in 2005 and the "HDR" degree in 2010. Currently, I am affiliated to the laboratory LIRMM (Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier) as full professor in the group « Algorithms for Graphs and Combinatorics ». My research interests include graph colorings (list-colorings, oriented colorings, group-coloring, labeling), structures (vertex partition,...) and design of fault tolerant networks...


Article dans une revue48 documents

  • François Dross, Mickaël Montassier, Alexandre Pinlou. Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. European Journal of Combinatorics, Elsevier, 2017, In press. <lirmm-01430784>
  • François Dross, Mickaël Montassier, Alexandre Pinlou. A lower bound on the order of the largest induced forest in planar graphs with high girth. Discrete Applied Mathematics, Elsevier, 2016, To appear. <lirmm-01375448>
  • Stanislav Jendrol, Mária Maceková, Mickaël Montassier, Roman Soták. 3-path in graphs with bounded average degree. Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2016, 36 (2), pp.339-353. <10.7151/dmgt.1859>. <lirmm-01346642>
  • Stanislav Jendrol', Mária Maceková, Mickaël Montassier, Roman Soták. Optimal unavoidable sets of types of 3-paths for planar graphs of given girth. Discrete Mathematics, Elsevier, 2016, 339 (2), pp.780 - 789. <10.1016/j.disc.2015.10.016>. <lirmm-01263824>
  • Paul Dorbec, Michael A. Henning, Mickaël Montassier, Justin Southey. Independent Domination in Cubic Graphs. Journal of Graph Theory, Wiley, 2015, 80 (4), pp.329-349. <10.1002/jgt.21855>. <lirmm-01263782>
  • Olivier Delmas, Frédéric Havet, Mickaël Montassier. Design of fault-tolerant on-board networks with variable switch sizes. Theoretical Computer Science, Elsevier, 2015, 562, pp.15. <hal-01111370>
  • François Dross, Mickaël Montassier, Alexandre Pinlou. Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Electronic Notes in Discrete Mathematics, Elsevier, 2015, The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, 49, pp.269-275. <10.1016/j.endm.2015.06.037>. <lirmm-01233461>
  • Mickaël Montassier, Pascal Ochem. Near-colorings: non-colorable graphs and NP-completeness. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2015, 22 (1), pp.#P1.57. <lirmm-01263770>
  • Paul Dorbec, Tomas Kaiser, Mickael Montassier, André Raspaud. Limits of near-coloring of sparse graphs. Journal of Graph Theory, Wiley, 2014, 75 (2), pp.191-202. <10.1002/jgt.21731>. <hal-00911263>
  • Gerard Jennhwa Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud. Strong chromatic index of planar graphs with large girth. Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2014, 34 (4), pp.723-733. <10.7151/dmgt.1763>. <hal-00920932>
  • Paul Dorbec, Mickael Montassier, Pascal Ochem. Vertex Partitions of Graphs into Cographs and Stars. Journal of Graph Theory, Wiley, 2013, 75, pp.75-90. <10.1002/jgt.21724>. <hal-00911272>
  • Paul Dorbec, Michael Henning, Christian Löwenstein, Mickael Montassier, André Raspaud. Generalized power domination in regular graphs. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2013, 27 (3), pp.1559-1574. <10.1137/120891356>. <hal-00903699>
  • Hervé Hocquard, Mickael Montassier, André Raspaud, Petru Valicov. On strong edge-colouring of subcubic graphs. Discrete Applied Mathematics, Elsevier, 2013, 161 (16-17), pp.2467-2479. <10.1016/j.dam.2013.05.021>. <hal-00686021v2>
  • Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou. A Complexity Dichotomy for the Coloring of Sparse Graphs. Journal of Graph Theory, Wiley, 2013, 73 (1), pp.85-102. <http://dx.doi.org/10.1002/jgt.21659>. <10.1002/jgt.21659>. <lirmm-00736468>
  • Louis Esperet, Sylvain Gravier, Mickael Montassier, Pascal Ochem, Aline Parreau. Locally identifying coloring of graphs. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2012, 19 (2), pp.40. <hal-00529640v2>
  • Min Chen, Mickaël Montassier, André Raspaud. Some structural properties of planar graphs and their applications to 3-choosability. Discrete Mathematics, Elsevier, 2012, 312 (2), pp.362-373. <10.1016/j.disc.2011.09.028>. <lirmm-00782828>
  • Oleg Borodin, Anna Ivanova, Mickaël Montassier, André Raspaud. (k,1)-coloring of sparse graphs. Discrete Mathematics, Elsevier, 2012, 312 (6), pp.1128-1135. <10.1016/j.disc.2011.11.031>. <lirmm-00782819>
  • Gerard Jennhwa Chang, Paul Dorbec, Mickael Montassier, André Raspaud. Generalized power domination of graphs. Discrete Applied Mathematics, Elsevier, 2012, 160 (12), pp.1691-1698. <10.1016/j.dam.2012.03.007>. <hal-00591512>
  • Mickael Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu. Decomposing a graph into forests. Journal of Combinatorial Theory, Series B, Elsevier, 2012, 102 (1), pp.38-52. <10.1016/j.jctb.2011.04.001>. <hal-00656800>
  • Hervé Hocquard, Mickaël Montassier. Adjacent vertex-distinguishing edge coloring of graphs with maximum degree $\Delta$. Journal of Combinatorial Optimization, Springer Verlag, 2012, pp.9. <10.1007/s10878-011-9444-9>. <lirmm-00782842>
  • Yuehua Bu, Mickaël Montassier, André Raspaud, Weifan Wang. On backbone coloring of graphs. Journal of Combinatorial Optimization, Springer Verlag, 2012, 23, pp.79-93. <10.1007/s10878-010-9342-6>. <lirmm-00782811>
  • Clément Charpentier, Mickaël Montassier, André Raspaud. L(p,q)-labeling of sparse graphs. Journal of Combinatorial Optimization, Springer Verlag, 2012, 25 (4), pp.646-660. <10.1007/s10878-012-9507-6>. <lirmm-00738574>
  • Olivier Delmas, Sylvain Gravier, Mickael Montassier, Aline Parreau. On two variations of identifying codes. Discrete Mathematics, Elsevier, 2011, 311 (17), pp.1948-1956. <10.1016/j.disc.2011.05.018>. <hal-00475625v2>
  • Tomáš Kaiser, Mickaël Montassier, André Raspaud. Covering a Graph by Forests and a Matching. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2011, 25 (4), pp.1804-1811. <10.1137/100818340>. <lirmm-01263789>
  • O.V. Borodin, A.O. Ivanova, A. Raspaud, Mickaël Montassier, André Raspaud. (k,j)-coloring of sparse graphs. Discrete Applied Mathematics, Elsevier, 2011, 159 (17), <10.1016/j.dam.2011.06.021>. <lirmm-01263802>
  • O.V. Borodin, A.O. Ivanova, Mickael Montassier, Pascal Ochem, André Raspaud. Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. Journal of Graph Theory, Wiley, 2010, 65 (2), pp.83-93. <hal-00377372>
  • O.V. Borodin, Mickael Montassier, André Raspaud. Planar graphs without adjacent cycles of length at most seven are 3-colorable. Discrete Mathematics, Elsevier, 2010, 310 (1), pp.167-173. <hal-00401710>
  • Hervé Hocquard, Mickaël Montassier, André Raspaud. A note on the acyclic 3-choosability of some planar graphs. Discrete Applied Mathematics, Elsevier, 2010, 158 (10), pp.1104-1110. <10.1016/j.dam.2010.02.005>. <lirmm-01263813>
  • Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu. Decomposition of sparse graphs, with application to game coloring number. Contributions to Discrete Mathematics, University of Calgary, 2010, 310 (10-11), <10.1016/j.disc.2010.01.008>. <lirmm-01263814>
  • Mickaël Montassier, André Raspaud, Xuding Zhu. Decomposition of sparse graphs into two forests, one having bounded maximum degree. Information Processing Letters, Elsevier, 2010, 110 (20), pp.913-916. <10.1016/j.ipl.2010.07.009>. <lirmm-01263807>
  • Hervé Hocquard, Mickael Montassier. Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable. Information Processing Letters, Elsevier, 2009. <hal-00402807>
  • Louis Esperet, Mickael Montassier, Xuding Zhu. Adapted list colouring of planar graphs. Journal of Graph Theory, Wiley, 2009, 62 (2), pp.127-138. <hal-00349116>
  • Yuehua Bu, Daniel W. Cranston, Mickael Montassier, André Raspaud, Weifan Wang. Star coloring of sparse graphs.. Journal of Graph Theory, Wiley, 2009, 62 (3), pp.201-219. <hal-00349115>
  • Mickael Montassier, André Raspaud, Xuding Zhu. An upper bound on the adaptable choosability of graphs.. European Journal of Combinatorics, Elsevier, 2009, 30 (2), pp.351-355. <10.1016/j.ejc.2008.06.003>. <hal-00322868>
  • Yuehua Bu, Huajing Lu, Mickael Montassier, André Raspaud, Weifan Wang, et al.. On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Discrete Mathematics, Elsevier, 2009, 309 (13), pp.4596-4607. <10.1016/j.disc.2009.02.030>. <hal-00369723>
  • O.V. Borodin, A.N. Glebov, Mickael Montassier, André Raspaud. Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable.. Journal of Combinatorial Theory, Series B, Elsevier, 2009, 99 (4), pp.668-673. <hal-00349110>
  • Louis Esperet, Mickael Montassier, André Raspaud. Linear choosability of graphs. Discrete Mathematics, Elsevier, 2008, 308 (17), pp.3938-3950. <hal-00306479>
  • Mickael Montassier, André Raspaud, Weifan Wang, Yingqian Wang. A relaxation of Havel's 3-color problem. Information Processing Letters, Elsevier, 2008, 107 (3-4), pp.107-109. <hal-00300736>
  • Mickaël Montassier, Pascal Ochem, Alexandre Pinlou. Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (1), pp.1-24. <lirmm-00184811>
  • Mickael Montassier, André Raspaud, Weifan Wang. Acyclic 5-choosability of planar graphs without small cycles.. Journal of Graph Theory, Wiley, 2007, 54, pp.245--260. <hal-00307135>
  • Fabrice Bazzaro, Mickael Montassier, André Raspaud. (d,1)-total labeling of planar graphs with large girth and high maximum degree.. Discrete Mathematics, Elsevier, 2007, 307, pp.2141-2151. <hal-00293465>
  • Mickael Montassier. A small non-Z4-colorable planar graph. Discrete Mathematics, Elsevier, 2007, 307 (13), pp.1684--1686. <hal-00285580>
  • Mickael Montassier. A note on the not 3-choosability of some families of planar graphs. Information Processing Letters, Elsevier, 2006, 99, pp.68--71. <hal-00307136>
  • Mickael Montassier, André Raspaud. (d,1)-total labeling of graphs with given maximum average degree. Journal of Graph Theory, Wiley, 2006, 51, pp.93--109. <hal-00307139>
  • Mickael Montassier, Pascal Ochem, André Raspaud. On the acyclic choosability of graphs. Journal of Graph Theory, Wiley, 2006, 51, pp.281--300. <hal-00307137>
  • Mickael Montassier, André Raspaud, Weifan Wang. Bordeaux 3-color conjecture and 3-choosability. Discrete Mathematics, Elsevier, 2006, 306 (6), pp.573-579. <hal-00306480>
  • Mickael Montassier, André Raspaud, Weifan Wang. Acyclic 4-choosability of planar graphs without cycles of specific length. Algorithms and Combinatorics, 2006, 26, pp.473--491. <hal-00307141>
  • Mickael Montassier, André Raspaud. A note on 2-facial coloring of plane graphs. Information Processing Letters, Elsevier, 2005, 98, pp.235--241. <hal-00307134>

Communication dans un congrès27 documents

  • Mickaël Montassier. Vertex-partitions of graphs. International Conference on Graph Theory, Combinatorics and Applications, Oct 2016, Jinhua, China. 2nd International Conference on Graph Theory, Combinatorics and Applications, 2016, <http://icgca2016.zjnu.edu.cn/?lan=EN>. <lirmm-01430816>
  • François Dross, Mickaël Montassier, Alexandre Pinlou. Partitioning sparse graphs into an independent set and a forest of bounded degree. BGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France. 4th International Workshop on graph theory, 2016, <http://bgw.labri.fr/2016/>. <lirmm-01430813>
  • Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou. Entropy compression method applied to graph colorings. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. 9th International colloquium on graph theory and combinatorics, June 30-July 4, 2014, 2014. <lirmm-01233456>
  • Mickaël Montassier. Entropy compression method and graph coloring problems. C&C: Cycles and Colourings, 2014, Novy Smokovec, Slovakia. 23rd, 2014. <lirmm-01264376>
  • Steven Chaplick, Paul Dorbec, Jan Kratochvil, Mickaël Montassier, Juraj Stacho. Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. WG: Graph-Theoretic Concepts in Computer Science, 2014, Nouan-le-fuzelier, France. 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, LNCS (8747), pp.139-151, 2014, Graph-Theoretic Concepts in Computer Science. <10.1007/978-3-319-12340-0_12>. <lirmm-01264271>
  • Arnaud Pêcher, Mickaël Montassier, André Raspaud. Strong chromatic index of planar graphs with large girth. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy. 7th European Conference on Combinatorics, Graph Theory and Applications, pp.265-270, 2013, <http://www.eurocomb2013.it/index.php?pg=webshow&id=1>. <10.1007/978-88-7642-475-5_43>. <hal-00920842>
  • Mickaël Montassier. Limits of near-coloring of sparse graphs. 2012 International Conference on Graph Theory, Combinatorics and Applications, Oct 2012, Zhejiang, China. 2012, <http://discrete.zjnu.edu.cn/icgca2012/?action-channel-name-en>. <lirmm-00782851>
  • Hervé Hocquard, Mickaël Montassier. A note on strong edge-colouring. Bordeaux Graph Workshop 2012, 2012, Bordeaux, France. <lirmm-01264278>
  • Hervé Hocquard, Mickaël Montassier. Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 2011, Budapest, Hungary. 38, 2011, <10.1016/j.endm.2011.09.074>. <lirmm-01264287>
  • Tomáš Kaiser, Mickaël Montassier, André Raspaud, Ondrej Rucky. Covering a graph by forests and a matching. CanaDAM 2011, 2011, Victoria, Canada. <lirmm-01264297>
  • Mickaël Montassier. Le problème des 3 couleurs et la conjecture de Steinberg. JGA2011, Journées Graphes et Algorithmes, 2011, Lyon, France. <lirmm-01264382>
  • Clément Charpentier, Mickaël Montassier, André Raspaud. Minmax degree of graphs (Extended abstract). The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 2011, Budapest, Hungary. 38, 2011, <10.1016/j.endm.2011.09.042>. <lirmm-01264283>
  • Gerard Jennhwa Chang, Paul Dorbec, Mickaël Montassier, André Raspaud. Generalized power domination. 8FCC, 2010, Orsay, France. <lirmm-01264351>
  • Mickaël Montassier. Decomposition of sparse graphs, with applications to game coloring number. Seminar on Graph Theory, 2010, Kaohsiung, Taiwan. 2010. <lirmm-01264386>
  • Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau. Identifying colorings of graphs. 8FCC, 2010, Orsay, France. <lirmm-01264347>
  • Mickaël Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu. Decomposing a graph into forests. 8FCC, 2010, Orsay, France. <lirmm-01264344>
  • Mickael Montassier. The 3-Color Problem. 2009 Workshop on Graph Theory, Jan 2009, Taiwan. <hal-00401708>
  • Hervé Hocquard, Mickael Montassier. Acyclic choosability of planar graphs : a Steinberg like approach. EuroComb'09, European conference on Combinatorics, Graph Theory and Applications, Sep 2009, France. 34, pp.199-205, 2009. <hal-00401603>
  • Mickael Montassier. Adaptive choosability of planar graphs. Seminar Colorings '08, Jan 2008, Taiwan. <hal-00401707>
  • Mickael Montassier, Pascal Ochem, Alexandre Pinlou. Strong Oriented Chromatic Number of Planar Graphs without Cycles of Specific Lengths. LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile. 30, pp.27-32, 2007, Electronic Notes in Discrete Mathematics. <http://www.dii.uchile.cl/~lagos07>. <10.1016/j.endm.2008.01.006>. <lirmm-00196741>
  • Mickael Montassier. Acyclic choosability of graphs: A survey. CS06, Sixth Czech-Slovak International Symposium on Combinatorics, Jul 2006, Czech Republic. <hal-00353650>
  • Daniel Gonçalves, Mickael Montassier. Acyclic choosability of graphs with small maximum degree. WG 2005, 2005, France. D. Kratsch, 3787, pp.239--248, 2005. <hal-00307782>
  • Louis Esperet, Mickael Montassier, André Raspaud. Linear choosability of graphs. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.99-104, 2005, DMTCS Proceedings. <hal-01184391>
  • Fabrice Bazzaro, Mickael Montassier. Assignation de fréquences et étiquetage (d,1)-total dans les topologies planaires. 6ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2004), May 2004, France. pp.27--31, 2004. <hal-00307863>
  • Mickaël Montassier, Pascal Ochem, André Raspaud. On the acyclic choosability of graphs. GT: Graph Theory, 2004, Paris, France. 2004. <lirmm-01264370>
  • Mickael Montassier. Observability of recursive clique-trees. Eurocomb03. European conference on Combinatorics, Graph Theory and Applications, Sep 2003, Czech Republic. pp.275--279, 2003. <hal-00307133>
  • Jean-Claude Bermond, Olivier Delmas, Frédéric Havet, Mickael Montassier, Stéphane Pérennes. Réseaux de télécommunication minimaux embarqués tolérants aux pannes. 5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2003), May 2003, France. pp.27--32, 2003. <hal-00307610>

Chapitre d'ouvrage1 document

  • Mickael Montassier. Acyclic 4-choosability of planar graphs with girth at least 5. Trends in Mathematics: Graph Theory in Paris, Birkhäuser Basel, pp.299-310, 2007, <10.1007/978-3-7643-7400-6>. <hal-00353647>