default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGwenaël Joret
Person information
SPARQL queries 
🛈 Please note that only 66% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j76]Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Comb. 44(2): 417-427 (2024)- [j75]Gwenaël Joret, Clément Rambaud:
Neighborhood Complexity of Planar Graphs. Comb. 44(5): 1115-1148 (2024) - [j74]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure. Electron. J. Comb. 31(2) (2024) - [j73]Vida Dujmovic, Robert Hickingbotham
, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. Comb. Probab. Comput. 33(1): 85-90 (2024) - [j72]Marcin Brianski, Gwenaël Joret, Michal T. Seweryn:
Pathwidth Versus Cocircumference. SIAM J. Discret. Math. 38(1): 857-866 (2024) - [j71]Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michal T. Seweryn, David R. Wood:
Product Structure Extension of the Alon-Seymour-Thomas Theorem. SIAM J. Discret. Math. 38(3): 2095-2107 (2024) - [c20]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The Grid-Minor Theorem Revisited. SODA 2024: 1241-1245 - [c19]Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak:
Cliquewidth and Dimension. SODA 2024: 1437-1446 - [i66]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin:
Tight bound for the Erdős-Pósa property of tree minors. CoRR abs/2403.06370 (2024) - [i65]Gwenaël Joret, Robin Petit:
A Caro-Wei bound for induced linear forests in graphs. CoRR abs/2403.17568 (2024) - [i64]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
Planar graphs in blowups of fans. CoRR abs/2407.05936 (2024) - [i63]Manuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Michal T. Seweryn, Stefan Weltge, Yelena Yuditsky:
Integer programs with nearly totally unimodular matrices: the cographic case. CoRR abs/2407.09477 (2024) - 2023
- [j70]Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs Circumference. Comb. 43(4): 659-664 (2023) - [j69]Gwenaël Joret, William Lochet, Michal T. Seweryn:
Edge Separators for Graphs Excluding a Minor. Electron. J. Comb. 30(4) (2023) - [j68]Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak:
Approximating Pathwidth for Graphs of Small Treewidth. ACM Trans. Algorithms 19(2): 16:1-16:19 (2023) - [i62]Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight bound on treedepth in terms of pathwidth and longest path. CoRR abs/2302.02995 (2023) - [i61]Gwenaël Joret, Clément Rambaud:
Neighborhood complexity of planar graphs. CoRR abs/2302.12633 (2023) - [i60]Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. CoRR abs/2303.14970 (2023) - [i59]Marcin Brianski, Gwenaël Joret, Michal T. Seweryn:
Pathwidth vs cocircumference. CoRR abs/2306.03621 (2023) - [i58]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The grid-minor theorem revisited. CoRR abs/2307.02816 (2023) - [i57]Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak:
Cliquewidth and dimension. CoRR abs/2308.11950 (2023) - 2022
- [j67]Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan:
Excluding a Ladder. Comb. 42(3): 405-432 (2022) - [j66]Gwenaël Joret, Piotr Micek:
Improved Bounds for Weak Coloring Numbers. Electron. J. Comb. 29(1) (2022) - [j65]Tony Huynh, Gwenaël Joret, David R. Wood:
Subgraph densities in a surface. Comb. Probab. Comput. 31(5): 812-839 (2022) - [i56]Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs circumference. CoRR abs/2211.11410 (2022) - [i55]Gwenaël Joret, William Lochet, Michal T. Seweryn:
Edge separators for graphs excluding a minor. CoRR abs/2212.10998 (2022) - 2021
- [j64]Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot:
Packing and Covering Balls in Graphs Excluding a Minor. Comb. 41(3): 299-318 (2021) - [j63]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid:
Tight Bounds on the Clique Chromatic Number. Electron. J. Comb. 28(3) (2021) - [j62]Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood:
Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond. Electron. J. Comb. 28(4) (2021) - [j61]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller:
Unavoidable Minors for Graphs with Large ℓ p-Dimension. Discret. Comput. Geom. 66(1): 301-343 (2021) - [j60]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). J. ACM 68(6): 42:1-42:33 (2021) - [c18]Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky:
Integer programs with bounded subdeterminants and two nonzeros per row. FOCS 2021: 13-24 - [c17]Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak:
Approximating Pathwidth for Graphs of Small Treewidth. SODA 2021: 1965-1976 - [i54]Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky:
Integer programs with bounded subdeterminants and two nonzeros per row. CoRR abs/2106.05947 (2021) - [i53]Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood:
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond. CoRR abs/2106.11945 (2021) - 2020
- [j59]Gerardo Berbeglia, Gwenaël Joret:
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments. Algorithmica 82(4): 681-720 (2020) - [j58]Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood:
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. Comb. 40(6): 839-868 (2020) - [j57]Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni:
Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27(1): 1 (2020) - [j56]Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois:
Two lower bounds for $p$-centered colorings. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j55]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs Have Bounded Queue-Number. J. ACM 67(4): 22:1-22:38 (2020) - [j54]Samuel Fiorini, Gwenaël Joret, Oliver Schaudt:
Improved approximation algorithms for hitting 3-vertex paths. Math. Program. 182(1): 355-367 (2020) - [j53]Wouter Cames van Batenburg, Gwenaël Joret, Arthur Ulmer:
Erdös-Pósa from Ball Packing. SIAM J. Discret. Math. 34(3): 1609-1619 (2020) - [j52]Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood:
Minor-Closed Graph Classes with Bounded Layered Pathwidth. SIAM J. Discret. Math. 34(3): 1693-1709 (2020) - [j51]Gwenaël Joret, William Lochet:
Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture. SIAM J. Discret. Math. 34(4): 2221-2238 (2020) - [c16]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). FOCS 2020: 577-588 - [c15]Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge:
The stable set problem in graphs with bounded genus and bounded odd cycle packing number. SODA 2020: 2896-2915 - [i52]Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot:
Packing and covering balls in graphs excluding a minor. CoRR abs/2001.04517 (2020) - [i51]Zdenek Dvorák, Tony Huynh, Gwenaël Joret, Chun-Hung Liu, David R. Wood:
Notes on Graph Product Structure Theory. CoRR abs/2001.08860 (2020) - [i50]Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan:
Excluding a ladder. CoRR abs/2002.00496 (2020) - [i49]Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). CoRR abs/2003.04280 (2020) - [i48]Tony Huynh, Gwenaël Joret, David R. Wood:
Subgraph densities in a surface. CoRR abs/2003.13777 (2020) - [i47]Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois:
Two lower bounds for $p$-centered colorings. CoRR abs/2006.04113 (2020) - [i46]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid:
Tight Bounds on The Clique Chromatic Number. CoRR abs/2006.11353 (2020) - [i45]Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak:
Approximating pathwidth for graphs of small treewidth. CoRR abs/2008.00779 (2020) - [i44]Louis Esperet, Gwenaël Joret, Pat Morin:
Sparse universal graphs for planarity. CoRR abs/2010.05779 (2020)
2010 – 2019
- 2019
- [j50]Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert:
Nowhere Dense Graph Classes and Dimension. Comb. 39(5): 1055-1079 (2019) - [c14]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. FOCS 2019: 862-875 - [c13]Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond:
A tight Erdős-Pósa function for planar minors. SODA 2019: 1485-1500 - [i43]Jean Cardinal, Gwenaël Joret, Jérémie Roland:
Information-theoretic lower bounds for quantum sorting. CoRR abs/1902.06473 (2019) - [i42]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller:
Unavoidable minors for graphs with large 𝓁p-dimension. CoRR abs/1904.02951 (2019) - [i41]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. CoRR abs/1904.04791 (2019) - [i40]Vida Dujmovic, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood:
Planar graphs have bounded nonrepetitive chromatic number. CoRR abs/1904.05269 (2019) - [i39]Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge:
The stable set problem in graphs with bounded genus and bounded odd cycle packing number. CoRR abs/1908.06300 (2019) - [i38]Wouter Cames van Batenburg, Jan Goedgebeur, Gwenaël Joret:
Large independent sets in triangle-free cubic graphs: beyond planarity. CoRR abs/1911.12471 (2019) - [i37]Wouter Cames van Batenburg, Gwenaël Joret, Arthur Ulmer:
Erdős-Pósa from ball packing. CoRR abs/1912.07965 (2019) - 2018
- [j49]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Sparsity and Dimension. Comb. 38(5): 1129-1148 (2018) - [j48]Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert:
Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions. Electron. J. Comb. 25(1): 1 (2018) - [j47]Gwenaël Joret, David R. Wood:
K4-Minor-Free Induced Subgraphs of Sparse Connected Graphs. SIAM J. Discret. Math. 32(1): 123-147 (2018) - [j46]Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood:
Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. 32(2): 839-863 (2018) - [j45]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A Tight Erdös-Pósa Function for Wheel Minors. SIAM J. Discret. Math. 32(3): 2302-2312 (2018) - [j44]Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood:
Corrigendum: Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. 32(4): 3003-3004 (2018) - [i36]Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood:
Seymour's conjecture on 2-connected graphs of large pathwidth. CoRR abs/1801.01833 (2018) - [i35]Gwenaël Joret, William Lochet:
Progress on the adjacent vertex distinguishing edge colouring conjecture. CoRR abs/1804.06104 (2018) - [i34]Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond:
A tight Erdős-Pósa function for planar minors. CoRR abs/1807.04969 (2018) - [i33]Samuel Fiorini, Gwenaël Joret, Oliver Schaudt:
Improved approximation algorithms for hitting 3-vertex paths. CoRR abs/1808.10370 (2018) - [i32]Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood:
Minor-closed graph classes with bounded layered pathwidth. CoRR abs/1810.08314 (2018) - 2017
- [j43]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich:
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs. Discret. Comput. Geom. 57(3): 757-761 (2017) - [j42]Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert:
Burling graphs, chromatic number, and orthogonal tree-decompositions. Electron. Notes Discret. Math. 61: 415-420 (2017) - [j41]Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert:
On the Dimension of Posets with Cover Graphs of Treewidth 2. Order 34(2): 185-234 (2017) - [j40]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Antonios Varvitsiotis:
The Excluded Minors for Isometric Realizability in the Plane. SIAM J. Discret. Math. 31(1): 438-453 (2017) - [j39]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Planar Posets Have Dimension at Most Linear in Their Height. SIAM J. Discret. Math. 31(4): 2754-2790 (2017) - [c12]Gerardo Berbeglia, Gwenaël Joret:
Assortment Optimisation under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments. EC 2017: 345-346 - [i31]Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert:
Nowhere Dense Graph Classes and Dimension. CoRR abs/1708.05424 (2017) - [i30]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A tight Erdős-Pósa function for wheel minors. CoRR abs/1710.06282 (2017) - 2016
- [j38]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Tree-width and dimension. Comb. 36(4): 431-450 (2016) - [j37]Vida Dujmovic, Gwenaël Joret, Jakub Kozik, David R. Wood:
Nonrepetitive colouring via entropy compression. Comb. 36(6): 661-686 (2016) - [j36]Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek:
Pathwidth and Nonrepetitive List Coloring. Electron. J. Comb. 23(4): 4 (2016) - [c11]Samuel Fiorini, Gwenaël Joret, Oliver Schaudt:
Improved Approximation Algorithms for Hitting 3-Vertex Paths. IPCO 2016: 238-249 - [c10]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Sparsity and dimension. SODA 2016: 1804-1813 - [i29]Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek:
Pathwidth and nonrepetitive list coloring. CoRR abs/1601.01886 (2016) - [i28]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich:
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-genus Graphs. CoRR abs/1604.07976 (2016) - [i27]Gwenaël Joret, David R. Wood:
$K_{4}$-Minor-Free Induced Subgraphs of Sparse Connected Graphs. CoRR abs/1605.04730 (2016) - [i26]Gerardo Berbeglia, Gwenaël Joret:
Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortments. CoRR abs/1606.01371 (2016) - [i25]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Planar posets have dimension at most linear in their height. CoRR abs/1612.07540 (2016) - 2015
- [j35]Jean Cardinal, Gwenaël Joret:
Hitting All Maximal Independent Sets of a Bipartite Graph. Algorithmica 72(2): 359-368 (2015) - [j34]Gwenaël Joret, Adrian Vetta:
Reducing the rank of a matroid. Discret. Math. Theor. Comput. Sci. 17(2): 143-156 (2015) - [j33]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. SIAM J. Discret. Math. 29(1): 198-209 (2015) - [i24]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Sparsity and dimension. CoRR abs/1507.01120 (2015) - [i23]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Antonios Varvitsiotis:
The excluded minors for isometric realizability in the plane. CoRR abs/1511.08054 (2015) - 2014
- [j32]Louis Esperet, Gwenaël Joret:
Colouring Planar Graphs With Three Colours and No Large Monochromatic Components. Comb. Probab. Comput. 23(4): 551-570 (2014) - [j31]Nancy E. Clarke, Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis:
A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces. Graphs Comb. 30(1): 119-124 (2014) - [j30]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé:
Hitting and Harvesting Pumpkins. SIAM J. Discret. Math. 28(3): 1363-1390 (2014) - 2013
- [j29]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under partial information (without the ellipsoid algorithm). Comb. 33(6): 655-697 (2013) - [j28]Vida Dujmovic, Gwenaël Joret, Fabrizio Frati, David R. Wood:
Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. Electron. J. Comb. 20(1): 51 (2013) - [j27]Samuel Fiorini, Gwenaël Joret, David R. Wood:
Excluded Forest Minors and the Erdős-Pósa Property. Comb. Probab. Comput. 22(5): 700-721 (2013) - [j26]Louis Esperet, Gwenaël Joret:
Boxicity of Graphs on Surfaces. Graphs Comb. 29(3): 417-427 (2013) - [j25]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) - [j24]Gwenaël Joret, David R. Wood:
Complete graph minors and the graph minor structure theorem. J. Comb. Theory B 103(1): 61-74 (2013) - [j23]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. SIAM J. Discret. Math. 27(4): 1770-1774 (2013) - [i22]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Tree-Width and Dimension. CoRR abs/1301.5271 (2013) - [i21]Louis Esperet, Gwenaël Joret:
Coloring planar graphs with three colors and no large monochromatic components. CoRR abs/1303.2487 (2013) - 2012
- [j22]Gwenaël Joret, David R. Wood:
Nordhaus-Gaddum for treewidth. Eur. J. Comb. 33(4): 488-490 (2012) - [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 Comb. 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. Discret. Math. 26(3): 1068-1075 (2012) - [i20]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) - [i19]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) - [i18]Samuel Fiorini, Gwenaël Joret, David R. Wood:
Excluded Forest Minors and the Erdős-Pósa Property. CoRR abs/1204.5192 (2012) - [i17]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) - [i16]Jean Cardinal, Gwenaël Joret:
Hitting all Maximal Independent Sets of a Bipartite Graph. CoRR abs/1208.5589 (2012) - [i15]Gwenaël Joret, Adrian Vetta:
Reducing the rank of a matroid. CoRR abs/1211.4853 (2012) - 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. Electron. 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]Gwenaël Joret:
Stackelberg network pricing is hard to approximate. Networks 57(2): 117-120 (2011) - [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 - [i14]Samuel Fiorini, Gwenaël Joret:
Approximating the Balanced Minimum Evolution Problem. CoRR abs/1104.1080 (2011) - [i13]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé:
Hitting and Harvesting Pumpkins. CoRR abs/1105.2704 (2011) - [i12]Gwenaël Joret, David R. Wood:
Nordhaus-Gaddum for Treewidth. CoRR abs/1109.1602 (2011) - [i11]János Barát, Gwenaël Joret, David R. Wood:
Disproof of the List Hadwiger Conjecture. CoRR abs/1110.2272 (2011) - [i10]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 Discret. Math. 5(2) (2010) - [j10]Gwenaël Joret, David R. Wood:
Irreducible triangulations are small. J. Comb. Theory 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 - [i9]Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood:
Small Minors in Dense Graphs. CoRR abs/1005.0895 (2010) - [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. Discret. Optim. 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, Raphaël 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, Raphaël 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. J. 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, Raphaël M. Jungers, J. Ian Munro:
An Efficient Algorithm for Partial Order Production. CoRR abs/0811.2572 (2008) - [i2]Gwenaël Joret:
Stackelberg Network Pricing is Hard to Approximate. CoRR abs/0812.0320 (2008) - 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. Electron. Notes Discret. Math. 22: 401-404 (2005) - [c1]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Coloring. ISAAC 2005: 819-828
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
