Gwenaël Joret

Cited by

	All	Since 2016
Citations	998	629
h-index	20	14
i10-index	38	25

180

135

20062007200820092010201120122013201420152016201720182019202020213 13 14 25 24 17 44 70 72 59 94 101 77 147 175 28

Co-authors

Samuel FioriniUniversité libre de BruxellesVerified email at ulb.ac.be
David R. WoodSchool of Mathematics, Monash UniversityVerified email at monash.edu
Vida DujmovicUniversity of OttawaVerified email at uottawa.ca
Jean CardinalUniversité libre de Bruxelles (ULB)Verified email at ulb.ac.be
Piotr MicekJagiellonian UniversityVerified email at tcs.uj.edu.pl
Pat MorinCarleton UniversityVerified email at scs.carleton.ca
Tony HuynhSchool of Mathematics, Monash UniversityVerified email at monash.edu
Veit WiechertPhD candidate at Technical University BerlinVerified email at math.tu-berlin.de
Ruidong WangBlizzard EntertainmentVerified email at math.gatech.edu
WILLIAM T TROTTERGeorgia Institute of TechnologyVerified email at math.gatech.edu
Bartosz WalczakJagiellonian University in KrakówVerified email at tcs.uj.edu.pl
Ignasi SauCNRS, LIRMM, Montpellier, FranceVerified email at lirmm.fr
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
Raphael JungersProfessor of Applied Mathematics, Université catholique de Louvain, ICTEAMVerified email at uclouvain.be
Ian MunroUniversity Professor, University of WaterlooVerified email at uwaterloo.ca
W.Cames van Batenburgpostdoc, Université Libre de BruxellesVerified email at ulb.ac.be
Adrian VettaProfessor of Mathematics/ Professor of Computer Science, McGill UniversityVerified email at math.mcgill.ca
Janos BaratAssociate Professor, University of PannoniaVerified email at mik.uni-pannon.hu

Gwenaël Joret

Université Libre de Bruxelles

Verified email at ulb.ac.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
Nonrepetitive colouring via entropy compression V Dujmović, G Joret, J Kozik, DR Wood Combinatorica 36 (6), 661-686, 2016	66	2016
The Stackelberg minimum spanning tree game J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ... Algorithmica 59 (2), 129-144, 2011	49	2011
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	42	2020
Tree-width and dimension G Joret, P Micek, KG Milans, WT Trotter, B Walczak, R Wang Combinatorica 36 (4), 431-450, 2016	36	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	34	2020
The cops and robber game on graphs with forbidden (induced) subgraphs G Joret, M Kamiński, DO Theis arXiv preprint arXiv:0804.4145, 2008	31	2008
Minimum entropy coloring J Cardinal, S Fiorini, G Joret Journal of combinatorial optimization 16 (4), 361-377, 2008	30	2008
Tight results on minimum entropy set cover J Cardinal, S Fiorini, G Joret Algorithmica 51 (1), 49-60, 2008	30	2008
Reducing the rank of a matroid A Vetta, G Joret Discrete Mathematics & Theoretical Computer Science 17, 2015	28*	2015
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	28*
Colouring planar graphs with three colours and no large monochromatic components L Esperet, G Joret Combinatorics, Probability and Computing 23 (4), 551-570, 2014	26	2014
Irreducible triangulations are small G Joret, DR Wood Journal of Combinatorial Theory, Series B 100 (5), 446-455, 2010	26	2010
Sorting under partial information (without the ellipsoid algorithm) J Cardinal, S Fiorini, G Joret, RM Jungers, JI Munro Combinatorica 33 (6), 655-697, 2013	25	2013
Boxicity of graphs on surfaces L Esperet, G Joret Graphs and combinatorics 29 (3), 417-427, 2013	25	2013
Stackelberg network pricing is hard to approximate G Joret Networks 57 (2), 117-120, 2011	25	2011
Hitting diamonds and growing cacti S Fiorini, G Joret, U Pietropaoli International Conference on Integer Programming and Combinatorial …, 2010	24	2010
Nonrepetitive Colourings of Planar Graphs with Colours V Dujmović, G Joret, F Frati, DR Wood the electronic journal of combinatorics, P51-P51, 2013	23	2013
Hitting and harvesting pumpkins G Joret, C Paul, I Sau, S Saurabh, S Thomassé SIAM Journal on Discrete Mathematics 28 (3), 1363-1390, 2014	21	2014
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs J Cardinal, ED Demaine, S Fiorini, G Joret, I Newman, O Weimann Journal of combinatorial optimization 25 (1), 19-46, 2013	21	2013
Approximating the balanced minimum evolution problem S Fiorini, G Joret Operations research letters 40 (1), 31-35, 2012	20	2012

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

Upload PDF

Follow this author

Cited by

Co-authors