Guillaume Ducoffe
Guillaume Ducoffe
University of Bucharest - Faculty of Mathematics and Informatics, and ICI
Email confirmado em - Página inicial
Citado por
Citado por
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
Applying clique-decomposition for computing Gromov hyperbolicity
N Cohen, D Coudert, G Ducoffe, A Lancin
Theoretical computer science 690, 114-139, 2017
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
Diameter of minimal separators in graphs
D Coudert, G Ducoffe, N Nisse
Inria Sophia Antipolis; I3S; INRIA, 2014
On the hyperbolicity of bipartite graphs and intersection graphs
D Coudert, G Ducoffe
Discrete Applied Mathematics 214, 187-195, 2016
On the complexity of computing treebreadth
G Ducoffe, S Legay, N Nisse
Algorithmica, 1-27, 2019
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
Data center interconnection networks are not hyperbolic
D Coudert, G Ducoffe
Theoretical Computer Science 639, 72-90, 2016
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, 1-37, 2019
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
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
Fast diameter computation within split graphs
G Ducoffe, M Habib, L Viennot
International Conference on Combinatorial Optimization and Applications, 155-167, 2019
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
Eulerian and Hamiltonian directed hypergraphs
G Ducoffe
INRIA, 2012
Convergence of coloring games with collusions
G Ducoffe, D Mazauric, A Chaintreau
CoRR abs/1212.3782, 2012
The b-matching problem in distance-hereditary graphs and beyond
G Ducoffe, A Popa
29th International Symposium on Algorithms and Computation (ISAAC 2018) 122 …, 2018
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
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
FF Dragan, G Ducoffe, HM Guarnera
arXiv preprint arXiv:2102.08349, 2021
Finding cut-vertices in the square roots of a graph
G Ducoffe
Discrete Applied Mathematics 257, 158-174, 2019
O sistema não pode efectuar a operação agora. Tente novamente mais tarde.
Artigos 1–20