Gwenaël Joret

According to our database1, Gwenaël Joret authored at least 53 papers between 2005 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
A tight Erdős-Pósa function for planar minors.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
K4-Minor-Free Induced Subgraphs of Sparse Connected Graphs.
SIAM J. Discrete Math., 2018

Corrigendum: Orthogonal Tree Decompositions of Graphs.
SIAM J. Discrete Math., 2018

Orthogonal Tree Decompositions of Graphs.
SIAM J. Discrete Math., 2018

A Tight Erdös-Pósa Function for Wheel Minors.
SIAM J. Discrete Math., 2018

Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions.
Electr. J. Comb., 2018

2017
Planar Posets Have Dimension at Most Linear in Their Height.
SIAM J. Discrete Math., 2017

The Excluded Minors for Isometric Realizability in the Plane.
SIAM J. Discrete Math., 2017

On the Dimension of Posets with Cover Graphs of Treewidth 2.
Order, 2017

Burling graphs, chromatic number, and orthogonal tree-decompositions.
Electronic Notes in Discrete Mathematics, 2017

Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs.
Discrete & Computational Geometry, 2017

Assortment Optimisation under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016
Pathwidth and Nonrepetitive List Coloring.
Electr. J. Comb., 2016

Tree-width and dimension.
Combinatorica, 2016

Nonrepetitive colouring via entropy compression.
Combinatorica, 2016

Sparsity and dimension.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Improved Approximation Algorithms for Hitting 3-Vertex Paths.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015
Empty Pentagons in Point Sets with Collinearities.
SIAM J. Discrete Math., 2015

Reducing the rank of a matroid.
Discrete Mathematics & Theoretical Computer Science, 2015

Hitting All Maximal Independent Sets of a Bipartite Graph.
Algorithmica, 2015

2014
A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces.
Graphs and Combinatorics, 2014

Colouring Planar Graphs With Three Colours and No Large Monochromatic Components.
Combinatorics, Probability & Computing, 2014

2013
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph.
SIAM J. Discrete Math., 2013

Complete graph minors and the graph minor structure theorem.
J. Comb. Theory, Ser. B, 2013

Boxicity of Graphs on Surfaces.
Graphs and Combinatorics, 2013

Excluded Forest Minors and the Erdős-Pósa Property.
Combinatorics, Probability & Computing, 2013

Nonrepetitive Colourings of Planar Graphs with O(log n) Colours.
Electr. J. Comb., 2013

2012
An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains.
SIAM J. Discrete Math., 2012

Approximating the balanced minimum evolution problem.
Oper. Res. Lett., 2012

Trees with Given Stability Number and Minimum Number of Stable Sets.
Graphs and Combinatorics, 2012

Nordhaus-Gaddum for treewidth.
Eur. J. Comb., 2012

Small minors in dense graphs.
Eur. J. Comb., 2012

2011
First-Fit is Linear on Posets Excluding Two Long Incomparable Chains.
Order, 2011

Stackelberg network pricing is hard to approximate.
Networks, 2011

On the maximum number of cliques in a graph embedded in a surface.
Eur. J. Comb., 2011

Disproof of the List Hadwiger Conjecture.
Electr. J. Comb., 2011

Hitting and Harvesting Pumpkins.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Irreducible triangulations are small.
J. Comb. Theory, Ser. B, 2010

The Cops and Robber game on graphs with forbidden (induced) subgraphs.
Contributions to Discrete Mathematics, 2010

Sorting under partial information (without the ellipsoid algorithm).
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Hitting Diamonds and Growing Cacti.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
On a theorem of Sewell and Trotter.
Eur. J. Comb., 2009

Weighted graphs defining facets: A connection between stable set and linear ordering polytopes.
Discrete Optimization, 2009

The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

An efficient algorithm for partial order production.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Minimum Entropy Combinatorial Optimization Problems.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Minimum entropy orientations.
Oper. Res. Lett., 2008

Turán's theorem and k-connected graphs.
Journal of Graph Theory, 2008

Well-balanced orientations of mixed graphs.
Inf. Process. Lett., 2008

2007
The Stackelberg Minimum Spanning Tree Game.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

2006
Tight Results on Minimum Entropy Set Cover.
Proceedings of the Approximation, 2006

2005
On a weighted generalization of alpha-critical graphs.
Electronic Notes in Discrete Mathematics, 2005

Minimum Entropy Coloring.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005


  Loading...