On a weighted generalization of alpha-critical graphs. - Jean-Paul Doignon; Samuel Fiorini; Gwenaël Joret (Electron. Notes Discret. Math., 2005)

Tight Results on Minimum Entropy Set Cover. - Jean Cardinal; Samuel Fiorini; Gwenaël Joret (Algorithmica, 2008)

Well-balanced orientations of mixed graphs. - Attila Bernáth; Gwenaël Joret (Inf. Process. Lett., 2008)

Minimum entropy coloring. - Jean Cardinal; Samuel Fiorini; Gwenaël Joret (J. Comb. Optim., 2008)

Turán's theorem and k-connected graphs. - Nicolas Bougard; Gwenaël Joret (J. Graph Theory, 2008)

Minimum entropy orientations. - Jean Cardinal; Samuel Fiorini; Gwenaël Joret (Oper. Res. Lett., 2008)

Weighted graphs defining facets: A connection between stable set and linear ordering polytopes. - Jean-Paul Doignon; Samuel Fiorini; Gwenaël Joret (Discret. Optim., 2009)

On a theorem of Sewell and Trotter. - Samuel Fiorini; Gwenaël Joret (Eur. J. Comb., 2009)

Hitting Diamonds and Growing Cacti. - Samuel Fiorini; Gwenaël Joret; Ugo Pietropaoli (IPCO, 2010)

The Cops and Robber game on graphs with forbidden (induced) subgraphs. - Gwenaël Joret; Marcin Kaminski 001; Dirk Oliver Theis (Contributions Discret. Math., 2010)

Irreducible triangulations are small. - Gwenaël Joret; David R. Wood (J. Comb. Theory B, 2010)

An Efficient Algorithm for Partial Order Production. - Jean Cardinal; Samuel Fiorini; Gwenaël Joret; Raphaël M. Jungers; J. Ian Munro (SIAM J. Comput., 2010)

The Stackelberg Minimum Spanning Tree Game. - Jean Cardinal; Erik D. Demaine; Samuel Fiorini; Gwenaël Joret; Stefan Langerman; Ilan Newman; Oren Weimann (Algorithmica, 2011)

Disproof of the List Hadwiger Conjecture. - János Barát; Gwenaël Joret; David R. Wood (Electron. J. Comb., 2011)

Nonrepetitive Colouring via Entropy Compression - Vida Dujmovic; Gwenaël Joret; David R. Wood (CoRR, 2011)

On the maximum number of cliques in a graph embedded in a surface. - Vida Dujmovic; Gasper Fijavz; Gwenaël Joret; Thom Sulanke; David R. Wood (Eur. J. Comb., 2011)

Stackelberg network pricing is hard to approximate. - Gwenaël Joret (Networks, 2011)

First-Fit is Linear on Posets Excluding Two Long Incomparable Chains. - Gwenaël Joret; Kevin G. Milans (Order, 2011)

Small minors in dense graphs. - Samuel Fiorini; Gwenaël Joret; Dirk Oliver Theis; David R. Wood (Eur. J. Comb., 2012)

Nordhaus-Gaddum for treewidth. - Gwenaël Joret; David R. Wood (Eur. J. Comb., 2012)

Trees with Given Stability Number and Minimum Number of Stable Sets. - Véronique Bruyère; Gwenaël Joret; Hadrien Mélot (Graphs Comb., 2012)

Minimum Entropy Combinatorial Optimization Problems. - Jean Cardinal; Samuel Fiorini; Gwenaël Joret (Theory Comput. Syst., 2012)

Approximating the balanced minimum evolution problem. - Samuel Fiorini; Gwenaël Joret (Oper. Res. Lett., 2012)

An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains. - Vida Dujmovic; Gwenaël Joret; David R. Wood (SIAM J. Discret. Math., 2012)

Sorting under partial information (without the ellipsoid algorithm). - Jean Cardinal; Samuel Fiorini; Gwenaël Joret; Raphaël M. Jungers; J. Ian Munro (Comb., 2013)

Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. - Vida Dujmovic; Gwenaël Joret; Fabrizio Frati; David R. Wood (Electron. J. Comb., 2013)

