Number of documents

52

Publications of Daniel Gonçalves


Journal articles28 documents

Conference papers22 documents

  • Vida Dujmović, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote. Every Collinear Set in a Planar Graph Is Free. SODA: Symposium on Discrete Algorithms, Jan 2019, San Diego, CA, United States. pp.1521-1538, ⟨10.1137/1.9781611975482.92⟩. ⟨lirmm-02046476⟩
  • Daniel Gonçalves, Lucas Isenmann, Claire Pennarun. Planar Graphs as L-intersection or L-contact graphs. SODA: Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.172-184, ⟨10.1137/1.9781611975031.12⟩. ⟨lirmm-01738150⟩
  • Daniel Gonçalves, Lucas Isenmann. Dushnik-Miller dimension of TD-Delaunay complexes. EuroCG: European Workshop on Computational Geometry, Apr 2017, Malmo, Sweden. ⟨lirmm-01888045⟩
  • Boris Albar, Daniel Gonçalves, Kolja Knauer. Orienting triangulations. EuroCG: European Workshop on Computational Geometry, Mar 2015, Ljubljana, Slovenia. ⟨lirmm-01264309⟩
  • Nathann Cohen, Daniel Gonçalves, Kim Eun Jung, Christophe Paul, Ignasi Sau, et al.. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩. ⟨hal-01178222⟩
  • Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul. On Independent Set on B1-EPG Graphs. WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩. ⟨lirmm-01264022⟩
  • Boris Albar, Daniel Gonçalves, Jorge Ramírez Alfonsín. Detecting minors in matroids throughout triangles. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. ⟨lirmm-01264288⟩
  • Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou. Entropy compression method applied to graph colorings. ICGT: International Colloquium on Graph Theory and Combinatorics, Jun 2014, Grenoble, France. ⟨lirmm-01233456⟩
  • Boris Albar, Daniel Gonçalves. Too many triangles. LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Apr 2013, Playa del Carmen, Mexico. pp.293-297, ⟨10.1016/j.endm.2013.10.046⟩. ⟨lirmm-01263909⟩
  • Mathew C. Francis, Daniel Gonçalves, Pascal Ochem. The Maximum Clique Problem in Multiple Interval Graphs. WG'12: 38th International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.57-68. ⟨lirmm-00738525⟩
  • Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Christophe Paul, Ignasi Sau, et al.. Parameterized Domination in Circle Graphs. WG'12: 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⟩. ⟨lirmm-00738534⟩
  • Daniel Gonçalves, Eunjung Kim. On Exact Algorithms for Permutation CSP. APEX'12: International Workshop on Approximation, Parameterized and EXact Algorithms, Feb 2012, Paris, France. ⟨lirmm-00738536⟩
  • Daniel Gonçalves. Modèles d'Intersections Géométriques pour les Graphes Planaires. JGA'10: Journées Graphes et Algorithmes, France. ⟨lirmm-00738561⟩
  • Daniel Gonçalves. Planar Graphs as Intersection Graphs. LAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. ⟨lirmm-00808045⟩
  • Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou. Triangle Contact Representations and Duality. GD'10: Graph Drawing, Sep 2011, Konstanz, Germany. pp.262-273, ⟨10.1007/978-3-642-18469-7_24⟩. ⟨lirmm-00620728⟩
  • Louis Esperet, Daniel Gonçalves, Arnaud Labourel. Coloring a set of touching strings. EuroComb'09: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.213-217. ⟨lirmm-00433096⟩
  • Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. Spanning galaxies in digraphs. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.139-143, ⟨10.1016/j.endm.2009.07.023⟩. ⟨lirmm-00433050⟩
  • Jérémie Chalopin, Daniel Gonçalves. Every Planar Graph is the Intersection Graph of Segments in the Plane: Extended Abstract. STOC '09: 41st ACM Symposium on Theory of Computing, May 2009, France. pp.631-638. ⟨lirmm-00395364⟩
  • Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem. Planar graphs are in 1-string. SODA 2007, 2007, United States. pp.609--617. ⟨hal-00308130⟩
  • Daniel Gonçalves, Mickael Montassier. Acyclic choosability of graphs with small maximum degree. WG 2005, 2005, France. pp.239--248. ⟨hal-00307782⟩
  • Daniel Gonçalves. Edge Partition of Planar Graphs into Two Outerplanar Graphs. Proceedings of STOC '05, 2005, United States. pp.504 - 512. ⟨hal-00307781⟩
  • Daniel Gonçalves. On the $L(p,1)$-labelling of graphs. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.81-86. ⟨hal-01184395⟩

Preprints, Working Papers, ...1 document

  • Daniel Gonçalves, Lucas Isenmann, Claire Pennarun. Planar graphs as L-intersection or L-contact graphs. 2017. ⟨hal-01569535v2⟩

Habilitation à diriger des recherches1 document

  • Daniel Gonçalves. Study of Schnyder Woods and Intersection Graphs. Discrete Mathematics [cs.DM]. Université de Montpellier, 2018. ⟨tel-02078613⟩