Guillaume Ducoffe

79
Documents

Publications

Publications

Deposit thumbnail

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs

Feodor F Dragan , Guillaume Ducoffe , Heather M Guarnera

Journal of Computer and System Sciences, 2025, 149, pp.103606. ⟨10.1016/j.jcss.2024.103606⟩

Article dans une revue hal-04812612v1
Deposit thumbnail

Balancing graph Voronoi diagrams with one more vertex

Guillaume Ducoffe

Networks, 2024, 83 (2), pp.368-389. ⟨10.1002/net.22198⟩

Article dans une revue hal-04445634v1
Deposit thumbnail

$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities

Feodor F Dragan , Guillaume Ducoffe

Algorithmica, In press, ⟨10.1007/s00453-024-01223-6⟩

Article dans une revue hal-04520525v1
Deposit thumbnail

Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs

Pierre Bergé , Guillaume Ducoffe , Michel Habib

Theory of Computing Systems, 2024, 68 (1), pp.144-193. ⟨10.1007/s00224-023-10153-9⟩

Article dans une revue hal-04452245v1
Deposit thumbnail

Corrigendum: The diameter of AT‐free graphs

Guillaume Ducoffe

Journal of Graph Theory, In press, ⟨10.1002/jgt.23170⟩

Article dans une revue hal-04693583v1
Deposit thumbnail

Graph based analysis of the Bucharest transport network

Guillaume Ducoffe

Romanian Journal of Information Technology and Automatic Control, 2024, 34 (1), pp.59-68. ⟨10.33436/v34i1y202406⟩

Article dans une revue hal-04541711v1
Deposit thumbnail

Leanness Computation: Small Values and Special Graph Classes

David Coudert , Samuel Coulomb , Guillaume Ducoffe

Discrete Mathematics and Theoretical Computer Science, 2024, 26 (2), pp.22. ⟨10.46298/dmtcs.12544⟩

Article dans une revue hal-04281128v3
Deposit thumbnail

Distance problems within Helly graphs and k-Helly graphs

Guillaume Ducoffe

Theoretical Computer Science, 2023, 946, pp.113690. ⟨10.1016/j.tcs.2023.113690⟩

Article dans une revue hal-03942267v1
Deposit thumbnail

Treelength of series–parallel graphs

Thomas Dissaux , Guillaume Ducoffe , Nicolas Nisse , Simon Nivelle

Discrete Applied Mathematics, 2023, 341, pp.16-30. ⟨10.1016/j.dam.2023.07.022⟩

Article dans une revue hal-04268050v1
Deposit thumbnail

The power of interval models for computing graph centralities

Guillaume Ducoffe

Romanian Journal of Information Technology and Automatic Control, 2022, 32 (4), pp.33-44. ⟨10.33436/v32i4y202203⟩

Article dans une revue hal-03906922v1
Deposit thumbnail

A variation of Boolean distance

Guillaume Ducoffe

Bulletin mathématique de la Société des Sciences mathématiques de Roumanie, 2022, 65(113) (4), pp.405-419

Article dans une revue hal-03876902v1
Deposit thumbnail

Optimal Centrality Computations Within Bounded Clique-Width Graphs

Guillaume Ducoffe

Algorithmica, In press, ⟨10.1007/s00453-022-01015-w⟩

Article dans une revue hal-03746312v1
Deposit thumbnail

Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width

Guillaume Ducoffe

Algorithmica, In press, ⟨10.1007/s00453-022-00999-9⟩

Article dans une revue hal-03712098v1
Deposit thumbnail

Eccentricity queries and beyond using hub labels

Guillaume Ducoffe

Theoretical Computer Science, 2022, ⟨10.1016/j.tcs.2022.07.017⟩

Article dans une revue hal-03738888v1
Deposit thumbnail

The diameter of AT-free graphs

Guillaume Ducoffe

Journal of Graph Theory, 2022, 99 (4), pp.594-614. ⟨10.1002/jgt.22754⟩

Article dans une revue hal-03370937v1
Deposit thumbnail

Diameter, eccentricities and distance oracle computations on H-minor free graphs and graphs of bounded (distance) VC-dimension

Guillaume Ducoffe , Michel Habib , Laurent Viennot

SIAM Journal on Computing, 2022, 51 (5), pp.1506-1534. ⟨10.1137/20M136551X⟩

Article dans une revue hal-03841015v1
Deposit thumbnail

Non-existence of stable social groups in information-driven networks

Augustin Chaintreau , Dorian Mazauric , Guillaume Ducoffe

Theory of Computing Systems, In press, 66, pp.758-777. ⟨10.1007/s00224-022-10089-6⟩

Article dans une revue hal-03696264v1
Deposit thumbnail

A story of diameter, radius and (almost) Helly property

Guillaume Ducoffe , Feodor F Dragan

Networks, 2021, 77 (3), pp.435-453

Article dans une revue hal-02969188v1
Deposit thumbnail

Fast Diameter Computation within Split Graphs

Guillaume Ducoffe , Michel Habib , Laurent Viennot

Discrete Mathematics and Theoretical Computer Science, 2021, ⟨10.46298/dmtcs.6422⟩

Article dans une revue hal-02307397v4
Deposit thumbnail

Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs

Guillaume Ducoffe

SIAM Journal on Discrete Mathematics, 2021, 35 (2), pp.953-969. ⟨10.1137/20M1330415⟩

Article dans une revue hal-03225724v1
Deposit thumbnail

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs

Jérémie Chalopin , Victor Chepoi , Feodor F. Dragan , Guillaume Ducoffe , Abdulhakeem Mohammed et al.

Discrete and Computational Geometry, 2021, 65 (3), pp.856-892. ⟨10.1007/s00454-019-00107-9⟩

Article dans une revue hal-02149991v1
Deposit thumbnail

The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes

Guillaume Ducoffe , Alexandru Popa

Discrete Applied Mathematics, 2021, 291, pp.201-222. ⟨10.1016/j.dam.2020.12.018⟩

Article dans une revue hal-03095562v1
Deposit thumbnail

The b-Matching problem in distance-hereditary graphs and beyond

Guillaume Ducoffe , Alexandru Popa

Discrete Applied Mathematics, 2021, 305, pp.233-246. ⟨10.1016/j.dam.2021.09.012⟩

Article dans une revue hal-03359175v1
Deposit thumbnail

On the Complexity of Computing Treebreadth

Guillaume Ducoffe , Sylvain Legay , Nicolas Nisse

Algorithmica, 2020, 82 (6), pp.1574-1600. ⟨10.1007/s00453-019-00657-7⟩

Article dans une revue hal-02528905v1
Deposit thumbnail

On the (di)graphs with (directed) proper connection number two

Guillaume Ducoffe , Ruxandra Marinescu-Ghemeci , Alexandru Popa

Discrete Applied Mathematics, 2020, 281, pp.203-215. ⟨10.1016/j.dam.2019.06.024⟩

Article dans une revue hal-02179551v1
Deposit thumbnail

P-FPT algorithms for bounded clique-width graphs

David Coudert , Guillaume Ducoffe , Alexandru Popa

ACM Transactions on Algorithms, 2019, 15 (3), pp.1-57. ⟨10.1145/3310228⟩

Article dans une revue hal-02152971v1
Deposit thumbnail

Finding cut-vertices in the square roots of a graph

Guillaume Ducoffe

Discrete Applied Mathematics, 2019, 257, pp.158-174

Article dans une revue hal-01948839v1
Deposit thumbnail

Low Time Complexity Algorithms for Path Computation in Cayley Graphs

Daniela Aguirre-Guerrero , Guillaume Ducoffe , Lluis Fabrega , Pere Vila , David Coudert

Discrete Applied Mathematics, 2019, 259, pp.218-225. ⟨10.1016/j.dam.2018.12.005⟩

