Edge partition of planar sraphs into two outerplanar graphs. - Daniel Gonçalves 001 (STOC, 2005)

Acyclic Choosability of Graphs with Small Maximum Degree. - Daniel Gonçalves 001; Mickaël Montassier (WG, 2005)

On some arboricities in planar graphs. - Daniel Gonçalves 001; Pascal Ochem (Electron. Notes Discret. Math., 2005)

On Oriented Labelling Parameters. - Daniel Gonçalves 001; André Raspaud; M. A. Shalu (Formal Models, Languages and Applications, 2007)

Planar graphs are in 1-STRING. - Jérémie Chalopin; Daniel Gonçalves 001; Pascal Ochem (SODA, 2007)

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs. - Jørgen Bang-Jensen; Daniel Gonçalves 001; Inge Li Gørtz (Discret. Optim., 2007)

Caterpillar arboricity of planar graphs. - Daniel Gonçalves 001 (Discret. Math., 2007)

On Vertex Partitions and the Colin de Verdière Parameter. - Daniel Gonçalves 001 (Electron. Notes Discret. Math., 2007)

On the L(p, 1)-labelling of graphs. - Daniel Gonçalves 001 (Discret. Math., 2008)

Every planar graph is the intersection graph of segments in the plane: extended abstract. - Jérémie Chalopin; Daniel Gonçalves 001 (STOC, 2009)

On star and caterpillar arboricity. - Daniel Gonçalves 001; Pascal Ochem (Discret. Math., 2009)

A planar linear hypergraph whose edges cannot be represented as straight line segments. - Daniel Gonçalves 001 (Eur. J. Comb., 2009)

Coloring a set of touching strings. - Louis Esperet; Daniel Gonçalves 001; Arnaud Labourel (Electron. Notes Discret. Math., 2009)

Covering planar graphs with forests, one having bounded maximum degree. - Daniel Gonçalves 001 (J. Comb. Theory B, 2009)

Planar Graphs Have 1-string Representations. - Jérémie Chalopin; Daniel Gonçalves 001; Pascal Ochem (Discret. Comput. Geom., 2010)

Diamond-free circle graphs are Helly circle. - Jean Daligault; Daniel Gonçalves 001; Michaël Rao (Discret. Math., 2010)

On vertex partitions and some minor-monotone graph parameters. - Daniel Gonçalves 001 (J. Graph Theory, 2011)

The Domination Number of Grids. - Daniel Gonçalves 001; Alexandre Pinlou; Michaël Rao; Stéphan Thomassé (SIAM J. Discret. Math., 2011)

The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract). - Mathew C. Francis; Daniel Gonçalves 001; Pascal Ochem (WG, 2012)

On spanning galaxies in digraphs. - Daniel Gonçalves 001; Frédéric Havet; Alexandre Pinlou; Stéphan Thomassé (Discret. Appl. Math., 2012)

Triangle Contact Representations and Duality. - Daniel Gonçalves 001; Benjamin Lévêque; Alexandre Pinlou (Discret. Comput. Geom., 2012)

Locally identifying coloring in bounded expansion classes of graphs. - Daniel Gonçalves 001; Aline Parreau; Alexandre Pinlou (Discret. Appl. Math., 2013)

Too many triangles. - Boris Albar; Daniel Gonçalves 001 (Electron. Notes Discret. Math., 2013)

Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties. - Jørgen Bang-Jensen; Daniel Gonçalves 001; Anders Yeo (Theor. Comput. Sci., 2013)

On exact algorithms for the permutation CSP. - Eun Jung Kim 002; Daniel Gonçalves 001 (Theor. Comput. Sci., 2013)

Entropy compression method applied to graph colorings. - Daniel Gonçalves 001; Mickaël Montassier; Alexandre Pinlou (CoRR, 2014)

Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations. - Daniel Gonçalves 001; Benjamin Lévêque (Discret. Comput. Geom., 2014)

Parameterized Domination in Circle Graphs. - Nicolas Bousquet 001; Daniel Gonçalves 001; George B. Mertzios; Christophe Paul; Ignasi Sau; Stéphan Thomassé (Theory Comput. Syst., 2014)

On Independent Set on B1-EPG Graphs. - Marin Bougeret; Stéphane Bessy; Daniel Gonçalves 001; Christophe Paul (WAOA, 2015)

The Maximum Clique Problem in Multiple Interval Graphs. - Mathew C. Francis; Daniel Gonçalves 001; Pascal Ochem (Algorithmica, 2015)

Structure of Schnyder labelings on orientable surfaces. - Daniel Gonçalves 001; Kolja B. Knauer; Benjamin Lévêque (CoRR, 2015)

