Gwenaël Joret
Publikacje:
26.
Vida Dujmović, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
The excluded tree minor theorem revisited, Combinatorics Probability and Computing vol. 33 (2024), 85-90
25.
Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
Tight bound on treedepth in terms of pathwidth and longest path, Combinatorica vol. 44 (2024), 417-427
24.
Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
The grid-minor theorem revisited, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1241-1245
23.
Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
Cliquewidth and dimension, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1437-1446
22.
Marcin Briański, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michał Seweryn, Roohani Sharma
Treedepth vs circumference, Combinatorica vol. 43 (2023), 659-664
21.
Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Approximating pathwidth for graphs of small treewidth, ACM Transactions on Algorithms vol. 19 (2023), 16:1-19
20.
Gwenaël Joret, Piotr Micek
Improved bounds for weak coloring numbers, Electronic Journal of Combinatorics vol. Volume 29, Issue 1 (2022), P1.60
19.
Tony Huynh, Gwenaël Joret, Piotr Micek, Michał Seweryn, Paul Wollan
Excludding a Ladder, Combinatorica vol. 42 (2022), 405–432
18.
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency Labelling for Planar Graphs (and Beyond), Journal of the ACM vol. 68 (2021), 1-33
17.
Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel Smid
Tight bounds on the clique chromatic number, Electronic Journal of Combinatorics vol. 28 (2021), P3.51
16.
Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Approximating pathwidth for graphs of small treewidth, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2021), 1965-1976
15.
Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth, Combinatorica vol. 40 (2020), 839–868
14.
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency labelling for planar graphs (and beyond), (2020), "2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)", Institute of Electrical and Electronics Engineers (IEEE)
13.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs Have Bounded Queue-Number, Journal of the ACM vol. 67(4) (2020), 862-875
12.
Vida Dujmović, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood
Planar graphs have bounded nonrepetitive chromatic number, Advances in Combinatorics vol. 2020 (2020), 5:1-11
11.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs have Bounded Queue-Number, (2019), "2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)", Institute of Electrical and Electronics Engineers (IEEE)
10.
Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
Nowhere dense graph classes and dimension, Combinatorica (2019), 1055-1079
9.
Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and dimension, Combinatorica vol. 38 (2018), 1129-1148
8.
Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions, Electronic Journal of Combinatorics vol. 25 (1) (2018), P1.35
7.
Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert
On the Dimension of Posets with Cover Graphs of Treewidth 2, Order vol. 34.2 (2017), 185-234
6.
Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
Burling graphs, chromatic number, and orthogonal tree-decompositions, Electronic Notes in Discrete Mathematics vol. 61 (2017), 415-420
5.
Gwenaël Joret, Piotr Micek, Veit Wiechert
Planar posets have dimension at most linear in their height, SIAM Journal on Discrete Mathematics vol. 31 (4) (2017), 2754–2790
4.
Vida Dujmović, Gwenaël Joret, Jakub Kozik, David R. Wood
Nonrepetitive colouring via entropy compression, Combinatorica vol. Volume 36, Issue 6 (2016), 661-686
3.
Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and dimension, (2016), "27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), January 10-12, 2016, Arlington, VA, USA", Society for Industrial and Applied Mathematics (SIAM)
2.
Pathwidth and nonrepetitive list colorings, Electronic Journal of Combinatorics vol. Volume 23, Issue 4 (2016), 19
1.
Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
Tree-width and dimension, Combinatorica vol. 36 (2016), 431-450