Daniel Gonçalves

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 30

Top Topics

Temporal Dimension

Independent Set

Minimal Spanning Tree

Top Venues

Discret. Comput. Geom.

J. Graph Theory

Publications

Daniel Gonçalves, Lucas Picasarri-Arrieta, Amadeus Reinald
Brooks-type colourings of digraphs in linear time. CoRR (2024)
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius. SWAT (2024)
Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald
Oriented trees in O(k √k)-chromatic digraphs, a subquadratic bound for Burr's conjecture. CoRR (2024)
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
Kick the cliques. CoRR (2024)
Daniel Gonçalves, Vincent Limouzy, Pascal Ochem
Contact graphs of boxes with unidirectional contacts. CoRR (2023)
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments. CoRR (2023)
Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves, Lucas Picasarri-Arrieta
Complexity of some arc-partition problems for digraphs. Theor. Comput. Sci. 928 (2022)
Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
On Comparable Box Dimension. CoRR (2022)
Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
On Comparable Box Dimension. SoCG (2022)
Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote
Every Collinear Set in a Planar Graph is Free. Discret. Comput. Geom. 65 (4) (2021)
Daniel Gonçalves
Not all planar graphs are in PURE-4-DIR. J. Graph Algorithms Appl. 24 (3) (2020)
Daniel Gonçalves, Lucas Isenmann
Dushnik-Miller dimension of TD-Delaunay complexes. Eur. J. Comb. 88 (2020)
Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou
Acyclic coloring of graphs and entropy compression method. Discret. Math. 343 (4) (2020)
Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul
On independent set in B1-EPG graphs. Discret. Appl. Math. 278 (2020)
Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
Homothetic triangle representations of planar graphs. CoRR (2019)
Kolja Knauer, Daniel Gonçalves, Benjamin Lévêque
On the structure of Schnyder woods on orientable surfaces. J. Comput. Geom. 10 (1) (2019)
Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote
Every Collinear Set in a Planar Graph Is Free. SODA (2019)
Daniel Gonçalves, Lucas Isenmann
Dushnik-Miller dimension of TD-Delaunay complexes. CoRR (2018)
Mathew C. Francis, Daniel Gonçalves
Dushnik-Miller dimension of d-dimensional tilings with boxes. CoRR (2018)
Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt
The k-strong induced arboricity of a graph. Eur. J. Comb. 67 (2018)
Daniel Gonçalves, Lucas Isenmann, Claire Pennarun
Planar Graphs as L-intersection or L-contact graphs. SODA (2018)
Boris Albar, Daniel Gonçalves
On triangles in -minor free graphs. J. Graph Theory 88 (1) (2018)
Vincent Despré, Daniel Gonçalves, Benjamin Lévêque
Encoding Toroidal Triangulations. Discret. Comput. Geom. 57 (3) (2017)
Daniel Gonçalves, Lucas Isenmann, Claire Pennarun
Planar graphs as L-intersection or L-contact graphs. CoRR (2017)
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. 89 (2017)
Mathew C. Francis, Daniel Gonçalves
Dushnik-Miller dimension of contact systems of d-dimensional boxes. Electron. Notes Discret. Math. 61 (2017)
Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt
The k-strong induced arboricity of a graph. CoRR (2016)
Boris Albar, Daniel Gonçalves, Kolja Knauer
Orienting Triangulations. J. Graph Theory 83 (4) (2016)
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
Coloring Non-Crossing Strings. Electron. J. Comb. 23 (4) (2016)
Boris Albar, Daniel Gonçalves, Jorge L. Ramírez Alfonsín
Detecting minors in matroids through triangles. Eur. J. Comb. 53 (2016)
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
The Maximum Clique Problem in Multiple Interval Graphs. Algorithmica 71 (4) (2015)
Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni
Two-floor buildings need eight colors. J. Graph Algorithms Appl. 19 (1) (2015)
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
Coloring non-crossing strings. CoRR (2015)
Vincent Despré, Daniel Gonçalves, Benjamin Lévêque
Encoding toroidal triangulations. CoRR (2015)
Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
On independent set on B1-EPG graphs. CoRR (2015)
Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR (2015)
Daniel Gonçalves, Kolja B. Knauer, Benjamin Lévêque
Structure of Schnyder labelings on orientable surfaces. CoRR (2015)
Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
On Independent Set on B1-EPG Graphs. WAOA (2015)
Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
Parameterized Domination in Circle Graphs. Theory Comput. Syst. 54 (1) (2014)
Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou
Entropy compression method applied to graph colorings. CoRR (2014)
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR (2014)
Daniel Gonçalves, Benjamin Lévêque
Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations. Discret. Comput. Geom. 51 (1) (2014)
Boris Albar, Daniel Gonçalves
Too many triangles. Electron. Notes Discret. Math. 44 (2013)
Daniel Gonçalves, Aline Parreau, Alexandre Pinlou
Locally identifying coloring in bounded expansion classes of graphs. Discret. Appl. Math. 161 (18) (2013)
Eun Jung Kim, Daniel Gonçalves
On exact algorithms for the permutation CSP. Theor. Comput. Sci. 511 (2013)
Jørgen Bang-Jensen, Daniel Gonçalves, Anders Yeo
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties. Theor. Comput. Sci. 475 (2013)
Daniel Gonçalves, Aline Parreau, Alexandre Pinlou
Locally identifying coloring in bounded expansion classes of graphs CoRR (2012)
Eun Jung Kim, Daniel Gonçalves
On Exact Algorithms for Permutation CSP CoRR (2012)
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
The Maximum Clique Problem in Multiple Interval Graphs CoRR (2012)
Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé
On spanning galaxies in digraphs. Discret. Appl. Math. 160 (6) (2012)
Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
Parameterized Domination in Circle Graphs CoRR (2012)
Daniel Gonçalves, Benjamin Lévêque
Toroidal maps : Schnyder woods, orthogonal surfaces and straight-line representations CoRR (2012)
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract). WG (2012)
Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
Parameterized Domination in Circle Graphs. WG (2012)
Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
Triangle Contact Representations and Duality. Discret. Comput. Geom. 48 (1) (2012)
Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
The Domination Number of Grids CoRR (2011)
Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
The Domination Number of Grids. SIAM J. Discret. Math. 25 (3) (2011)
Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
Planar Graphs Have 1-string Representations. Discret. Comput. Geom. 43 (3) (2010)
Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
Triangle Contact Representations and Duality. Graph Drawing (2010)
Jean Daligault, Daniel Gonçalves, Michaël Rao
Diamond-free circle graphs are Helly circle. Discret. Math. 310 (4) (2010)
Daniel Gonçalves, Pascal Ochem
On star and caterpillar arboricity. Discret. Math. 309 (11) (2009)
Jérémie Chalopin, Daniel Gonçalves
Every planar graph is the intersection graph of segments in the plane: extended abstract. STOC (2009)
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
Coloring a set of touching strings. Electron. Notes Discret. Math. 34 (2009)
Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet
Spanning galaxies in digraphs. Electron. Notes Discret. Math. 34 (2009)
Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
Planar graphs are in 1-STRING. SODA (2007)
Jørgen Bang-Jensen, Daniel Gonçalves, Inge Li Gørtz
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs. Discret. Optim. 4 (3-4) (2007)
Daniel Gonçalves, André Raspaud, M. A. Shalu
On Oriented Labelling Parameters. Formal Models, Languages and Applications (2007)
Daniel Gonçalves, Pascal Ochem
On some arboricities in planar graphs. Electron. Notes Discret. Math. 22 (2005)
Daniel Gonçalves
Edge partition of planar sraphs into two outerplanar graphs. STOC (2005)
Daniel Gonçalves, Mickaël Montassier
Acyclic Choosability of Graphs with Small Maximum Degree. WG (2005)