Two-floor buildings need eight colors. - Stéphane Bessy; Daniel Gonçalves 001; Jean-Sébastien Sereni (J. Graph Algorithms Appl., 2015)

Coloring Non-Crossing Strings. - Louis Esperet; Daniel Gonçalves 001; Arnaud Labourel (Electron. J. Comb., 2016)

Detecting minors in matroids through triangles. - Boris Albar; Daniel Gonçalves 001; Jorge L. Ramírez Alfonsín (Eur. J. Comb., 2016)

Orienting Triangulations. - Boris Albar; Daniel Gonçalves 001; Kolja Knauer (J. Graph Theory, 2016)

Encoding Toroidal Triangulations. - Vincent Despré; Daniel Gonçalves 001; Benjamin Lévêque (Discret. Comput. Geom., 2017)

Dushnik-Miller dimension of contact systems of d-dimensional boxes. - Mathew C. Francis; Daniel Gonçalves 001 (Electron. Notes Discret. Math., 2017)

A polynomial-time algorithm for Outerplanar Diameter Improvement. - Nathann Cohen; Daniel Gonçalves 001; Eun Jung Kim 002; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos; Mathias Weller (J. Comput. Syst. Sci., 2017)

Study of Schnyder Woods and Intersection Graphs. (Étude des Bois de Schnyder et des Graphes d'Intersections). - Daniel Gonçalves 001 (2018)

Planar Graphs as L-intersection or L-contact graphs. - Daniel Gonçalves 001; Lucas Isenmann; Claire Pennarun (SODA, 2018)

Dushnik-Miller dimension of d-dimensional tilings with boxes. - Mathew C. Francis; Daniel Gonçalves 001 (CoRR, 2018)

The k-strong induced arboricity of a graph. - Maria Axenovich; Daniel Gonçalves 001; Jonathan Rollin; Torsten Ueckerdt (Eur. J. Comb., 2018)

On triangles in -minor free graphs. - Boris Albar; Daniel Gonçalves 001 (J. Graph Theory, 2018)

3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes. - Daniel Gonçalves 001 (WG, 2019)

Homothetic triangle representations of planar graphs. - Daniel Gonçalves 001; Benjamin Lévêque; Alexandre Pinlou (CoRR, 2019)

On the structure of Schnyder woods on orientable surfaces. - Kolja Knauer; Daniel Gonçalves 001; Benjamin Lévêque (J. Comput. Geom., 2019)

On independent set in B1-EPG graphs. - Stéphane Bessy; Marin Bougeret; Steven Chaplick; Daniel Gonçalves 001; Christophe Paul (Discret. Appl. Math., 2020)

Acyclic coloring of graphs and entropy compression method. - Daniel Gonçalves 001; Mickaël Montassier; Alexandre Pinlou (Discret. Math., 2020)

Dushnik-Miller dimension of TD-Delaunay complexes. - Daniel Gonçalves 001; Lucas Isenmann (Eur. J. Comb., 2020)

Not all planar graphs are in PURE-4-DIR. - Daniel Gonçalves 001 (J. Graph Algorithms Appl., 2020)

Every Collinear Set in a Planar Graph is Free. - Vida Dujmovic; Fabrizio Frati; Daniel Gonçalves 001; Pat Morin; Günter Rote (Discret. Comput. Geom., 2021)

On Comparable Box Dimension. - Zdenek Dvorák 001; Daniel Gonçalves 001; Abhiruk Lahiri; Jane Tan; Torsten Ueckerdt (SoCG, 2022)

Complexity of some arc-partition problems for digraphs. - Jørgen Bang-Jensen; Stéphane Bessy; Daniel Gonçalves 001; Lucas Picasarri-Arrieta (Theor. Comput. Sci., 2022)

Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (CoRR, 2023)

Contact graphs of boxes with unidirectional contacts. - Daniel Gonçalves 001; Vincent Limouzy; Pascal Ochem (Discret. Math. Theor. Comput. Sci., 2023)

Kick the Cliques. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (IPEC, 2024)

Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (SWAT, 2024)

Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT Time. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (WG, 2024)

Oriented Trees in $O(k sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture. - Stéphane Bessy; Daniel Gonçalves 001; Amadeus Reinald (WG, 2024)

Oriented trees in O(k √k)-chromatic digraphs, a subquadratic bound for Burr's conjecture. - Stéphane Bessy; Daniel Gonçalves 001; Amadeus Reinald (CoRR, 2024)

Brooks-type colourings of digraphs in linear time. - Daniel Gonçalves 001; Lucas Picasarri-Arrieta; Amadeus Reinald (CoRR, 2024)

Pushing the Frontiers of Subexponential FPT Time for Feedback Vertex Set. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (ICALP, 2025)