Guillaume Ducoffe
Guillaume Ducoffe
University of Bucharest - Faculty of Mathematics and Informatics, and ICI
Verified email at - Homepage
Cited by
Cited by
{XRay}: Enhancing the {Web’s} Transparency with Differential Correlation
M Lécuyer, G Ducoffe, F Lan, A Papancea, T Petsios, R Spahn, ...
23rd USENIX Security Symposium (USENIX Security 14), 49-64, 2014
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
D Coudert, G Ducoffe, A Popa
ACM Transactions on Algorithms (TALG) 15 (3), 1-57, 2019
Recognition of -Free and 1/2-Hyperbolic Graphs
D Coudert, G Ducoffe
SIAM Journal on Discrete Mathematics 28 (3), 1601-1617, 2014
Applying clique-decomposition for computing Gromov hyperbolicity
N Cohen, D Coudert, G Ducoffe, A Lancin
Theoretical computer science 690, 114-139, 2017
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
G Ducoffe, M Habib, L Viennot
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
Extremal graphs with respect to the modified first Zagreb connection index
G Ducoffe, R Marinescu-Ghemeci, C Obreja, A Popa, RM Tache
2018 20th International Symposium on Symbolic and Numeric Algorithms for …, 2018
On the hyperbolicity of bipartite graphs and intersection graphs
D Coudert, G Ducoffe
Discrete Applied Mathematics 214, 187-195, 2016
A story of diameter, radius, and (almost) Helly property
G Ducoffe, FF Dragan
Networks 77 (3), 435-453, 2021
Diameter of minimal separators in graphs
D Coudert, G Ducoffe, N Nisse
Inria Sophia Antipolis; I3S; INRIA, 2014
On the (di) graphs with (directed) proper connection number two
G Ducoffe, R Marinescu-Ghemeci, A Popa
Electronic Notes in Discrete Mathematics 62, 237-242, 2017
Fast approximation and exact computation of negative curvature parameters of graphs
J Chalopin, V Chepoi, FF Dragan, G Ducoffe, A Mohammed, Y Vaxès
Discrete & Computational Geometry 65, 856-892, 2021
Fast diameter computation within split graphs
G Ducoffe, M Habib, L Viennot
Discrete Mathematics & Theoretical Computer Science 23 (Graph Theory), 2021
On the complexity of computing treebreadth
G Ducoffe, S Legay, N Nisse
Algorithmica 82 (6), 1574-1600, 2020
Data center interconnection networks are not hyperbolic
D Coudert, G Ducoffe
Theoretical Computer Science 639, 72-90, 2016
A new application of orthogonal range searching for computing giant graph diameters
G Ducoffe
2nd Symposium on Simplicity in Algorithms (SOSA 2019), 12: 1-12: 7, 2019
Optimal centrality computations within bounded clique-width graphs
G Ducoffe
Algorithmica 84 (11), 3192-3222, 2022
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes
G Ducoffe, A Popa
Discrete Applied Mathematics 291, 201-222, 2021
The b-matching problem in distance-hereditary graphs and beyond
G Ducoffe, A Popa
Discrete Applied Mathematics 305, 233-246, 2021
Revisiting decomposition by clique separators
D Coudert, G Ducoffe
SIAM Journal on Discrete Mathematics 32 (1), 682-694, 2018
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
FF Dragan, G Ducoffe, HM Guarnera
Workshop on Algorithms and Data Structures, 300-314, 2021
The system can't perform the operation now. Try again later.
Articles 1–20