Skip to Main content
Number of documents

56

Publications of Daniel Gonçalves


Journal articles31 documents

  • Daniel Gonçalves, Lucas Isenmann. Dushnik–Miller dimension of TD-Delaunay complexes. European Journal of Combinatorics, Elsevier, 2020, 88, pp.#103110. ⟨10.1016/j.ejc.2020.103110⟩. ⟨lirmm-02900923⟩
  • Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou. Homothetic triangle representations of planar graphs. Journal of Graph Algorithms and Applications, Brown University, 2019, 23 (4), pp.745-753. ⟨10.7155/jgaa.00509⟩. ⟨lirmm-02407930⟩
  • Daniel Gonçalves, Kolja Knauer, Benjamin Lévêque. On the structure of Schnyder woods on orientable surfaces. Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2019, 10 (1), pp.127-164. ⟨10.20382/jocg.v10i1a5⟩. ⟨lirmm-02407874⟩
  • Boris Albar, Daniel Gonçalves. On triangles in $Kr$-minor free graphs. Journal of Graph Theory, Wiley, 2018, 88 (1), pp.154-173. ⟨10.1002/jgt.22203⟩. ⟨lirmm-01888027⟩
  • Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt. The $k$-strong induced arboricity of a graph. European Journal of Combinatorics, Elsevier, 2018, 67, pp.1-20. ⟨10.1016/j.ejc.2017.05.010⟩. ⟨lirmm-01888032⟩
  • Vincent Despré, Daniel Gonçalves, Benjamin Lévêque. Encoding toroidal triangulations. Discrete and Computational Geometry, Springer Verlag, 2017, 57 (3), pp.507-544. ⟨10.1007/s00454-016-9832-0⟩. ⟨hal-01488931⟩
  • Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau Valls, et al.. A polynomial-time algorithm for Outerplanar Diameter Improvement. Journal of Computer and System Sciences, Elsevier, 2017, 89, pp.315 - 327. ⟨10.1016/j.jcss.2017.05.016⟩. ⟨hal-01592242⟩
  • Mathew Francis, Daniel Gonçalves. Dushnik-Miller dimension of contact systems of d -dimensional boxes. Electronic Notes in Discrete Mathematics, Elsevier, 2017, 61, pp.467-473. ⟨10.1016/j.endm.2017.06.075⟩. ⟨lirmm-01693192⟩
  • Boris Albar, Daniel Gonçalves, Kolja Knauer. Orienting Triangulations. Journal of Graph Theory, Wiley, 2016, 83 (4), pp.392-405. ⟨10.1002/jgt.22005⟩. ⟨hal-01457782⟩
  • Boris Albar, Daniel Gonçalves, Jorge Luis Ramírez Alfonsín. Detecting minors in matroids through triangles. European Journal of Combinatorics, Elsevier, 2016, 53, pp.50-58. ⟨10.1016/j.ejc.2015.10.010⟩. ⟨lirmm-01263827⟩
  • Louis Esperet, Daniel Gonçalves, Arnaud Labourel. Coloring non-crossing strings. The Electronic Journal of Combinatorics, Open Journal Systems, 2016, 23 (4), pp.4.4. ⟨hal-01480244⟩
  • Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni. Two floor building needing eight colors. Journal of Graph Algorithms and Applications, Brown University, 2015, 19 (1), pp.1--9. ⟨hal-00996709v2⟩
  • Mathew C. Francis, Daniel Gonçalves, Pascal Ochem. The Maximum Clique Problem in Multiple Interval Graphs. Algorithmica, Springer Verlag, 2015, 71 (4), pp.812-836. ⟨10.1007/s00453-013-9828-6⟩. ⟨lirmm-01263898⟩
  • Daniel Gonçalves, Benjamin Lévêque. Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations. Discrete and Computational Geometry, Springer Verlag, 2014, 51 (1), pp.67-131. ⟨10.1007/s00454-013-9552-7⟩. ⟨lirmm-01263819⟩
  • Christophe Paul, Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Ignasi Sau Valls, et al.. Parameterized domination in circle graphs. Theory of Computing Systems, Springer Verlag, 2014, 54 (1), pp.45-72. ⟨10.1007/s00224-013-9478-8⟩. ⟨hal-01178188⟩
  • Daniel Gonçalves, Aline Parreau, Alexandre Pinlou. Locally identifying coloring in bounded expansion classes of graphs. Discrete Applied Mathematics, Elsevier, 2013, 161 (18), pp.2946-2951. ⟨10.1016/j.dam.2013.07.003⟩. ⟨hal-00768472v2⟩
  • Jørgen Bang-Jensen, Daniel Gonçalves, Anders Yeo. Partitioning the arcs of a digraph into a star forests of the underlying graph with prescribed orientation properties. Theoretical Computer Science, Elsevier, 2013, 475, pp.13-20. ⟨lirmm-00807975⟩
  • Eun Jung Kim, Daniel Gonçalves. On exact algorithms for the permutation CSP. Theoretical Computer Science, Elsevier, 2013, 511, pp.109-116. ⟨10.1016/j.tcs.2012.10.035⟩. ⟨lirmm-01263918⟩
  • Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. On Spanning Galaxies in Digraphs. Discrete Applied Mathematics, Elsevier, 2012, 160 (6), pp.744-754. ⟨10.1016/j.dam.2011.07.013⟩. ⟨hal-00749191⟩
  • Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou. Triangle Contact Representations and Duality. Discrete and Computational Geometry, Springer Verlag, 2012, 48 (1), pp.239-254. ⟨lirmm-00715024⟩
  • Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé. The Domination Number of Grids. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2011, 25, pp.1443-1453. ⟨lirmm-00569256⟩
  • Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem. Planar Graphs Have 1-string Representations. Discrete and Computational Geometry, Springer Verlag, 2010, 43 ((3)), pp.626-647. ⟨10.1007/s00454-009-9196-9⟩. ⟨lirmm-00433091⟩
  • Jean Daligault, Daniel Gonçalves, Michaël Rao. Diamond-Free Circle Graphs are Helly Circle. Discrete Mathematics, Elsevier, 2010, 310 (4), pp.845-849. ⟨10.1016/j.disc.2009.09.022⟩. ⟨lirmm-00432897⟩
  • Daniel Gonçalves. On Vertex Partitions and some Minor-Monotone Parameters. Journal of Graph Theory, Wiley, 2010, 66 (1), pp.49-56. ⟨lirmm-00808034⟩
  • Daniel Gonçalves, Pascal Ochem. On Star and Caterpillar Arboricity. Discrete Mathematics, Elsevier, 2009, 309 (11), pp.3694-3702. ⟨10.1016/j.disc.2008.01.041⟩. ⟨lirmm-00338327⟩
  • Daniel Gonçalves. Covering Planar Graphs with Forests, one Having Bounded Maximum Degree. Journal of Combinatorial Theory, Series B, Elsevier, 2009, 99 (2), pp.314-322. ⟨10.1016/j.jctb.2008.07.004⟩. ⟨lirmm-00338319⟩
  • Daniel Gonçalves. A Planar Linear Hypergraph Whose Edges Cannot be Represented as Straight Line Segments. European Journal of Combinatorics, Elsevier, 2009, 30 (1), pp.280-282. ⟨10.1016/j.ejc.2007.12.004⟩. ⟨lirmm-00338324⟩
  • Daniel Gonçalves. On the L(p,1)-labelling of graphs. Discrete Mathematics, Elsevier, 2008, 308 (8), pp.1405-1414. ⟨10.1016/j.disc.2007.07.075⟩. ⟨lirmm-00250126⟩
  • Daniel Gonçalves. Caterpillar arboricity of planar graphs. Discrete Mathematics, Elsevier, 2007, 307 (16), pp.2112-2121. ⟨10.1016/j.disc.2005.12.055⟩. ⟨lirmm-00250121⟩
  • Jørgen Bang-Jensen, Daniel Gonçalves, Inge Li Gørtz. Finding Well-Balanced Pairs of Edge-Disjoint Trees in Edge-Weighted Graphs. Discrete Optimization, Elsevier, 2007, 4 (3-4), pp.334-348. ⟨10.1016/j.disopt.2007.09.003⟩. ⟨lirmm-00250124⟩
  • Daniel Gonçalves, André Raspaud, M.A. Shalu. On oriented labelling parameters. World Scientific, 2006, 66, pp.33-45. ⟨hal-00353655⟩

Conference papers23 documents

  • Daniel Gonçalves. 3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes. 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Jun 2019, Vall de Núria, Spain. pp.351-363, ⟨10.1007/978-3-030-30786-8_27⟩. ⟨lirmm-02407838⟩
  • 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⟩
  • Nathann Cohen, Daniel Gonçalves, Kim Eun Jung, Christophe Paul, Ignasi Sau Valls, 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⟩
  • Boris Albar, Daniel Gonçalves, Kolja Knauer. Orienting triangulations. EuroCG: European Workshop on Computational Geometry, Mar 2015, Ljubljana, Slovenia. ⟨lirmm-01264309⟩
  • 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⟩
  • 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, 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⟩
  • 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 Valls, 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: 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⟩
  • 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⟩
  • 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, Pascal Ochem. Planar graphs are in 1-string. SODA 2007, 2007, United States. pp.609--617. ⟨hal-00308130⟩
  • 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, Mickael Montassier. Acyclic choosability of graphs with small maximum degree. WG 2005, 2005, France. pp.239--248. ⟨hal-00307782⟩
  • 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⟩