Skip to Main content
Number of documents

49

Alexandre Pinlou


Since September 2017, I am full professor at Polytech Montpellier, engineering school of the university of Montpellier. From 2008 to 2017, I was associate professor (maître de conférences) at the MIAp department of the university Paul-Valéry, Montpellier 3.

I am member of the Algorithms on Graphs & Combinatorics group of the LIRMM

A short curriculum vitae is available here.

For more details about researches, see Research Activities.
For more details about teachings, see Teaching Activities.


Journal articles32 documents

  • Janusz Dybizbański, Pascal Ochem, Alexandre Pinlou, Andrzej Szepietowski. Oriented cliques and colorings of graphs with low maximum degree. Discrete Mathematics, Elsevier, 2020, 343 (5), pp.#111829. ⟨10.1016/j.disc.2020.111829⟩. ⟨lirmm-02938614⟩
  • Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou. Acyclic coloring of graphs and entropy compression method. Discrete Mathematics, Elsevier, 2020, 343 (4), pp.#111772. ⟨10.1016/j.disc.2019.111772⟩. ⟨lirmm-02938618⟩
  • Borut Lužar, Martina Mockovčiaková, Pascal Ochem, Alexandre Pinlou, Roman Sotak. On non-repetitive sequences of arithmetic progressions: The cases k ∈ { 4 , 5 , 6 , 7 , 8 }. Discrete Applied Mathematics, Elsevier, 2020, 279, pp.106-117. ⟨10.1016/j.dam.2019.10.013⟩. ⟨lirmm-02349883⟩
  • François Dross, Mickaël Montassier, Alexandre Pinlou. Large induced forests in planar graphs with girth 4. Discrete Applied Mathematics, Elsevier, 2019, 254, pp.96-106. ⟨10.1016/j.dam.2018.06.029⟩. ⟨lirmm-02021020⟩
  • Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou. Homothetic triangle representations of planar graphs. Journal of Graph Algorithms and Applications, Brown University, 2019, 23 (4), pp.745-753. ⟨10.7155/jgaa.00509⟩. ⟨lirmm-02407930⟩
  • François Dross, Mickael Montassier, Alexandre Pinlou. A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. Discrete Mathematics, Elsevier, 2019, 342 (4), pp.943-950. ⟨10.1016/j.disc.2018.11.023⟩. ⟨lirmm-02010775⟩
  • François Dross, Mickaël Montassier, Alexandre Pinlou. Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree. The Electronic Journal of Combinatorics, Open Journal Systems, 2018, 25 (1), pp.#P1.45. ⟨lirmm-01730269⟩
  • Borut Lužar, Pascal Ochem, Alexandre Pinlou. On repetition thresholds of caterpillars and trees of bounded degree. The Electronic Journal of Combinatorics, Open Journal Systems, 2018, 25 (1), pp.#P1.61. ⟨lirmm-01730276⟩
  • Marthe Bonamy, Martin Knor, Borut Lužar, Alexandre Pinlou, Riste Škrekovski. On the difference between the Szeged and the Wiener index. Applied Mathematics and Computation, Elsevier, 2017, 312, pp.202-213. ⟨10.1016/j.amc.2017.05.047⟩. ⟨lirmm-01730264⟩
  • 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, 66, pp.81-94. ⟨10.1016/j.ejc.2017.06.014⟩. ⟨lirmm-01430784⟩
  • Pascal Ochem, Alexandre Pinlou, Sagnik Sen. Homomorphisms of 2-edge-colored triangle-free planar graphs. Journal of Graph Theory, Wiley, 2017, 85 (1), pp.258-277. ⟨10.1002/jgt.22059⟩. ⟨lirmm-01376130⟩
  • 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, 214, pp.99-107. ⟨lirmm-01375448⟩
  • Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, 17 (3), pp.131-146. ⟨lirmm-01347027v2⟩
  • Pascal Ochem, Alexandre Pinlou. Application of entropy compression in pattern avoidance. The Electronic Journal of Combinatorics, Open Journal Systems, 2014, 21 (2), pp.1-12. ⟨lirmm-01233448⟩
  • Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable. Discrete Mathematics, Elsevier, 2014, 317, pp.19-32. ⟨10.1016/j.disc.2013.10.022⟩. ⟨lirmm-01233453⟩
  • Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. List coloring the square of sparse graphs with large degree. European Journal of Combinatorics, Elsevier, 2014, 41, pp.128-137. ⟨10.1016/j.ejc.2014.03.006⟩. ⟨lirmm-01233445⟩
  • Pascal Ochem, Alexandre Pinlou. Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Graphs and Combinatorics, Springer Verlag, 2014, 30 (2), pp.439-453. ⟨10.1007/s00373-013-1283-2⟩. ⟨lirmm-00780910⟩
  • Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. 2-Distance Coloring of Sparse Graphs. Journal of Graph Theory, Wiley, 2014, 77 (3), pp.190-218. ⟨10.1002/jgt.21782⟩. ⟨lirmm-01233451⟩
  • Daniel Gonçalves, Aline Parreau, Alexandre Pinlou. Locally identifying coloring in bounded expansion classes of graphs. Discrete Applied Mathematics, Elsevier, 2013, 161 (18), pp.2946-2951. ⟨10.1016/j.dam.2013.07.003⟩. ⟨hal-00768472v2⟩
  • 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. ⟨10.1002/jgt.21659⟩. ⟨lirmm-00736468⟩
  • Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. On Spanning Galaxies in Digraphs. Discrete Applied Mathematics, Elsevier, 2012, 160 (6), pp.744-754. ⟨10.1016/j.dam.2011.07.013⟩. ⟨hal-00749191⟩
  • Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou. Triangle Contact Representations and Duality. Discrete and Computational Geometry, Springer Verlag, 2012, 48 (1), pp.239-254. ⟨lirmm-00715024⟩
  • Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé. The Domination Number of Grids. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2011, 25, pp.1443-1453. ⟨lirmm-00569256⟩
  • Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena. Homomorphisms of 2-edge-colored graphs. Discrete Applied Mathematics, Elsevier, 2010, 158 (12), pp.1365-1379. ⟨10.1016/j.dam.2009.09.017⟩. ⟨lirmm-00433039⟩
  • Louigi Addario-Berry, Louis Esperet, Ross Kang, Colin Mcdiarmid, Alexandre Pinlou. Acyclic improper colourings of graphs with bounded maximum degree. Discrete Mathematics, Elsevier, 2010, 310 (2), pp.223-229. ⟨10.1016/j.disc.2008.09.009⟩. ⟨lirmm-00433038⟩
  • Alexandre Pinlou. An Oriented Coloring of Planar Graphs with Girth at Least Five. Discrete Mathematics, Elsevier, 2009, 309, pp.2108-2118. ⟨10.1016/j.disc.2008.04.030⟩. ⟨lirmm-00371599⟩
  • 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⟩
  • Pascal Ochem, Alexandre Pinlou. Oriented Colorings of Partial 2-trees. Information Processing Letters, Elsevier, 2008, 108, pp.82-86. ⟨10.1016/j.ipl.2008.04.007⟩. ⟨lirmm-00314715⟩
  • Pascal Ochem, Alexandre Pinlou, Eric Sopena. On the Oriented Chromatic Index of Oriented Graphs. Journal of Graph Theory, Wiley, 2008, 57 (4), pp.313--332. ⟨10.1002/jgt.20286⟩. ⟨lirmm-00195956⟩
  • Alexandre Pinlou, Eric Sopena. Oriented vertex and arc colorings of outerplanar graphs. Information Processing Letters, Elsevier, 2006, 100, pp.97-104. ⟨hal-00307093⟩
  • Alexandre Pinlou. On oriented arc-coloring of subcubic graphs. The Electronic Journal of Combinatorics, Open Journal Systems, 2006, 13, pp.131. ⟨hal-00307094⟩
  • Alexandre Pinlou, Eric Sopena. The acircuitic directed star arboricity of subcubic graphs is at most four. Discrete Mathematics, Elsevier, 2006, 306, pp.3281--3289. ⟨hal-00307095⟩

