Gwenaël Joret

Cited by

	All	Since 2019
Citations	1795	1142
h-index	26	18
i10-index	55	37

300

150

225

20072008200920102011201220132014201520162017201820192020202120222023202413 14 23 27 17 46 63 69 60 94 97 80 124 152 164 173 232 282

Public access

View all

41 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Samuel FioriniUniversité libre de BruxellesVerified email at ulb.ac.be
David R. WoodSchool of Mathematics, Monash UniversityVerified email at monash.edu
Piotr MicekJagiellonian UniversityVerified email at uj.edu.pl
Vida DujmovicUniversity of OttawaVerified email at uottawa.ca
Pat MorinCarleton UniversityVerified email at scs.carleton.ca
Jean CardinalUniversité libre de Bruxelles (ULB)Verified email at ulb.be
Tony HuynhDepartment of Computer Science, Sapienza University of RomeVerified email at di.uniroma1.it
Veit WiechertPhD candidate at Technical University BerlinVerified email at math.tu-berlin.de
Bartosz WalczakJagiellonian University in KrakówVerified email at uj.edu.pl
William T. TrotterGeorgia Institute of TechnologyVerified email at math.gatech.edu
Ruidong WangBlizzard EntertainmentVerified email at math.gatech.edu
Torsten UeckerdtKarlsruhe Institute of TechnologyVerified email at kit.edu
Ignasi SauCNRS, LIRMM, Université de Montpellier, FranceVerified email at lirmm.fr
Stefan WeltgeProfessor at Technical University of MunichVerified email at tum.de
W.Cames van Batenburgpostdoc, TU DelftVerified email at tudelft.nl
Ilan NewmanProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
Oren WeimannUniversity of HaifaVerified email at cs.haifa.ac.il
Michał SewerynUniversité libre de BruxellesVerified email at ulb.be
Jean-Paul DoignonVerified email at ulb.be

Gwenaël Joret

Université libre de Bruxelles

Verified email at ulb.be - Homepage

Graph Theory Partial Orders Combinatorial Optimization Approximation Algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	140	2020
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	77	2020
Nonrepetitive colouring via entropy compression V Dujmović, G Joret, J Kozik, DR Wood Combinatorica 36 (6), 661-686, 2016	77	2016
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	71	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	62	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	58	2008
Planar graphs have bounded nonrepetitive chromatic number V Dujmović, L Esperet, G Joret, B Walczak, DR Wood arXiv preprint arXiv:1904.05269, 2019	52	2019
Tree-width and dimension G Joret, P Micek, KG Milans, WT Trotter, B Walczak, R Wang Combinatorica 36 (4), 431-450, 2016	44	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
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	37	2010
Tight results on minimum entropy set cover J Cardinal, S Fiorini, G Joret Algorithmica 51 (1), 49-60, 2008	37	2008
Sparse universal graphs for planarity L Esperet, G Joret, P Morin Journal of the London Mathematical Society 108 (4), 1333-1357, 2023	36	2023
Reducing the rank of a matroid G Joret, A Vetta Discrete Mathematics & Theoretical Computer Science 17 (Discrete Algorithms), 2015	36	2015
Stackelberg network pricing is hard to approximate G Joret Networks 57 (2), 117-120, 2011	34	2011
Boxicity of graphs on surfaces L Esperet, G Joret Graphs and combinatorics 29 (3), 417-427, 2013	32	2013
Hitting diamonds and growing cacti S Fiorini, G Joret, U Pietropaoli International Conference on Integer Programming and Combinatorial …, 2010	32	2010
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*
Hitting and harvesting pumpkins G Joret, C Paul, I Sau, S Saurabh, S Thomassé SIAM Journal on Discrete Mathematics 28 (3), 1363-1390, 2014	31	2014
Disproof of the list Hadwiger conjecture J Barát, G Joret, DR Wood arXiv preprint arXiv:1110.2272, 2011	31	2011

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors