default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulien Duron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Édouard Bonnet
, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SIAM J. Comput. 53(5): 1578-1601 (2024)- [j1]Édouard Bonnet, Dibyayan Chakraborty, Julien Duron:
Cutting Barnette graphs perfectly is hard. Theor. Comput. Sci. 1010: 114701 (2024) - [c7]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Tight Bounds on Adjacency Labels for Monotone Graph Classes. ICALP 2024: 31:1-31:20 - [c6]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev:
Symmetric-Difference (Degeneracy) and Signed Tree Models. MFCS 2024: 32:1-32:16 - [c5]Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SODA 2024: 1147-1165 - [i8]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev:
Symmetric-Difference (Degeneracy) and Signed Tree Models. CoRR abs/2405.09011 (2024) - [i7]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev:
Adjacency Labeling Schemes for Small Classes. CoRR abs/2409.04821 (2024) - 2023
- [c4]Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek:
Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄. ESA 2023: 23:1-23:15 - [c3]Édouard Bonnet, Julien Duron:
Stretch-Width. IPEC 2023: 8:1-8:15 - [c2]Édouard Bonnet, Julien Duron:
PACE Solver Description: RedAlert - Heuristic Track. IPEC 2023: 40:1-40:5 - [c1]Édouard Bonnet, Dibyayan Chakraborty, Julien Duron:
Cutting Barnette Graphs Perfectly is Hard. WG 2023: 116-129 - [i6]Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek:
Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4. CoRR abs/2302.08182 (2023) - [i5]Édouard Bonnet, Dibyayan Chakraborty, Julien Duron:
Cutting Barnette graphs perfectly is hard. CoRR abs/2302.11667 (2023) - [i4]Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud:
On the minimum number of inversions to make a digraph k-(arc-)strong. CoRR abs/2303.11719 (2023) - [i3]Édouard Bonnet, Julien Duron:
Stretch-width. CoRR abs/2305.12023 (2023) - [i2]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Small But Unwieldy. CoRR abs/2307.11225 (2023) - [i1]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Tight bounds on adjacency labels for monotone graph classes. CoRR abs/2310.20522 (2023)
Coauthor Index
aka: Edouard Bonnet
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-11-07 21:32 CET 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:
