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
Dublois, Louis
12
results:
Search for persons
X
Format
Online (12)
Mediatypes
Articles (Online) (2)
Bookchapter (Online) (1)
OpenAccess-fulltext (9)
Sorted by: Relevance
Sorted by: Year
?
1
Upper Dominating Set: Tight algorithms for pathwidth and su..:
Dublois, Louis
;
Lampis, Michael
;
Paschos, Vangelis Th.
Theoretical Computer Science. 923 (2022) - p. 271-291 , 2022
Link:
https://doi.org/10.1016/..
?
2
(In)approximability of maximum minimal FVS:
Dublois, Louis
;
Hanaka, Tesshu
;
Khosravian Ghadikolaei, Mehdi
..
Journal of Computer and System Sciences. 124 (2022) - p. 26-40 , 2022
Link:
https://doi.org/10.1016/..
?
3
Upper Dominating Set: Tight Algorithms for Pathwidth and Su..:
, In:
Lecture Notes in Computer Science; Algorithms and Complexity
,
Dublois, Louis
;
Lampis, Michael
;
Paschos, Vangelis Th.
- p. 202-215 , 2021
Link:
https://doi.org/10.1007/..
?
4
Algorithms and Intractability of Some NP-hard Domination Pr..:
Dublois, Louis
NNT: 2021UPSLD014. , 2021
Link:
https://theses.hal.scien..
?
5
Upper Dominating Set: Tight Algorithms for Pathwidth and Su..:
Dublois, Louis
;
Lampis, Michael
;
Paschos, Vangelis Th
http://arxiv.org/abs/2101.07550. , 2021
Link:
http://arxiv.org/abs/210..
?
6
Algorithms and Intractability of Some NP-hard Domination Pr..:
Dublois, Louis
NNT: 2021UPSLD014. , 2021
Link:
https://theses.hal.scien..
?
7
Algorithmes et Intractabilité de Certains Problèmes de Domi..:
Dublois, Louis
http://www.theses.fr/2021UPSLD014/document. , 2021
Link:
http://www.theses.fr/202..
?
8
(In)approximability of Maximum Minimal FVS:
Dublois, Louis
;
Hanaka, Tesshu
;
Ghadikolaei, Mehdi Khosravian
..
http://arxiv.org/abs/2009.09971. , 2020
Link:
http://arxiv.org/abs/200..
?
9
(In)approximability of Maximum Minimal FVS:
Dublois, Louis
;
Hanaka, Tesshu
;
Khosravian Ghadikolaei, Mehdi
..
doi:10.4230/LIPIcs.ISAAC.2020.3. , 2020
Link:
https://doi.org/10.4230/..
?
10
New Algorithms for Mixed Dominating Set:
Dublois, Louis
;
Lampis, Michael
;
Paschos, Vangelis Th
doi:10.4230/LIPIcs.IPEC.2020.9. , 2020
Link:
https://doi.org/10.4230/..
?
11
New Algorithms for Mixed Dominating Set:
Dublois, Louis
;
Lampis, Michael
;
Paschos, Vangelis Th
http://arxiv.org/abs/1911.08964. , 2019
Link:
http://arxiv.org/abs/191..
?
12
New Algorithms for Mixed Dominating Set:
Louis Dublois
;
Michael Lampis
;
Vangelis Th. Paschos
https://dmtcs.episciences.org/6824/pdf. , 2021
Link:
https://doi.org/10.46298..
1-12