Manolis Vasilakis

Open to Postdoc opportunities (Fall 2026)

I'm seeking a postdoctoral position in Theoretical CS (parameterized & fine-grained complexity, approximation algorithms). Earlier start dates are welcome.

Email me about a Postdoc

I am a PhD student in Theoretical Computer Science at LAMSADE, Université Paris Dauphine - PSL, fortunate to be supervised by Michael Lampis. Previously, I studied at the School of Electrical and Computer Engineering, National Technical University of Athens.

Favorite research topics include:

Parameterized Algorithms
Fine-grained Complexity
Approximation Algorithms
Combinatorial Optimization

Publications

Preprints

Exact Algorithms for Distance to Unique Vertex Cover, with Foivos Fioravantes, Dušan Knop, Nikolaos Melissinos, and Michal Opler. 2025
Parameterized Critical Node Cut Revisited, with Dušan Knop and Nikolaos Melissinos. 2025

Conferences

Structural Parameters for Steiner Orientation, with Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, and Hirotaka Ono. To appear in ISAAC 2025
Parameterized Maximum Node-Disjoint Paths, with Michael Lampis. To appear in IPEC 2025
Structural Parameterizations for Induced and Acyclic Matching, with Michael Lampis. To appear in WG 2025 (Best Student Paper Award)
Parameterized Spanning Tree Congestion, with Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, and Daniel Vaz. MFCS 2025
Broadcasting Under Structural Restrictions, with Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, and Daniel Vaz. MFCS 2025
Parameterized Vertex Integrity Revisited, with Tesshu Hanaka, Michael Lampis, and Kanae Yoshiwatari. MFCS 2024
Bandwidth Parameterized by Cluster Vertex Deletion Number, with Tatsuya Gima, Eun Jung Kim, Noleen Köhler, and Nikolaos Melissinos. IPEC 2023
Structural Parameterizations for Two Bounded Degree Problems Revisited, with Michael Lampis. ESA 2023
Parameterized Max Min Feedback Vertex Set, with Michael Lampis and Nikolaos Melissinos. MFCS 2023
Approximating Subset Sum Ratio via Subset Sum Computations, with Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, and Stavros Petsalakis. IWOCA 2022
Faster Algorithms for k-Subset Sum and Variations, with Antonis Antonopoulos, Aris Pagourtzis, and Stavros Petsalakis. IJTCS-FAW 2021

Journals

Parameterized Max Min Feedback Vertex Set, with Michael Lampis and Nikolaos Melissinos. SIAM Journal on Discrete Mathematics, 2025
Bandwidth Parameterized by Cluster Vertex Deletion Number, with Tatsuya Gima, Eun Jung Kim, Noleen Köhler, and Nikolaos Melissinos. Algorithmica, 2025
Structural Parameterizations for Two Bounded Degree Problems Revisited, with Michael Lampis. ACM Transactions on Computation Theory, 2024
Approximating Subset Sum Ratio via Partition Computations, with Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, and Stavros Petsalakis. Acta Informatica, 2024
Faster Algorithms for k-Subset Sum and Variations, with Antonis Antonopoulos, Aris Pagourtzis, and Stavros Petsalakis. Journal of Combinatorial Optimization, 2023