Article dans une revue hal-01973608v1
Deposit thumbnail

Equivalence between pathbreadth and strong pathbreadth

Guillaume Ducoffe , Arne Leitert

Discrete Applied Mathematics, 2019, 262, pp.185-188. ⟨10.1016/j.dam.2019.02.009⟩

Article dans une revue hal-02055113v1
Deposit thumbnail

Easy computation of eccentricity approximating trees

Guillaume Ducoffe

Discrete Applied Mathematics, 2019, 260, pp.267-271

Article dans une revue hal-02011252v1
Deposit thumbnail

How long does it take for all users in a social network to choose their communities?

Jean-Claude Bermond , Augustin Chaintreau , Guillaume Ducoffe , Dorian Mazauric

Discrete Applied Mathematics, 2019, 270, pp.37-57. ⟨10.1016/j.dam.2019.07.023⟩

Article dans une revue hal-02264327v1
Deposit thumbnail

Revisiting Decomposition by Clique Separators

David Coudert , Guillaume Ducoffe

SIAM Journal on Discrete Mathematics, 2018, 32 (1), pp.682 - 694. ⟨10.1137/16M1059837⟩

Article dans une revue hal-01753324v1
Deposit thumbnail

A short note on the complexity of computing strong pathbreadth

Guillaume Ducoffe

Information Processing Letters, 2018, 133, pp.56-58. ⟨10.1016/j.ipl.2018.01.005⟩

Article dans une revue hal-01735826v1
Deposit thumbnail

On interval number in cycle convexity

Julio Araujo , Guillaume Ducoffe , Nicolas Nisse , Karol Suchan

Discrete Mathematics and Theoretical Computer Science, 2018, Vol. 20 no. 1 (1), pp.1-28. ⟨10.23638/DMTCS-20-1-13⟩

Article dans une revue hal-01394201v4
Deposit thumbnail

On distance-preserving elimination orderings in graphs: Complexity and algorithms

David Coudert , Guillaume Ducoffe , Nicolas Nisse , Mauricio Soto

Discrete Applied Mathematics, 2018, 243, pp.140-153. ⟨10.1016/j.dam.2018.02.007⟩

Article dans une revue hal-01741277v1
Deposit thumbnail

Applying clique-decomposition for computing Gromov hyperbolicity

Nathann Cohen , David Coudert , Guillaume Ducoffe , Aurélien Lancin

Theoretical Computer Science, 2017, 690, pp.114-139. ⟨10.1016/j.tcs.2017.06.001⟩

Article dans une revue hal-01540756v1
Deposit thumbnail

Data center interconnection networks are not hyperbolic

David Coudert , Guillaume Ducoffe

Theoretical Computer Science, 2016, 639, pp.72-90. ⟨10.1016/j.tcs.2016.05.025⟩

Article dans une revue hal-01323301v1
Deposit thumbnail

To Approximate Treewidth, Use Treelength!

David Coudert , Guillaume Ducoffe , Nicolas Nisse

SIAM Journal on Discrete Mathematics, 2016, 30 (3), pp.13. ⟨10.1137/15M1034039⟩

Article dans une revue hal-01348965v1
Deposit thumbnail

On the hyperbolicity of bipartite graphs and intersection graphs

David Coudert , Guillaume Ducoffe

Discrete Applied Mathematics, 2016, 214, pp.187-195. ⟨10.1016/j.dam.2016.06.017⟩

Article dans une revue hal-01220132v2
Deposit thumbnail

Eulerian and Hamiltonian dicycles in directed hypergraphs

Julio Araujo , Jean-Claude Bermond , Guillaume Ducoffe

Discrete Mathematics, Algorithms and Applications, 2014, 06, pp.1450012. ⟨10.1142/S1793830914500128⟩

Article dans une revue hal-01104634v2
Deposit thumbnail

Recognition of C4-free and 1/2-hyperbolic graphs

David Coudert , Guillaume Ducoffe

