| Complexity of Finding Maximum Locally Irregular Induced Subgraphs 1 F Fioravantes, N Melissinos, T Triommatis Available at SSRN 4350904, 2022 | 4 | 2022 |
| Approximation schemes for subset sum ratio problems N Melissinos, A Pagourtzis, T Triommatis International Workshop on Frontiers in Algorithmics, 96-107, 2020 | 4 | 2020 |
| Approximate# knapsack computations to count semi-fair allocations T Triommatis, A Pagourtzis Theory and Applications of Models of Computation: 16th International …, 2020 | 2 | 2020 |
| A geometric approach to passive localisation T Triommatis, I Potapov, G Rees, JF Ralph 2022 25th International Conference on Information Fusion (FUSION), 1-8, 2022 | 1 | 2022 |
| The Maximum Cover with Rotating Field of View I Potapov, J Ralph, T Triommatis arXiv preprint arXiv:2309.15573, 2023 | | 2023 |
| Parameterised distance to local irregularity F Fioravantes, N Melissinos, T Triommatis arXiv preprint arXiv:2307.04583, 2023 | | 2023 |
| Μελέτη της permanent,# P-Complete προβλημάτων και προσεγγιστικοί αλγόριθμοι αυτών Θ Τριομμάτης | | 2019 |
Nikolaos MelissinosVerified email at dauphine.eu
