| Faster algorithms for k-subset sum and variations A Antonopoulos, A Pagourtzis, S Petsalakis, M Vasilakis Journal of Combinatorial Optimization 45 (1), 24, 2023 | 11 | 2023 |
| Structural parameterizations for two bounded degree problems revisited M Lampis, M Vasilakis ACM Transactions on Computation Theory, 2023 | 9 | 2023 |
| Parameterized max min feedback vertex set M Lampis, N Melissinos, M Vasilakis arXiv preprint arXiv:2302.09604, 2023 | 7 | 2023 |
| Approximating subset sum ratio via subset sum computations G Alonistiotis, A Antonopoulos, N Melissinos, A Pagourtzis, S Petsalakis, ... International Workshop on Combinatorial Algorithms, 73-85, 2022 | 5 | 2022 |
| Parameterized Vertex Integrity Revisited T Hanaka, M Lampis, M Vasilakis, K Yoshiwatari arXiv preprint arXiv:2402.09971, 2024 | 2 | 2024 |
| Bandwidth parameterized by cluster vertex deletion number T Gima, EJ Kim, N Köhler, N Melissinos, M Vasilakis arXiv preprint arXiv:2309.17204, 2023 | 1 | 2023 |
| Approximating subset sum ratio via partition computations G Alonistiotis, A Antonopoulos, N Melissinos, A Pagourtzis, S Petsalakis, ... Acta Informatica 61 (2), 101-113, 2024 | | 2024 |
| Parameterized Maximum Node-Disjoint Paths M Lampis, M Vasilakis arXiv preprint arXiv:2404.14849, 2024 | | 2024 |
Michael LampisLAMSADE, Université Paris DauphineVerified email at dauphine.fr
