LIRMM     Université Montpellier 3

Group Algorithms, Graphs and Combinatorics
Seminars

LIRMM
161 rue Ada
34095 Montpellier Cedex 5

email: Alexandre.Pinlou@lirmm.fr
Tel: +33 (0) 4 67 41 85 44
Fax: +33 (0) 4 67 41 85 00
Room: E318

Version française      English version

Last Modif: October 18, 2008 at 20:06

Home Page


Curriculum Vitae


Research

Publications

Research topics

Useful links


Teachings (in french)

2011 - 2012

  • Associate professor UFR 4 Montpellier 3

2010 - 2011

  • Associate professor UFR 4 Montpellier 3

2009 - 2010

  • Associate professor UFR 4 Montpellier 3

Précédents ...


Valid XHTML 1.0 Transitional CSS Valide !


International journals with program committee

  1. A complexity dichotomy for the coloring of sparse graphs. L. Esperet, M. Montassier, P. Ochem et A. Pinlou. J. Graph Theory, to appear, 2012. (pdf submitted version) (abstr) (bib)

  2. Triangle contact representations and duality. D. Gonçalves, B. Lévêque et A. Pinlou. Discrete and Computational Geometry, 48(1):239-254, 2012. (www) (abstr) (bib)

  3. The Domination Number of Grids. D. Gonçalves, A. Pinlou, M. Rao et S. Thomassé. SIAM J. Discrete Math., 25:1443-1453, 2011. (www) (pdf submitted version) (abstr) (bib)

  4. On spanning galaxies in digraphs. D. Gonçalves, F. Havet, A. Pinlou et S. Thomassé. Discrete Appl. Math., To appear, 2011. (www) (pdf submitted version) (abstr) (bib)

  5. Homomorphisms of 2-edge-colored graphs. A. Montejano, P. Ochem, A. Pinlou, A. Raspaud et É. Sopena. Discrete Appl. Math., 158(12):1365-1379, 2010. (www) (pdf submitted version) (abstr) (bib)

  6. Acyclic improper colourings of graphs with bounded maximum degree. L. Addario-Berry, L. Esperet, R.J. Kang, C.J.H McDiarmid et A. Pinlou. Discrete Math., 310(2):223 - 229, 2010. (Selected Papers from the 21st British Combinatorial Conference). (www) (pdf submitted version) (abstr) (bib)

  7. An oriented coloring of planar graphs with girth at least five. A. Pinlou. Discrete Math., 309(8):2108 - 2118, 2009. (www) (pdf submitted version) (abstr) (bib)

  8. Oriented colorings of partial 2-trees. P. Ochem et A. Pinlou. Inform. Process. Lett., 108:82-86, 2008. (www) (pdf submitted version) (abstr) (bib)

  9. On the oriented chromatic index of oriented graphs. P. Ochem, A. Pinlou et É. Sopena. J. Graph Theory, 57(4):313-332, 2008. (www) (pdf submitted version) (abstr) (bib)

  10. Strong oriented chromatic number of planar graphs without short cycles. M. Montassier, P. Ochem et A. Pinlou. Discrete Math. Theoret. Comput. Sci., 10(1):1-24, 2008. (www) (pdf submitted version) (abstr) (bib)

  11. Oriented vertex and arc colorings of outerplanar graphs. A. Pinlou et É. Sopena. Inform. Process. Lett., 100(3):97-104, 2006. (www) (pdf submitted version) (abstr) (bib)

  12. The acircuitic directed star arboricity of subcubic graphs is at most four. A. Pinlou et É. Sopena. Discrete Math., 306(24):3281-3289, 2006. (www) (pdf submitted version) (abstr) (bib)

  13. On oriented arc-coloring of subcubic graphs. A. Pinlou. Elect. J. Comb., 13(1):1-13, 2006. (www) (pdf submitted version) (abstr) (bib)