Coloring planar graphs with three colors and no large monochromatic components - Louis Esperet; Gwenaël Joret (CoRR, 2013)

Excluded Forest Minors and the Erdős-Pósa Property. - Samuel Fiorini; Gwenaël Joret; David R. Wood (Comb. Probab. Comput., 2013)

Boxicity of Graphs on Surfaces. - Louis Esperet; Gwenaël Joret (Graphs Comb., 2013)

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. - Jean Cardinal; Erik D. Demaine; Samuel Fiorini; Gwenaël Joret; Ilan Newman; Oren Weimann (J. Comb. Optim., 2013)

Complete graph minors and the graph minor structure theorem. - Gwenaël Joret; David R. Wood (J. Comb. Theory B, 2013)

A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph. - Vida Dujmovic; Daniel J. Harvey; Gwenaël Joret; Bruce A. Reed; David R. Wood (SIAM J. Discret. Math., 2013)

Colouring Planar Graphs With Three Colours and No Large Monochromatic Components. - Louis Esperet; Gwenaël Joret (Comb. Probab. Comput., 2014)

A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces. - Nancy E. Clarke; Samuel Fiorini; Gwenaël Joret; Dirk Oliver Theis (Graphs Comb., 2014)

Hitting and Harvesting Pumpkins. - Gwenaël Joret; Christophe Paul; Ignasi Sau; Saket Saurabh 001; Stéphan Thomassé (SIAM J. Discret. Math., 2014)

Hitting All Maximal Independent Sets of a Bipartite Graph. - Jean Cardinal; Gwenaël Joret (Algorithmica, 2015)

Reducing the rank of a matroid. - Gwenaël Joret; Adrian Vetta (Discret. Math. Theor. Comput. Sci., 2015)

Empty Pentagons in Point Sets with Collinearities. - János Barát; Vida Dujmovic; Gwenaël Joret; Michael S. Payne; Ludmila Scharf; Daria Schymura; Pavel Valtr 001; David R. Wood (SIAM J. Discret. Math., 2015)

Nonrepetitive colouring via entropy compression. - Vida Dujmovic; Gwenaël Joret; Jakub Kozik; David R. Wood (Comb., 2016)

Tree-width and dimension. - Gwenaël Joret; Piotr Micek; Kevin G. Milans; William T. Trotter; Bartosz Walczak; Ruidong Wang (Comb., 2016)

Pathwidth and Nonrepetitive List Coloring. - Adam Gagol; Gwenaël Joret; Jakub Kozik; Piotr Micek (Electron. J. Comb., 2016)

$K_{4}$-Minor-Free Induced Subgraphs of Sparse Connected Graphs. - Gwenaël Joret; David R. Wood (CoRR, 2016)

Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs. - Samuel Fiorini; Tony Huynh; Gwenaël Joret; Kanstantsin Pashkovich (Discret. Comput. Geom., 2017)

Burling graphs, chromatic number, and orthogonal tree-decompositions. - Stefan Felsner; Gwenaël Joret; Piotr Micek; William T. Trotter; Veit Wiechert (Electron. Notes Discret. Math., 2017)

On the Dimension of Posets with Cover Graphs of Treewidth 2. - Gwenaël Joret; Piotr Micek; William T. Trotter; Ruidong Wang; Veit Wiechert (Order, 2017)

The Excluded Minors for Isometric Realizability in the Plane. - Samuel Fiorini; Tony Huynh; Gwenaël Joret; Antonios Varvitsiotis (SIAM J. Discret. Math., 2017)

Planar Posets Have Dimension at Most Linear in Their Height. - Gwenaël Joret; Piotr Micek; Veit Wiechert (SIAM J. Discret. Math., 2017)

Sparsity and Dimension. - Gwenaël Joret; Piotr Micek; Veit Wiechert (Comb., 2018)

Progress on the adjacent vertex distinguishing edge colouring conjecture. - Gwenaël Joret; William Lochet (CoRR, 2018)

A Tight Erdös-Pósa Function for Wheel Minors. - Pierre Aboulker; Samuel Fiorini; Tony Huynh; Gwenaël Joret; Jean-Florent Raymond; Ignasi Sau (SIAM J. Discret. Math., 2018)

Orthogonal Tree Decompositions of Graphs. - Vida Dujmovic; Gwenaël Joret; Pat Morin; Sergey Norin; David R. Wood (SIAM J. Discret. Math., 2018)

Corrigendum: Orthogonal Tree Decompositions of Graphs. - Vida Dujmovic; Gwenaël Joret; Pat Morin; Sergey Norin; David R. Wood (SIAM J. Discret. Math., 2018)

K4-Minor-Free Induced Subgraphs of Sparse Connected Graphs. - Gwenaël Joret; David R. Wood (SIAM J. Discret. Math., 2018)

A tight Erdős-Pósa function for planar minors. - Wouter Cames van Batenburg; Tony Huynh; Gwenaël Joret; Jean-Florent Raymond (SODA, 2019)

Nowhere Dense Graph Classes and Dimension. - Gwenaël Joret; Piotr Micek; Patrice Ossona de Mendez; Veit Wiechert (Comb., 2019)

Information-theoretic lower bounds for quantum sorting. - Jean Cardinal; Gwenaël Joret; Jérémie Roland (CoRR, 2019)

Planar graphs have bounded nonrepetitive chromatic number. - Vida Dujmovic; Louis Esperet; Gwenaël Joret; Bartosz Walczak; David R. Wood (CoRR, 2019)

Large independent sets in triangle-free cubic graphs: beyond planarity. - Wouter Cames van Batenburg; Jan Goedgebeur; Gwenaël Joret (CoRR, 2019)

The stable set problem in graphs with bounded genus and bounded odd cycle packing number. - Michele Conforti; Samuel Fiorini; Tony Huynh; Gwenaël Joret; Stefan Weltge (SODA, 2020)

Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments. - Gerardo Berbeglia; Gwenaël Joret (Algorithmica, 2020)

Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. - Tony Huynh; Gwenaël Joret; Piotr Micek; David R. Wood (Comb., 2020)

Revisiting a Theorem by Folkman on Graph Colouring. - Marthe Bonamy; Pierre Charbit; Oscar Defrain; Gwenaël Joret; Aurélie Lagoutte; Vincent Limouzy; Lucas Pastor; Jean-Sébastien Sereni (Electron. J. Comb., 2020)

Notes on Graph Product Structure Theory. - Zdenek Dvorák 001; Tony Huynh; Gwenaël Joret; Chun-Hung Liu; David R. Wood (CoRR, 2020)

Sparse universal graphs for planarity. - Louis Esperet; Gwenaël Joret; Pat Morin (CoRR, 2020)

Two lower bounds for p-centered colorings. - Loïc Dubois 001; Gwenaël Joret; Guillem Perarnau; Marcin Pilipczuk; François Pitois (Discret. Math. Theor. Comput. Sci., 2020)

Planar Graphs Have Bounded Queue-Number. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin; Torsten Ueckerdt; David R. Wood (J. ACM, 2020)

Improved approximation algorithms for hitting 3-vertex paths. - Samuel Fiorini; Gwenaël Joret; Oliver Schaudt (Math. Program., 2020)

Erdös-Pósa from Ball Packing. - Wouter Cames van Batenburg; Gwenaël Joret; Arthur Ulmer (SIAM J. Discret. Math., 2020)

Minor-Closed Graph Classes with Bounded Layered Pathwidth. - Vida Dujmovic; David Eppstein; Gwenaël Joret; Pat Morin; David R. Wood (SIAM J. Discret. Math., 2020)

Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture. - Gwenaël Joret; William Lochet (SIAM J. Discret. Math., 2020)

Packing and Covering Balls in Graphs Excluding a Minor. - Nicolas Bousquet 001; Wouter Cames van Batenburg; Louis Esperet; Gwenaël Joret; William Lochet; Carole Muller; François Pirot (Comb., 2021)

Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond. - Manuel Aprile; Samuel Fiorini; Tony Huynh; Gwenaël Joret; David R. Wood (Electron. J. Comb., 2021)

Tight Bounds on the Clique Chromatic Number. - Gwenaël Joret; Piotr Micek; Bruce A. Reed; Michiel Smid (Electron. J. Comb., 2021)

