Accéder directement au contenu

Alexandre Pinlou

16
Documents

Présentation

Since September 2017, I am full professor at [Polytech Montpellier](http://www.polytech-montpellier.fr), engineering school of the [university of Montpellier](http://www.umontpellier.fr). From 2008 to 2017, I was associate professor (maître de conférences) at the [MIAp ](http://www.univ-montp3.fr/miap/ens/site/pmwiki.php?n=Main.HomePage)department of the [university Paul-Valéry, Montpellier 3](http://www.univ-montp3.fr). I am member of the [Algorithms on Graphs & Combinatorics](http://www.lirmm.fr/algco) group of the [LIRMM](http://www.lirmm.fr). A short curriculum vitae is available [here](http://www.lirmm.fr/%7Epinlou/curriculum-vitae/ "Curriculum vitae"). For more details about researches, see [Research Activities](http://www.lirmm.fr/%7Epinlou/research-activities/ "Research activities"). For more details about teachings, see [Teaching Activities](http://www.lirmm.fr/%7Epinlou/teaching-activities/ "Teaching activites").

Publications

mickael-montassier

The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree

Christopher Duffy , Fabien Jacques , Mickaël Montassier , Alexandre Pinlou
Discrete Mathematics, 2023, 346 (10), pp.113579. ⟨10.1016/j.disc.2023.113579⟩
Article dans une revue lirmm-04227159v1
Image document

$r$-hued ( r + 1 ) -coloring of planar graphs with girth at least 8 for $r$ ≥ 9

Xuan Hoang La , Mickaël Montassier , Alexandre Pinlou , Petru Valicov
European Journal of Combinatorics, 2021, 91, pp.#103219. ⟨10.1016/j.ejc.2020.103219⟩
Article dans une revue lirmm-03475125v1
Image document

Acyclic coloring of graphs and entropy compression method

Daniel Gonçalves , Mickaël Montassier , Alexandre Pinlou
Discrete Mathematics, 2020, 343 (4), pp.#111772. ⟨10.1016/j.disc.2019.111772⟩
Article dans une revue lirmm-02938618v1
Image document

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs

François Dross , Mickaël Montassier , Alexandre Pinlou
Discrete Mathematics, 2019, 342 (4), pp.943-950. ⟨10.1016/j.disc.2018.11.023⟩
Article dans une revue lirmm-02010775v1
Image document

Large induced forests in planar graphs with girth 4

François Dross , Mickaël Montassier , Alexandre Pinlou
Discrete Applied Mathematics, 2019, 254, pp.96-106. ⟨10.1016/j.dam.2018.06.029⟩
Article dans une revue lirmm-02021020v1
Image document

Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree

François Dross , Mickaël Montassier , Alexandre Pinlou
The Electronic Journal of Combinatorics, 2018, 25 (1), pp.#P1.45. ⟨10.37236/6815⟩
Article dans une revue lirmm-01730269v1

Partitioning a triangle-free planar graph into a forest and a forest of bounded degree

François Dross , Mickaël Montassier , Alexandre Pinlou
European Journal of Combinatorics, 2017, 66, pp.81-94. ⟨10.1016/j.ejc.2017.06.014⟩
Article dans une revue lirmm-01430784v1

A lower bound on the order of the largest induced forest in planar graphs with high girth

François Dross , Mickaël Montassier , Alexandre Pinlou
Discrete Applied Mathematics, 2016, 214, pp.99-107. ⟨10.1016/j.dam.2016.06.011⟩
Article dans une revue lirmm-01375448v1

A Complexity Dichotomy for the Coloring of Sparse Graphs

Louis Esperet , Mickaël Montassier , Pascal Ochem , Alexandre Pinlou
Journal of Graph Theory, 2013, 73 (1), pp.85-102. ⟨10.1002/jgt.21659⟩
Article dans une revue lirmm-00736468v1
Image document

Strong Oriented Chromatic Number of Planar Graphs without Short Cycles

Mickaël Montassier , Pascal Ochem , Alexandre Pinlou
Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 1 (1), pp.1-24. ⟨10.46298/dmtcs.418⟩
Article dans une revue lirmm-00184811v1
Image document

r-hued coloring of planar graphs with girth at least 8

Hoang La , Mickaël Montassier , Alexandre Pinlou , Petru Valicov
BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France
Communication dans un congrès lirmm-02938645v1
Image document

The chromatic number and switching chromatic number of 2-edge-colored graphs of bounded degree

Fabien Jacques , Mickaël Montassier , Alexandre Pinlou
BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France
Communication dans un congrès lirmm-02938635v1

Partitioning sparse graphs into an independent set and a forest of bounded degree

François Dross , Mickaël Montassier , Alexandre Pinlou
BGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France
Communication dans un congrès lirmm-01430813v1

Partitioning a triangle-free planar graph into a forest and a forest of bounded degree

François Dross , Mickaël Montassier , Alexandre Pinlou
EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.269-275, ⟨10.1016/j.endm.2015.06.037⟩
Communication dans un congrès lirmm-01233461v1
Image document

Entropy compression method applied to graph colorings

Daniel Gonçalves , Mickaël Montassier , Alexandre Pinlou
ICGT: International Colloquium on Graph Theory and Combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès lirmm-01233456v1

Strong Oriented Chromatic Number of Planar Graphs without Cycles of Specific Lengths

Mickael Montassier , Pascal Ochem , Alexandre Pinlou
LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile. pp.27-32, ⟨10.1016/j.endm.2008.01.006⟩
Communication dans un congrès lirmm-00196741v1