SIAM Journal on Discrete Mathematics, 2014, 28 (3), pp.1601-1617. ⟨10.1137/140954787⟩

Article dans une revue hal-01070768v1
Deposit thumbnail

Hamiltonicity of large generalized de Bruijn cycles

Guillaume Ducoffe

Discrete Applied Mathematics, 2013, 161, pp.2200 - 2204. ⟨10.1016/j.dam.2013.02.027⟩

Article dans une revue hal-01103786v1
Deposit thumbnail

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs

Feodor F. Dragan , Guillaume Ducoffe , Michel Habib , Laurent Viennot

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan 2025, New Orleans (LA), United States. pp.2157--2193, ⟨10.1137/1.9781611978322.70⟩

Communication dans un congrès hal-01729748v6
Deposit thumbnail

Quasilinear-time eccentricities computation, and more, on median graphs

Pierre Bergé , Guillaume Ducoffe , Michel Habib

SODA 2025, Jan 2025, Nouvelle Orléans (USA), United States

Communication dans un congrès hal-04732470v1
Deposit thumbnail

Practical Computation of Graph VC-Dimension

David Coudert , Mónika Csikós , Guillaume Ducoffe , Laurent Viennot

SEA 2024 - Symposium on Experimental Algorithms, Jul 2024, Vienne, Austria. pp.20, ⟨10.4230/LIPIcs.SEA.2024.8⟩

Communication dans un congrès hal-04553784v1
Deposit thumbnail

αi-Metric Graphs: Radius, Diameter and all Eccentricities

Feodor F Dragan , Guillaume Ducoffe

Graph-Theoretic Concepts in Computer Science (WG 2023), Jun 2023, Fribourg (CH), Switzerland. pp.276-290, ⟨10.1007/978-3-031-43380-1_20⟩

Communication dans un congrès hal-04267646v1

Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs

Pierre Bergé , Guillaume Ducoffe , Michel Habib

39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Mar 2022, Marseille, France. ⟨10.4230/LIPIcs.STACS.2022.9⟩

Communication dans un congrès hal-03603802v1
Deposit thumbnail

Obstructions to faster diameter computation: Asteroidal sets

Guillaume Ducoffe

17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Sep 2022, Postdam, Germany. ⟨10.4230/LIPIcs.IPEC.2022.15⟩

Communication dans un congrès hal-03906291v1
Deposit thumbnail

Optimal centrality computations within bounded clique-width graphs

Guillaume Ducoffe

16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Sep 2021, Lisbon (virtual event), Portugal. ⟨10.4230/LIPIcs.IPEC.2021.16⟩

Communication dans un congrès hal-03445484v1
Deposit thumbnail

Treelength of Series-parallel graphs

Thomas Dissaux , Guillaume Ducoffe , Nicolas Nisse , Simon Nivelle

LAGOS 2021 - XI Latin and American Algorithms, Graphs and Optimization Symposium, May 2021, São Paulo / Virtual, Brazil. ⟨10.1016/j.procs.2021.11.008⟩

Communication dans un congrès hal-03175837v1
Deposit thumbnail

Isometric embeddings in trees and their use in distance problems

Guillaume Ducoffe

46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Aug 2021, Tallinn, Estonia. ⟨10.4230/LIPIcs.MFCS.2021.43⟩

Communication dans un congrès hal-03323472v1
Deposit thumbnail

Maximum Matching in almost linear time on graphs of bounded clique-width

Guillaume Ducoffe

16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Sep 2021, Lisbon (virtual event), Portugal. ⟨10.4230/LIPIcs.IPEC.2021.15⟩

Communication dans un congrès hal-03445479v1
Deposit thumbnail

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs

Feodor F Dragan , Guillaume Ducoffe , Heather M Guarnera

Algorithms and Data Structures 17th International Symposium (WADS 2021), Aug 2021, Halifax, Nova Scotia (Virtual Event), Canada. pp.300-314, ⟨10.1007/978-3-030-83508-8_22⟩

Communication dans un congrès hal-03315928v1
Deposit thumbnail

