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
Paschos, Vangelis Th
93
results:
Articles (Online) X
Search for persons
X
Languages
english (90)
french (1)
Sorted by: Relevance
Sorted by: Year
?
1
Average-case complexity of a branch-and-bound algorithm for..:
Denat, Tom
;
Harutyunyan, Ararat
;
Melissinos, Nikolaos
.
Discrete Applied Mathematics. 345 (2024) - p. 4-8 , 2024
Link:
https://doi.org/10.1016/..
?
2
Improved (In-)Approximability Bounds for d-Scattered Set:
Katsikarelis, Ioannis
;
Lampis, Michael
;
Paschos, Vangelis Th.
Journal of Graph Algorithms and Applications. 27 (2023) 3 - p. 219-238 , 2023
Link:
https://doi.org/10.7155/..
?
3
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/..
?
4
Structurally parameterized d-scattered set:
Katsikarelis, Ioannis
;
Lampis, Michael
;
Paschos, Vangelis Th.
Discrete Applied Mathematics. 308 (2022) - p. 168-186 , 2022
Link:
https://doi.org/10.1016/..
?
5
Structural parameters, tight bounds, and approximation for ..:
Katsikarelis, Ioannis
;
Lampis, Michael
;
Paschos, Vangelis Th.
Discrete Applied Mathematics. 264 (2019) - p. 90-117 , 2019
Link:
https://doi.org/10.1016/..
?
6
The probabilistic minimum dominating set problem:
Boria, Nicolas
;
Murat, Cécile
;
Paschos, Vangelis Th.
Discrete Applied Mathematics. 234 (2018) - p. 93-113 , 2018
Link:
https://doi.org/10.1016/..
?
7
Time-approximation trade-offs for inapproximable problems:
Bonnet, Édouard
;
Lampis, Michael
;
Paschos, Vangelis Th.
Journal of Computer and System Sciences. 92 (2018) - p. 171-180 , 2018
Link:
https://doi.org/10.1016/..
?
8
Purely combinatorial approximation algorithms for maximum k..:
Bonnet, Édouard
;
Escoffier, Bruno
;
Paschos, Vangelis Th.
.
Discrete Optimization. 27 (2018) - p. 26-56 , 2018
Link:
https://doi.org/10.1016/..
?
9
When polynomial approximation meets exact computation:
Paschos, Vangelis Th.
Annals of Operations Research. 271 (2018) 1 - p. 87-103 , 2018
Link:
https://doi.org/10.1007/..
?
10
The many facets of upper domination:
Bazgan, Cristina
;
Brankovic, Ljiljana
;
Casel, Katrin
...
Theoretical Computer Science. 717 (2018) - p. 2-25 , 2018
Link:
https://doi.org/10.1016/..
?
11
Exact and superpolynomial approximation algorithms for the ..:
Bourgeois, Nicolas
;
Giannakos, Aristotelis
;
Lucarelli, Giorgio
..
European Journal of Operational Research. 262 (2017) 3 - p. 894-903 , 2017
Link:
https://doi.org/10.1016/..
?
12
Sparsification and subexponential approximation:
Bonnet, Édouard
;
Paschos, Vangelis Th.
Acta Informatica. 55 (2016) 1 - p. 1-15 , 2016
Link:
https://doi.org/10.1007/..
?
13
On the max min vertex cover problem:
Boria, Nicolas
;
Della Croce, Federico
;
Paschos, Vangelis Th.
Discrete Applied Mathematics. 196 (2015) - p. 62-71 , 2015
Link:
https://doi.org/10.1016/..
?
14
When polynomial approximation meets exact computation:
Paschos, Vangelis Th.
4OR. 13 (2015) 3 - p. 227-245 , 2015
Link:
https://doi.org/10.1007/..
?
15
New Results on Polynomial Inapproximabilityand Fixed Parame..:
Escoffier, Bruno
;
Monnot, Jérôme
;
Paschos, Vangelis Th.
.
Theory of Computing Systems. 56 (2014) 2 - p. 330-346 , 2014
Link:
https://doi.org/10.1007/..
1-15