
Daniel Goncalves
73
Documents
Publications
4
4
3
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
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
8
6
6
6
5
5
5
4
4
4
3
3
3
3
3
2
2
2
2
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
13
13
4
4
3
2
2
2
1
1
1
1
56
12
4
4
Publications
Oriented Trees in $O(k \sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr’s ConjectureWG 2024 - 50th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2024, Gozd Martuljek, Slovenia. pp.79-91, ⟨10.1007/978-3-031-75409-8_6⟩
Communication dans un congrès
lirmm-04938265
v1
|
|
|
Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT TimeWG 2024 - 50th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2024, Gozd Martuljek, Slovenia. pp.65-78, ⟨10.1007/978-3-031-75409-8_5⟩
Communication dans un congrès
lirmm-04938252
v1
|
|
Kick the CliquesIPEC 2024 - 19th International Symposium on Parameterized and Exact Computation, Sep 2024, Londres, United Kingdom. pp.13:1-13:17, ⟨10.4230/LIPIcs.IPEC.2024.13⟩
Communication dans un congrès
lirmm-04938282
v1
|
|
Nonrepetitive colorings of $R^d$Eurocom 2023 - 12th European Conference on Combinatorics, Graph Theory and Applications, Aug 2023, Prague, Czech Republic. pp.114-119, ⟨10.5817/CZ.MUNI.EUROCOMB23-016⟩
Communication dans un congrès
lirmm-04308803
v1
|
|
Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radiusSWAT 2024 - 19th Scandinavian Symposium and Workshops on Algorithm Theory, Jun 2024, Helsinki, Finland. pp.11:1-11:18, ⟨10.4230/LIPIcs.SWAT.2024.11⟩
Communication dans un congrès
hal-04149792
v1
|
|
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⟩
Communication dans un congrès
lirmm-03872134
v1
|
|
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⟩
Communication dans un congrès
lirmm-02407838
v1
|
|
Every Collinear Set in a Planar Graph Is FreeSODA 2019 - 30th ACM/SIAM Symposium on Discrete Algorithms, Jan 2019, San Diego, CA, United States. pp.1521-1538, ⟨10.1137/1.9781611975482.92⟩
Communication dans un congrès
lirmm-02046476
v1
|
|
Planar Graphs as L-intersection or L-contact graphsSODA 2018 - 29th ACM/SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.172-184, ⟨10.1137/1.9781611975031.12⟩
Communication dans un congrès
lirmm-01738150
v1
|
|
Dushnik-Miller dimension of TD-Delaunay complexesEuroCG 2017 - 33rd European Workshop on Computational Geometry, Apr 2017, Malmo, Sweden
Communication dans un congrès
lirmm-01888045
v1
|
|
On Independent Set on B1-EPG GraphsWAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩
Communication dans un congrès
lirmm-01264022
v1
|
|
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⟩
Communication dans un congrès
hal-01178222
v1
|
|
Orienting triangulationsEuroCG: European Workshop on Computational Geometry, Mar 2015, Ljubljana, Slovenia
Communication dans un congrès
lirmm-01264309
v1
|
|
Entropy compression method applied to graph coloringsICGT: International Colloquium on Graph Theory and Combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
lirmm-01233456
v1
|
|
Detecting minors in matroids throughout trianglesICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
lirmm-01264288
v1
|
|
Parameterized domination in circle graphsWG 2012 - 38th International Workshop on Graph Theoretic-Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.45-72, ⟨10.1007/s00224-013-9478-8⟩
Communication dans un congrès
lirmm-00738534
v1
|
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⟩
Communication dans un congrès
istex
lirmm-01263909
v1
|
|
The Maximum Clique Problem in Multiple Interval GraphsWG 2012 - 38th International Workshop on Graph Theoretic-Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.57-68
Communication dans un congrès
lirmm-00738525
v1
|
|
On Exact Algorithms for Permutation CSPAPEX: Approximation, Parameterized and EXact Algorithms, Feb 2012, Paris, France
Communication dans un congrès
lirmm-00738536
v1
|
|
Planar Graphs as Intersection GraphsLAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina
Communication dans un congrès
lirmm-00808045
v1
|
|
|
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⟩
Communication dans un congrès
istex
lirmm-00620728
v1
|
Modèles d'Intersections Géométriques pour les Graphes PlanairesJGA'10: Journées Graphes et Algorithmes, France
Communication dans un congrès
lirmm-00738561
v1
|
|
Coloring a set of touching stringsEuroComb'09: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.213-217
Communication dans un congrès
lirmm-00433096
v1
|
|
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
Communication dans un congrès
lirmm-00395364
v1
|
|
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⟩
Communication dans un congrès
istex
lirmm-00433050
v1
|
|
Planar graphs are in 1-stringSODA 2007, 2007, United States. pp.609--617
Communication dans un congrès
hal-00308130
v1
|
|
Acyclic choosability of graphs with small maximum degreeWG 2005, 2005, France. pp.239--248
Communication dans un congrès
hal-00307782
v1
|
|
|
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⟩
Communication dans un congrès
hal-01184395
v1
|
Edge Partition of Planar Graphs into Two Outerplanar GraphsProceedings of STOC '05, 2005, United States. pp.504 - 512
Communication dans un congrès
hal-00307781
v1
|
|
On oriented labelling parametersFormal Models, Languages and Applications, 66, pp.33-45, 2006, 978-981-277-303-6. ⟨10.1142/9789812773036_0003⟩
Chapitre d'ouvrage
hal-00353655
v1
|
|
Brooks-type colourings of digraphs in linear time2024
Pré-publication, Document de travail
hal-04639963
v1
|
|
Kick the cliques2024
Pré-publication, Document de travail
hal-04636118
v1
|
|
Contact graphs of boxes with unidirectional contacts2023
Pré-publication, Document de travail
hal-04216379
v1
|
|
Avoiding large squares in trees and planar graphs2021
Pré-publication, Document de travail
lirmm-03452602
v1
|
|
Planar graphs as L-intersection or L-contact graphs2017
Pré-publication, Document de travail
hal-01569535
v2
|
|
Study of Schnyder Woods and Intersection GraphsDiscrete Mathematics [cs.DM]. Université de Montpellier, 2018
HDR
tel-02078613
v1
|
Chargement...
Chargement...