Conference papers16 documents

  • Fabien Jacques, Mickaël Montassier, Alexandre Pinlou. The chromatic number and switching chromatic number of 2-edge-colored graphs of bounded degree. 5th Bordeaux Graph Workshop (BGW), Oct 2019, Bordeaux, France. ⟨lirmm-02938635⟩
  • Hoang La, Mickaël Montassier, Alexandre Pinlou, Petru Valicov. r-hued coloring of planar graphs with girth at least 8. 5th Bordeaux Graph Workshop (BGW), Oct 2019, Bordeaux, France. ⟨lirmm-02938645⟩
  • 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. ⟨lirmm-01430813⟩
  • Borut Lužar, Martina Mockovčiaková, Pascal Ochem, Alexandre Pinlou, Roman Soták. On a conjecture on k-Thue sequences. BGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France. ⟨lirmm-01730302⟩
  • François Dross, Mickaël Montassier, Alexandre Pinlou. Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.269-275, ⟨10.1016/j.endm.2015.06.037⟩. ⟨lirmm-01233461⟩
  • Alexandre Pinlou. La méthode de compression d'entropie appliquée aux colorations de graphes. Journées Graphes et Algorithmes, Nov 2014, Dijon, France. ⟨lirmm-01377063⟩
  • 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. ⟨lirmm-01233456⟩
  • Pascal Ochem, Alexandre Pinlou. Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. LAGOS'11: VI Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. pp.123-128, ⟨10.1016/j.endm.2011.05.022⟩. ⟨lirmm-00530543⟩
  • Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. 2-distance coloring of sparse graphs. Eurocomb'11: European Conference on Combinatorics, Graph Theory and Applications, Aug 2011, Budapest, Hungary. pp.155-160, ⟨10.1016/j.endm.2011.09.027⟩. ⟨lirmm-00782852⟩
  • Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou. Triangle Contact Representations and Duality. GD'10: Graph Drawing, Sep 2011, Konstanz, Germany. pp.262-273, ⟨10.1007/978-3-642-18469-7_24⟩. ⟨lirmm-00620728⟩
  • Amanda Montejano, Alexandre Pinlou, André Raspaud, Eric Sopena. The chromatic number of sparse colored mixed graphs. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.363-367, ⟨10.1016/j.endm.2009.07.060⟩. ⟨hal-00409025⟩
  • Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. Spanning galaxies in digraphs. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.139-143, ⟨10.1016/j.endm.2009.07.023⟩. ⟨lirmm-00433050⟩
  • 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. pp.27-32, ⟨10.1016/j.endm.2008.01.006⟩. ⟨lirmm-00196741⟩
  • Pascal Ochem, Alexandre Pinlou. Oriented vertex and arc-colorings of partial 2-trees. Eurocomb07 - European Conference on Combinatorics, Graph Theory and Applications, Sep 2007, Spain. pp.195--199. ⟨hal-00307125⟩
  • Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena. Homomorphisms of 2-Edge-Colored Graphs. IV Latin American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile, pp.33-38, ⟨10.1016/j.endm.2008.01.007⟩. ⟨lirmm-00196757⟩
  • Louis Esperet, Alexandre Pinlou. Acyclic improper choosability of graphs. CS06 - Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Jul 2006, Slovakia. pp.251--258. ⟨hal-00307157⟩

Habilitation à diriger des recherches1 document

  • Alexandre Pinlou. Some Problems in Graph Coloring: Methods, Extensions and Results. Discrete Mathematics [cs.DM]. Université montpellier II, 2014. ⟨tel-01376199⟩