Contact Info

Email : goncalves [at] lirmm.fr

Tel : +33 (0)4 67 41 86 05

Office n° E.3.21

LIRMM (CNRS and Université Montpellier 2)

161 rue Ada, 34392 Montpellier Cedex 05, France.

Sujet de thèse : Étude des graphes "Linkless Embeddable"

Articles

  • Coloring a set of touching strings (with L.Esperet and A. Labourel) EuroComb '09.
  • Spanning galaxies in digraphs (with F. Havet, A. Pinlou and S. Thomassé) EuroComb '09.
  • Every planar graph is the intersection graph of segments in the plane. (with J. Chalopin) STOC 2009.
  • Diamond-free Circle Graphs are Helly Circle. (with J. Daligault and M. Rao) Discrete Math. 310 (4), 845-849, 2010.
  • On Vertex Partitions and some Minor-Monotone Parameters. accepted to J. of Graph Theory.
  • On star and caterpillar arboricity. (with P. Ochem) Discrete Math. 309 (11), 3694--3702, 2009.
  • A Planar linear hypergraph whose edges cannot be represented as straight line segments. Eur. J. Combin. 30, 280-282, 2009.
  • Covering planar graphs with forests, one having bounded maximum degree. J. Combin. Theory Ser. B 99, 314-322, 2009.
  • On the L(p,1)-labelling of graphs. Discrete Math. 308 (8), 1405-1414, 2008.
  • Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs. (with J. Bang-Jensen and I.L. Gørtz) Discrete Optimization 4 (3-4), 334-348, 2007.
  • Caterpillar arboricity of planar graphs. Discrete Math. 307 (16), 2112-2121, 2007.
  • Planar graphs are in 1-STRING. (with J. Chalopin and P. Ochem) SODA '07.
  • On graph classes defined by overlap and intersection models. (with J. Chalopin and P. Ochem) CS '06.
  • Edge Partition of Planar Graphs into Two Outerplanar Graphs. STOC '05.
  • Acyclic choosability of graphs with small maximum degree. (with M. Montassier) WG '05.
  • On Oriented Labelling Parameters. (with A. Raspaud and M.A. Shalu) Formal Models, Languages and Applications, Series in Machine Perception and artificial Intelligence Vol. 66, World Scientific, Singapore. Chap. 3, p. 34-45.