Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Gwenaël Joret
2010 – today
- 2013
[j26]Vida Dujmovic, Gwenaël Joret, Fabrizio Frati, David R. Wood: Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. Electr. J. Comb. 20(1): P51 (2013)- [j25]Louis Esperet, Gwenaël Joret: Boxicity of Graphs on Surfaces. Graphs and Combinatorics 29(3): 417-427 (2013)
- [j24]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann: The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. J. Comb. Optim. 25(1): 19-46 (2013)
- [j23]Gwenaël Joret, David R. Wood: Complete graph minors and the graph minor structure theorem. J. Comb. Theory, Ser. B 103(1): 61-74 (2013)
- [i21]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang: Tree-Width and Dimension. CoRR abs/1301.5271 (2013)
- [i20]Louis Esperet, Gwenaël Joret: Coloring planar graphs with three colors and no large monochromatic components. CoRR abs/1303.2487 (2013)
- 2012
- [j22]
- [j21]Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood: Small minors in dense graphs. Eur. J. Comb. 33(6): 1226-1245 (2012)
- [j20]Véronique Bruyère, Gwenaël Joret, Hadrien Mélot: Trees with Given Stability Number and Minimum Number of Stable Sets. Graphs and Combinatorics 28(2): 167-187 (2012)
- [j19]Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Minimum Entropy Combinatorial Optimization Problems. Theory Comput. Syst. 51(1): 4-21 (2012)
- [j18]Samuel Fiorini, Gwenaël Joret: Approximating the balanced minimum evolution problem. Oper. Res. Lett. 40(1): 31-35 (2012)
- [j17]Vida Dujmovic, Gwenaël Joret, David R. Wood: An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains. SIAM J. Discrete Math. 26(3): 1068-1075 (2012)
- [i19]Vida Dujmovic, Fabrizio Frati, Gwenaël Joret, David R. Wood: Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours. CoRR abs/1202.1569 (2012)
- [i18]Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood: A linear-time algorithm for finding a complete graph minor in a dense graph. CoRR abs/1202.2624 (2012)
- [i17]Samuel Fiorini, Gwenaël Joret, David R. Wood: Excluded Forest Minors and the Erdős-Pósa Property. CoRR abs/1204.5192 (2012)
- [i16]János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood: Empty pentagons in point sets with collinearities. CoRR abs/1207.3633 (2012)
- [i15]Jean Cardinal, Gwenaël Joret: Hitting all Maximal Independent Sets of a Bipartite Graph. CoRR abs/1208.5589 (2012)
- [i14]
- 2011
- [j16]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game. Algorithmica 59(2): 129-144 (2011)
- [j15]János Barát, Gwenaël Joret, David R. Wood: Disproof of the List Hadwiger Conjecture. Electr. J. Comb. 18(1) (2011)
- [j14]Vida Dujmovic, Gasper Fijavz, Gwenaël Joret, Thom Sulanke, David R. Wood: On the maximum number of cliques in a graph embedded in a surface. Eur. J. Comb. 32(8): 1244-1252 (2011)
- [j13]
- [j12]Gwenaël Joret, Kevin G. Milans: First-Fit is Linear on Posets Excluding Two Long Incomparable Chains. Order 28(3): 455-464 (2011)
- [c9]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé: Hitting and Harvesting Pumpkins. ESA 2011: 394-407
- [i13]Samuel Fiorini, Gwenaël Joret: Approximating the Balanced Minimum Evolution Problem. CoRR abs/1104.1080 (2011)
- [i12]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé: Hitting and Harvesting Pumpkins. CoRR abs/1105.2704 (2011)
- [i11]
- [i10]János Barát, Gwenaël Joret, David R. Wood: Disproof of the List Hadwiger Conjecture. CoRR abs/1110.2272 (2011)
- [i9]Vida Dujmovic, Gwenaël Joret, David R. Wood: Nonrepetitive Colouring via Entropy Compression. CoRR abs/1112.5524 (2011)
- 2010
- [j11]Gwenaël Joret, Marcin Kaminski, Dirk Oliver Theis: The Cops and Robber game on graphs with forbidden (induced) subgraphs. Contributions to Discrete Mathematics 5(2) (2010)
- [j10]Gwenaël Joret, David R. Wood: Irreducible triangulations are small. J. Comb. Theory, Ser. B 100(5): 446-455 (2010)
- [j9]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro: An Efficient Algorithm for Partial Order Production. SIAM J. Comput. 39(7): 2927-2940 (2010)
- [c8]Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli: Hitting Diamonds and Growing Cacti. IPCO 2010: 191-204
- [c7]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro: Sorting under partial information (without the ellipsoid algorithm). STOC 2010: 359-368
- [i8]Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Minimum Entropy Combinatorial Optimization Problems. CoRR abs/1008.2928 (2010)
2000 – 2009
- 2009
- [j8]Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret: Weighted graphs defining facets: A connection between stable set and linear ordering polytopes. Discrete Optimization 6(1): 1-9 (2009)
- [j7]Samuel Fiorini, Gwenaël Joret: On a theorem of Sewell and Trotter. Eur. J. Comb. 30(2): 425-428 (2009)
- [c6]Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Minimum Entropy Combinatorial Optimization Problems. CiE 2009: 79-88
- [c5]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro: An efficient algorithm for partial order production. STOC 2009: 93-100
- [c4]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. WINE 2009: 125-136
- [i7]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. CoRR abs/0909.3221 (2009)
- [i6]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro: Sorting under Partial Information (without the Ellipsoid Algorithm). CoRR abs/0911.0086 (2009)
- [i5]Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli: Hitting Diamonds and Growing Cacti. CoRR abs/0911.4366 (2009)
- 2008
- [j6]Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Tight Results on Minimum Entropy Set Cover. Algorithmica 51(1): 49-60 (2008)
- [j5]Attila Bernáth, Gwenaël Joret: Well-balanced orientations of mixed graphs. Inf. Process. Lett. 106(4): 149-151 (2008)
- [j4]Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Minimum entropy coloring. J. Comb. Optim. 16(4): 361-377 (2008)
- [j3]Nicolas Bougard, Gwenaël Joret: Turán's theorem and k-connected graphs. Journal of Graph Theory 58(1): 1-13 (2008)
- [j2]Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Minimum entropy orientations. Oper. Res. Lett. 36(6): 680-683 (2008)
- [i4]Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Minimum Entropy Orientations. CoRR abs/0802.1237 (2008)
- [i3]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro: An Efficient Algorithm for Partial Order Production. CoRR abs/0811.2572 (2008)
- [i2]
- 2007
- [c3]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game. WADS 2007: 64-76
- [i1]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game. CoRR abs/cs/0703019 (2007)
- 2006
- [c2]Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Tight Results on Minimum Entropy Set Cover. APPROX-RANDOM 2006: 61-69
- 2005
- [j1]Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret: On a weighted generalization of alpha-critical graphs. Electronic Notes in Discrete Mathematics 22: 401-404 (2005)
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-14 22:39 CEST by the dblp team