On computing the average distance for some chordal-like graphs

Guillaume Ducoffe

46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Aug 2021, Tallinn, Estonia. ⟨10.4230/LIPIcs.MFCS.2021.44⟩

Communication dans un congrès hal-03323471v1
Deposit thumbnail

Beyond Helly graphs: the diameter problem on absolute retracts

Guillaume Ducoffe

47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021), Jun 2021, Warsaw (online), Poland. pp.321-335, ⟨10.1007/978-3-030-86838-3_25⟩

Communication dans un congrès hal-03350582v1
Deposit thumbnail

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension

Guillaume Ducoffe , Michel Habib , Laurent Viennot

SODA 2020 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, United States

Communication dans un congrès hal-02340382v1
Deposit thumbnail

The 4-Steiner Root Problem

Guillaume Ducoffe

45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019), Jun 2019, Vall de Nuria, Spain. pp.14-26, ⟨10.1007/978-3-030-30786-8_2⟩

Communication dans un congrès hal-02290671v1
Deposit thumbnail

A new application of Orthogonal Range Searching for computing Giant Graph Diameters

Guillaume Ducoffe

2nd Symposium on Simplicity in Algorithms (SOSA 2019), Jan 2019, San Diego, CA, United States. pp.12:1-12:7, ⟨10.4230/OASIcs.SOSA.2019.12⟩

Communication dans un congrès hal-01974190v1
Deposit thumbnail

Faster approximation algorithms for computing shortest cycles on weighted graphs

Guillaume Ducoffe

46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.44⟩

Communication dans un congrès hal-02173350v1

Fast Diameter Computation within Split Graphs

Guillaume Ducoffe , Michel Habib , Laurent Viennot

COCOA 2019 - 13th Annual International Conference on Combinatorial Optimization and Applications, Dec 2019, Xiamen, China

Communication dans un congrès hal-03373614v1
Deposit thumbnail

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs

Jérémie Chalopin , Victor Chepoi , Feodor F. Dragan , Guillaume Ducoffe , Abdulhakeem Mohammed et al.

34th International Symposium on Computational Geometry (SoCG 2018), Jun 2018, Budapest, Hungary. pp.22, ⟨10.4230/LIPIcs.SoCG.2018.22⟩

Communication dans un congrès hal-01836063v1
Deposit thumbnail

The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes

Guillaume Ducoffe , Alexandru Popa

29th International Symposium on Algorithms and Computation (ISAAC 2018), Dec 2018, Jiaoxi, Yilan County, Taiwan. ⟨10.4230/LIPIcs.ISAAC.2018.144⟩

Communication dans un congrès hal-01955985v1
Deposit thumbnail

Extremal Graphs with respect to the Modified First Zagreb Connection Index

Guillaume Ducoffe , Ruxandra Marinescu-Ghemeci , Camelia Obreja , Alexandru Popa , Rozica Maria Tache

20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Sep 2018, Timisoara, Romania. ⟨10.1109/SYNASC.2018.00033⟩

Communication dans un congrès hal-02011274v1
Deposit thumbnail

The b-Matching problem in distance-hereditary graphs and beyond

Guillaume Ducoffe , Alexandru Popa

29th International Symposium on Algorithms and Computation (ISAAC 2018), Dec 2018, Jiaoxi, Yilan County, Taiwan. pp.1 - 122, ⟨10.4230/LIPIcs.ISAAC.2018.122⟩

Communication dans un congrès hal-01955994v1
Deposit thumbnail

Fully polynomial FPT algorithms for some classes of bounded clique-width graphs

David Coudert , Guillaume Ducoffe , Alexandru Popa

ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.20, ⟨10.1137/1.9781611975031.176⟩

Communication dans un congrès hal-01676187v1
Deposit thumbnail

How long does it take for all users in a social network to choose their communities?

Jean-Claude Bermond , Augustin Chaintreau , Guillaume Ducoffe , Dorian Mazauric

FUN 2018 - 9th International Conference on Fun with Algorithms, 2018, La Maddalena, Italy

Communication dans un congrès hal-01780627v1
Deposit thumbnail

Extremal Graphs with respect to the Modified First Zagreb Connection Index

Guillaume Ducoffe , Ruxandra Marinescu-Ghemeci , Camelia Obreja , Alexandru Popa , Rozica Maria Tache

Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), Jun 2018, Paris, France

Communication dans un congrès hal-02011265v1
Deposit thumbnail

Finding cut-vertices in the square roots of a graph

Guillaume Ducoffe

43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Jun 2017, Eindhoven, Netherlands. pp.234--248, ⟨10.1007/978-3-319-68705-6_18⟩

Communication dans un congrès hal-01627959v1
Deposit thumbnail

A simple approach for lower-bounding the distortion in any Hyperbolic embedding

David Coudert , Guillaume Ducoffe

EUROCOMB'17 -- The European Conference on Combinatorics, Graph Theory and Applications, Aug 2017, Vienna, Austria. pp.293 - 299, ⟨10.1016/j.endm.2017.06.051⟩

Communication dans un congrès hal-01573042v1
Deposit thumbnail

On the (di)graphs with (directed) proper connection number two

Guillaume Ducoffe , Ruxandra Marinescu-Ghemeci , Alexandru Popa

IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), Sep 2017, Marseille, France. pp.237 - 242, ⟨10.1016/j.endm.2017.10.041⟩

Communication dans un congrès hal-01625042v1
Deposit thumbnail

On the Complexity of Computing Treebreadth

Guillaume Ducoffe , Sylvain Legay , Nicolas Nisse

27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Aug 2016, Helsinki, Finland. pp.3-15, ⟨10.1007/978-3-319-44543-4_1⟩

Communication dans un congrès hal-01354996v1
Deposit thumbnail

Liens entre symétries et étirements de routages dans les réseaux d'interconnexions de centres de données

David Coudert , Guillaume Ducoffe

ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France

Communication dans un congrès hal-01302470v1
Deposit thumbnail

The Parallel Complexity of Coloring Games

Guillaume Ducoffe

9th International Symposium, SAGT 2016, Sep 2016, Liverpool, United Kingdom. pp.27-39, ⟨10.1007/978-3-662-53354-3_3⟩

Communication dans un congrès hal-01361056v1
Deposit thumbnail

Vers une plus grande transparence du Web

Augustin Chaintreau , Guillaume Ducoffe , Roxana Geambasu , Mathias Lécuyer

ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France

Communication dans un congrès hal-01144787v1
Deposit thumbnail

Structure vs métrique dans les graphes

David Coudert , Guillaume Ducoffe , Nicolas Nisse

ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France

Communication dans un congrès hal-01144694v1
Deposit thumbnail

XRay: Enhancing the Web's Transparency with Differential Correlation

Mathias Lecuyer , Guillaume Ducoffe , Francis Lan , Andrei Papancea , Theofilos Petsios et al.

USENIX Security Symposium, Aug 2014, San Diego, United States

Communication dans un congrès hal-01100757v1
Deposit thumbnail

De la difficulté de garder ses amis (quand on a des ennemis) !

Guillaume Ducoffe , Dorian Mazauric , Augustin Chaintreau

15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.1-4

Communication dans un congrès hal-00815680v1
Deposit thumbnail

Web Transparency for Complex Targeting: Algorithms, Limits, and Tradeoffs

Guillaume Ducoffe , Mathias Lécuyer , Augustin Chaintreau , Roxana Geambasu

SIGMETRICS '15 Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Jun 2015, Portland, Oregon, United States. , ⟨10.1145/2745844.2745896⟩

Poster de conférence hal-01163552v1
Deposit thumbnail

Contributions to Path Problems in Graphs

Guillaume Ducoffe

Data Structures and Algorithms [cs.DS]. University of Bucharest, Faculty of Mathematics and Computer Science, 2025

HDR tel-05090989v1