default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Gwenaël Joret
@article{DBLP:journals/combinatorica/HatzelJMPUW24,
author = {Meike Hatzel and
Gwena{\"{e}}l Joret and
Piotr Micek and
Marcin Pilipczuk and
Torsten Ueckerdt and
Bartosz Walczak},
title = {Tight Bound on Treedepth in Terms of Pathwidth and Longest Path},
journal = {Comb.},
volume = {44},
number = {2},
pages = {417--427},
year = {2024},
url = {https://doi.org/10.1007/s00493-023-00077-w},
doi = {10.1007/S00493-023-00077-W},
timestamp = {Fri, 29 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/HatzelJMPUW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/DujmovicJMMW24,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
David R. Wood},
title = {Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure},
journal = {Electron. J. Comb.},
volume = {31},
number = {2},
year = {2024},
url = {https://doi.org/10.37236/11712},
doi = {10.37236/11712},
timestamp = {Wed, 03 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/DujmovicJMMW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DujmovicHJMMW24,
author = {Vida Dujmovic and
Robert Hickingbotham and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
David R. Wood},
title = {The Excluded Tree Minor Theorem Revisited},
journal = {Comb. Probab. Comput.},
volume = {33},
number = {1},
pages = {85--90},
year = {2024},
url = {https://doi.org/10.1017/s0963548323000275},
doi = {10.1017/S0963548323000275},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/DujmovicHJMMW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrianskiJS24,
author = {Marcin Brianski and
Gwena{\"{e}}l Joret and
Michal T. Seweryn},
title = {Pathwidth Versus Cocircumference},
journal = {{SIAM} J. Discret. Math.},
volume = {38},
number = {1},
pages = {857--866},
year = {2024},
url = {https://doi.org/10.1137/23m158663x},
doi = {10.1137/23M158663X},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrianskiJS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DistelDEHJMMSW24,
author = {Marc Distel and
Vida Dujmovic and
David Eppstein and
Robert Hickingbotham and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
Michal T. Seweryn and
David R. Wood},
title = {Product Structure Extension of the Alon-Seymour-Thomas Theorem},
journal = {{SIAM} J. Discret. Math.},
volume = {38},
number = {3},
pages = {2095--2107},
year = {2024},
url = {https://doi.org/10.1137/23m1591773},
doi = {10.1137/23M1591773},
timestamp = {Thu, 22 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DistelDEHJMMSW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DujmovicHHJLMMRW24,
author = {Vida Dujmovic and
Robert Hickingbotham and
Jedrzej Hodor and
Gwena{\"{e}}l Joret and
Hoang La and
Piotr Micek and
Pat Morin and
Cl{\'{e}}ment Rambaud and
David R. Wood},
editor = {David P. Woodruff},
title = {The Grid-Minor Theorem Revisited},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {1241--1245},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.48},
doi = {10.1137/1.9781611977912.48},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DujmovicHHJLMMRW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JoretMPW24,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Michal Pilipczuk and
Bartosz Walczak},
editor = {David P. Woodruff},
title = {Cliquewidth and Dimension},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {1437--1446},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.58},
doi = {10.1137/1.9781611977912.58},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/JoretMPW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-06370,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin},
title = {Tight bound for the Erd{\H{o}}s-P{\'{o}}sa property of tree minors},
journal = {CoRR},
volume = {abs/2403.06370},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.06370},
doi = {10.48550/ARXIV.2403.06370},
eprinttype = {arXiv},
eprint = {2403.06370},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-06370.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-17568,
author = {Gwena{\"{e}}l Joret and
Robin Petit},
title = {A Caro-Wei bound for induced linear forests in graphs},
journal = {CoRR},
volume = {abs/2403.17568},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.17568},
doi = {10.48550/ARXIV.2403.17568},
eprinttype = {arXiv},
eprint = {2403.17568},
timestamp = {Thu, 11 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-17568.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2407-05936,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
David R. Wood},
title = {Planar graphs in blowups of fans},
journal = {CoRR},
volume = {abs/2407.05936},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2407.05936},
doi = {10.48550/ARXIV.2407.05936},
eprinttype = {arXiv},
eprint = {2407.05936},
timestamp = {Sat, 24 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2407-05936.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2407-09477,
author = {Manuel Aprile and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Stefan Kober and
Michal T. Seweryn and
Stefan Weltge and
Yelena Yuditsky},
title = {Integer programs with nearly totally unimodular matrices: the cographic
case},
journal = {CoRR},
volume = {abs/2407.09477},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2407.09477},
doi = {10.48550/ARXIV.2407.09477},
eprinttype = {arXiv},
eprint = {2407.09477},
timestamp = {Sat, 24 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2407-09477.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BrianskiJMMSS23,
author = {Marcin Brianski and
Gwena{\"{e}}l Joret and
Konrad Majewski and
Piotr Micek and
Michal T. Seweryn and
Roohani Sharma},
title = {Treedepth vs Circumference},
journal = {Comb.},
volume = {43},
number = {4},
pages = {659--664},
year = {2023},
url = {https://doi.org/10.1007/s00493-023-00028-5},
doi = {10.1007/S00493-023-00028-5},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BrianskiJMMSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/JoretLS23,
author = {Gwena{\"{e}}l Joret and
William Lochet and
Michal T. Seweryn},
title = {Edge Separators for Graphs Excluding a Minor},
journal = {Electron. J. Comb.},
volume = {30},
number = {4},
year = {2023},
url = {https://doi.org/10.37236/11744},
doi = {10.37236/11744},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/JoretLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GroenlandJNW23,
author = {Carla Groenland and
Gwena{\"{e}}l Joret and
Wojciech Nadara and
Bartosz Walczak},
title = {Approximating Pathwidth for Graphs of Small Treewidth},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {2},
pages = {16:1--16:19},
year = {2023},
url = {https://doi.org/10.1145/3576044},
doi = {10.1145/3576044},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/GroenlandJNW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-02995,
author = {Meike Hatzel and
Gwena{\"{e}}l Joret and
Piotr Micek and
Marcin Pilipczuk and
Torsten Ueckerdt and
Bartosz Walczak},
title = {Tight bound on treedepth in terms of pathwidth and longest path},
journal = {CoRR},
volume = {abs/2302.02995},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.02995},
doi = {10.48550/ARXIV.2302.02995},
eprinttype = {arXiv},
eprint = {2302.02995},
timestamp = {Mon, 13 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-02995.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-12633,
author = {Gwena{\"{e}}l Joret and
Cl{\'{e}}ment Rambaud},
title = {Neighborhood complexity of planar graphs},
journal = {CoRR},
volume = {abs/2302.12633},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.12633},
doi = {10.48550/ARXIV.2302.12633},
eprinttype = {arXiv},
eprint = {2302.12633},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-12633.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-14970,
author = {Vida Dujmovic and
Robert Hickingbotham and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
David R. Wood},
title = {The Excluded Tree Minor Theorem Revisited},
journal = {CoRR},
volume = {abs/2303.14970},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.14970},
doi = {10.48550/ARXIV.2303.14970},
eprinttype = {arXiv},
eprint = {2303.14970},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-14970.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-03621,
author = {Marcin Brianski and
Gwena{\"{e}}l Joret and
Michal T. Seweryn},
title = {Pathwidth vs cocircumference},
journal = {CoRR},
volume = {abs/2306.03621},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.03621},
doi = {10.48550/ARXIV.2306.03621},
eprinttype = {arXiv},
eprint = {2306.03621},
timestamp = {Wed, 14 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-03621.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-02816,
author = {Vida Dujmovic and
Robert Hickingbotham and
Jedrzej Hodor and
Gwena{\"{e}}l Joret and
Hoang La and
Piotr Micek and
Pat Morin and
Cl{\'{e}}ment Rambaud and
David R. Wood},
title = {The grid-minor theorem revisited},
journal = {CoRR},
volume = {abs/2307.02816},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.02816},
doi = {10.48550/ARXIV.2307.02816},
eprinttype = {arXiv},
eprint = {2307.02816},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-02816.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-11950,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Michal Pilipczuk and
Bartosz Walczak},
title = {Cliquewidth and dimension},
journal = {CoRR},
volume = {abs/2308.11950},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.11950},
doi = {10.48550/ARXIV.2308.11950},
eprinttype = {arXiv},
eprint = {2308.11950},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-11950.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HuynhJMSW22,
author = {Tony Huynh and
Gwena{\"{e}}l Joret and
Piotr Micek and
Michal T. Seweryn and
Paul Wollan},
title = {Excluding a Ladder},
journal = {Comb.},
volume = {42},
number = {3},
pages = {405--432},
year = {2022},
url = {https://doi.org/10.1007/s00493-021-4592-8},
doi = {10.1007/S00493-021-4592-8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HuynhJMSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/JoretM22,
author = {Gwena{\"{e}}l Joret and
Piotr Micek},
title = {Improved Bounds for Weak Coloring Numbers},
journal = {Electron. J. Comb.},
volume = {29},
number = {1},
year = {2022},
url = {https://doi.org/10.37236/10274},
doi = {10.37236/10274},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/JoretM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HuynhJW22,
author = {Tony Huynh and
Gwena{\"{e}}l Joret and
David R. Wood},
title = {Subgraph densities in a surface},
journal = {Comb. Probab. Comput.},
volume = {31},
number = {5},
pages = {812--839},
year = {2022},
url = {https://doi.org/10.1017/S0963548321000560},
doi = {10.1017/S0963548321000560},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/HuynhJW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-11410,
author = {Marcin Brianski and
Gwena{\"{e}}l Joret and
Konrad Majewski and
Piotr Micek and
Michal T. Seweryn and
Roohani Sharma},
title = {Treedepth vs circumference},
journal = {CoRR},
volume = {abs/2211.11410},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.11410},
doi = {10.48550/ARXIV.2211.11410},
eprinttype = {arXiv},
eprint = {2211.11410},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-11410.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-10998,
author = {Gwena{\"{e}}l Joret and
William Lochet and
Michal T. Seweryn},
title = {Edge separators for graphs excluding a minor},
journal = {CoRR},
volume = {abs/2212.10998},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.10998},
doi = {10.48550/ARXIV.2212.10998},
eprinttype = {arXiv},
eprint = {2212.10998},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-10998.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BousquetBEJLMP21,
author = {Nicolas Bousquet and
Wouter Cames van Batenburg and
Louis Esperet and
Gwena{\"{e}}l Joret and
William Lochet and
Carole Muller and
Fran{\c{c}}ois Pirot},
title = {Packing and Covering Balls in Graphs Excluding a Minor},
journal = {Comb.},
volume = {41},
number = {3},
pages = {299--318},
year = {2021},
url = {https://doi.org/10.1007/s00493-020-4423-3},
doi = {10.1007/S00493-020-4423-3},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/BousquetBEJLMP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/JoretMRS21,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Bruce A. Reed and
Michiel Smid},
title = {Tight Bounds on the Clique Chromatic Number},
journal = {Electron. J. Comb.},
volume = {28},
number = {3},
year = {2021},
url = {https://doi.org/10.37236/9659},
doi = {10.37236/9659},
timestamp = {Mon, 27 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/JoretMRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/AprileFHJW21,
author = {Manuel Aprile and
Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
David R. Wood},
title = {Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed
Classes and Beyond},
journal = {Electron. J. Comb.},
volume = {28},
number = {4},
year = {2021},
url = {https://doi.org/10.37236/10522},
doi = {10.37236/10522},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/AprileFHJW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/FioriniHJM21,
author = {Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
Carole Muller},
title = {Unavoidable Minors for Graphs with Large {\(\mathscr{l}\)} \({}_{\mbox{p}}\)-Dimension},
journal = {Discret. Comput. Geom.},
volume = {66},
number = {1},
pages = {301--343},
year = {2021},
url = {https://doi.org/10.1007/s00454-021-00285-5},
doi = {10.1007/S00454-021-00285-5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/FioriniHJM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DujmovicEGJMM21,
author = {Vida Dujmovic and
Louis Esperet and
Cyril Gavoille and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin},
title = {Adjacency Labelling for Planar Graphs (and Beyond)},
journal = {J. {ACM}},
volume = {68},
number = {6},
pages = {42:1--42:33},
year = {2021},
url = {https://doi.org/10.1145/3477542},
doi = {10.1145/3477542},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DujmovicEGJMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FioriniJWY21,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Stefan Weltge and
Yelena Yuditsky},
title = {Integer programs with bounded subdeterminants and two nonzeros per
row},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {13--24},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00011},
doi = {10.1109/FOCS52979.2021.00011},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/FioriniJWY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GroenlandJNW21,
author = {Carla Groenland and
Gwena{\"{e}}l Joret and
Wojciech Nadara and
Bartosz Walczak},
editor = {D{\'{a}}niel Marx},
title = {Approximating Pathwidth for Graphs of Small Treewidth},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {1965--1976},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.117},
doi = {10.1137/1.9781611976465.117},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GroenlandJNW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-05947,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Stefan Weltge and
Yelena Yuditsky},
title = {Integer programs with bounded subdeterminants and two nonzeros per
row},
journal = {CoRR},
volume = {abs/2106.05947},
year = {2021},
url = {https://arxiv.org/abs/2106.05947},
eprinttype = {arXiv},
eprint = {2106.05947},
timestamp = {Wed, 16 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-05947.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-11945,
author = {Manuel Aprile and
Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
David R. Wood},
title = {Smaller extended formulations for spanning tree polytopes in minor-closed
classes and beyond},
journal = {CoRR},
volume = {abs/2106.11945},
year = {2021},
url = {https://arxiv.org/abs/2106.11945},
eprinttype = {arXiv},
eprint = {2106.11945},
timestamp = {Thu, 01 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-11945.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BerbegliaJ20,
author = {Gerardo Berbeglia and
Gwena{\"{e}}l Joret},
title = {Assortment Optimisation Under a General Discrete Choice Model: {A}
Tight Analysis of Revenue-Ordered Assortments},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {681--720},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00610-8},
doi = {10.1007/S00453-019-00610-8},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BerbegliaJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HuynhJMW20,
author = {Tony Huynh and
Gwena{\"{e}}l Joret and
Piotr Micek and
David R. Wood},
title = {Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth},
journal = {Comb.},
volume = {40},
number = {6},
pages = {839--868},
year = {2020},
url = {https://doi.org/10.1007/s00493-020-3941-3},
doi = {10.1007/S00493-020-3941-3},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HuynhJMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BonamyCDJLLPS20,
author = {Marthe Bonamy and
Pierre Charbit and
Oscar Defrain and
Gwena{\"{e}}l Joret and
Aur{\'{e}}lie Lagoutte and
Vincent Limouzy and
Lucas Pastor and
Jean{-}S{\'{e}}bastien Sereni},
title = {Revisiting a Theorem by Folkman on Graph Colouring},
journal = {Electron. J. Comb.},
volume = {27},
number = {1},
pages = {1},
year = {2020},
url = {https://doi.org/10.37236/8899},
doi = {10.37236/8899},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BonamyCDJLLPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/DuboisJPPP20,
author = {Lo{\"{\i}}c Dubois and
Gwena{\"{e}}l Joret and
Guillem Perarnau and
Marcin Pilipczuk and
Fran{\c{c}}ois Pitois},
title = {Two lower bounds for {\textdollar}p{\textdollar}-centered colorings},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {22},
number = {4},
year = {2020},
url = {https://doi.org/10.23638/DMTCS-22-4-9},
doi = {10.23638/DMTCS-22-4-9},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/DuboisJPPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DujmovicJMMUW20,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
Torsten Ueckerdt and
David R. Wood},
title = {Planar Graphs Have Bounded Queue-Number},
journal = {J. {ACM}},
volume = {67},
number = {4},
pages = {22:1--22:38},
year = {2020},
url = {https://doi.org/10.1145/3385731},
doi = {10.1145/3385731},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DujmovicJMMUW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FioriniJS20,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Oliver Schaudt},
title = {Improved approximation algorithms for hitting 3-vertex paths},
journal = {Math. Program.},
volume = {182},
number = {1},
pages = {355--367},
year = {2020},
url = {https://doi.org/10.1007/s10107-019-01395-y},
doi = {10.1007/S10107-019-01395-Y},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FioriniJS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BatenburgJU20,
author = {Wouter Cames van Batenburg and
Gwena{\"{e}}l Joret and
Arthur Ulmer},
title = {Erd{\"{o}}s-P{\'{o}}sa from Ball Packing},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {3},
pages = {1609--1619},
year = {2020},
url = {https://doi.org/10.1137/19M1309225},
doi = {10.1137/19M1309225},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BatenburgJU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DujmovicEJMW20,
author = {Vida Dujmovic and
David Eppstein and
Gwena{\"{e}}l Joret and
Pat Morin and
David R. Wood},
title = {Minor-Closed Graph Classes with Bounded Layered Pathwidth},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {3},
pages = {1693--1709},
year = {2020},
url = {https://doi.org/10.1137/18M122162X},
doi = {10.1137/18M122162X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DujmovicEJMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JoretL20,
author = {Gwena{\"{e}}l Joret and
William Lochet},
title = {Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {4},
pages = {2221--2238},
year = {2020},
url = {https://doi.org/10.1137/18M1200427},
doi = {10.1137/18M1200427},
timestamp = {Sat, 09 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/JoretL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DujmovicEGJMM20,
author = {Vida Dujmovic and
Louis Esperet and
Cyril Gavoille and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin},
editor = {Sandy Irani},
title = {Adjacency Labelling for Planar Graphs (and Beyond)},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {577--588},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00060},
doi = {10.1109/FOCS46700.2020.00060},
timestamp = {Wed, 15 Dec 2021 10:49:16 +0100},
biburl = {https://dblp.org/rec/conf/focs/DujmovicEGJMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ConfortiFHJW20,
author = {Michele Conforti and
Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
Stefan Weltge},
editor = {Shuchi Chawla},
title = {The stable set problem in graphs with bounded genus and bounded odd
cycle packing number},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {2896--2915},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.176},
doi = {10.1137/1.9781611975994.176},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/ConfortiFHJW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-04517,
author = {Nicolas Bousquet and
Wouter Cames van Batenburg and
Louis Esperet and
Gwena{\"{e}}l Joret and
William Lochet and
Carole Muller and
Fran{\c{c}}ois Pirot},
title = {Packing and covering balls in graphs excluding a minor},
journal = {CoRR},
volume = {abs/2001.04517},
year = {2020},
url = {https://arxiv.org/abs/2001.04517},
eprinttype = {arXiv},
eprint = {2001.04517},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-04517.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-08860,
author = {Zdenek Dvor{\'{a}}k and
Tony Huynh and
Gwena{\"{e}}l Joret and
Chun{-}Hung Liu and
David R. Wood},
title = {Notes on Graph Product Structure Theory},
journal = {CoRR},
volume = {abs/2001.08860},
year = {2020},
url = {https://arxiv.org/abs/2001.08860},
eprinttype = {arXiv},
eprint = {2001.08860},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-08860.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-00496,
author = {Tony Huynh and
Gwena{\"{e}}l Joret and
Piotr Micek and
Michal T. Seweryn and
Paul Wollan},
title = {Excluding a ladder},
journal = {CoRR},
volume = {abs/2002.00496},
year = {2020},
url = {https://arxiv.org/abs/2002.00496},
eprinttype = {arXiv},
eprint = {2002.00496},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-00496.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-04280,
author = {Vida Dujmovic and
Louis Esperet and
Gwena{\"{e}}l Joret and
Cyril Gavoille and
Piotr Micek and
Pat Morin},
title = {Adjacency Labelling for Planar Graphs (and Beyond)},
journal = {CoRR},
volume = {abs/2003.04280},
year = {2020},
url = {https://arxiv.org/abs/2003.04280},
eprinttype = {arXiv},
eprint = {2003.04280},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-04280.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-13777,
author = {Tony Huynh and
Gwena{\"{e}}l Joret and
David R. Wood},
title = {Subgraph densities in a surface},
journal = {CoRR},
volume = {abs/2003.13777},
year = {2020},
url = {https://arxiv.org/abs/2003.13777},
eprinttype = {arXiv},
eprint = {2003.13777},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-13777.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-04113,
author = {Lo{\"{\i}}c Dubois and
Gwena{\"{e}}l Joret and
Guillem Perarnau and
Marcin Pilipczuk and
Fran{\c{c}}ois Pitois},
title = {Two lower bounds for {\textdollar}p{\textdollar}-centered colorings},
journal = {CoRR},
volume = {abs/2006.04113},
year = {2020},
url = {https://arxiv.org/abs/2006.04113},
eprinttype = {arXiv},
eprint = {2006.04113},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-04113.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-11353,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Bruce A. Reed and
Michiel H. M. Smid},
title = {Tight Bounds on The Clique Chromatic Number},
journal = {CoRR},
volume = {abs/2006.11353},
year = {2020},
url = {https://arxiv.org/abs/2006.11353},
eprinttype = {arXiv},
eprint = {2006.11353},
timestamp = {Wed, 24 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-11353.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-00779,
author = {Carla Groenland and
Gwena{\"{e}}l Joret and
Wojciech Nadara and
Bartosz Walczak},
title = {Approximating pathwidth for graphs of small treewidth},
journal = {CoRR},
volume = {abs/2008.00779},
year = {2020},
url = {https://arxiv.org/abs/2008.00779},
eprinttype = {arXiv},
eprint = {2008.00779},
timestamp = {Fri, 07 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-00779.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-05779,
author = {Louis Esperet and
Gwena{\"{e}}l Joret and
Pat Morin},
title = {Sparse universal graphs for planarity},
journal = {CoRR},
volume = {abs/2010.05779},
year = {2020},
url = {https://arxiv.org/abs/2010.05779},
eprinttype = {arXiv},
eprint = {2010.05779},
timestamp = {Wed, 21 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-05779.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/JoretMMW19,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Patrice Ossona de Mendez and
Veit Wiechert},
title = {Nowhere Dense Graph Classes and Dimension},
journal = {Comb.},
volume = {39},
number = {5},
pages = {1055--1079},
year = {2019},
url = {https://doi.org/10.1007/s00493-019-3892-8},
doi = {10.1007/S00493-019-3892-8},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/JoretMMW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DujmovicJMMUW19,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
Torsten Ueckerdt and
David R. Wood},
editor = {David Zuckerman},
title = {Planar Graphs have Bounded Queue-Number},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {862--875},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00056},
doi = {10.1109/FOCS.2019.00056},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DujmovicJMMUW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BatenburgHJR19,
author = {Wouter Cames van Batenburg and
Tony Huynh and
Gwena{\"{e}}l Joret and
Jean{-}Florent Raymond},
editor = {Timothy M. Chan},
title = {A tight Erd{\H{o}}s-P{\'{o}}sa function for planar minors},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1485--1500},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.90},
doi = {10.1137/1.9781611975482.90},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/BatenburgHJR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-06473,
author = {Jean Cardinal and
Gwena{\"{e}}l Joret and
J{\'{e}}r{\'{e}}mie Roland},
title = {Information-theoretic lower bounds for quantum sorting},
journal = {CoRR},
volume = {abs/1902.06473},
year = {2019},
url = {http://arxiv.org/abs/1902.06473},
eprinttype = {arXiv},
eprint = {1902.06473},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-06473.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-02951,
author = {Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
Carole Muller},
title = {Unavoidable minors for graphs with large {\unicode{120001}}\({}_{\mbox{p}}\)-dimension},
journal = {CoRR},
volume = {abs/1904.02951},
year = {2019},
url = {http://arxiv.org/abs/1904.02951},
eprinttype = {arXiv},
eprint = {1904.02951},
timestamp = {Fri, 26 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-02951.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-04791,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
Torsten Ueckerdt and
David R. Wood},
title = {Planar Graphs have Bounded Queue-Number},
journal = {CoRR},
volume = {abs/1904.04791},
year = {2019},
url = {http://arxiv.org/abs/1904.04791},
eprinttype = {arXiv},
eprint = {1904.04791},
timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-04791.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-05269,
author = {Vida Dujmovic and
Louis Esperet and
Gwena{\"{e}}l Joret and
Bartosz Walczak and
David R. Wood},
title = {Planar graphs have bounded nonrepetitive chromatic number},
journal = {CoRR},
volume = {abs/1904.05269},
year = {2019},
url = {http://arxiv.org/abs/1904.05269},
eprinttype = {arXiv},
eprint = {1904.05269},
timestamp = {Fri, 26 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-05269.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-06300,
author = {Michele Conforti and
Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
Stefan Weltge},
title = {The stable set problem in graphs with bounded genus and bounded odd
cycle packing number},
journal = {CoRR},
volume = {abs/1908.06300},
year = {2019},
url = {http://arxiv.org/abs/1908.06300},
eprinttype = {arXiv},
eprint = {1908.06300},
timestamp = {Mon, 26 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-06300.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-12471,
author = {Wouter Cames van Batenburg and
Jan Goedgebeur and
Gwena{\"{e}}l Joret},
title = {Large independent sets in triangle-free cubic graphs: beyond planarity},
journal = {CoRR},
volume = {abs/1911.12471},
year = {2019},
url = {http://arxiv.org/abs/1911.12471},
eprinttype = {arXiv},
eprint = {1911.12471},
timestamp = {Wed, 08 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-12471.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-07965,
author = {Wouter Cames van Batenburg and
Gwena{\"{e}}l Joret and
Arthur Ulmer},
title = {Erd{\H{o}}s-P{\'{o}}sa from ball packing},
journal = {CoRR},
volume = {abs/1912.07965},
year = {2019},
url = {http://arxiv.org/abs/1912.07965},
eprinttype = {arXiv},
eprint = {1912.07965},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-07965.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/JoretMW18,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Veit Wiechert},
title = {Sparsity and Dimension},
journal = {Comb.},
volume = {38},
number = {5},
pages = {1129--1148},
year = {2018},
url = {https://doi.org/10.1007/s00493-017-3638-4},
doi = {10.1007/S00493-017-3638-4},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/JoretMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/FelsnerJMTW18,
author = {Stefan Felsner and
Gwena{\"{e}}l Joret and
Piotr Micek and
William T. Trotter and
Veit Wiechert},
title = {Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions},
journal = {Electron. J. Comb.},
volume = {25},
number = {1},
pages = {1},
year = {2018},
url = {https://doi.org/10.37236/7052},
doi = {10.37236/7052},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/FelsnerJMTW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JoretW18,
author = {Gwena{\"{e}}l Joret and
David R. Wood},
title = {K\({}_{\mbox{4}}\)-Minor-Free Induced Subgraphs of Sparse Connected
Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {1},
pages = {123--147},
year = {2018},
url = {https://doi.org/10.1137/16M107712X},
doi = {10.1137/16M107712X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JoretW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DujmovicJMNW18,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Pat Morin and
Sergey Norin and
David R. Wood},
title = {Orthogonal Tree Decompositions of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {2},
pages = {839--863},
year = {2018},
url = {https://doi.org/10.1137/17M1112637},
doi = {10.1137/17M1112637},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DujmovicJMNW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AboulkerFHJRS18,
author = {Pierre Aboulker and
Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
Jean{-}Florent Raymond and
Ignasi Sau},
title = {A Tight Erd{\"{o}}s-P{\'{o}}sa Function for Wheel Minors},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {3},
pages = {2302--2312},
year = {2018},
url = {https://doi.org/10.1137/17M1153169},
doi = {10.1137/17M1153169},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/AboulkerFHJRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DujmovicJMNW18a,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Pat Morin and
Sergey Norin and
David R. Wood},
title = {Corrigendum: Orthogonal Tree Decompositions of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {4},
pages = {3003--3004},
year = {2018},
url = {https://doi.org/10.1137/18M1214196},
doi = {10.1137/18M1214196},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DujmovicJMNW18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-01833,
author = {Tony Huynh and
Gwena{\"{e}}l Joret and
Piotr Micek and
David R. Wood},
title = {Seymour's conjecture on 2-connected graphs of large pathwidth},
journal = {CoRR},
volume = {abs/1801.01833},
year = {2018},
url = {http://arxiv.org/abs/1801.01833},
eprinttype = {arXiv},
eprint = {1801.01833},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-01833.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-06104,
author = {Gwena{\"{e}}l Joret and
William Lochet},
title = {Progress on the adjacent vertex distinguishing edge colouring conjecture},
journal = {CoRR},
volume = {abs/1804.06104},
year = {2018},
url = {http://arxiv.org/abs/1804.06104},
eprinttype = {arXiv},
eprint = {1804.06104},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-06104.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-04969,
author = {Wouter Cames van Batenburg and
Tony Huynh and
Gwena{\"{e}}l Joret and
Jean{-}Florent Raymond},
title = {A tight Erd{\H{o}}s-P{\'{o}}sa function for planar minors},
journal = {CoRR},
volume = {abs/1807.04969},
year = {2018},
url = {http://arxiv.org/abs/1807.04969},
eprinttype = {arXiv},
eprint = {1807.04969},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-04969.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-10370,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Oliver Schaudt},
title = {Improved approximation algorithms for hitting 3-vertex paths},
journal = {CoRR},
volume = {abs/1808.10370},
year = {2018},
url = {http://arxiv.org/abs/1808.10370},
eprinttype = {arXiv},
eprint = {1808.10370},
timestamp = {Mon, 03 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-10370.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-08314,
author = {Vida Dujmovic and
David Eppstein and
Gwena{\"{e}}l Joret and
Pat Morin and
David R. Wood},
title = {Minor-closed graph classes with bounded layered pathwidth},
journal = {CoRR},
volume = {abs/1810.08314},
year = {2018},
url = {http://arxiv.org/abs/1810.08314},
eprinttype = {arXiv},
eprint = {1810.08314},
timestamp = {Thu, 01 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-08314.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/FioriniHJP17,
author = {Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
Kanstantsin Pashkovich},
title = {Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus
Graphs},
journal = {Discret. Comput. Geom.},
volume = {57},
number = {3},
pages = {757--761},
year = {2017},
url = {https://doi.org/10.1007/s00454-016-9852-9},
doi = {10.1007/S00454-016-9852-9},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/FioriniHJP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FelsnerJMTW17,
author = {Stefan Felsner and
Gwena{\"{e}}l Joret and
Piotr Micek and
William T. Trotter and
Veit Wiechert},
title = {Burling graphs, chromatic number, and orthogonal tree-decompositions},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {415--420},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.068},
doi = {10.1016/J.ENDM.2017.06.068},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FelsnerJMTW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/JoretMTWW17,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
William T. Trotter and
Ruidong Wang and
Veit Wiechert},
title = {On the Dimension of Posets with Cover Graphs of Treewidth 2},
journal = {Order},
volume = {34},
number = {2},
pages = {185--234},
year = {2017},
url = {https://doi.org/10.1007/s11083-016-9395-y},
doi = {10.1007/S11083-016-9395-Y},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/JoretMTWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FioriniHJV17,
author = {Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
Antonios Varvitsiotis},
title = {The Excluded Minors for Isometric Realizability in the Plane},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {1},
pages = {438--453},
year = {2017},
url = {https://doi.org/10.1137/16M1064775},
doi = {10.1137/16M1064775},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FioriniHJV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JoretMW17,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Veit Wiechert},
title = {Planar Posets Have Dimension at Most Linear in Their Height},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {4},
pages = {2754--2790},
year = {2017},
url = {https://doi.org/10.1137/17M111300X},
doi = {10.1137/17M111300X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JoretMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/BerbegliaJ17,
author = {Gerardo Berbeglia and
Gwena{\"{e}}l Joret},
editor = {Constantinos Daskalakis and
Moshe Babaioff and
Herv{\'{e}} Moulin},
title = {Assortment Optimisation under a General Discrete Choice Model: {A}
Tight Analysis of Revenue-Ordered Assortments},
booktitle = {Proceedings of the 2017 {ACM} Conference on Economics and Computation,
{EC} '17, Cambridge, MA, USA, June 26-30, 2017},
pages = {345--346},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3033274.3084084},
doi = {10.1145/3033274.3084084},
timestamp = {Mon, 30 Jan 2023 21:01:44 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/BerbegliaJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-05424,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Patrice Ossona de Mendez and
Veit Wiechert},
title = {Nowhere Dense Graph Classes and Dimension},
journal = {CoRR},
volume = {abs/1708.05424},
year = {2017},
url = {http://arxiv.org/abs/1708.05424},
eprinttype = {arXiv},
eprint = {1708.05424},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-05424.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-06282,
author = {Pierre Aboulker and
Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
Jean{-}Florent Raymond and
Ignasi Sau},
title = {A tight Erd{\H{o}}s-P{\'{o}}sa function for wheel minors},
journal = {CoRR},
volume = {abs/1710.06282},
year = {2017},
url = {http://arxiv.org/abs/1710.06282},
eprinttype = {arXiv},
eprint = {1710.06282},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-06282.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/JoretMMTWW16,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Kevin G. Milans and
William T. Trotter and
Bartosz Walczak and
Ruidong Wang},
title = {Tree-width and dimension},
journal = {Comb.},
volume = {36},
number = {4},
pages = {431--450},
year = {2016},
url = {https://doi.org/10.1007/s00493-014-3081-8},
doi = {10.1007/S00493-014-3081-8},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/JoretMMTWW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/DujmovicJKW16,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Jakub Kozik and
David R. Wood},
title = {Nonrepetitive colouring via entropy compression},
journal = {Comb.},
volume = {36},
number = {6},
pages = {661--686},
year = {2016},
url = {https://doi.org/10.1007/s00493-015-3070-6},
doi = {10.1007/S00493-015-3070-6},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/DujmovicJKW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GagolJKM16,
author = {Adam Gagol and
Gwena{\"{e}}l Joret and
Jakub Kozik and
Piotr Micek},
title = {Pathwidth and Nonrepetitive List Coloring},
journal = {Electron. J. Comb.},
volume = {23},
number = {4},
pages = {4},
year = {2016},
url = {https://doi.org/10.37236/5855},
doi = {10.37236/5855},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GagolJKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FioriniJS16,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Oliver Schaudt},
editor = {Quentin Louveaux and
Martin Skutella},
title = {Improved Approximation Algorithms for Hitting 3-Vertex Paths},
booktitle = {Integer Programming and Combinatorial Optimization - 18th International
Conference, {IPCO} 2016, Li{\`{e}}ge, Belgium, June 1-3, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9682},
pages = {238--249},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-33461-5\_20},
doi = {10.1007/978-3-319-33461-5\_20},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/FioriniJS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JoretMW16,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Veit Wiechert},
editor = {Robert Krauthgamer},
title = {Sparsity and dimension},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1804--1813},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch125},
doi = {10.1137/1.9781611974331.CH125},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/JoretMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GagolJKM16,
author = {Adam Gagol and
Gwena{\"{e}}l Joret and
Jakub Kozik and
Piotr Micek},
title = {Pathwidth and nonrepetitive list coloring},
journal = {CoRR},
volume = {abs/1601.01886},
year = {2016},
url = {http://arxiv.org/abs/1601.01886},
eprinttype = {arXiv},
eprint = {1601.01886},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GagolJKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FioriniHJP16,
author = {Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
Kanstantsin Pashkovich},
title = {Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-genus
Graphs},
journal = {CoRR},
volume = {abs/1604.07976},
year = {2016},
url = {http://arxiv.org/abs/1604.07976},
eprinttype = {arXiv},
eprint = {1604.07976},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FioriniHJP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JoretW16,
author = {Gwena{\"{e}}l Joret and
David R. Wood},
title = {{\textdollar}K{\_}\{4\}{\textdollar}-Minor-Free Induced Subgraphs
of Sparse Connected Graphs},
journal = {CoRR},
volume = {abs/1605.04730},
year = {2016},
url = {http://arxiv.org/abs/1605.04730},
eprinttype = {arXiv},
eprint = {1605.04730},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JoretW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerbegliaJ16,
author = {Gerardo Berbeglia and
Gwena{\"{e}}l Joret},
title = {Assortment optimisation under a general discrete choice model: {A}
tight analysis of revenue-ordered assortments},
journal = {CoRR},
volume = {abs/1606.01371},
year = {2016},
url = {http://arxiv.org/abs/1606.01371},
eprinttype = {arXiv},
eprint = {1606.01371},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BerbegliaJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JoretMW16,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Veit Wiechert},
title = {Planar posets have dimension at most linear in their height},
journal = {CoRR},
volume = {abs/1612.07540},
year = {2016},
url = {http://arxiv.org/abs/1612.07540},
eprinttype = {arXiv},
eprint = {1612.07540},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JoretMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CardinalJ15,
author = {Jean Cardinal and
Gwena{\"{e}}l Joret},
title = {Hitting All Maximal Independent Sets of a Bipartite Graph},
journal = {Algorithmica},
volume = {72},
number = {2},
pages = {359--368},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9847-3},
doi = {10.1007/S00453-013-9847-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CardinalJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/JoretV15,
author = {Gwena{\"{e}}l Joret and
Adrian Vetta},
title = {Reducing the rank of a matroid},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {17},
number = {2},
pages = {143--156},
year = {2015},
url = {https://doi.org/10.46298/dmtcs.2135},
doi = {10.46298/DMTCS.2135},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/JoretV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BaratDJPSSVW15,
author = {J{\'{a}}nos Bar{\'{a}}t and
Vida Dujmovic and
Gwena{\"{e}}l Joret and
Michael S. Payne and
Ludmila Scharf and
Daria Schymura and
Pavel Valtr and
David R. Wood},
title = {Empty Pentagons in Point Sets with Collinearities},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {1},
pages = {198--209},
year = {2015},
url = {https://doi.org/10.1137/130950422},
doi = {10.1137/130950422},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BaratDJPSSVW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JoretMW15,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Veit Wiechert},
title = {Sparsity and dimension},
journal = {CoRR},
volume = {abs/1507.01120},
year = {2015},
url = {http://arxiv.org/abs/1507.01120},
eprinttype = {arXiv},
eprint = {1507.01120},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JoretMW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FioriniHJV15,
author = {Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
Antonios Varvitsiotis},
title = {The excluded minors for isometric realizability in the plane},
journal = {CoRR},
volume = {abs/1511.08054},
year = {2015},
url = {http://arxiv.org/abs/1511.08054},
eprinttype = {arXiv},
eprint = {1511.08054},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FioriniHJV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/EsperetJ14,
author = {Louis Esperet and
Gwena{\"{e}}l Joret},
title = {Colouring Planar Graphs With Three Colours and No Large Monochromatic
Components},
journal = {Comb. Probab. Comput.},
volume = {23},
number = {4},
pages = {551--570},
year = {2014},
url = {https://doi.org/10.1017/S0963548314000170},
doi = {10.1017/S0963548314000170},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/EsperetJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ClarkeFJT14,
author = {Nancy E. Clarke and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Dirk Oliver Theis},
title = {A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable
Surfaces},
journal = {Graphs Comb.},
volume = {30},
number = {1},
pages = {119--124},
year = {2014},
url = {https://doi.org/10.1007/s00373-012-1246-z},
doi = {10.1007/S00373-012-1246-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ClarkeFJT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JoretPSST14,
author = {Gwena{\"{e}}l Joret and
Christophe Paul and
Ignasi Sau and
Saket Saurabh and
St{\'{e}}phan Thomass{\'{e}}},
title = {Hitting and Harvesting Pumpkins},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {3},
pages = {1363--1390},
year = {2014},
url = {https://doi.org/10.1137/120883736},
doi = {10.1137/120883736},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JoretPSST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/CardinalFJJM13,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Rapha{\"{e}}l M. Jungers and
J. Ian Munro},
title = {Sorting under partial information (without the ellipsoid algorithm)},
journal = {Comb.},
volume = {33},
number = {6},
pages = {655--697},
year = {2013},
url = {https://doi.org/10.1007/s00493-013-2821-5},
doi = {10.1007/S00493-013-2821-5},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/CardinalFJJM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/DujmovicJFW13,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Fabrizio Frati and
David R. Wood},
title = {Nonrepetitive Colourings of Planar Graphs with O(log n) Colours},
journal = {Electron. J. Comb.},
volume = {20},
number = {1},
pages = {51},
year = {2013},
url = {https://doi.org/10.37236/3153},
doi = {10.37236/3153},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/DujmovicJFW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FioriniJW13,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
David R. Wood},
title = {Excluded Forest Minors and the Erd{\H{o}}s-P{\'{o}}sa Property},
journal = {Comb. Probab. Comput.},
volume = {22},
number = {5},
pages = {700--721},
year = {2013},
url = {https://doi.org/10.1017/S0963548313000266},
doi = {10.1017/S0963548313000266},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/FioriniJW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EsperetJ13,
author = {Louis Esperet and
Gwena{\"{e}}l Joret},
title = {Boxicity of Graphs on Surfaces},
journal = {Graphs Comb.},
volume = {29},
number = {3},
pages = {417--427},
year = {2013},
url = {https://doi.org/10.1007/s00373-012-1130-x},
doi = {10.1007/S00373-012-1130-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/EsperetJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CardinalDFJNW13,
author = {Jean Cardinal and
Erik D. Demaine and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Ilan Newman and
Oren Weimann},
title = {The Stackelberg minimum spanning tree game on planar and bounded-treewidth
graphs},
journal = {J. Comb. Optim.},
volume = {25},
number = {1},
pages = {19--46},
year = {2013},
url = {https://doi.org/10.1007/s10878-011-9414-2},
doi = {10.1007/S10878-011-9414-2},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CardinalDFJNW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JoretW13,
author = {Gwena{\"{e}}l Joret and
David R. Wood},
title = {Complete graph minors and the graph minor structure theorem},
journal = {J. Comb. Theory {B}},
volume = {103},
number = {1},
pages = {61--74},
year = {2013},
url = {https://doi.org/10.1016/j.jctb.2012.09.001},
doi = {10.1016/J.JCTB.2012.09.001},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/JoretW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DujmovicHJRW13,
author = {Vida Dujmovic and
Daniel J. Harvey and
Gwena{\"{e}}l Joret and
Bruce A. Reed and
David R. Wood},
title = {A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense
Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {4},
pages = {1770--1774},
year = {2013},
url = {https://doi.org/10.1137/120866725},
doi = {10.1137/120866725},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DujmovicHJRW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-5271,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Kevin G. Milans and
William T. Trotter and
Bartosz Walczak and
Ruidong Wang},
title = {Tree-Width and Dimension},
journal = {CoRR},
volume = {abs/1301.5271},
year = {2013},
url = {http://arxiv.org/abs/1301.5271},
eprinttype = {arXiv},
eprint = {1301.5271},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-5271.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-2487,
author = {Louis Esperet and
Gwena{\"{e}}l Joret},
title = {Coloring planar graphs with three colors and no large monochromatic
components},
journal = {CoRR},
volume = {abs/1303.2487},
year = {2013},
url = {http://arxiv.org/abs/1303.2487},
eprinttype = {arXiv},
eprint = {1303.2487},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-2487.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/JoretW12,
author = {Gwena{\"{e}}l Joret and
David R. Wood},
title = {Nordhaus-Gaddum for treewidth},
journal = {Eur. J. Comb.},
volume = {33},
number = {4},
pages = {488--490},
year = {2012},
url = {https://doi.org/10.1016/j.ejc.2011.10.005},
doi = {10.1016/J.EJC.2011.10.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/JoretW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FioriniJTW12,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Dirk Oliver Theis and
David R. Wood},
title = {Small minors in dense graphs},
journal = {Eur. J. Comb.},
volume = {33},
number = {6},
pages = {1226--1245},
year = {2012},
url = {https://doi.org/10.1016/j.ejc.2012.02.003},
doi = {10.1016/J.EJC.2012.02.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FioriniJTW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BruyereJM12,
author = {V{\'{e}}ronique Bruy{\`{e}}re and
Gwena{\"{e}}l Joret and
Hadrien M{\'{e}}lot},
title = {Trees with Given Stability Number and Minimum Number of Stable Sets},
journal = {Graphs Comb.},
volume = {28},
number = {2},
pages = {167--187},
year = {2012},
url = {https://doi.org/10.1007/s00373-011-1041-2},
doi = {10.1007/S00373-011-1041-2},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BruyereJM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CardinalFJ12,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret},
title = {Minimum Entropy Combinatorial Optimization Problems},
journal = {Theory Comput. Syst.},
volume = {51},
number = {1},
pages = {4--21},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9371-2},
doi = {10.1007/S00224-011-9371-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CardinalFJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/FioriniJ12,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret},
title = {Approximating the balanced minimum evolution problem},
journal = {Oper. Res. Lett.},
volume = {40},
number = {1},
pages = {31--35},
year = {2012},
url = {https://doi.org/10.1016/j.orl.2011.10.003},
doi = {10.1016/J.ORL.2011.10.003},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/FioriniJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DujmovicJW12,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
David R. Wood},
title = {An Improved Bound for First-Fit on Posets Without Two Long Incomparable
Chains},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {3},
pages = {1068--1075},
year = {2012},
url = {https://doi.org/10.1137/110855806},
doi = {10.1137/110855806},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DujmovicJW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-1569,
author = {Vida Dujmovic and
Fabrizio Frati and
Gwena{\"{e}}l Joret and
David R. Wood},
title = {Nonrepetitive Colourings of Planar Graphs with {\textdollar}O({\textbackslash}log
n){\textdollar} Colours},
journal = {CoRR},
volume = {abs/1202.1569},
year = {2012},
url = {http://arxiv.org/abs/1202.1569},
eprinttype = {arXiv},
eprint = {1202.1569},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-1569.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-2624,
author = {Vida Dujmovic and
Daniel J. Harvey and
Gwena{\"{e}}l Joret and
Bruce A. Reed and
David R. Wood},
title = {A linear-time algorithm for finding a complete graph minor in a dense
graph},
journal = {CoRR},
volume = {abs/1202.2624},
year = {2012},
url = {http://arxiv.org/abs/1202.2624},
eprinttype = {arXiv},
eprint = {1202.2624},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-2624.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-5192,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
David R. Wood},
title = {Excluded Forest Minors and the Erd{\H{o}}s-P{\'{o}}sa Property},
journal = {CoRR},
volume = {abs/1204.5192},
year = {2012},
url = {http://arxiv.org/abs/1204.5192},
eprinttype = {arXiv},
eprint = {1204.5192},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-5192.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-3633,
author = {J{\'{a}}nos Bar{\'{a}}t and
Vida Dujmovic and
Gwena{\"{e}}l Joret and
Michael S. Payne and
Ludmila Scharf and
Daria Schymura and
Pavel Valtr and
David R. Wood},
title = {Empty pentagons in point sets with collinearities},
journal = {CoRR},
volume = {abs/1207.3633},
year = {2012},
url = {http://arxiv.org/abs/1207.3633},
eprinttype = {arXiv},
eprint = {1207.3633},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-3633.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-5589,
author = {Jean Cardinal and
Gwena{\"{e}}l Joret},
title = {Hitting all Maximal Independent Sets of a Bipartite Graph},
journal = {CoRR},
volume = {abs/1208.5589},
year = {2012},
url = {http://arxiv.org/abs/1208.5589},
eprinttype = {arXiv},
eprint = {1208.5589},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-5589.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-4853,
author = {Gwena{\"{e}}l Joret and
Adrian Vetta},
title = {Reducing the rank of a matroid},
journal = {CoRR},
volume = {abs/1211.4853},
year = {2012},
url = {http://arxiv.org/abs/1211.4853},
eprinttype = {arXiv},
eprint = {1211.4853},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-4853.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CardinalDFJLNW11,
author = {Jean Cardinal and
Erik D. Demaine and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Stefan Langerman and
Ilan Newman and
Oren Weimann},
title = {The Stackelberg Minimum Spanning Tree Game},
journal = {Algorithmica},
volume = {59},
number = {2},
pages = {129--144},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9299-y},
doi = {10.1007/S00453-009-9299-Y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CardinalDFJLNW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BaratJW11,
author = {J{\'{a}}nos Bar{\'{a}}t and
Gwena{\"{e}}l Joret and
David R. Wood},
title = {Disproof of the List Hadwiger Conjecture},
journal = {Electron. J. Comb.},
volume = {18},
number = {1},
year = {2011},
url = {https://doi.org/10.37236/719},
doi = {10.37236/719},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BaratJW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/DujmovicFJSW11,
author = {Vida Dujmovic and
Gasper Fijavz and
Gwena{\"{e}}l Joret and
Thom Sulanke and
David R. Wood},
title = {On the maximum number of cliques in a graph embedded in a surface},
journal = {Eur. J. Comb.},
volume = {32},
number = {8},
pages = {1244--1252},
year = {2011},
url = {https://doi.org/10.1016/j.ejc.2011.04.001},
doi = {10.1016/J.EJC.2011.04.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/DujmovicFJSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Joret11,
author = {Gwena{\"{e}}l Joret},
title = {Stackelberg network pricing is hard to approximate},
journal = {Networks},
volume = {57},
number = {2},
pages = {117--120},
year = {2011},
url = {https://doi.org/10.1002/net.20391},
doi = {10.1002/NET.20391},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Joret11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/JoretM11,
author = {Gwena{\"{e}}l Joret and
Kevin G. Milans},
title = {First-Fit is Linear on Posets Excluding Two Long Incomparable Chains},
journal = {Order},
volume = {28},
number = {3},
pages = {455--464},
year = {2011},
url = {https://doi.org/10.1007/s11083-010-9184-y},
doi = {10.1007/S11083-010-9184-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/JoretM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/JoretPSST11,
author = {Gwena{\"{e}}l Joret and
Christophe Paul and
Ignasi Sau and
Saket Saurabh and
St{\'{e}}phan Thomass{\'{e}}},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Hitting and Harvesting Pumpkins},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {394--407},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_34},
doi = {10.1007/978-3-642-23719-5\_34},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/JoretPSST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-1080,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret},
title = {Approximating the Balanced Minimum Evolution Problem},
journal = {CoRR},
volume = {abs/1104.1080},
year = {2011},
url = {http://arxiv.org/abs/1104.1080},
eprinttype = {arXiv},
eprint = {1104.1080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-1080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-2704,
author = {Gwena{\"{e}}l Joret and
Christophe Paul and
Ignasi Sau and
Saket Saurabh and
St{\'{e}}phan Thomass{\'{e}}},
title = {Hitting and Harvesting Pumpkins},
journal = {CoRR},
volume = {abs/1105.2704},
year = {2011},
url = {http://arxiv.org/abs/1105.2704},
eprinttype = {arXiv},
eprint = {1105.2704},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-2704.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-1602,
author = {Gwena{\"{e}}l Joret and
David R. Wood},
title = {Nordhaus-Gaddum for Treewidth},
journal = {CoRR},
volume = {abs/1109.1602},
year = {2011},
url = {http://arxiv.org/abs/1109.1602},
eprinttype = {arXiv},
eprint = {1109.1602},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-1602.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-2272,
author = {J{\'{a}}nos Bar{\'{a}}t and
Gwena{\"{e}}l Joret and
David R. Wood},
title = {Disproof of the List Hadwiger Conjecture},
journal = {CoRR},
volume = {abs/1110.2272},
year = {2011},
url = {http://arxiv.org/abs/1110.2272},
eprinttype = {arXiv},
eprint = {1110.2272},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-2272.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-5524,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
David R. Wood},
title = {Nonrepetitive Colouring via Entropy Compression},
journal = {CoRR},
volume = {abs/1112.5524},
year = {2011},
url = {http://arxiv.org/abs/1112.5524},
eprinttype = {arXiv},
eprint = {1112.5524},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-5524.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cdm/JoretKT10,
author = {Gwena{\"{e}}l Joret and
Marcin Kaminski and
Dirk Oliver Theis},
title = {The Cops and Robber game on graphs with forbidden (induced) subgraphs},
journal = {Contributions Discret. Math.},
volume = {5},
number = {2},
year = {2010},
url = {http://cdm.ucalgary.ca/cdm/index.php/cdm/article/view/154},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cdm/JoretKT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JoretW10,
author = {Gwena{\"{e}}l Joret and
David R. Wood},
title = {Irreducible triangulations are small},
journal = {J. Comb. Theory {B}},
volume = {100},
number = {5},
pages = {446--455},
year = {2010},
url = {https://doi.org/10.1016/j.jctb.2010.01.004},
doi = {10.1016/J.JCTB.2010.01.004},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/JoretW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CardinalFJJM10,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Rapha{\"{e}}l M. Jungers and
J. Ian Munro},
title = {An Efficient Algorithm for Partial Order Production},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {7},
pages = {2927--2940},
year = {2010},
url = {https://doi.org/10.1137/090759860},
doi = {10.1137/090759860},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CardinalFJJM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FioriniJP10,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Ugo Pietropaoli},
editor = {Friedrich Eisenbrand and
F. Bruce Shepherd},
title = {Hitting Diamonds and Growing Cacti},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International
Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6080},
pages = {191--204},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13036-6\_15},
doi = {10.1007/978-3-642-13036-6\_15},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/FioriniJP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CardinalFJJM10,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Rapha{\"{e}}l M. Jungers and
J. Ian Munro},
editor = {Leonard J. Schulman},
title = {Sorting under partial information (without the ellipsoid algorithm)},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {359--368},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806740},
doi = {10.1145/1806689.1806740},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CardinalFJJM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FioriniJTW10,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Dirk Oliver Theis and
David R. Wood},
title = {Small Minors in Dense Graphs},
journal = {CoRR},
volume = {abs/1005.0895},
year = {2010},
url = {http://arxiv.org/abs/1005.0895},
eprinttype = {arXiv},
eprint = {1005.0895},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FioriniJTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-2928,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret},
title = {Minimum Entropy Combinatorial Optimization Problems},
journal = {CoRR},
volume = {abs/1008.2928},
year = {2010},
url = {http://arxiv.org/abs/1008.2928},
eprinttype = {arXiv},
eprint = {1008.2928},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-2928.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/DoignonFJ09,
author = {Jean{-}Paul Doignon and
Samuel Fiorini and
Gwena{\"{e}}l Joret},
title = {Weighted graphs defining facets: {A} connection between stable set
and linear ordering polytopes},
journal = {Discret. Optim.},
volume = {6},
number = {1},
pages = {1--9},
year = {2009},
url = {https://doi.org/10.1016/j.disopt.2008.07.001},
doi = {10.1016/J.DISOPT.2008.07.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/DoignonFJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FioriniJ09,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret},
title = {On a theorem of Sewell and Trotter},
journal = {Eur. J. Comb.},
volume = {30},
number = {2},
pages = {425--428},
year = {2009},
url = {https://doi.org/10.1016/j.ejc.2008.05.002},
doi = {10.1016/J.EJC.2008.05.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FioriniJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/CardinalFJ09,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret},
editor = {Klaus Ambos{-}Spies and
Benedikt L{\"{o}}we and
Wolfgang Merkle},
title = {Minimum Entropy Combinatorial Optimization Problems},
booktitle = {Mathematical Theory and Computational Practice, 5th Conference on
Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5635},
pages = {79--88},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03073-4\_9},
doi = {10.1007/978-3-642-03073-4\_9},
timestamp = {Sun, 02 Jun 2019 21:17:54 +0200},
biburl = {https://dblp.org/rec/conf/cie/CardinalFJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CardinalFJJM09,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Rapha{\"{e}}l M. Jungers and
J. Ian Munro},
editor = {Michael Mitzenmacher},
title = {An efficient algorithm for partial order production},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {93--100},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536430},
doi = {10.1145/1536414.1536430},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CardinalFJJM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/CardinalDFJNW09,
author = {Jean Cardinal and
Erik D. Demaine and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Ilan Newman and
Oren Weimann},
editor = {Stefano Leonardi},
title = {The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth
Graphs},
booktitle = {Internet and Network Economics, 5th International Workshop, {WINE}
2009, Rome, Italy, December 14-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5929},
pages = {125--136},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10841-9\_13},
doi = {10.1007/978-3-642-10841-9\_13},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/wine/CardinalDFJNW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-3221,
author = {Jean Cardinal and
Erik D. Demaine and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Ilan Newman and
Oren Weimann},
title = {The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth
Graphs},
journal = {CoRR},
volume = {abs/0909.3221},
year = {2009},
url = {http://arxiv.org/abs/0909.3221},
eprinttype = {arXiv},
eprint = {0909.3221},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-3221.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-0086,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Rapha{\"{e}}l M. Jungers and
J. Ian Munro},
title = {Sorting under Partial Information (without the Ellipsoid Algorithm)},
journal = {CoRR},
volume = {abs/0911.0086},
year = {2009},
url = {http://arxiv.org/abs/0911.0086},
eprinttype = {arXiv},
eprint = {0911.0086},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0911-0086.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-4366,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Ugo Pietropaoli},
title = {Hitting Diamonds and Growing Cacti},
journal = {CoRR},
volume = {abs/0911.4366},
year = {2009},
url = {http://arxiv.org/abs/0911.4366},
eprinttype = {arXiv},
eprint = {0911.4366},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0911-4366.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CardinalFJ08,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret},
title = {Tight Results on Minimum Entropy Set Cover},
journal = {Algorithmica},
volume = {51},
number = {1},
pages = {49--60},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9076-8},
doi = {10.1007/S00453-007-9076-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CardinalFJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BernathJ08,
author = {Attila Bern{\'{a}}th and
Gwena{\"{e}}l Joret},
title = {Well-balanced orientations of mixed graphs},
journal = {Inf. Process. Lett.},
volume = {106},
number = {4},
pages = {149--151},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2007.10.014},
doi = {10.1016/J.IPL.2007.10.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BernathJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CardinalFJ08,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret},
title = {Minimum entropy coloring},
journal = {J. Comb. Optim.},
volume = {16},
number = {4},
pages = {361--377},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9152-2},
doi = {10.1007/S10878-008-9152-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CardinalFJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BougardJ08,
author = {Nicolas Bougard and
Gwena{\"{e}}l Joret},
title = {Tur{\'{a}}n's theorem and \emph{k}-connected graphs},
journal = {J. Graph Theory},
volume = {58},
number = {1},
pages = {1--13},
year = {2008},
url = {https://doi.org/10.1002/jgt.20289},
doi = {10.1002/JGT.20289},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BougardJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CardinalFJ08,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret},
title = {Minimum entropy orientations},
journal = {Oper. Res. Lett.},
volume = {36},
number = {6},
pages = {680--683},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2008.06.010},
doi = {10.1016/J.ORL.2008.06.010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CardinalFJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-1237,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret},
title = {Minimum Entropy Orientations},
journal = {CoRR},
volume = {abs/0802.1237},
year = {2008},
url = {http://arxiv.org/abs/0802.1237},
eprinttype = {arXiv},
eprint = {0802.1237},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-1237.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-2572,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Rapha{\"{e}}l M. Jungers and
J. Ian Munro},
title = {An Efficient Algorithm for Partial Order Production},
journal = {CoRR},
volume = {abs/0811.2572},
year = {2008},
url = {http://arxiv.org/abs/0811.2572},
eprinttype = {arXiv},
eprint = {0811.2572},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-2572.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-0320,
author = {Gwena{\"{e}}l Joret},
title = {Stackelberg Network Pricing is Hard to Approximate},
journal = {CoRR},
volume = {abs/0812.0320},
year = {2008},
url = {http://arxiv.org/abs/0812.0320},
eprinttype = {arXiv},
eprint = {0812.0320},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-0320.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/CardinalDFJLNW07,
author = {Jean Cardinal and
Erik D. Demaine and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Stefan Langerman and
Ilan Newman and
Oren Weimann},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Norbert Zeh},
title = {The Stackelberg Minimum Spanning Tree Game},
booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS}
2007, Halifax, Canada, August 15-17, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4619},
pages = {64--76},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7\_7},
doi = {10.1007/978-3-540-73951-7\_7},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/CardinalDFJLNW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0703019,
author = {Jean Cardinal and
Erik D. Demaine and
Samuel Fiorini and
Gwena{\"{e}}l Joret and
Stefan Langerman and
Ilan Newman and
Oren Weimann},
title = {The Stackelberg Minimum Spanning Tree Game},
journal = {CoRR},
volume = {abs/cs/0703019},
year = {2007},
url = {http://arxiv.org/abs/cs/0703019},
eprinttype = {arXiv},
eprint = {cs/0703019},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0703019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CardinalFJ06,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {Tight Results on Minimum Entropy Set Cover},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {61--69},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_8},
doi = {10.1007/11830924\_8},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/CardinalFJ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DoignonFJ05,
author = {Jean{-}Paul Doignon and
Samuel Fiorini and
Gwena{\"{e}}l Joret},
title = {On a weighted generalization of alpha-critical graphs},
journal = {Electron. Notes Discret. Math.},
volume = {22},
pages = {401--404},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.06.069},
doi = {10.1016/J.ENDM.2005.06.069},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/DoignonFJ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CardinalFJ05,
author = {Jean Cardinal and
Samuel Fiorini and
Gwena{\"{e}}l Joret},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {Minimum Entropy Coloring},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {819--828},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_82},
doi = {10.1007/11602613\_82},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/CardinalFJ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-08-25 20:08 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:
