Guillaume Ducoffe
Orcid: 0000-0003-2127-5989Affiliations:
- University of Bucharest, Romania
According to our database1,
Guillaume Ducoffe
authored at least 64 papers
between 2012 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Algorithmica, July, 2024
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs.
Theory Comput. Syst., February, 2024
Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024
2023
Theor. Comput. Sci., February, 2023
2022
Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension.
SIAM J. Comput., 2022
Theory Comput. Syst., 2022
Algorithmica, 2022
Algorithmica, 2022
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022
2021
SIAM J. Discret. Math., 2021
Discret. Math. Theor. Comput. Sci., 2021
Discret. Comput. Geom., 2021
Discret. Appl. Math., 2021
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes.
Discret. Appl. Math., 2021
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021
2020
Discret. Appl. Math., 2020
Diameter computation on <i>H</i>-minor free graphs and graphs of bounded (distance) VC-dimension.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2019
ACM Trans. Algorithms, 2019
Discret. Appl. Math., 2019
Discret. Appl. Math., 2019
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension.
CoRR, 2019
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019
2018
Inf. Process. Lett., 2018
Discret. Appl. Math., 2018
A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs.
CoRR, 2018
Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018
Digital Modelling of Knowledge Innovations In Sacrobosco's Sphere: A Practical Application Of CIDOC-CRM And Linked Open Data With CorpusTracer.
Proceedings of the 13th Annual International Conference of the Alliance of Digital Humanities Organizations, 2018
2017
Theor. Comput. Sci., 2017
Electron. Notes Discret. Math., 2017
2016
PhD thesis, 2016
Discret. Appl. Math., 2016
CoRR, 2016
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016
2015
Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015
2014
SIAM J. Discret. Math., 2014
Discret. Math. Algorithms Appl., 2014
Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., 2014
2013
2012