Gwenaël Joret 个人学术档案

引用次数

	总计	2019 年至今
引用	1723	1071
h 指数	25	18
i10 指数	53	33

240

120

180

20072008200920102011201220132014201520162017201820192020202120222023202413 14 23 27 17 46 63 69 60 94 98 79 124 153 163 177 227 215

开放获取的出版物数量

查看全部

41 篇文章

0 篇文章

可查看的文章

无法查看的文章

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

合著作者

Samuel FioriniUniversité libre de Bruxelles在 ulb.ac.be 的电子邮件经过验证
David R. WoodSchool of Mathematics, Monash University在 monash.edu 的电子邮件经过验证
Piotr MicekJagiellonian University在 uj.edu.pl 的电子邮件经过验证
Vida DujmovicUniversity of Ottawa在 uottawa.ca 的电子邮件经过验证
Pat MorinCarleton University在 scs.carleton.ca 的电子邮件经过验证
Jean CardinalUniversité libre de Bruxelles (ULB)在 ulb.be 的电子邮件经过验证
Tony HuynhDepartment of Computer Science, Sapienza University of Rome在 di.uniroma1.it 的电子邮件经过验证
Veit WiechertPhD candidate at Technical University Berlin在 math.tu-berlin.de 的电子邮件经过验证
Bartosz WalczakJagiellonian University in Kraków在 uj.edu.pl 的电子邮件经过验证
Ruidong WangBlizzard Entertainment在 math.gatech.edu 的电子邮件经过验证
William T. TrotterGeorgia Institute of Technology在 math.gatech.edu 的电子邮件经过验证
Torsten UeckerdtKarlsruhe Institute of Technology在 kit.edu 的电子邮件经过验证
Ignasi SauCNRS, LIRMM, Université de Montpellier, France在 lirmm.fr 的电子邮件经过验证
Stefan WeltgeProfessor at Technical University of Munich在 tum.de 的电子邮件经过验证
W.Cames van Batenburgpostdoc, TU Delft在 tudelft.nl 的电子邮件经过验证
Ilan NewmanProfessor of Computer Science, University of Haifa在 cs.haifa.ac.il 的电子邮件经过验证
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology在 mit.edu 的电子邮件经过验证
Oren WeimannUniversity of Haifa在 cs.haifa.ac.il 的电子邮件经过验证
Michał SewerynUniversité libre de Bruxelles在 ulb.be 的电子邮件经过验证
Jean-Paul Doignon在 ulb.be 的电子邮件经过验证

关注

Gwenaël Joret

Université libre de Bruxelles

在 ulb.be 的电子邮件经过验证 - 首页

Graph Theory Partial Orders Combinatorial Optimization Approximation Algorithms


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Planar graphs have bounded queue-number V Dujmović, G Joret, P Micek, P Morin, T Ueckerdt, DR Wood Journal of the ACM (JACM) 67 (4), 1-38, 2020	132	2020
Nonrepetitive colouring via entropy compression V Dujmović, G Joret, J Kozik, DR Wood Combinatorica 36 (6), 661-686, 2016	77	2016
Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortments G Berbeglia, G Joret Algorithmica 82 (4), 681-720, 2020	73	2020
Adjacency labelling for planar graphs (and beyond) V Dujmović, L Esperet, C Gavoille, G Joret, P Micek, P Morin Journal of the ACM (JACM) 68 (6), 1-33, 2021	65	2021
The Stackelberg minimum spanning tree game J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ... Algorithmica 59 (2), 129-144, 2011	61	2011
The cops and robber game on graphs with forbidden (induced) subgraphs G Joret, M Kamiński, DO Theis arXiv preprint arXiv:0804.4145, 2008	55	2008
Planar graphs have bounded nonrepetitive chromatic number V Dujmović, L Esperet, G Joret, B Walczak, DR Wood arXiv preprint arXiv:1904.05269, 2019	48	2019
Tree-width and dimension G Joret, P Micek, KG Milans, WT Trotter, B Walczak, R Wang Combinatorica 36 (4), 431-450, 2016	43	2016
Colouring planar graphs with three colours and no large monochromatic components L Esperet, G Joret Combinatorics, Probability and Computing 23 (4), 551-570, 2014	38	2014
Tight results on minimum entropy set cover J Cardinal, S Fiorini, G Joret Algorithmica 51 (1), 49-60, 2008	37	2008
Reducing the rank of a matroid G Joret, A Vetta Discrete Mathematics & Theoretical Computer Science 17 (Discrete Algorithms), 2015	36	2015
Sorting under partial information (without the ellipsoid algorithm) J Cardinal, S Fiorini, G Joret, RM Jungers, JI Munro Proceedings of the forty-second ACM symposium on Theory of computing, 359-368, 2010	35	2010
Stackelberg network pricing is hard to approximate G Joret Networks 57 (2), 117-120, 2011	34	2011
Sparse universal graphs for planarity L Esperet, G Joret, P Morin Journal of the London Mathematical Society 108 (4), 1333-1357, 2023	32	2023
Boxicity of graphs on surfaces L Esperet, G Joret Graphs and combinatorics 29 (3), 417-427, 2013	32	2013
Minimum entropy coloring J Cardinal, S Fiorini, G Joret Journal of combinatorial optimization 16 (4), 361-377, 2008	32	2008
On the dimension of posets with cover graphs of treewidth 2 G Joret, P Micek, WT Trotter, R Wang, V Wiechert arXiv preprint arXiv:1406.3397, 0	32*
Disproof of the list Hadwiger conjecture J Barát, G Joret, DR Wood arXiv preprint arXiv:1110.2272, 2011	31	2011
Hitting diamonds and growing cacti S Fiorini, G Joret, U Pietropaoli International Conference on Integer Programming and Combinatorial …, 2010	31	2010
Hitting and harvesting pumpkins G Joret, C Paul, I Sau, S Saurabh, S Thomassé SIAM Journal on Discrete Mathematics 28 (3), 1363-1390, 2014	30	2014

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

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用