Gwenaël Joret

Citata da

	Tutte	Dal 2018
Citazioni	1542	974
Indice H	23	18
i10-index	53	34

240

120

180

2007200820092010201120122013201420152016201720182019202020212022202313 14 25 25 18 45 65 69 59 95 97 79 122 148 180 192 235

Accesso pubblico

Visualizza tutto

35 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Samuel FioriniUniversité libre de BruxellesEmail verificata su ulb.ac.be
David R. WoodSchool of Mathematics, Monash UniversityEmail verificata su monash.edu
Piotr MicekJagiellonian UniversityEmail verificata su uj.edu.pl
Vida DujmovicUniversity of OttawaEmail verificata su uottawa.ca
Jean CardinalUniversité libre de Bruxelles (ULB)Email verificata su ulb.be
Pat MorinCarleton UniversityEmail verificata su scs.carleton.ca
Tony HuynhDepartment of Computer Science, Sapienza University of RomeEmail verificata su di.uniroma1.it
Veit WiechertPhD candidate at Technical University BerlinEmail verificata su math.tu-berlin.de
Bartosz WalczakJagiellonian University in KrakówEmail verificata su uj.edu.pl
Ruidong WangBlizzard EntertainmentEmail verificata su math.gatech.edu
William T. TrotterGeorgia Institute of TechnologyEmail verificata su math.gatech.edu
Torsten UeckerdtKarlsruhe Institute of TechnologyEmail verificata su kit.edu
Ignasi SauCNRS, LIRMM, Université de Montpellier, FranceEmail verificata su lirmm.fr
W.Cames van Batenburgpostdoc, TU DelftEmail verificata su tudelft.nl
Ilan NewmanProfessor of Computer Science, University of HaifaEmail verificata su cs.haifa.ac.il
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyEmail verificata su mit.edu
Oren WeimannUniversity of HaifaEmail verificata su cs.haifa.ac.il
Jean-Paul DoignonEmail verificata su ulb.be
Stefan WeltgeAssistant Professor at Technical University of MunichEmail verificata su tum.de
Raphael JungersProfessor of Applied Mathematics, Université catholique de Louvain, ICTEAMEmail verificata su uclouvain.be

Segui

Gwenaël Joret

Université libre de Bruxelles

Email verificata su ulb.be - Home page

Graph Theory Partial Orders Combinatorial Optimization Approximation Algorithms


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	116	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	61	2020
The Stackelberg minimum spanning tree game J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ... Algorithmica 59 (2), 129-144, 2011	56	2011
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	52	2021
The cops and robber game on graphs with forbidden (induced) subgraphs G Joret, M Kamiński, DO Theis arXiv preprint arXiv:0804.4145, 2008	52	2008
Tree-width and dimension G Joret, P Micek, KG Milans, WT Trotter, B Walczak, R Wang Combinatorica 36 (4), 431-450, 2016	41	2016
Planar graphs have bounded nonrepetitive chromatic number V Dujmović, L Esperet, G Joret, B Walczak, DR Wood arXiv preprint arXiv:1904.05269, 2019	39	2019
Tight results on minimum entropy set cover J Cardinal, S Fiorini, G Joret Algorithmica 51 (1), 49-60, 2008	37	2008
Colouring planar graphs with three colours and no large monochromatic components L Esperet, G Joret Combinatorics, Probability and Computing 23 (4), 551-570, 2014	35	2014
Reducing the rank of a matroid G Joret, A Vetta Discrete Mathematics & Theoretical Computer Science 17 (Discrete Algorithms), 2015	33	2015
Stackelberg network pricing is hard to approximate G Joret Networks 57 (2), 117-120, 2011	33	2011
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	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*
Boxicity of graphs on surfaces L Esperet, G Joret Graphs and combinatorics 29 (3), 417-427, 2013	30	2013
Approximating the balanced minimum evolution problem S Fiorini, G Joret Operations research letters 40 (1), 31-35, 2012	29	2012
Hitting diamonds and growing cacti S Fiorini, G Joret, U Pietropaoli International Conference on Integer Programming and Combinatorial …, 2010	29	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	28	2014
Irreducible triangulations are small G Joret, DR Wood Journal of Combinatorial Theory, Series B 100 (5), 446-455, 2010	28	2010

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori