Nombre de documents

23

Publications


Article dans une revue10 documents

Communication dans un congrès11 documents

  • David Coudert, Guillaume Ducoffe, Alexandru Popa. Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. SIAM, pp.20, 2018, 〈10.1137/1.9781611975031.176〉. 〈hal-01676187〉
  • Guillaume Ducoffe. Finding cut-vertices in the square roots of a graph. 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Jun 2017, Eindhoven, Netherlands. Lecture Notes in Computer Science, 10520, pp.234--248, 2017, Graph-Theoretic Concepts in Computer Science. 〈10.1007/978-3-319-68705-6_18〉. 〈hal-01627959〉
  • Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Alexandru Popa. On the (di)graphs with (directed) proper connection number two. IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), Sep 2017, Marseille, France. 62, pp.237 - 242, 2017, 〈10.1016/j.endm.2017.10.041〉. 〈hal-01625042〉
  • David Coudert, Guillaume Ducoffe. A simple approach for lower-bounding the distortion in any Hyperbolic embedding. EUROCOMB'17 -- The European Conference on Combinatorics, Graph Theory and Applications, Aug 2017, Vienna, Austria. Elsevier, Electronic Notes in Discrete Mathematics, 61, pp.293 - 299, 2017, 〈10.1016/j.endm.2017.06.051〉. 〈hal-01573042〉
  • 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-01361056〉
  • 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-01354996〉
  • 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-01302470〉
  • 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-01144787〉
  • 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-01144694〉
  • 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-01100757〉
  • Guillaume Ducoffe, Dorian Mazauric, Augustin Chaintreau. De la difficulté de garder ses amis (quand on a des ennemis) !. Nisse, Nicolas et Rousseau, Franck et Busnel, Yann. 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.1-4, 2013. 〈hal-00815680〉

Poster1 document

Thèse1 document