| An efficient algorithm for the fast delivery problem IA Carvalho, T Erlebach, K Papadopoulos International Symposium on Fundamentals of Computation Theory, 171-184, 2019 | 8 | 2019 |
| On the fast delivery problem with one or two packages IA Carvalho, T Erlebach, K Papadopoulos Journal of Computer and System Sciences 115, 246-263, 2021 | 5 | 2021 |
| A fast algorithm for the gas station problem K Papadopoulos, D Christofides Information Processing Letters 131, 55-59, 2018 | 5 | 2018 |
| A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners D Bilò, K Papadopoulos arXiv preprint arXiv:1807.01260, 2018 | 4 | 2018 |
| A faster algorithm for the construction of optimal factoring automata T Erlebach, K Papadopoulos arXiv preprint arXiv:2404.02354, 2024 | | 2024 |
| A Novel exact algorithm for economic lot-sizing with piecewise linear production costs K Papadopoulos arXiv preprint arXiv:2403.16314, 2024 | | 2024 |
| Efficient algorithms for certain graph theoretic problems K Papadopoulos University of Leicester, 2024 | | 2024 |
| A Tight Bound on the Size of a Smallest Critical Set for Each Failed Edge in a Tree Spanner T Erlebach, K Papadopoulos Available at SSRN 4478139, 2022 | | 2022 |
| An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs D Bilò, K Papadopoulos arXiv preprint arXiv:1807.03331, 2018 | | 2018 |
| An Efficient Algorithm for the Fast Delivery Problem K Papadopoulos | | |
