Nombre de documents

37

Alexandre Pinlou


Since September 2008, I am associate professor HDR (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. Previously, I was member of the Graphs & Applications group of the LaBRI.

A short curriculum vitae is available here.

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


Article dans une revue24 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〉
  • 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, Vol. 17 no. 3 (3), pp.131-146. 〈lirmm-01347027v2〉
  • 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〉
  • Pascal Ochem, Alexandre Pinlou, Sagnik Sen. Homomorphisms of 2-edge-colored triangle-free planar graphs. Journal of Graph Theory, Wiley, 2016, to appear, 〈10.1002/jgt.22059〉. 〈lirmm-01376130〉
  • 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〉
  • Pascal Ochem, Alexandre Pinlou. Application of entropy compression in pattern avoidance. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2014, 21 (2), pp.1-12. 〈http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p7〉. 〈lirmm-01233448〉
  • Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. Graphs with maximum degree Δ≥17 and maximum average degree less than 33 are list 22-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. 〈http://dx.doi.org/10.1002/jgt.21659〉. 〈10.1002/jgt.21659〉. 〈lirmm-00736468〉
  • 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, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. The spanning galaxy problem. Discrete Applied Mathematics, Elsevier, 2012, 160 (6), pp.744-754. 〈hal-00749191〉
  • 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, 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〉
  • 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〉
  • Alexandre Pinlou. On oriented arc-coloring of subcubic graphs. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 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〉
  • Alexandre Pinlou, Eric Sopena. Oriented vertex and arc colorings of outerplanar graphs. Information Processing Letters, Elsevier, 2006, 100, pp.97-104. 〈hal-00307093〉

Communication dans un congrès12 documents

  • 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〉
  • Alexandre Pinlou. La méthode de compression d'entropie appliquée aux colorations de graphes. Journées Graphes et Algorithmes, Nov 2014, Dijon, France. 2016. 〈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. 9th International colloquium on graph theory and combinatorics, June 30-July 4, 2014, 2014. 〈lirmm-01233456〉
  • 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. Elsevier, 38, pp.155-160, 2011, Electronic Notes in Discrete Mathematics. 〈http://www.renyi.hu/conferences/ec11/〉. 〈10.1016/j.endm.2011.09.027〉. 〈lirmm-00782852〉
  • Pascal Ochem, Alexandre Pinlou. Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Flavia Bonomo, Thomas Liebling, Javier Marenco, Jayme Szwarcfiter, Mario Valencia-Pabon. LAGOS'11: VI Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. 37, pp.123-128, 2011, Electronic Notes in Discrete Mathematics. 〈http://www-2.dc.uba.ar/lagos2011/〉. 〈10.1016/j.endm.2011.05.022〉. 〈lirmm-00530543〉
  • 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, 2011, Lecture Notes in Computer Science. 〈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. Elsevier, 34, pp.363-367, 2009, Electronic Notes in Discrete Mathematics. 〈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. Jaroslav Nešetřil and André Raspaud. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. Elsevier, 34, pp.139-143, 2009, Electronic Notes in Discrete Mathematics. 〈http://eurocomb09.labri.fr/〉. 〈10.1016/j.endm.2009.07.023〉. 〈lirmm-00433050〉
  • 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. 29, pp.195--199, 2007. 〈hal-00307125〉
  • 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〉
  • 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, 30, pp.33-38, 2008, Electronic Notes in Discrete Mathematics. 〈http://www.dii.uchile.cl/~lagos07〉. 〈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. Petr Hlineny, Jan Kratochvil, Roman Nedela and Martin Skoviera, 28, pp.251--258, 2006. 〈hal-00307157〉

HDR1 document

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