Daniel Gonçalves

According to our database, Daniel Gonçalves authored at least 56 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Oriented trees in O(k √k)-chromatic digraphs, a subquadratic bound for Burr's conjecture.

Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald

CoRR, 2024

2023

Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments.

Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond

CoRR, 2023

Contact graphs of boxes with unidirectional contacts.

Daniel Gonçalves, Vincent Limouzy, Pascal Ochem

CoRR, 2023

2022

Complexity of some arc-partition problems for digraphs.

Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves, Lucas Picasarri-Arrieta

Theor. Comput. Sci., 2022

On Comparable Box Dimension.

Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Every Collinear Set in a Planar Graph is Free.

Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote

Discret. Comput. Geom., 2021

2020

Not all planar graphs are in PURE-4-DIR.

Daniel Gonçalves

J. Graph Algorithms Appl., 2020

Dushnik-Miller dimension of TD-Delaunay complexes.

Daniel Gonçalves, Lucas Isenmann

Eur. J. Comb., 2020

Acyclic coloring of graphs and entropy compression method.

Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou

Discret. Math., 2020

On independent set in B1-EPG graphs.

Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul

Discret. Appl. Math., 2020

2019

On the structure of Schnyder woods on orientable surfaces.

Kolja Knauer, Daniel Gonçalves, Benjamin Lévêque

J. Comput. Geom., 2019

Homothetic triangle representations of planar graphs.

Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou

CoRR, 2019

3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes.

Daniel Gonçalves

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

2018

On triangles in -minor free graphs.

Boris Albar, Daniel Gonçalves

J. Graph Theory, 2018

The k-strong induced arboricity of a graph.

Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt

Eur. J. Comb., 2018

Dushnik-Miller dimension of d-dimensional tilings with boxes.

Mathew C. Francis, Daniel Gonçalves

CoRR, 2018

Planar Graphs as L-intersection or L-contact graphs.

Daniel Gonçalves, Lucas Isenmann, Claire Pennarun

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Study of Schnyder Woods and Intersection Graphs. (Étude des Bois de Schnyder et des Graphes d'Intersections).

Daniel Gonçalves

, 2018

2017

A polynomial-time algorithm for Outerplanar Diameter Improvement.

Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller

J. Comput. Syst. Sci., 2017

Dushnik-Miller dimension of contact systems of d-dimensional boxes.

Mathew C. Francis, Daniel Gonçalves

Electron. Notes Discret. Math., 2017

Encoding Toroidal Triangulations.

Vincent Despré, Daniel Gonçalves, Benjamin Lévêque

Discret. Comput. Geom., 2017

2016

Orienting Triangulations.

Boris Albar, Daniel Gonçalves, Kolja Knauer

J. Graph Theory, 2016

Detecting minors in matroids through triangles.

Boris Albar, Daniel Gonçalves, Jorge L. Ramírez Alfonsín

Eur. J. Comb., 2016

Coloring Non-Crossing Strings.

Louis Esperet, Daniel Gonçalves, Arnaud Labourel

Electron. J. Comb., 2016

2015

Two-floor buildings need eight colors.

Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni

J. Graph Algorithms Appl., 2015

Structure of Schnyder labelings on orientable surfaces.

Daniel Gonçalves, Kolja B. Knauer, Benjamin Lévêque

CoRR, 2015

The Maximum Clique Problem in Multiple Interval Graphs.

Mathew C. Francis, Daniel Gonçalves, Pascal Ochem

Algorithmica, 2015

On Independent Set on B1-EPG Graphs.

Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul

Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

2014

Parameterized Domination in Circle Graphs.

Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé

Theory Comput. Syst., 2014

Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations.

Daniel Gonçalves, Benjamin Lévêque

Discret. Comput. Geom., 2014

Entropy compression method applied to graph colorings.

Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou

CoRR, 2014

2013

On exact algorithms for the permutation CSP.

Eun Jung Kim, Daniel Gonçalves

Theor. Comput. Sci., 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, Anders Yeo

Theor. Comput. Sci., 2013

Too many triangles.

Boris Albar, Daniel Gonçalves

Electron. Notes Discret. Math., 2013

Locally identifying coloring in bounded expansion classes of graphs.

Daniel Gonçalves, Aline Parreau, Alexandre Pinlou

Discret. Appl. Math., 2013

2012

Triangle Contact Representations and Duality.

Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou

Discret. Comput. Geom., 2012

The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract).

Mathew C. Francis, Daniel Gonçalves, Pascal Ochem

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

The Domination Number of Grids.

Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé

SIAM J. Discret. Math., 2011

On vertex partitions and some minor-monotone graph parameters.

Daniel Gonçalves

J. Graph Theory, 2011

2010

Diamond-free circle graphs are Helly circle.

Jean Daligault, Daniel Gonçalves, Michaël Rao

Discret. Math., 2010

Planar Graphs Have 1-string Representations.

Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem

Discret. Comput. Geom., 2010

2009

Spanning galaxies in digraphs.

Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet

Electron. Notes Discret. Math., 2009

Coloring a set of touching strings.

Louis Esperet, Daniel Gonçalves, Arnaud Labourel

Electron. Notes Discret. Math., 2009

A planar linear hypergraph whose edges cannot be represented as straight line segments.

Daniel Gonçalves

Eur. J. Comb., 2009

On star and caterpillar arboricity.

Daniel Gonçalves, Pascal Ochem

Discret. Math., 2009

Every planar graph is the intersection graph of segments in the plane: extended abstract.

Jérémie Chalopin, Daniel Gonçalves

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

Covering planar graphs with forests, one having a bounded maximum degree.

Daniel Gonçalves

Electron. Notes Discret. Math., 2008

On the L(p, 1)-labelling of graphs.

Daniel Gonçalves

Discret. Math., 2008

2007

On Vertex Partitions and the Colin de Verdière Parameter.

Daniel Gonçalves

Electron. Notes Discret. Math., 2007

Caterpillar arboricity of planar graphs.

Daniel Gonçalves

Discret. Math., 2007

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs.

Jørgen Bang-Jensen, Daniel Gonçalves, Inge Li Gørtz

Discret. Optim., 2007

Planar graphs are in 1-STRING.

Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On Oriented Labelling Parameters.

Daniel Gonçalves, André Raspaud, M. A. Shalu

Proceedings of the Formal Models, 2007

2005

On some arboricities in planar graphs.

Daniel Gonçalves, Pascal Ochem

Electron. Notes Discret. Math., 2005

Acyclic Choosability of Graphs with Small Maximum Degree.

Daniel Gonçalves, Mickaël Montassier

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Edge partition of planar sraphs into two outerplanar graphs.

Daniel Gonçalves

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005