Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGwenaël Joret
- > Home > Persons > Gwenaël Joret
Publications
- 2024
[j73]Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Comb. 44(2): 417-427 (2024)- [j72]Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
:
The Excluded Tree Minor Theorem Revisited. Comb. Probab. Comput. 33(1): 85-90 (2024) - [c20]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The Grid-Minor Theorem Revisited. SODA 2024: 1241-1245 - [c19]Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak:
Cliquewidth and Dimension. SODA 2024: 1437-1446 - [i64]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin:
Tight bound for the Erdős-Pósa property of tree minors. CoRR abs/2403.06370 (2024) - 2023
- [j70]Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs Circumference. Comb. 43(4): 659-664 (2023) - [i62]Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight bound on treedepth in terms of pathwidth and longest path. CoRR abs/2302.02995 (2023) - [i60]Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. CoRR abs/2303.14970 (2023) - [i58]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The grid-minor theorem revisited. CoRR abs/2307.02816 (2023) - [i57]Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak:
Cliquewidth and dimension. CoRR abs/2308.11950 (2023) - 2022
- [j67]Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan:
Excluding a Ladder. Comb. 42(3): 405-432 (2022) - [j66]Gwenaël Joret, Piotr Micek:
Improved Bounds for Weak Coloring Numbers. Electron. J. Comb. 29(1) (2022) - [i56]Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs circumference. CoRR abs/2211.11410 (2022) - 2021
- [j63]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid:
Tight Bounds on the Clique Chromatic Number. Electron. J. Comb. 28(3) (2021) - [j60]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). J. ACM 68(6): 42:1-42:33 (2021) - 2020
- [j58]Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood:
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. Comb. 40(6): 839-868 (2020) - [j55]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs Have Bounded Queue-Number. J. ACM 67(4): 22:1-22:38 (2020) - [c16]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). FOCS 2020: 577-588 - [i50]Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan:
Excluding a ladder. CoRR abs/2002.00496 (2020) - [i49]Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). CoRR abs/2003.04280 (2020) - [i46]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid:
Tight Bounds on The Clique Chromatic Number. CoRR abs/2006.11353 (2020) - 2019
- [j50]Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert:
Nowhere Dense Graph Classes and Dimension. Comb. 39(5): 1055-1079 (2019) - [c14]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. FOCS 2019: 862-875 - [i41]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. CoRR abs/1904.04791 (2019) - 2018
- [j49]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Sparsity and Dimension. Comb. 38(5): 1129-1148 (2018) - [j48]Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert:
Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions. Electron. J. Comb. 25(1): 1 (2018) - [i36]Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood:
Seymour's conjecture on 2-connected graphs of large pathwidth. CoRR abs/1801.01833 (2018) - 2017
- [j42]Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert:
Burling graphs, chromatic number, and orthogonal tree-decompositions. Electron. Notes Discret. Math. 61: 415-420 (2017) - [j41]Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert:
On the Dimension of Posets with Cover Graphs of Treewidth 2. Order 34(2): 185-234 (2017) - [j39]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Planar Posets Have Dimension at Most Linear in Their Height. SIAM J. Discret. Math. 31(4): 2754-2790 (2017) - [i31]Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert:
Nowhere Dense Graph Classes and Dimension. CoRR abs/1708.05424 (2017) - 2016
- [j38]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Tree-width and dimension. Comb. 36(4): 431-450 (2016) - [j36]Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek:
Pathwidth and Nonrepetitive List Coloring. Electron. J. Comb. 23(4): 4 (2016) - [c10]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Sparsity and dimension. SODA 2016: 1804-1813 - [i29]Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek:
Pathwidth and nonrepetitive list coloring. CoRR abs/1601.01886 (2016) - [i25]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Planar posets have dimension at most linear in their height. CoRR abs/1612.07540 (2016) - 2015
- [i24]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Sparsity and dimension. CoRR abs/1507.01120 (2015) - 2013
- [i22]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Tree-Width and Dimension. CoRR abs/1301.5271 (2013)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:19 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:
