Gwenaël Joret

177 papers A* 14A 1B 4C 1Journal 155Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Blow-up structure of graphs excluding a tree or an apex-tree as a minor. CoRR Quentin Claus, Gwenaël Joret, Clément Rambaud
2026	J	`jnl`	Cops and robber in graphs with bounded vertex cover number. CoRR Prosenjit Bose, Louis Esperet, Jedrzej Hodor, Gwenaël Joret, Piotr Micek, Clément Rambaud
2026	J	`jnl`	Excluding an apex-forest or a fan as quickly as possible. CoRR Quentin Claus, Jedrzej Hodor, Gwenaël Joret, Pat Morin
2026	J	`jnl`	Note on the treewidth of graphs excluding a disjoint union of cycles as a minor. CoRR Gwenaël Joret, Piotr Micek
2026	J	`jnl`	Tree decompositions whose trees are subgraphs: An application of Simon's factorization. CoRR Romain Bourneuf, Gwenaël Joret, Piotr Micek, Martin Milanic, Michal Pilipczuk
2025	J	`jnl`	A Caro-Wei Bound for Induced Linear Forests in Graphs. SIAM J. Discret. Math. Gwenaël Joret, Robin Petit
2025	J	`jnl`	Improved lower bounds on the maximum size of graphs with girth 5. CoRR Jan Goedgebeur, Jorik Jooken, Gwenaël Joret, Tibo Van den Eede
2025	J	`jnl`	Integer programs with bounded subdeterminants and two nonzeros per row. J. ACM Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky
2025	A*	`conf`	Integer programs with nearly totally unimodular matrices: the cographic case. SODA Manuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Miehal T. Seweryn, Stefan Weltge, Yelena Yuditsky
2025	A*	`conf`	Planar Graphs in Blowups of Fans. SODA Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2025	J	`jnl`	Shallow brambles. Discret. Math. Theor. Comput. Sci. Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, Piotr Micek
2025	J	`jnl`	The Grid-Minor Theorem Revisited. Comb. Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
2025	J	`jnl`	Tight bound for the Erdős-Pósa property of tree minors. Comb. Probab. Comput. Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin
2024	J	`jnl`	A Caro-Wei bound for induced linear forests in graphs. CoRR Gwenaël Joret, Robin Petit
2024	J	`jnl`	Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure. Electron. J. Comb. Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2024	A*	`conf`	Cliquewidth and Dimension. SODA Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak
2024	J	`jnl`	Corrigendum: Orthogonal Tree-Decompositions of Graphs. SIAM J. Discret. Math. Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood
2024	J	`jnl`	Erdős-Pósa property of cycles that are far apart. CoRR Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin
2024	J	`jnl`	Integer programs with nearly totally unimodular matrices: the cographic case. CoRR Manuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Michal T. Seweryn, Stefan Weltge, Yelena Yuditsky
2024	J	`jnl`	Neighborhood Complexity of Planar Graphs. Comb. Gwenaël Joret, Clément Rambaud
2024	J	`jnl`	Pathwidth Versus Cocircumference. SIAM J. Discret. Math. Marcin Brianski, Gwenaël Joret, Michal T. Seweryn
2024	J	`jnl`	Planar graphs in blowups of fans. CoRR Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2024	J	`jnl`	Product Structure Extension of the Alon-Seymour-Thomas Theorem. SIAM J. Discret. Math. Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michal T. Seweryn, David R. Wood
2024	J	`jnl`	The Excluded Tree Minor Theorem Revisited. Comb. Probab. Comput. Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2024	A*	`conf`	The Grid-Minor Theorem Revisited. SODA Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
2024	J	`jnl`	Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Comb. Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
2024	J	`jnl`	Tight bound for the Erdős-Pósa property of tree minors. CoRR Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin
2023	J	`jnl`	Approximating Pathwidth for Graphs of Small Treewidth. ACM Trans. Algorithms Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
2023	J	`jnl`	Cliquewidth and dimension. CoRR Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak
2023	J	`jnl`	Edge Separators for Graphs Excluding a Minor. Electron. J. Comb. Gwenaël Joret, William Lochet, Michal T. Seweryn
2023	J	`jnl`	Neighborhood complexity of planar graphs. CoRR Gwenaël Joret, Clément Rambaud
2023	J	`jnl`	Pathwidth vs cocircumference. CoRR Marcin Brianski, Gwenaël Joret, Michal T. Seweryn
2023	J	`jnl`	The Excluded Tree Minor Theorem Revisited. CoRR Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2023	J	`jnl`	The grid-minor theorem revisited. CoRR Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
2023	J	`jnl`	Tight bound on treedepth in terms of pathwidth and longest path. CoRR Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
2023	J	`jnl`	Treedepth vs Circumference. Comb. Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma
2022	J	`jnl`	Edge separators for graphs excluding a minor. CoRR Gwenaël Joret, William Lochet, Michal T. Seweryn
2022	J	`jnl`	Excluding a Ladder. Comb. Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan
2022	J	`jnl`	Improved Bounds for Weak Coloring Numbers. Electron. J. Comb. Gwenaël Joret, Piotr Micek
2022	J	`jnl`	Subgraph densities in a surface. Comb. Probab. Comput. Tony Huynh, Gwenaël Joret, David R. Wood
2022	J	`jnl`	Treedepth vs circumference. CoRR Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma
2021	J	`jnl`	Adjacency Labelling for Planar Graphs (and Beyond). J. ACM Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
2021	A*	`conf`	Approximating Pathwidth for Graphs of Small Treewidth. SODA Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
2021	A*	`conf`	Integer programs with bounded subdeterminants and two nonzeros per row. FOCS Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky
2021	J	`jnl`	Integer programs with bounded subdeterminants and two nonzeros per row. CoRR Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky
2021	J	`jnl`	Packing and Covering Balls in Graphs Excluding a Minor. Comb. Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot
2021	J	`jnl`	Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond. Electron. J. Comb. Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood
2021	J	`jnl`	Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond. CoRR Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood
2021	J	`jnl`	Tight Bounds on the Clique Chromatic Number. Electron. J. Comb. Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid
2021	J	`jnl`	Unavoidable Minors for Graphs with Large ℓ Discret. Comput. Geom. Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller
2020	A*	`conf`	Adjacency Labelling for Planar Graphs (and Beyond). FOCS Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
2020	J	`jnl`	Adjacency Labelling for Planar Graphs (and Beyond). CoRR Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin
2020	J	`jnl`	Approximating pathwidth for graphs of small treewidth. CoRR Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
2020	J	`jnl`	Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments. Algorithmica Gerardo Berbeglia, Gwenaël Joret
2020	J	`jnl`	Erdös-Pósa from Ball Packing. SIAM J. Discret. Math. Wouter Cames van Batenburg, Gwenaël Joret, Arthur Ulmer
2020	J	`jnl`	Excluding a ladder. CoRR Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan
2020	J	`jnl`	Improved approximation algorithms for hitting 3-vertex paths. Math. Program. Samuel Fiorini, Gwenaël Joret, Oliver Schaudt
2020	J	`jnl`	Minor-Closed Graph Classes with Bounded Layered Pathwidth. SIAM J. Discret. Math. Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood
2020	J	`jnl`	Notes on Graph Product Structure Theory. CoRR Zdenek Dvorák, Tony Huynh, Gwenaël Joret, Chun-Hung Liu, David R. Wood
2020	J	`jnl`	Packing and covering balls in graphs excluding a minor. CoRR Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot
2020	J	`jnl`	Planar Graphs Have Bounded Queue-Number. J. ACM Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2020	J	`jnl`	Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture. SIAM J. Discret. Math. Gwenaël Joret, William Lochet
2020	J	`jnl`	Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni
2020	J	`jnl`	Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. Comb. Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
2020	J	`jnl`	Sparse universal graphs for planarity. CoRR Louis Esperet, Gwenaël Joret, Pat Morin
2020	J	`jnl`	Subgraph densities in a surface. CoRR Tony Huynh, Gwenaël Joret, David R. Wood
2020	A*	`conf`	The stable set problem in graphs with bounded genus and bounded odd cycle packing number. SODA Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge
2020	J	`jnl`	Tight Bounds on The Clique Chromatic Number. CoRR Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid
2020	J	`jnl`	Two lower bounds for $p$-centered colorings. CoRR Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois
2020	J	`jnl`	Two lower bounds for p-centered colorings. Discret. Math. Theor. Comput. Sci. Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois
2019	A*	`conf`	A tight Erdős-Pósa function for planar minors. SODA Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond
2019	J	`jnl`	Erdős-Pósa from ball packing. CoRR Wouter Cames van Batenburg, Gwenaël Joret, Arthur Ulmer
2019	J	`jnl`	Information-theoretic lower bounds for quantum sorting. CoRR Jean Cardinal, Gwenaël Joret, Jérémie Roland
2019	J	`jnl`	Large independent sets in triangle-free cubic graphs: beyond planarity. CoRR Wouter Cames van Batenburg, Jan Goedgebeur, Gwenaël Joret
2019	J	`jnl`	Nowhere Dense Graph Classes and Dimension. Comb. Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
2019	A*	`conf`	Planar Graphs have Bounded Queue-Number. FOCS Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2019	J	`jnl`	Planar Graphs have Bounded Queue-Number. CoRR Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2019	J	`jnl`	Planar graphs have bounded nonrepetitive chromatic number. CoRR Vida Dujmovic, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood
2019	J	`jnl`	The stable set problem in graphs with bounded genus and bounded odd cycle packing number. CoRR Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge
2019	J	`jnl`	Unavoidable minors for graphs with large 𝓁 CoRR Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller
2018	J	`jnl`	A Tight Erdös-Pósa Function for Wheel Minors. SIAM J. Discret. Math. Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau
2018	J	`jnl`	A tight Erdős-Pósa function for planar minors. CoRR Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond
2018	J	`jnl`	Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions. Electron. J. Comb. Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
2018	J	`jnl`	Corrigendum: Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood
2018	J	`jnl`	Improved approximation algorithms for hitting 3-vertex paths. CoRR Samuel Fiorini, Gwenaël Joret, Oliver Schaudt
2018	J	`jnl`	K SIAM J. Discret. Math. Gwenaël Joret, David R. Wood
2018	J	`jnl`	Minor-closed graph classes with bounded layered pathwidth. CoRR Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood
2018	J	`jnl`	Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood
2018	J	`jnl`	Progress on the adjacent vertex distinguishing edge colouring conjecture. CoRR Gwenaël Joret, William Lochet
2018	J	`jnl`	Seymour's conjecture on 2-connected graphs of large pathwidth. CoRR Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
2018	J	`jnl`	Sparsity and Dimension. Comb. Gwenaël Joret, Piotr Micek, Veit Wiechert
2017	J	`jnl`	A tight Erdős-Pósa function for wheel minors. CoRR Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau
2017	A*	`conf`	Assortment Optimisation under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments. EC Gerardo Berbeglia, Gwenaël Joret
2017	J	`jnl`	Burling graphs, chromatic number, and orthogonal tree-decompositions. Electron. Notes Discret. Math. Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
2017	J	`jnl`	Nowhere Dense Graph Classes and Dimension. CoRR Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
2017	J	`jnl`	On the Dimension of Posets with Cover Graphs of Treewidth 2. Order Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert
2017	J	`jnl`	Planar Posets Have Dimension at Most Linear in Their Height. SIAM J. Discret. Math. Gwenaël Joret, Piotr Micek, Veit Wiechert
2017	J	`jnl`	Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs. Discret. Comput. Geom. Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich
2017	J	`jnl`	The Excluded Minors for Isometric Realizability in the Plane. SIAM J. Discret. Math. Samuel Fiorini, Tony Huynh, Gwenaël Joret, Antonios Varvitsiotis
2016	J	`jnl`	$K_{4}$-Minor-Free Induced Subgraphs of Sparse Connected Graphs. CoRR Gwenaël Joret, David R. Wood
2016	J	`jnl`	Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortments. CoRR Gerardo Berbeglia, Gwenaël Joret
2016	B	`conf`	Improved Approximation Algorithms for Hitting 3-Vertex Paths. IPCO Samuel Fiorini, Gwenaël Joret, Oliver Schaudt
2016	J	`jnl`	Nonrepetitive colouring via entropy compression. Comb. Vida Dujmovic, Gwenaël Joret, Jakub Kozik, David R. Wood
2016	J	`jnl`	Pathwidth and Nonrepetitive List Coloring. Electron. J. Comb. Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek
2016	J	`jnl`	Pathwidth and nonrepetitive list coloring. CoRR Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek
2016	J	`jnl`	Planar posets have dimension at most linear in their height. CoRR Gwenaël Joret, Piotr Micek, Veit Wiechert
2016	J	`jnl`	Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-genus Graphs. CoRR Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich
2016	A*	`conf`	Sparsity and dimension. SODA Gwenaël Joret, Piotr Micek, Veit Wiechert
2016	J	`jnl`	Tree-width and dimension. Comb. Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
2015	J	`jnl`	Empty Pentagons in Point Sets with Collinearities. SIAM J. Discret. Math. János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood
2015	J	`jnl`	Hitting All Maximal Independent Sets of a Bipartite Graph. Algorithmica Jean Cardinal, Gwenaël Joret
2015	J	`jnl`	Reducing the rank of a matroid. Discret. Math. Theor. Comput. Sci. Gwenaël Joret, Adrian Vetta
2015	J	`jnl`	Sparsity and dimension. CoRR Gwenaël Joret, Piotr Micek, Veit Wiechert
2015	J	`jnl`	The excluded minors for isometric realizability in the plane. CoRR Samuel Fiorini, Tony Huynh, Gwenaël Joret, Antonios Varvitsiotis
2014	J	`jnl`	A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces. Graphs Comb. Nancy E. Clarke, Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis
2014	J	`jnl`	Colouring Planar Graphs With Three Colours and No Large Monochromatic Components. Comb. Probab. Comput. Louis Esperet, Gwenaël Joret
2014	J	`jnl`	Hitting and Harvesting Pumpkins. SIAM J. Discret. Math. Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2013	J	`jnl`	A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph. SIAM J. Discret. Math. Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood
2013	J	`jnl`	Boxicity of Graphs on Surfaces. Graphs Comb. Louis Esperet, Gwenaël Joret
2013	J	`jnl`	Coloring planar graphs with three colors and no large monochromatic components CoRR Louis Esperet, Gwenaël Joret
2013	J	`jnl`	Complete graph minors and the graph minor structure theorem. J. Comb. Theory B Gwenaël Joret, David R. Wood
2013	J	`jnl`	Excluded Forest Minors and the Erdős-Pósa Property. Comb. Probab. Comput. Samuel Fiorini, Gwenaël Joret, David R. Wood
2013	J	`jnl`	Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. Electron. J. Comb. Vida Dujmovic, Gwenaël Joret, Fabrizio Frati, David R. Wood
2013	J	`jnl`	Sorting under partial information (without the ellipsoid algorithm). Comb. Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2013	J	`jnl`	The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. J. Comb. Optim. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
2013	J	`jnl`	Tree-Width and Dimension CoRR Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
2012	J	`jnl`	A linear-time algorithm for finding a complete graph minor in a dense graph CoRR Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood
2012	J	`jnl`	An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains. SIAM J. Discret. Math. Vida Dujmovic, Gwenaël Joret, David R. Wood
2012	J	`jnl`	Approximating the balanced minimum evolution problem. Oper. Res. Lett. Samuel Fiorini, Gwenaël Joret
2012	J	`jnl`	Empty pentagons in point sets with collinearities CoRR János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood
2012	J	`jnl`	Excluded Forest Minors and the Erdős-Pósa Property CoRR Samuel Fiorini, Gwenaël Joret, David R. Wood
2012	J	`jnl`	Hitting all Maximal Independent Sets of a Bipartite Graph CoRR Jean Cardinal, Gwenaël Joret
2012	J	`jnl`	Minimum Entropy Combinatorial Optimization Problems. Theory Comput. Syst. Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2012	J	`jnl`	Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours CoRR Vida Dujmovic, Fabrizio Frati, Gwenaël Joret, David R. Wood
2012	J	`jnl`	Nordhaus-Gaddum for treewidth. Eur. J. Comb. Gwenaël Joret, David R. Wood
2012	J	`jnl`	Reducing the rank of a matroid CoRR Gwenaël Joret, Adrian Vetta
2012	J	`jnl`	Small minors in dense graphs. Eur. J. Comb. Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood
2012	J	`jnl`	Trees with Given Stability Number and Minimum Number of Stable Sets. Graphs Comb. Véronique Bruyère, Gwenaël Joret, Hadrien Mélot
2011	J	`jnl`	Approximating the Balanced Minimum Evolution Problem CoRR Samuel Fiorini, Gwenaël Joret
2011	J	`jnl`	Disproof of the List Hadwiger Conjecture CoRR János Barát, Gwenaël Joret, David R. Wood
2011	J	`jnl`	Disproof of the List Hadwiger Conjecture. Electron. J. Comb. János Barát, Gwenaël Joret, David R. Wood
2011	J	`jnl`	First-Fit is Linear on Posets Excluding Two Long Incomparable Chains. Order Gwenaël Joret, Kevin G. Milans
2011	J	`jnl`	Hitting and Harvesting Pumpkins CoRR Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2011	A	`conf`	Hitting and Harvesting Pumpkins. ESA Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2011	J	`jnl`	Nonrepetitive Colouring via Entropy Compression CoRR Vida Dujmovic, Gwenaël Joret, David R. Wood
2011	J	`jnl`	Nordhaus-Gaddum for Treewidth CoRR Gwenaël Joret, David R. Wood
2011	J	`jnl`	On the maximum number of cliques in a graph embedded in a surface. Eur. J. Comb. Vida Dujmovic, Gasper Fijavz, Gwenaël Joret, Thom Sulanke, David R. Wood
2011	J	`jnl`	Stackelberg network pricing is hard to approximate. Networks Gwenaël Joret
2011	J	`jnl`	The Stackelberg Minimum Spanning Tree Game. Algorithmica Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2010	J	`jnl`	An Efficient Algorithm for Partial Order Production. SIAM J. Comput. Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2010	B	`conf`	Hitting Diamonds and Growing Cacti. IPCO Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli
2010	J	`jnl`	Irreducible triangulations are small. J. Comb. Theory B Gwenaël Joret, David R. Wood
2010	J	`jnl`	Minimum Entropy Combinatorial Optimization Problems CoRR Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2010	J	`jnl`	Small Minors in Dense Graphs. CoRR Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood
2010	A*	`conf`	Sorting under partial information (without the ellipsoid algorithm). STOC Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2010	J	`jnl`	The Cops and Robber game on graphs with forbidden (induced) subgraphs. Contributions Discret. Math. Gwenaël Joret, Marcin Kaminski, Dirk Oliver Theis
2009	A*	`conf`	An efficient algorithm for partial order production. STOC Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2009	J	`jnl`	Hitting Diamonds and Growing Cacti CoRR Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli
2009	C	`conf`	Minimum Entropy Combinatorial Optimization Problems. CiE Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2009	J	`jnl`	On a theorem of Sewell and Trotter. Eur. J. Comb. Samuel Fiorini, Gwenaël Joret
2009	J	`jnl`	Sorting under Partial Information (without the Ellipsoid Algorithm) CoRR Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2009	J	`jnl`	The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs CoRR Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
2009	—	`conf`	The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. WINE Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
2009	J	`jnl`	Weighted graphs defining facets: A connection between stable set and linear ordering polytopes. Discret. Optim. Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret
2008	J	`jnl`	An Efficient Algorithm for Partial Order Production CoRR Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2008	J	`jnl`	Minimum Entropy Orientations CoRR Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2008	J	`jnl`	Minimum entropy coloring. J. Comb. Optim. Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2008	J	`jnl`	Minimum entropy orientations. Oper. Res. Lett. Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2008	J	`jnl`	Stackelberg Network Pricing is Hard to Approximate CoRR Gwenaël Joret
2008	J	`jnl`	Tight Results on Minimum Entropy Set Cover. Algorithmica Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2008	J	`jnl`	Turán's theorem and J. Graph Theory Nicolas Bougard, Gwenaël Joret
2008	J	`jnl`	Well-balanced orientations of mixed graphs. Inf. Process. Lett. Attila Bernáth, Gwenaël Joret
2007	J	`jnl`	The Stackelberg Minimum Spanning Tree Game CoRR Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2007	B	`conf`	The Stackelberg Minimum Spanning Tree Game. WADS Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2006	—	`conf`	Tight Results on Minimum Entropy Set Cover. APPROX-RANDOM Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2005	B	`conf`	Minimum Entropy Coloring. ISAAC Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2005	J	`jnl`	On a weighted generalization of alpha-critical graphs. Electron. Notes Discret. Math. Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret