Daniel Goncalves
66
Documents
Publications
- 4
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 9
- 7
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 61
- 4
- 11
- 10
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
|
On Comparable Box DimensionSoCG 2022 - 38th International Symposium on Computational Geometry, Jun 2022, Berlin, Germany. pp.38:1--38:14, ⟨10.4230/LIPIcs.SoCG.2022.38⟩
Conference papers
lirmm-03872134v1
|
|
3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 SlopesWG 2019 - 45th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2019, Vall de Núria, Spain. pp.351-363, ⟨10.1007/978-3-030-30786-8_27⟩
Conference papers
lirmm-02407838v1
|
|
Every Collinear Set in a Planar Graph Is FreeSODA 2019 - 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2019, San Diego, CA, United States. pp.1521-1538, ⟨10.1137/1.9781611975482.92⟩
Conference papers
lirmm-02046476v1
|
Planar Graphs as L-intersection or L-contact graphsSODA: Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.172-184, ⟨10.1137/1.9781611975031.12⟩
Conference papers
lirmm-01738150v1
|
|
|
Dushnik-Miller dimension of TD-Delaunay complexesEuroCG: European Workshop on Computational Geometry, Apr 2017, Malmo, Sweden
Conference papers
lirmm-01888045v1
|
A Polynomial-Time Algorithm for Outerplanar Diameter ImprovementCSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩
Conference papers
hal-01178222v1
|
|
On Independent Set on B1-EPG GraphsWAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩
Conference papers
lirmm-01264022v1
|
|
|
Orienting triangulationsEuroCG: European Workshop on Computational Geometry, Mar 2015, Ljubljana, Slovenia
Conference papers
lirmm-01264309v1
|
|
Detecting minors in matroids throughout trianglesICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Conference papers
lirmm-01264288v1
|
|
Entropy compression method applied to graph coloringsICGT: International Colloquium on Graph Theory and Combinatorics, Jun 2014, Grenoble, France
Conference papers
lirmm-01233456v1
|
Too many trianglesLAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Apr 2013, Playa del Carmen, Mexico. pp.293-297, ⟨10.1016/j.endm.2013.10.046⟩
Conference papers
lirmm-01263909v1
|
|
Modèles d'Intersections Géométriques pour les Graphes PlanairesJGA'10: Journées Graphes et Algorithmes, France
Conference papers
lirmm-00738561v1
|
|
Parameterized Domination in Circle GraphsWG 2012 - 38th International Workshop on Graph Theoretic-Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.308-319, ⟨10.1007/978-3-642-34611-8_31⟩
Conference papers
lirmm-00738534v1
|
|
On Exact Algorithms for Permutation CSPAPEX: Approximation, Parameterized and EXact Algorithms, Feb 2012, Paris, France
Conference papers
lirmm-00738536v1
|
|
The Maximum Clique Problem in Multiple Interval GraphsWG'12: 38th International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.57-68
Conference papers
lirmm-00738525v1
|
|
Planar Graphs as Intersection GraphsLAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina
Conference papers
lirmm-00808045v1
|
|
|
Triangle Contact Representations and Duality18th International Symposium on Graph Drawing (GD), Sep 2010, Konstanz, Germany. pp.262-273, ⟨10.1007/978-3-642-18469-7_24⟩
Conference papers
lirmm-00620728v1
|
Every Planar Graph is the Intersection Graph of Segments in the Plane: Extended AbstractSTOC '09: 41st ACM Symposium on Theory of Computing, May 2009, France. pp.631-638
Conference papers
lirmm-00395364v1
|
|
Coloring a set of touching stringsEuroComb'09: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.213-217
Conference papers
lirmm-00433096v1
|
|
Spanning galaxies in digraphsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.139-143, ⟨10.1016/j.endm.2009.07.023⟩
Conference papers
lirmm-00433050v1
|
|
Planar graphs are in 1-stringSODA 2007, 2007, United States. pp.609--617
Conference papers
hal-00308130v1
|
|
|
On the $L(p,1)$-labelling of graphs2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.81-86, ⟨10.46298/dmtcs.3438⟩
Conference papers
hal-01184395v1
|
Edge Partition of Planar Graphs into Two Outerplanar GraphsProceedings of STOC '05, 2005, United States. pp.504 - 512
Conference papers
hal-00307781v1
|
|
Acyclic choosability of graphs with small maximum degreeWG 2005, 2005, France. pp.239--248
Conference papers
hal-00307782v1
|
|
On oriented labelling parametersFormal Models, Languages and Applications, 66, pp.33-45, 2006, 978-981-277-303-6. ⟨10.1142/9789812773036_0003⟩
Book sections
hal-00353655v1
|
Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments2023
Preprints, Working Papers, ...
hal-04149792v1
|
|
Contact graphs of boxes with unidirectional contacts2023
Preprints, Working Papers, ...
hal-04216379v1
|
|
Partitioning into degenerate graphs in linear time2022
Preprints, Working Papers, ...
lirmm-03872198v1
|
|
Avoiding large squares in trees and planar graphs2021
Preprints, Working Papers, ...
lirmm-03452602v1
|
|
|
Planar graphs as L-intersection or L-contact graphs2017
Preprints, Working Papers, ...
hal-01569535v2
|
|
Study of Schnyder Woods and Intersection GraphsDiscrete Mathematics [cs.DM]. Université de Montpellier, 2018
Habilitation à diriger des recherches
tel-02078613v1
|