E-LIB Suche - Ergebnisse für: Paschos, Vangelis Th - Sprache EN

Search for persons X

Sorted by: Year

Sorted by: Relevance

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

In memory of Jérôme Monnot:

Escoffier, Bruno ; Gourvès, Laurent ; Paschos, Vangelis
Theoretical Computer Science. 921 (2022) - p. 1-3 , 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

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/..

6

Structurally parameterized d -scattered set:

Katsikarelis, Ioannis ; Lampis, Michael ; Paschos, Vangelis Th
info:eu-repo/semantics/altIdentifier/arxiv/1709.02180. , 2022

Link: https://hal.science/hal-..

7

Structurally parameterized d -scattered set:

Katsikarelis, Ioannis ; Lampis, Michael ; Paschos, Vangelis Th
info:eu-repo/semantics/altIdentifier/arxiv/1709.02180. , 2022

Link: https://hal.science/hal-..

8

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/..

9

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..

10

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..

11

The Maximum Duo-Preservation String Mapping Problem with Bo..:

Boria, Nicolas ; Paschos, Vangelis Th
doi:10.4230/LIPIcs.WABI.2021.5. , 2021

Link: https://doi.org/10.4230/..

12

Improved (In-)Approximability Bounds for d-Scattered Set:

, In: Approximation and Online Algorithms; Lecture Notes in Computer Science,

Katsikarelis, Ioannis ; Lampis, Michael ; Paschos, Vangelis Th. - p. 202-216 , 2020

Link: https://doi.org/10.1007/..

13

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/..

14

Preface to Special Issue on Algorithms and Complexity:

Fotakis, Dimitris ; Pagourtzis, Aris ; Paschos, Vangelis
Theoretical Computer Science. 754 (2019) - p. 1-2 , 2019

Link: https://doi.org/10.1016/..

15

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/..

1-15