Obserwuj
Gwenaël Joret
Gwenaël Joret
Université libre de Bruxelles
Zweryfikowany adres z ulb.be - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
1492020
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
842020
Nonrepetitive colouring via entropy compression
V Dujmović, G Joret, J Kozik, DR Wood
Combinatorica 36 (6), 661-686, 2016
762016
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
742021
The Stackelberg minimum spanning tree game
J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ...
Algorithmica 59 (2), 129-144, 2011
632011
The cops and robber game on graphs with forbidden (induced) subgraphs
G Joret, M Kamiński, DO Theis
arXiv preprint arXiv:0804.4145, 2008
612008
Planar graphs have bounded nonrepetitive chromatic number
V Dujmović, L Esperet, G Joret, B Walczak, DR Wood
arXiv preprint arXiv:1904.05269, 2019
542019
Tree-width and dimension
G Joret, P Micek, KG Milans, WT Trotter, B Walczak, R Wang
Combinatorica 36 (4), 431-450, 2016
442016
Colouring planar graphs with three colours and no large monochromatic components
L Esperet, G Joret
Combinatorics, Probability and Computing 23 (4), 551-570, 2014
402014
Sparse universal graphs for planarity
L Esperet, G Joret, P Morin
Journal of the London Mathematical Society 108 (4), 1333-1357, 2023
392023
Tight results on minimum entropy set cover
J Cardinal, S Fiorini, G Joret
Algorithmica 51 (1), 49-60, 2008
382008
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
372010
Reducing the rank of a matroid
G Joret, A Vetta
Discrete Mathematics & Theoretical Computer Science 17 (Discrete Algorithms), 2015
362015
Stackelberg network pricing is hard to approximate
G Joret
Networks 57 (2), 117-120, 2011
352011
Boxicity of graphs on surfaces
L Esperet, G Joret
Graphs and combinatorics 29 (3), 417-427, 2013
342013
Disproof of the list Hadwiger conjecture
J Barát, G Joret, DR Wood
arXiv preprint arXiv:1110.2272, 2011
332011
Hitting diamonds and growing cacti
S Fiorini, G Joret, U Pietropaoli
International Conference on Integer Programming and Combinatorial …, 2010
332010
Minimum entropy coloring
J Cardinal, S Fiorini, G Joret
Journal of combinatorial optimization 16 (4), 361-377, 2008
322008
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
312014
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20