I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Bonnet, Edouard
75
results:
Articles (Online) X
Search for persons
X
Languages
english (68)
french (5)
Sorted by: Relevance
Sorted by: Year
?
1
Sparse graphs with bounded induced cycle packing number hav..:
Bonamy, Marthe
;
Bonnet, Édouard
;
Déprés, Hugues
...
Journal of Combinatorial Theory, Series B. 167 (2024) - p. 215-249 , 2024
Link:
https://doi.org/10.1016/..
?
2
Cutting Barnette graphs perfectly is hard:
Bonnet, Édouard
;
Chakraborty, Dibyayan
;
Duron, Julien
Theoretical Computer Science. 1010 (2024) - p. 114701 , 2024
Link:
https://doi.org/10.1016/..
?
3
Twin-Width IV: Ordered Graphs and Matrices:
Bonnet, Édouard
;
Giocanti, Ugo
;
de Mendez, Patrice Ossona
...
Journal of the ACM. 71 (2024) 3 - p. 1-45 , 2024
Link:
https://doi.org/10.1145/..
?
4
Neighbourhood complexity of graphs of bounded twin-width:
Bonnet, Édouard
;
Foucaud, Florent
;
Lehtilä, Tuomo
.
European Journal of Combinatorics. 115 (2024) - p. 103772 , 2024
Link:
https://doi.org/10.1016/..
?
5
Maximum Matchings in Geometric Intersection Graphs:
Bonnet, Édouard
;
Cabello, Sergio
;
Mulzer, Wolfgang
Discrete & Computational Geometry. 70 (2023) 3 - p. 550-579 , 2023
Link:
https://doi.org/10.1007/..
?
6
Twin-width can be exponential in treewidth:
Bonnet, Édouard
;
Déprés, Hugues
Journal of Combinatorial Theory, Series B. 161 (2023) - p. 1-14 , 2023
Link:
https://doi.org/10.1016/..
?
7
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard a..:
Bonnet, Édouard
ACM Transactions on Algorithms. 18 (2022) 2 - p. 1-14 , 2022
Link:
https://doi.org/10.1145/..
?
8
Grundy Coloring and Friends, Half-Graphs, Bicliques:
Aboulker, Pierre
;
Bonnet, Édouard
;
Kim, Eun Jung
.
Algorithmica. 85 (2022) 1 - p. 1-28 , 2022
Link:
https://doi.org/10.1007/..
?
9
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard a..:
Bonnet, Édouard
ACM Transactions on Algorithms (TALG). 18 (2022) 2 - p. 1-14 , 2022
Link:
https://dl.acm.org/doi/1..
?
10
Twin-width and Polynomial Kernels:
Bonnet, Édouard
;
Kim, Eun Jung
;
Reinald, Amadeus
..
Algorithmica. 84 (2022) 11 - p. 3300-3337 , 2022
Link:
https://doi.org/10.1007/..
?
11
Metric Dimension Parameterized By Treewidth:
Bonnet, Édouard
;
Purohit, Nidhi
Algorithmica. 83 (2021) 8 - p. 2606-2633 , 2021
Link:
https://doi.org/10.1007/..
?
12
EPTAS and Subexponential Algorithm for Maximum Clique on Di..:
Bonamy, Marthe
;
Bonnet, Édouard
;
Bousquet, Nicolas
...
Journal of the ACM (JACM). 68 (2021) 2 - p. 1-38 , 2021
Link:
https://dl.acm.org/doi/1..
?
13
Twin-width I: Tractable FO Model Checking:
Bonnet, Édouard
;
Kim, Eun Jung
;
Thomassé, Stéphan
.
Journal of the ACM. 69 (2021) 1 - p. 1-46 , 2021
Link:
https://doi.org/10.1145/..
?
14
The complexity of mixed-connectivity:
Bonnet, Édouard
;
Cabello, Sergio
Annals of Operations Research. 307 (2021) 1-2 - p. 25-35 , 2021
Link:
https://doi.org/10.1007/..
?
15
Parameterized Intractability of Even Set and Shortest Vecto..:
Bhattacharyya, Arnab
;
Bonnet, Édouard
;
Egri, László
...
Journal of the ACM. 68 (2021) 3 - p. 1-40 , 2021
Link:
https://doi.org/10.1145/..
1-15