Guillaume Ducoffe
Guillaume Ducoffe
University of Bucharest - Faculty of Mathematics and Informatics, and ICI
Email verificata su ici.ro - Home page
Titolo
Citata da
Citata da
Anno
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
1182014
Recognition of -Free and 1/2-Hyperbolic Graphs
D Coudert, G Ducoffe
SIAM Journal on Discrete Mathematics 28 (3), 1601-1617, 2014
372014
Applying clique-decomposition for computing Gromov hyperbolicity
N Cohen, D Coudert, G Ducoffe, A Lancin
Theoretical computer science 690, 114-139, 2017
292017
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
D Coudert, G Ducoffe, A Popa
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
272018
On the hyperbolicity of bipartite graphs and intersection graphs
D Coudert, G Ducoffe
Discrete Applied Mathematics 214, 187-195, 2016
202016
Diameter of minimal separators in graphs
D Coudert, G Ducoffe, N Nisse
19*2014
Data center interconnection networks are not hyperbolic
D Coudert, G Ducoffe
Theoretical Computer Science 639, 72-90, 2016
142016
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
122018
On the (di) graphs with (directed) proper connection number two
G Ducoffe, R Marinescu-Ghemeci, A Popa
Discrete Applied Mathematics 281, 203-215, 2020
112020
On the complexity of computing treebreadth
G Ducoffe, S Legay, N Nisse
International Workshop on Combinatorial Algorithms, 3-15, 2016
112016
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
102019
On the Complexity of Computing Treebreadth
G Ducoffe, S Legay, N Nisse
Algorithmica, 1-27, 2019
6*2019
Eulerian and Hamiltonian directed hypergraphs
G Ducoffe
6*2012
Convergence of coloring games with collusions
G Ducoffe, D Mazauric, A Chaintreau
CoRR abs/1212.3782, 2012
6*2012
Finding cut-vertices in the square roots of a graph
G Ducoffe
Discrete Applied Mathematics 257, 158-174, 2019
52019
The b-matching problem in distance-hereditary graphs and beyond
G Ducoffe, A Popa
5*2018
Metric properties of large graphs
G Ducoffe
5*2016
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
42020
A new application of orthogonal range searching for computing giant graph diameters
G Ducoffe
42019
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes
G Ducoffe, A Popa
arXiv preprint arXiv:1804.09407, 2018
42018
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20