Guillaume Ducoffe 个人学术档案

引用次数

	总计	2019 年至今
引用	737	529
h 指数	15	12
i10 指数	20	18

120

2013201420152016201720182019202020212022202320245 7 22 56 57 38 73 87 116 105 72 62

开放获取的出版物数量

查看全部

12 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

David CoudertINRIA在 inria.fr 的电子邮件经过验证
Augustin ChaintreauAssociate Professor, Columbia University在 cs.columbia.edu 的电子邮件经过验证
Alexandru PopaProfessor, University of Bucharest在 fmi.unibuc.ro 的电子邮件经过验证
Nicolas NisseInria, France在 inria.fr 的电子邮件经过验证
Feodor F. DraganKent State University在 CS.KENT.EDU 的电子邮件经过验证
Mathias LécuyerUniversity of British Columbia在 ubc.ca 的电子邮件经过验证
Roxana GeambasuAssistant Professor of Computer Science, Columbia University在 columbia.edu 的电子邮件经过验证
Marinescu-Ghemeci R.University of Bucharest在 fmi.unibuc.ro 的电子邮件经过验证
Theofilos Petsios在 cs.columbia.edu 的电子邮件经过验证
Riley SpahnColumbia University在 cs.columbia.edu 的电子邮件经过验证
Jean-Claude BermondDirecteur de Recherche CNRS在 sophia.inria.fr 的电子邮件经过验证
Karol SuchanUniversidad Diego Portales在 mail.udp.cl 的电子邮件经过验证

关注

Guillaume Ducoffe

University of Bucharest - Faculty of Mathematics and Informatics, and ICI

在 ici.ro 的电子邮件经过验证 - 首页

Graph theory Algorithms Game theory Combinatorics Complexity theory


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
{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	162	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	71	2019
Recognition of -Free and 1/2-Hyperbolic Graphs D Coudert, G Ducoffe SIAM Journal on Discrete Mathematics 28 (3), 1601-1617, 2014	37	2014
Applying clique-decomposition for computing Gromov hyperbolicity N Cohen, D Coudert, G Ducoffe, A Lancin Theoretical computer science 690, 114-139, 2017	35	2017
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	33	2018
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	32	2020
Diameter of minimal separators in graphs D Coudert, G Ducoffe, N Nisse Inria Sophia Antipolis; I3S; INRIA, 2014	22*	2014
A story of diameter, radius, and (almost) Helly property G Ducoffe, FF Dragan Networks 77 (3), 435-453, 2021	21*	2021
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	21	2017
On the hyperbolicity of bipartite graphs and intersection graphs D Coudert, G Ducoffe Discrete Applied Mathematics 214, 187-195, 2016	21	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 65, 856-892, 2021	18	2021
Fast diameter computation within split graphs G Ducoffe, M Habib, L Viennot Discrete Mathematics & Theoretical Computer Science 23 (Graph Theory), 2021	17	2021
On the complexity of computing treebreadth G Ducoffe, S Legay, N Nisse Algorithmica 82 (6), 1574-1600, 2020	17*	2020
Data center interconnection networks are not hyperbolic D Coudert, G Ducoffe Theoretical Computer Science 639, 72-90, 2016	16	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	15	2019
Optimal centrality computations within bounded clique-width graphs G Ducoffe Algorithmica 84 (11), 3192-3222, 2022	12*	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	12	2021
The b-matching problem in distance-hereditary graphs and beyond G Ducoffe, A Popa Discrete Applied Mathematics 305, 233-246, 2021	11*	2021
The 4-Steiner root problem G Ducoffe International Workshop on Graph-Theoretic Concepts in Computer Science, 14-26, 2019	10	2019
Revisiting decomposition by clique separators D Coudert, G Ducoffe SIAM Journal on Discrete Mathematics 32 (1), 682-694, 2018	10	2018

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用