Daniel Gonçalves

According to our database1, Daniel Gonçalves authored at least 44 papers between 2005 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Not all planar graphs are in PURE-4-DIR.
J. Graph Algorithms Appl., 2020

Dushnik-Miller dimension of TD-Delaunay complexes.
Eur. J. Comb., 2020

Acyclic coloring of graphs and entropy compression method.
Discret. Math., 2020

On independent set in B1-EPG graphs.
Discret. Appl. Math., 2020

2019
On the structure of Schnyder woods on orientable surfaces.
J. Comput. Geom., 2019

Homothetic triangle representations of planar graphs.
CoRR, 2019

Every Collinear Set in a Planar Graph Is Free.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
On triangles in -minor free graphs.
J. Graph Theory, 2018

The k-strong induced arboricity of a graph.
Eur. J. Comb., 2018

Dushnik-Miller dimension of d-dimensional tilings with boxes.
CoRR, 2018

Planar Graphs as L-intersection or L-contact graphs.
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).
, 2018

2017
A polynomial-time algorithm for Outerplanar Diameter Improvement.
J. Comput. Syst. Sci., 2017

Dushnik-Miller dimension of contact systems of d-dimensional boxes.
Electron. Notes Discret. Math., 2017

Encoding Toroidal Triangulations.
Discret. Comput. Geom., 2017

2016
Orienting Triangulations.
J. Graph Theory, 2016

Detecting minors in matroids through triangles.
Eur. J. Comb., 2016

Coloring Non-Crossing Strings.
Electron. J. Comb., 2016

2015
Two-floor buildings need eight colors.
J. Graph Algorithms Appl., 2015

Structure of Schnyder labelings on orientable surfaces.
CoRR, 2015

The Maximum Clique Problem in Multiple Interval Graphs.
Algorithmica, 2015

On Independent Set on B1-EPG Graphs.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

2014
Parameterized Domination in Circle Graphs.
Theory Comput. Syst., 2014

Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations.
Discret. Comput. Geom., 2014

Entropy compression method applied to graph colorings.
CoRR, 2014

2013
On exact algorithms for the permutation CSP.
Theor. Comput. Sci., 2013

Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties.
Theor. Comput. Sci., 2013

Too many triangles.
Electron. Notes Discret. Math., 2013

Locally identifying coloring in bounded expansion classes of graphs.
Discret. Appl. Math., 2013

2012
Triangle Contact Representations and Duality.
Discret. Comput. Geom., 2012

The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
The Domination Number of Grids.
SIAM J. Discret. Math., 2011

2010
Diamond-free circle graphs are Helly circle.
Discret. Math., 2010

Planar Graphs Have 1-string Representations.
Discret. Comput. Geom., 2010

2009
Spanning galaxies in digraphs.
Electron. Notes Discret. Math., 2009

Coloring a set of touching strings.
Electron. Notes Discret. Math., 2009

On star and caterpillar arboricity.
Discret. Math., 2009

Every planar graph is the intersection graph of segments in the plane: extended abstract.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2007
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs.
Discret. Optim., 2007

Planar graphs are in 1-STRING.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On Oriented Labelling Parameters.
Proceedings of the Formal Models, 2007

2005
On some arboricities in planar graphs.
Electron. Notes Discret. Math., 2005

Acyclic Choosability of Graphs with Small Maximum Degree.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Edge partition of planar sraphs into two outerplanar graphs.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005


  Loading...