International conferences with program committee and proceedings

  1. Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. P. Ochem et A. Pinlou. In VI Latin-American Algorithms, Graphs and Optimization Symposium, Bariloche, Argentina, 28 march - 01 april 2011. Vol. 37 of Elect. Notes in Discrete Math., pages 123-128, 2011. (www) (abstr) (bib)

  2. 2-distance coloring of sparse graphs. M. Bonamy, B. Lévêque et A. Pinlou. In European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, Budapest, Hongrie, 29 september - 02 october 2011. Vol. to appear of Elect. Notes in Discrete Math., 2011. (abstr) (bib)

  3. Triangle contact representations and duality. D. Gonçalves, B. Lévêque et A. Pinlou. In Graph Drawing, Konstanz, Germany, September 21-24, 2010. Vol. 6502 of Lecture Notes in Computer Science, pages 262-273, 2010. (www) (abstr) (bib)

  4. Spanning galaxies in digraphs. D. Gonçalves, F. Havet, A. Pinlou et S. Thomassé. In European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2009, Bordeaux, France, 7-11 september 2009. Vol. 34 of Elect. Notes in Discrete Math., pages 134-137, 2009. (www) (abstr) (bib)

  5. Chromatic number of sparse colored mixed planar graphs. A. Montejano, A. Pinlou, A. Raspaud et É. Sopena. In European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2009, Bordeaux, France, 7-11 september 2009. Vol. 34 of Elect. Notes in Discrete Math., pages 363-367, 2009. (www) (abstr) (bib)

  6. Homomorphisms of 2-edge-colored graphs. A. Montejano, P. Ochem, A. Pinlou, A. Raspaud et É. Sopena. In IV Latin-American Algorithms, Graphs and Optimization Symposium, Puerto Varas, Chili, 25-29 november 2007. Vol. 30 of Elect. Notes in Discrete Math., pages 33-38, 2008. (www) (abstr) (bib)

  7. Strong oriented chromatic number of planar graphs without cycles of specifics lengths. M. Montassier, P. Ochem et A. Pinlou. In IV Latin-American Algorithms, Graphs and Optimization Symposium, Puerto Varas, Chili, 25-29 november 2007. Vol. 30 of Elect. Notes in Discrete Math., pages 27-32, 2008. (www) (abstr) (bib)

  8. Acyclic improper choosability of graphs. L. Esperet et A. Pinlou. In Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, Czech Republic, 10-15 juillet 2006. Vol. 28 of Elect. Notes in Discrete Math., pages 251-258, 2007. (www) (abstr) (bib)

  9. Oriented vertex and arc colorings of partial 2-trees. P. Ochem et A. Pinlou. In European Conference on Combinatorics, Graph Theory and Applications (EuroComb '07), Sévilla, Spain, 11-15 september 2007. Vol. 29 of Elect. Notes in Discrete Math., pages 195-199, 2007. (www) (bib)

Submitted papers in journals

  1. 2-distance coloring of sparse graphs. M. Bonamy, B. Lévêque et A. Pinlou. Research Report, 2012. (Submitted). (abstr) (bib)

  2. Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. P. Ochem et A. Pinlou. Research Report, 2011. (Submitted). (abstr) (bib)

International meetings / International communications

  1. Acyclic $t$-improper colourings of graphs with bounded maximum degree. L. Addario-Berry, L. Esperet, R. J. Kang, C. J. H. McDiarmid et A. Pinlou. In The 2007 British Combinatorial Conference, Readings, UK, 8-13 july 2007. (Full version published in Discrete Math.). (www) (abstr)

  2. Oriented Chromatic Index of Oriented Graphs. P. Ochem, A. Pinlou et É. Sopena. In Proceedings of the Last COMBSTRU Workshop, Prague, Czech Republic, 10-12 march 2006. (www) (abstr)

  3. Oriented vertex and arc colorings of outerplanar graphs. A. Pinlou et É. Sopena. In Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, Czech Republic, 10-15 juillet 2006. (Full version published in Inform. Process. Lett.). (www) (abstr)

  4. Some problems on oriented coloring. A. Pinlou. In Last COMBSTRU Meeting, Barcelona, Spain, 25--27 september 2006. (www)

  5. Acircuitic directed star arboricity of cubic graphs, k4 minor-free graphs and planar graphs. A. Pinlou et É. Sopena. In COMBSTRU meeting, University of Oxford, UK, 11--13 avril 2005. (www)

National meeting

  1. Coloration orientée des graphes planaires de maille 5. A. Pinlou. In 9ème Journées Graphes et Algorithmes, Paris, France, 8-9 november 2007. (www)

  2. Arc et sommet colorations orientées des graphes planaires extérieurs. A. Pinlou et É. Sopena. In 8ème Journées Graphes et Algorithmes, Orléans, France, 9 - 10 november 2006. (www)

  3. Coloration impropre acyclique. L. Esperet, R. J. Kang, C. J. H. McDiarmid et A. Pinlou. In 8ème Journées Graphes et Algorithmes, Orléans, France, 9 - 10 november 2006. (www)

  4. Arc-coloration orientée. P. Ochem, A. Pinlou et É. Sopena. In 7ème Journées Graphes et Algorithmes, Bordeaux, France, 03-04 novembre 2005. Vol. RR-1372-05 of Internal reports of the LaBRI, pages 51-54. (www)

  5. Étoile arboricité orientée acircuitique. A. Pinlou et É. Sopena. In 6ème Journées Graphes et Algorithmes, Grenoble, France, 29, 30 september & 1er october 2004. Vol. 114 of Les Cahiers du Laboratoire Leibniz, pages 83-85.

Research visits in foreign universities

PhD thesis

Oriented arc-colorings and oriented vertex-colorings of graphs (in french)
Under supervision of Éric Sopena
Defended at LaBRI, October 27th, 2006
Thesis : pdf -- ps

Research reports

  1. An oriented coloring of graphs with maximum average degree less than 10/3. A. Pinlou. Research Report RR-07024, LIRMM, Université Montpellier 2, Nov. 2007. (www) (bib)

  2. Acyclic improper choosability of outerplanar graphs. L. Esperet et A. Pinlou. Research Report RR-1405-06, LaBRI, Université Bordeaux 1, may 2006. (www) (bib)

  3. The acircuitic directed star arboricity of planar graphs with large grith. A. Pinlou et É. Sopena. Research Report RR-1371-05, LaBRI, Université Bordeaux 1, 2005. (www) (bib)

Seminars

  • Colorations orientées des graphes planaires
    LaBRI, Université Bordeaux 1
    Seminar "Graphes & Algorithmes"
    January 11th, 2008
  • Colorations orientées des graphes planaires
    LIRMM, University of Montpellier 2
    Seminar "Visualisation et Algorithmes de graphes"
    September 27th, 2007
  • Colorations orientées de graphes
    Institut Fourier, University of Grenoble
    Seminar "Mathématiques Discretes"
    April 12th, 2007
  • Colorations orientées de graphes
    LIFO, Université d'Orléans
    Seminar of the LIFO
    April 10th, 2007
  • Oriented arc-coloring
    University of Oxford, UK
    Junior combinatorics seminar
    February 21th, 2006
  • Arc-coloration orientée (suite & fin)
    LaBRI, Université Bordeaux 1
    Seminar "Graphes & Algorithmes"
    December 16th, 2005
  • Arc-coloration orientée
    LaBRI, Université Bordeaux 1
    Seminar "Graphes & Algorithmes"
    Decembrer 9th, 2005
  • Acircuitic directed star arboricity
    University Comenius of Bratislava, Slovaquia
    Seminar of theoretical computer science
    November 4th, 2004
  • Étoile-arboricité orientée acircuitique
    LaBRI, Université Bordeaux 1
    Seminar "Graphes & Algorithmes"
    March 26th, 2004