 |
 |
 |
 |
|
|
||
|---|---|---|
|
tel-01485328v1
Thèse
Guillaume Ducoffe. Metric properties of large graphs Other [cs.OH]. Université Côte d'Azur, 2016. English. < NNT : 2016AZUR4134 > |
||
|
hal-01104634v2
Article dans une revue
Julio Araujo, Jean-Claude Bermond, Guillaume Ducoffe. Eulerian and Hamiltonian dicycles in directed hypergraphs Discrete Mathematics, Algorithms and Applications, World Scientific Publishing, 2014, 06, pp.1450012. <10.1142/S1793830914500128> |
||
|
hal-01491146v1
Rapport
Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Alexandru Popa. On the (di)graphs with (directed) proper connection number two [Research Report] Université Côte d’Azur, Inria, CNRS, I3S, France; University of Bucharest, Faculty of Mathematics and Computer Science; National Institute for Research and Development in Informatics, Romania; The Research Institute of the University of Bucharest ICUB, Romania. 2017 |
||
|
hal-01477981v2
Rapport
Guillaume Ducoffe. Finding cut-vertices in the square roots of a graph [Research Report] Université Côte d’Azur, Inria, CNRS, I3S, France. 2017 |
||
|
hal-00937935v2
Rapport
David Coudert, Guillaume Ducoffe. On the recognition of $C_4$-free and $1/2$-hyperbolic graphs [Research Report] RR-8458, INRIA. 2014, pp.20 |
||
|
hal-00989024v2
Rapport
Nathann Cohen, David Coudert, Guillaume Ducoffe, Aurélien Lancin. Applying clique-decomposition for computing Gromov hyperbolicity [Research Report] RR-8535, INRIA. 2014, pp.33 |
||
|
hal-01562413v1
Rapport
David Coudert, Guillaume Ducoffe, Alexandru Popa. Fully polynomial FPT algorithms for some classes of bounded clique-width graphs [Research Report] Inria - Sophia antipolis; Universite Cote d'Azur; University of Bucharest, Faculty of Mathematics and Computer Science; National Institute for Research and Development in Informatics, Romania. 2017 |
||
|
hal-01144694v1
Communication dans un congrès
David Coudert, Guillaume Ducoffe, Nicolas Nisse. Structure vs métrique dans les graphes ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France |
||
|
hal-01100757v1
Communication dans un congrès
Mathias Lecuyer, Guillaume Ducoffe, Francis Lan, Andrei Papancea, Theofilos Petsios et al. XRay: Enhancing the Web's Transparency with Differential Correlation USENIX Security Symposium, Aug 2014, San Diego, United States |
||
|
hal-01088423v2
Rapport
David Coudert, Guillaume Ducoffe, Nicolas Nisse. Diameter of Minimal Separators in Graphs [Research Report] RR-8639, Inria Sophia Antipolis; I3S; INRIA. 2014, pp.16 |
||
|
hal-01144787v1
Communication dans un congrès
Augustin Chaintreau, Guillaume Ducoffe, Roxana Geambasu, Mathias Lécuyer. Vers une plus grande transparence du Web ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France |
||
|
hal-01354996v1
Communication dans un congrès
Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse. On the Complexity of Computing Treebreadth Veli Mäkinen; Simon J. Puglisi; Leena Salmela. 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Aug 2016, Helsinki, Finland. Springer International Publishing, 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), pp.3-15, 2016, Combinatorial Algorithms. <http://iwoca2016.cs.helsinki.fi/>. <10.1007/978-3-319-44543-4_1> |
||
|
hal-01394201v1
Rapport
Julio Araujo, Guillaume Ducoffe, Nicolas Nisse, Karol Suchan. On interval number in cycle convexity [Research Report] Inria Sophia Antipolis; I3S. 2016 |
||
|
hal-01393523v1
Rapport
David Coudert, Guillaume Ducoffe, Nicolas Nisse, Mauricio Soto. Distance-preserving orderings in graphs [Research Report] RR-8973, Inria Sophia Antipolis. 2016 |
||
|
hal-01361056v1
Communication dans un congrès
Guillaume Ducoffe. The Parallel Complexity of Coloring Games Martin Gairing and Rahul Savani. 9th International Symposium, SAGT 2016, Sep 2016, Liverpool, United Kingdom. Springer International Publishing, pp.27-39, 2016, Algorithmic Game Theory. <http://sagt16.csc.liv.ac.uk/>. <10.1007/978-3-662-53354-3_3> |
||
|
hal-01302470v1
Communication dans un congrès
David Coudert, Guillaume Ducoffe. Liens entre symétries et étirements de routages dans les réseaux d'interconnexions de centres de données ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France |
||
|
hal-01266147v1
Rapport
David Coudert, Guillaume Ducoffe. Clique-decomposition revisited [Research Report] INRIA Sophia Antipolis - I3S. 2016 |
||
|
hal-01254917v1
Rapport
Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse. On computing tree and path decompositions with metric constraints on the bags [Research Report] RR-8842, INRIA Sophia Antipolis - Méditerranée; LRI - CNRS, University Paris-Sud. 2016, pp.66 |
||
|
hal-01149203v1
Rapport
David Coudert, Guillaume Ducoffe. Data center interconnection networks are not hyperbolic [Research Report] Inria Sophia Antipolis; I3S; Université Nice Sophia Antipolis; CNRS. 2015, pp.23 |
||
|
hal-01163552v1
Poster
Guillaume Ducoffe, Mathias Lécuyer, Augustin Chaintreau, Roxana Geambasu. Web Transparency for Complex Targeting: Algorithms, Limits, and Tradeoffs SIGMETRICS '15 Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Jun 2015, Portland, Oregon, United States. <http://www.sigmetrics.org/sigmetrics2015/>. <10.1145/2745844.2745896> |
||
|
hal-00674655v3
Rapport
Guillaume Ducoffe. Eulerian and Hamiltonian Directed Hypergraphs [Research Report] RR-7893, INRIA. 2012, pp.55 |
||
|
hal-01103786v1
Article dans une revue
Guillaume Ducoffe. Hamiltonicity of large generalized de Bruijn cycles Discrete Applied Mathematics, Elsevier, 2013, 161, pp.2200 - 2204. <10.1016/j.dam.2013.02.027> |
||
|
hal-01220132v2
Article dans une revue
David Coudert, Guillaume Ducoffe. On the hyperbolicity of bipartite graphs and intersection graphs Discrete Applied Mathematics, Elsevier, 2016, 214, pp.187-195. <10.1016/j.dam.2016.06.017> |
||
|
hal-01348965v1
Article dans une revue
David Coudert, Guillaume Ducoffe, Nicolas Nisse. To Approximate Treewidth, Use Treelength! Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2016, 30 (3), pp.13. <10.1137/15M1034039> |
||
|
hal-01070768v1
Article dans une revue
David Coudert, Guillaume Ducoffe. Recognition of C4-free and 1/2-hyperbolic graphs Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2014, 28 (3), pp.1601-1617. <10.1137/140954787> |
||
|
hal-01540756v1
Article dans une revue
Nathann Cohen, David Coudert, Guillaume Ducoffe, Aurélien Lancin. Applying clique-decomposition for computing Gromov hyperbolicity Theoretical Computer Science, Elsevier, 2017, <10.1016/j.tcs.2017.06.001> |
||
|
hal-01323301v1
Article dans une revue
David Coudert, Guillaume Ducoffe. Data center interconnection networks are not hyperbolic Theoretical Computer Science, Elsevier, 2016, 639, pp.72-90. <10.1016/j.tcs.2016.05.025> |
||
|
|
||