Publications and preprints

• Nonrepetitive colourings of planar graphs with O(logn) colours
  V. Dujmović, F. Frati, G. Joret, and D. R. Wood
  
  
• Nonrepetitive colouring via entropy compression
  V. Dujmović, G. Joret, and D. R. Wood
  
  
• An improved bound for First-Fit on posets without two long incomparable chains
  V. Dujmović, G. Joret, and D. R. Wood
  
  
• Disproof of the list Hadwiger conjecture
  J. Barát, G. Joret, and D. R. Wood
  Electronic Journal of Combinatorics, 18/1:R232, 2011.
  
  
• Nordhaus-Gaddum for treewidth
  G. Joret and D. R. Wood
  European Journal of Combinatorics, to appear.
  
  
• Boxicity of graphs on surfaces
  L. Esperet and G. Joret
  Graphs and Combinatorics, to appear.
  
  
• Complete graph minors and the graph minor structure theorem
  G. Joret and D. R. Wood
  
  
• Hitting and harvesting pumpkins
  G. Joret, C. Paul, I. Sau, S. Saurabh, and S. Thomassé
  Conference version in Proc. of ESA 2011.
  
  
• Approximating the balanced minimum evolution problem
  S. Fiorini and G. Joret
  Operations Research Letters, 40/1:31--35, 2012.
  
  
• A note on the Cops & Robber game on graphs embedded in non-orientable surfaces
  N. E. Clarke, S. Fiorini, G. Joret, and D. O. Theis
  
  
• First-Fit is linear on posets excluding two long incomparable chains
  G. Joret and K. G. Milans
  Order, 28/3:455--464, 2011.
  
  
• Small minors in dense graphs
  S. Fiorini, G. Joret, D. O. Theis, and D. R. Wood
  
  
• Trees with given stability number and minimum number of stable sets
  V. Bruyère, G. Joret, and H. Mélot
  Graphs and Combinatorics, to appear.
  
  
• Hitting diamonds and growing cacti
  S. Fiorini, G. Joret, and U. Pietropaoli
  Conference version in Proc. of IPCO 2010.
  
  
• Sorting under partial information (without the ellipsoid algorithm)
  J. Cardinal, S. Fiorini, G. Joret, R. M. Jungers, and J. I. Munro
  Combinatorica, accepted pending minor revisions.
  Conference version in Proc. of STOC 2010.
  
  
• Irreducible triangulations are small
  G. Joret and D. R. Wood
  Journal of Combinatorial Theory, Series B, 100/5:446--455, 2010.
  
  
• On the maximum number of cliques in a graph embedded in a surface
  V. Dujmović, G. Fijavž, G. Joret, T. Sulanke, and D. R. Wood
  European Journal of Combinatorics, 32/8:1244--1252, 2011.
  
  
• The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
  J. Cardinal, E. D. Demaine, S. Fiorini, G. Joret, I. Newman, and O. Weimann
  Journal of Combinatorial Optimization, accepted.
  Conference version in Proc. of WINE 2009.
  
  
• Stackelberg network pricing is hard to approximate
  G. Joret
  Networks, 57/2:117--120, 2011.
  
  
• An efficient algorithm for partial order production
  J. Cardinal, S. Fiorini, G. Joret, R. M. Jungers, and J. I. Munro
  SIAM Journal on Computing, 39/7:2927--2940, 2010.
  Conference version in Proc. of STOC 2009.
  
  
• Minimum entropy combinatorial optimization problems
  J. Cardinal, S. Fiorini, and G. Joret
  Theory of Computing Systems, to appear.
  Conference version in Proc. of CiE 2009.
  
  
• The Cops and Robber game on graphs with forbidden (induced) subgraphs
  G. Joret, M. Kamiński, and D. O. Theis
  Contributions to Discrete Mathematics, 5/2:40--51, 2010.
  
  
• The Stackelberg minimum spanning tree game
  J. Cardinal, E. D. Demaine, S. Fiorini, G. Joret, S. Langerman, I. Newman, and O. Weimann
  Algorithmica, 59/2:129--144, 2011.
  Conference version in Proc. of WADS 2007.
  
  
• Minimum entropy orientations
  J. Cardinal, S. Fiorini, and G. Joret
  Operations Research Letters, 36/6:680--683, 2008.
  
  
• Weighted graphs defining facets: a connection between stable set and linear ordering polytopes
  J.-P. Doignon, S. Fiorini, and G. Joret
  Discrete Optimization, 6/1:1--9, 2009.
  
  
• On a theorem of Sewell and Trotter
  S. Fiorini and G. Joret
  European Journal of Combinatorics, 30/2:425--428, 2009.
  
  
• Well-balanced orientations of mixed graphs
  A. Bernáth and G. Joret
  Information Processing Letters, 106/4:149--151, 2008.
  
  
• Turán’s theorem and k-connected graphs
  N. Bougard and G. Joret
  Journal of Graph Theory, 58/1:1--13, 2008.
  
  
• Tight results on minimum entropy set cover
  J. Cardinal, S. Fiorini, and G. Joret
  Algorithmica, 51/1:49--60, 2008.
  Conference version in Proc. of APPROX 2006.
  
  
• Minimum entropy coloring
  J. Cardinal, S. Fiorini, and G. Joret
  Journal of Combinatorial Optimization, 16/4:361--377, 2008.
  Conference version in Proc. of ISAAC 2005.
  
  
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
  J.-P. Doignon, S. Fiorini, and G. Joret
  Journal of Mathematical Psychology, 50/3:251--262, 2006.