Alexandre Pinlou
54
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
- 5
- 5
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 16
- 16
- 9
- 8
- 7
- 6
- 6
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
The Chromatic Number of Signed Graphs with Bounded Maximum Average DegreeEuroComb 2021 - European Conference on Combinatorics, Graph Theory and Applications, Sep 2021, Barcelone (online), Spain. pp.657-662, ⟨10.1007/978-3-030-83823-2_105⟩
Communication dans un congrès
lirmm-04026746v1
|
|
|
|
r-hued coloring of planar graphs with girth at least 8BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France
Communication dans un congrès
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
Communication dans un congrès
lirmm-02938635v1
|
On a conjecture on k-Thue sequencesBGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France
Communication dans un congrès
lirmm-01730302v1
|
|
Partitioning sparse graphs into an independent set and a forest of bounded degreeBGW: 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 degreeEuroComb: 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
|
|
|
|
Entropy compression method applied to graph coloringsICGT: International Colloquium on Graph Theory and Combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
lirmm-01233456v1
|
La méthode de compression d'entropie appliquée aux colorations de graphesJournées Graphes et Algorithmes, Nov 2014, Dijon, France
Communication dans un congrès
lirmm-01377063v1
|
|
|
|
2-distance coloring of sparse graphsEurocomb'11: European Conference on Combinatorics, Graph Theory and Applications, Aug 2011, Budapest, Hungary. pp.155-160, ⟨10.1016/j.endm.2011.09.027⟩
Communication dans un congrès
lirmm-00782852v1
|
|
|
Plate-forme semi-automatique : E-quitySéminaire national "C2i1 : plan pour la réussite en licence et compétences numériques, Jun 2011, Montpellier, France. 11 p
Communication dans un congrès
hal-03071401v1
|
|
|
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar GraphsLAGOS'11: VI Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. pp.123-128, ⟨10.1016/j.endm.2011.05.022⟩
Communication dans un congrès
lirmm-00530543v1
|
|
|
Triangle Contact Representations and Duality18th International Symposium on Graph Drawing (GD), Sep 2010, Konstanz, Germany. pp.262-273, ⟨10.1007/978-3-642-18469-7_24⟩
Communication dans un congrès
lirmm-00620728v1
|
Spanning galaxies in digraphsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.139-143, ⟨10.1016/j.endm.2009.07.023⟩
Communication dans un congrès
lirmm-00433050v1
|
|
|
|
The chromatic number of sparse colored mixed graphsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.363-367, ⟨10.1016/j.endm.2009.07.060⟩
Communication dans un congrès
hal-00409025v1
|
Homomorphisms of 2-Edge-Colored GraphsIV Latin American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile, pp.33-38, ⟨10.1016/j.endm.2008.01.007⟩
Communication dans un congrès
lirmm-00196757v1
|
|
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⟩
Communication dans un congrès
lirmm-00196741v1
|
|
Oriented vertex and arc-colorings of partial 2-treesEurocomb07 - European Conference on Combinatorics, Graph Theory and Applications, Sep 2007, Spain. pp.195--199
Communication dans un congrès
hal-00307125v1
|
|
Acyclic improper choosability of graphsCS06 - Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Jul 2006, Slovakia. pp.251--258
Communication dans un congrès
hal-00307157v1
|
|
|
Some Problems in Graph Coloring: Methods, Extensions and ResultsDiscrete Mathematics [cs.DM]. Université montpellier II, 2014
HDR
tel-01376199v1
|