Guillaume Ducoffe
68
Documents
Publications
|
αi-Metric Graphs: Radius, Diameter and all EccentricitiesGraph-Theoretic Concepts in Computer Science (WG 2023), Jun 2023, Fribourg (CH), Switzerland. pp.276-290, ⟨10.1007/978-3-031-43380-1_20⟩
Conference papers
hal-04267646v1
|
Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Mar 2022, Marseille, France. ⟨10.4230/LIPIcs.STACS.2022.9⟩
Conference papers
hal-03603802v1
|
|
|
Obstructions to faster diameter computation: Asteroidal sets17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Sep 2022, Postdam, Germany. ⟨10.4230/LIPIcs.IPEC.2022.15⟩
Conference papers
hal-03906291v1
|
|
Optimal centrality computations within bounded clique-width graphs16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Sep 2021, Lisbon (virtual event), Portugal. ⟨10.4230/LIPIcs.IPEC.2021.16⟩
Conference papers
hal-03445484v1
|
|
Treelength of Series-parallel graphsLAGOS 2021 - XI Latin and American Algorithms, Graphs and Optimization Symposium, May 2021, São Paulo / Virtual, Brazil. ⟨10.1016/j.procs.2021.11.008⟩
Conference papers
hal-03175837v1
|
|
Isometric embeddings in trees and their use in distance problems46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Aug 2021, Tallinn, Estonia. ⟨10.4230/LIPIcs.MFCS.2021.43⟩
Conference papers
hal-03323472v1
|
|
Beyond Helly graphs: the diameter problem on absolute retracts47th 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⟩
Conference papers
hal-03350582v1
|
|
On computing the average distance for some chordal-like graphs46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Aug 2021, Tallinn, Estonia. ⟨10.4230/LIPIcs.MFCS.2021.44⟩
Conference papers
hal-03323471v1
|
|
Maximum Matching in almost linear time on graphs of bounded clique-width16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Sep 2021, Lisbon (virtual event), Portugal. ⟨10.4230/LIPIcs.IPEC.2021.15⟩
Conference papers
hal-03445479v1
|
|
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphsAlgorithms 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⟩
Conference papers
hal-03315928v1
|
|
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimensionSODA 2020 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, United States
Conference papers
hal-02340382v1
|
|
Faster approximation algorithms for computing shortest cycles on weighted graphs46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.44⟩
Conference papers
hal-02173350v1
|
Fast Diameter Computation within Split GraphsCOCOA 2019 - 13th Annual International Conference on Combinatorial Optimization and Applications, Dec 2019, Xiamen, China
Conference papers
hal-03373614v1
|
|
|
A new application of Orthogonal Range Searching for computing Giant Graph Diameters2nd 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⟩
Conference papers
hal-01974190v1
|
|
The 4-Steiner Root Problem45th 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⟩
Conference papers
hal-02290671v1
|
|
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes29th International Symposium on Algorithms and Computation (ISAAC 2018), Dec 2018, Jiaoxi, Yilan County, Taiwan. ⟨10.4230/LIPIcs.ISAAC.2018.144⟩
Conference papers
hal-01955985v1
|
|
Extremal Graphs with respect to the Modified First Zagreb Connection Index20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Sep 2018, Timisoara, Romania. ⟨10.1109/SYNASC.2018.00033⟩
Conference papers
hal-02011274v1
|
|
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs34th International Symposium on Computational Geometry (SoCG 2018), Jun 2018, Budapest, Hungary. pp.22, ⟨10.4230/LIPIcs.SoCG.2018.22⟩
Conference papers
hal-01836063v1
|
|
Extremal Graphs with respect to the Modified First Zagreb Connection IndexCologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), Jun 2018, Paris, France
Conference papers
hal-02011265v1
|
|
How long does it take for all users in a social network to choose their communities?FUN 2018 - 9th International Conference on Fun with Algorithms, 2018, La Maddalena, Italy
Conference papers
hal-01780627v1
|
|
Fully polynomial FPT algorithms for some classes of bounded clique-width graphsACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.20, ⟨10.1137/1.9781611975031.176⟩
Conference papers
hal-01676187v1
|
|
The b-Matching problem in distance-hereditary graphs and beyond29th International Symposium on Algorithms and Computation (ISAAC 2018), Dec 2018, Jiaoxi, Yilan County, Taiwan. pp.1 - 122, ⟨10.4230/LIPIcs.ISAAC.2018.122⟩
Conference papers
hal-01955994v1
|
|
On the (di)graphs with (directed) proper connection number twoIX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), Sep 2017, Marseille, France. pp.237 - 242, ⟨10.1016/j.endm.2017.10.041⟩
Conference papers
hal-01625042v1
|
|
A simple approach for lower-bounding the distortion in any Hyperbolic embeddingEUROCOMB'17 -- The European Conference on Combinatorics, Graph Theory and Applications, Aug 2017, Vienna, Austria. pp.293 - 299, ⟨10.1016/j.endm.2017.06.051⟩
Conference papers
hal-01573042v1
|
|
Finding cut-vertices in the square roots of a graph43rd 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⟩
Conference papers
hal-01627959v1
|
|
Liens entre symétries et étirements de routages dans les réseaux d'interconnexions de centres de donnéesALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France
Conference papers
hal-01302470v1
|
|
On the Complexity of Computing Treebreadth27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Aug 2016, Helsinki, Finland. pp.3-15, ⟨10.1007/978-3-319-44543-4_1⟩
Conference papers
hal-01354996v1
|
|
The Parallel Complexity of Coloring Games9th International Symposium, SAGT 2016, Sep 2016, Liverpool, United Kingdom. pp.27-39, ⟨10.1007/978-3-662-53354-3_3⟩
Conference papers
hal-01361056v1
|
|
Structure vs métrique dans les graphesALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Conference papers
hal-01144694v1
|
|
Vers une plus grande transparence du WebALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Conference papers
hal-01144787v1
|
|
XRay: Enhancing the Web's Transparency with Differential CorrelationUSENIX Security Symposium, Aug 2014, San Diego, United States
Conference papers
hal-01100757v1
|
|
De la difficulté de garder ses amis (quand on a des ennemis) !15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.1-4
Conference papers
hal-00815680v1
|
|
Web Transparency for Complex Targeting: Algorithms, Limits, and TradeoffsSIGMETRICS '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⟩
Conference poster
hal-01163552v1
|