Daniel Gonçalves
Orcid: 0000-0003-3228-9622Affiliations:
- Université de Montpellier, LIRMM, France
According to our database1,
Daniel Gonçalves
authored at least 61 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2006
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
2
2
1
1
4
2
3
3
3
3
3
4
2
2
2
4
1
3
1
4
1
1
1
1
1
1
2
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
Oriented trees in O(k √k)-chromatic digraphs, a subquadratic bound for Burr's conjecture.
CoRR, 2024
Oriented Trees in $O(k \sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024
Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024
2023
Discret. Math. Theor. Comput. Sci., 2023
Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments.
CoRR, 2023
2022
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
2020
2019
3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019
2018
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
J. Comput. Syst. Sci., 2017
Electron. Notes Discret. Math., 2017
2016
2015
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015
2014
Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations.
Discret. Comput. Geom., 2014
2013
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties.
Theor. Comput. Sci., 2013
Discret. Appl. Math., 2013
2012
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012
2011
2010
2009
J. Comb. Theory B, 2009
A planar linear hypergraph whose edges cannot be represented as straight line segments.
Eur. J. Comb., 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
2008
2007
Electron. Notes Discret. Math., 2007
Discret. Optim., 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
2005
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005