1. Recherche
23 résultats  enregistrer la recherche
lirmm-00338319v1  Article dans une revue
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-00808045v1  Communication dans un congrès
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-00433096v1  Communication dans un congrès
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-01264288v1  Communication dans un congrès
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-01263909v1  Communication dans un congrès
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-01233456v1  Communication dans un congrès
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-00738525v1  Communication dans un congrès
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-00738561v1  Communication dans un congrès
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-01264309v1  Communication dans un congrès
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>
...
hal-01184395v1  Communication dans un congrès
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
lirmm-01263819v1  Article dans une revue
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-00433091v1  Article dans une revue
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-00250121v1  Article dans une revue
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-00338327v1  Article dans une revue
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-00250126v1  Article dans une revue
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-00808034v1  Article dans une revue
Daniel Gonçalves. On Vertex Partitions and some Minor-Monotone Parameters
Journal of Graph Theory, Wiley, 2010, 66 (1), pp.49-56
lirmm-00338324v1  Article dans une revue
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-01263827v1  Article dans une revue
Boris Albar, Daniel Gonçalves, Jorge L. 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>
...
hal-00996709v2  Article dans une revue
Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni. Two floor building needing eight colors
Journal of Graph Algorithms and Applications (JGAA), Brown University, 2015, 19 (1), pp.1--9. <http://dx.doi.org/10.7155/jgaa.00344>
...
hal-00768472v2  Article dans une revue
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>

Contact


archive-ouverte@inria.fr