Nombre de documents

45

CV de Daniel Gonçalves


Article dans une revue25 documents

Communication dans un congrès19 documents

  • Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul. On Independent Set on B1-EPG Graphs. WAOA: International Workshop on Approximation and Online Algorithms, 2015, Patras, Greece. 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers, LNCS (9499), pp.158-169, 2016, Approximation and Online Algorithms. 〈10.1007/978-3-319-28684-6_14〉. 〈lirmm-01264022〉
  • Boris Albar, Daniel Gonçalves, Kolja Knauer. Orienting triangulations. EuroCG: European Workshop on Computational Geometry, Mar 2015, Ljubljana, Slovenia. 31st European Workshop on Computational Geometry, EuroCG 2015, 〈http://eurocg15.fri.uni-lj.si〉. 〈lirmm-01264309〉
  • Nathann Cohen, Daniel Gonçalves, Kim Eun Jung, Christophe Paul, Ignasi Sau, et al.. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. International Computer Science Symposium in Russia - CRS, 2015, Irkutsk, Russia. 9139, 2015, Lecture Notes in Computer Science. 〈hal-01178222〉
  • 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. 9th International colloquium on graph theory and combinatorics, June 30-July 4, 2014, 2014. 〈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. 9th International colloquium on graph theory and combinatorics, June 30-July 4, 2014, 2014, 〈http://oc.inpg.fr/conf/icgt2014/Main/HomePage〉. 〈lirmm-01264288〉
  • Boris Albar, Daniel Gonçalves. Too many triangles. LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Apr 2013, Playa del Carmen, Mexico. VII Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS) April 22-26, 2013 Playa del Carmen, Mexico, 44, pp.293-297, 2013, Electronic Notes in Discrete Mathematics. 〈10.1016/j.endm.2013.10.046〉. 〈lirmm-01263909〉
  • Daniel Gonçalves. Modèles d'Intersections Géométriques pour les Graphes Planaires. JGA'10: Journées Graphes et Algorithmes, France. 2010, 〈http://www.lif.univ-mrs.fr/jga10/〉. 〈lirmm-00738561〉
  • 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. 2012. 〈lirmm-00738536〉
  • 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. LNCS (7551), pp.308-319, 2012, Graph-Theoretic Concepts in Computer Science. 〈https://sites.google.com/site/wg2012conf/〉. 〈10.1007/978-3-642-34611-8_31〉. 〈lirmm-00738534〉
  • 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. LNCS (7551), pp.57-68, 2012. 〈lirmm-00738525〉
  • 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, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-18469-7_24〉. 〈lirmm-00620728〉
  • Daniel Gonçalves. Planar Graphs as Intersection Graphs. LAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. VI Latin-American Algorithms, Graphs and Optimization Symposium, 2011, 〈http://www-2.dc.uba.ar/lagos2011/〉. 〈lirmm-00808045〉
  • Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. Spanning galaxies in digraphs. Jaroslav Nešetřil and André Raspaud. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. Elsevier, 34, pp.139-143, 2009, Electronic Notes in Discrete Mathematics. 〈http://eurocomb09.labri.fr/〉. 〈10.1016/j.endm.2009.07.023〉. 〈lirmm-00433050〉
  • 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. Elsevier, 34, pp.213-217, 2009, Electronic Notes in Discrete Mathematics. 〈lirmm-00433096〉
  • 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, 2009, 〈http://www.umiacs.umd.edu/conferences/stoc2009/index.shtml〉. 〈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, 2007. 〈hal-00308130〉
  • Daniel Gonçalves. Edge Partition of Planar Graphs into Two Outerplanar Graphs. Proceedings of STOC '05, 2005, United States. pp.504 - 512, 2005. 〈hal-00307781〉
  • Daniel Gonçalves, Mickael Montassier. Acyclic choosability of graphs with small maximum degree. WG 2005, 2005, France. D. Kratsch, 3787, pp.239--248, 2005. 〈hal-00307782〉
  • Daniel Gonçalves. On the $L(p,1)$-labelling of graphs. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.81-86, 2005, DMTCS Proceedings. 〈hal-01184395〉

Pré-publication, Document de travail1 document

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