On the L (p, 1)-labelling of graphs D Gonçalves Discrete Mathematics 308 (8), 1405-1414, 2008 | 171 | 2008 |

The domination number of grids D Gonçalves, A Pinlou, M Rao, S Thomassé SIAM Journal on Discrete Mathematics 25 (3), 1443-1453, 2011 | 117 | 2011 |

Every planar graph is the intersection graph of segments in the plane J Chalopin, D Gonçalves Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 101 | 2009 |

Triangle contact representations and duality D Gonçalves, B Lévêque, A Pinlou Discrete & Computational Geometry 48 (1), 239-254, 2012 | 49 | 2012 |

Entropy compression method applied to graph colorings D Gonçalves, M Montassier, A Pinlou arXiv preprint arXiv:1406.4380, 2014 | 48 | 2014 |

Edge partition of planar sraphs into two outerplanar graphs D Gonçalves Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 46 | 2005 |

Covering planar graphs with forests, one having bounded maximum degree D Gonçalves Journal of Combinatorial Theory, Series B 99 (2), 314-322, 2009 | 39 | 2009 |

Planar graphs as L-intersection or L-contact graphs D Gonçalves, L Isenmann, C Pennarun Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 31 | 2018 |

Planar graphs have 1-string representations J Chalopin, D Gonçalves, P Ochem Discrete & Computational Geometry 43 (3), 626-647, 2010 | 31 | 2010 |

Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations D Gonçalves, B Lévêque Discrete & Computational Geometry 51 (1), 67-131, 2014 | 30 | 2014 |

Planar graphs are in 1-STRING J Chalopin, D Gonçalves, P Ochem Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007 | 26 | 2007 |

Caterpillar arboricity of planar graphs D Gonçalves Discrete mathematics 307 (16), 2112-2121, 2007 | 24 | 2007 |

Encoding toroidal triangulations V Despré, D Gonçalves, B Lévêque Discrete & Computational Geometry 57 (3), 507-544, 2017 | 19 | 2017 |

On star and caterpillar arboricity D Gonçalves, P Ochem Discrete mathematics 309 (11), 3694-3702, 2009 | 17 | 2009 |

The maximum clique problem in multiple interval graphs MC Francis, D Gonçalves, P Ochem Algorithmica 71 (4), 812-836, 2015 | 16 | 2015 |

Diamond-free circle graphs are Helly circle J Daligault, D Gonçalves, M Rao Discrete Mathematics 310 (4), 845-849, 2010 | 13 | 2010 |

On triangles in K_r-minor free graphs B Albar, D Gonçalves arXiv preprint arXiv:1304.5468, 2013 | 12 | 2013 |

On oriented labelling parameters D Gonçalves, A Raspaud, MA Shalu Formal Models, Languages and Applications, 34-45, 2006 | 12 | 2006 |

Locally identifying coloring in bounded expansion classes of graphs D Gonçalves, A Parreau, A Pinlou Discrete Applied Mathematics 161 (18), 2946-2951, 2013 | 11 | 2013 |

Orienting triangulations B Albar, D Gonçalves, K Knauer Journal of Graph Theory 83 (4), 392-405, 2016 | 10 | 2016 |