Unavoidable Minors for Graphs with Large ℓ p-Dimension. - Samuel Fiorini; Tony Huynh; Gwenaël Joret; Carole Muller (Discret. Comput. Geom., 2021)

Adjacency Labelling for Planar Graphs (and Beyond). - Vida Dujmovic; Louis Esperet; Cyril Gavoille; Gwenaël Joret; Piotr Micek; Pat Morin (J. ACM, 2021)

Excluding a Ladder. - Tony Huynh; Gwenaël Joret; Piotr Micek; Michal T. Seweryn; Paul Wollan (Comb., 2022)

Improved Bounds for Weak Coloring Numbers. - Gwenaël Joret; Piotr Micek (Electron. J. Comb., 2022)

Subgraph densities in a surface. - Tony Huynh; Gwenaël Joret; David R. Wood (Comb. Probab. Comput., 2022)

Edge Separators for Graphs Excluding a Minor. - Gwenaël Joret; William Lochet; Michal T. Seweryn (Electron. J. Comb., 2023)

Pathwidth vs cocircumference. - Marcin Brianski; Gwenaël Joret; Michal T. Seweryn (CoRR, 2023)

Approximating Pathwidth for Graphs of Small Treewidth. - Carla Groenland; Gwenaël Joret; Wojciech Nadara; Bartosz Walczak (ACM Trans. Algorithms, 2023)

Treedepth vs Circumference. - Marcin Brianski; Gwenaël Joret; Konrad Majewski; Piotr Micek; Michal T. Seweryn; Roohani Sharma (Comb., 2023)

The Grid-Minor Theorem Revisited. - Vida Dujmovic; Robert Hickingbotham; Jedrzej Hodor; Gwenaël Joret; Hoang La; Piotr Micek; Pat Morin; Clément Rambaud; David R. Wood (SODA, 2024)

Cliquewidth and Dimension. - Gwenaël Joret; Piotr Micek; Michal Pilipczuk; Bartosz Walczak (SODA, 2024)

Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin; David R. Wood (Electron. J. Comb., 2024)

Integer programs with nearly totally unimodular matrices: the cographic case. - Manuel Aprile; Samuel Fiorini; Gwenaël Joret; Stefan Kober; Michal T. Seweryn; Stefan Weltge; Yelena Yuditsky (CoRR, 2024)

Erdős-Pósa property of cycles that are far apart. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin (CoRR, 2024)

Product Structure Extension of the Alon-Seymour-Thomas Theorem. - Marc Distel; Vida Dujmovic; David Eppstein; Robert Hickingbotham; Gwenaël Joret; Piotr Micek; Pat Morin; Michal T. Seweryn; David R. Wood (SIAM J. Discret. Math., 2024)

The Excluded Tree Minor Theorem Revisited. - Vida Dujmovic; Robert Hickingbotham; Gwenaël Joret; Piotr Micek; Pat Morin; David R. Wood (Comb. Probab. Comput., 2024)

Pathwidth Versus Cocircumference. - Marcin Brianski; Gwenaël Joret; Michal T. Seweryn (SIAM J. Discret. Math., 2024)

Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. - Meike Hatzel; Gwenaël Joret; Piotr Micek; Marcin Pilipczuk; Torsten Ueckerdt; Bartosz Walczak (Comb., 2024)

Neighborhood Complexity of Planar Graphs. - Gwenaël Joret; Clément Rambaud (Comb., 2024)

Integer programs with nearly totally unimodular matrices: the cographic case. - Manuel Aprile; Samuel Fiorini; Gwenaël Joret; Stefan Kober; Miehal T. Seweryn; Stefan Weltge; Yelena Yuditsky (SODA, 2025)

Planar Graphs in Blowups of Fans. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin; David R. Wood (SODA, 2025)

Tight bound for the Erdős-Pósa property of tree minors. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin (Comb. Probab. Comput., 2025)

A Caro-Wei Bound for Induced Linear Forests in Graphs. - Gwenaël Joret; Robin Petit (SIAM J. Discret. Math., 2025)

Integer programs with bounded subdeterminants and two nonzeros per row. - Samuel Fiorini; Gwenaël Joret; Stefan Weltge; Yelena Yuditsky (J. ACM, 2025)