Mickael Montassier
86
Documents
Presentation
**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)](http://www.lirmm.fr/) as full professor in the group [« Algorithms for Graphs and Combinatorics »](http://www2.lirmm.fr/algco/). My research interests include graph colorings (list-colorings, oriented colorings, group-coloring, labeling), structures (vertex partition,...) and design of fault tolerant networks...
**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)](http://www.lirmm.fr/) as full professor in the group [« Algorithms for Graphs and Combinatorics »](http://www2.lirmm.fr/algco/). My research interests include graph colorings (list-colorings, oriented colorings, group-coloring, labeling), structures (vertex partition,...) and design of fault tolerant networks...
Publications
|
r-hued coloring of planar graphs with girth at least 8BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France
Conference papers
lirmm-02938645v1
|
|
The chromatic number and switching chromatic number of 2-edge-colored graphs of bounded degreeBGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France
Conference papers
lirmm-02938635v1
|
Partitioning sparse graphs into an independent set and a forest of bounded degreeBGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France
Conference papers
lirmm-01430813v1
|
|
Vertex-partitions of graphsICGCA: International Conference on Graph theory, Combinatorics and their Applications, Oct 2016, Jinhua, China
Conference papers
lirmm-01430816v1
|
|
Partitioning a triangle-free planar graph into a forest and a forest of bounded degreeEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.269-275, ⟨10.1016/j.endm.2015.06.037⟩
Conference papers
lirmm-01233461v1
|
|
|
Entropy compression method applied to graph coloringsICGT: International Colloquium on Graph Theory and Combinatorics, Jun 2014, Grenoble, France
Conference papers
lirmm-01233456v1
|
Contact Representations of Planar Graphs: Extending a Partial Representation is HardWG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2014, Nouan-le-fuzelier, France. pp.139-151, ⟨10.1007/978-3-319-12340-0_12⟩
Conference papers
lirmm-01264271v1
|
|
Entropy compression method and graph coloring problemsC&C: Cycles and Colourings, 2014, Novy Smokovec, Slovakia
Conference papers
lirmm-01264376v1
|
|
Strong chromatic index of planar graphs with large girthEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy. pp.265-270, ⟨10.1007/978-88-7642-475-5_43⟩
Conference papers
hal-00920842v1
|
|
Limits of near-coloring of sparse graphs2012 International Conference on Graph Theory, Combinatorics and Applications, Oct 2012, Zhejiang, China
Conference papers
lirmm-00782851v1
|
|
A note on strong edge-colouringBordeaux Graph Workshop 2012, 2012, Bordeaux, France
Conference papers
lirmm-01264278v1
|
|
Le problème des 3 couleurs et la conjecture de SteinbergJGA2011, Journées Graphes et Algorithmes, 2011, Lyon, France
Conference papers
lirmm-01264382v1
|
|
Covering a graph by forests and a matchingCanaDAM 2011, 2011, Victoria, Canada
Conference papers
lirmm-01264297v1
|
|
Minmax degree of graphs (Extended abstract)The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 2011, Budapest, Hungary. ⟨10.1016/j.endm.2011.09.042⟩
Conference papers
lirmm-01264283v1
|
|
Decomposing a graph into forests8FCC, 2010, Orsay, France
Conference papers
lirmm-01264344v1
|
|
Decomposition of sparse graphs, with applications to game coloring numberSeminar on Graph Theory, 2010, Kaohsiung, Taiwan
Conference papers
lirmm-01264386v1
|
|
Generalized power domination8FCC, 2010, Orsay, France
Conference papers
lirmm-01264351v1
|
|
Identifying colorings of graphs8FCC, 2010, Orsay, France
Conference papers
lirmm-01264347v1
|
|
Acyclic choosability of planar graphs : a Steinberg like approachEuroComb'09, European conference on Combinatorics, Graph Theory and Applications, Sep 2009, France. pp.199-205
Conference papers
hal-00401603v1
|
|
The 3-Color Problem2009 Workshop on Graph Theory, Jan 2009, Taiwan
Conference papers
hal-00401708v1
|
|
Adaptive choosability of planar graphsSeminar Colorings '08, Jan 2008, Taiwan
Conference papers
hal-00401707v1
|
|
Strong Oriented Chromatic Number of Planar Graphs without Cycles of Specific LengthsLAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile. pp.27-32, ⟨10.1016/j.endm.2008.01.006⟩
Conference papers
lirmm-00196741v1
|
|
Acyclic choosability of graphs: A surveyCS06, Sixth Czech-Slovak International Symposium on Combinatorics, Jul 2006, Czech Republic
Conference papers
hal-00353650v1
|
|
|
Linear choosability of graphs2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.99-104, ⟨10.46298/dmtcs.3434⟩
Conference papers
hal-01184391v1
|
Acyclic choosability of graphs with small maximum degreeWG 2005, 2005, France. pp.239--248
Conference papers
hal-00307782v1
|
|
Assignation de fréquences et étiquetage (d,1)-total dans les topologies planaires6ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2004), May 2004, France. pp.27--31
Conference papers
hal-00307863v1
|
|
On the acyclic choosability of graphsGT: Graph Theory, 2004, Paris, France
Conference papers
lirmm-01264370v1
|
|
|
Réseaux de télécommunication minimaux embarqués tolérants aux pannes5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2003), May 2003, Banyuls, France. pp.27--32
Conference papers
hal-00307610v1
|
Observability of recursive clique-treesEurocomb03. European conference on Combinatorics, Graph Theory and Applications, Sep 2003, Czech Republic. pp.275--279
Conference papers
hal-00307133v1
|
Acyclic 4-choosability of planar graphs with girth at least 5Trends in Mathematics: Graph Theory in Paris, Birkhäuser Basel, pp.299-310, 2007, ⟨10.1007/978-3-7643-7400-6⟩
Book sections
hal-00353647v1
|