Kleitos Papadopoulos

12 papers B 2Journal 10
YearRankTypeTitle / Venue / Authors
2026 J jnl
An 𝒪(log N) Time Algorithm for the Generalized Egg Dropping Problem.
CoRR
Kleitos Papadopoulos
2025 J jnl
An O(n\log n) Algorithm for Single-Item Capacitated Lot Sizing with a One-Breakpoint All-Units Discount and Non-Increasing Prices.
CoRR
Kleitos Papadopoulos
2024 J jnl
A Novel exact algorithm for economic lot-sizing with piecewise linear production costs.
CoRR
Kleitos Papadopoulos
2024 J jnl
A faster algorithm for the construction of optimal factoring automata.
CoRR
Thomas Erlebach, Kleitos Papadopoulos
2021 J jnl
On the fast delivery problem with one or two packages.
J. Comput. Syst. Sci.
Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos
2019 B conf
An Efficient Algorithm for the Fast Delivery Problem.
FCT
Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos
2019 J jnl
An Efficient Algorithm for the Fast Delivery Problem.
CoRR
Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos
2018 B conf
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners.
ISAAC
Davide Bilò, Kleitos Papadopoulos
2018 J jnl
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners.
CoRR
Davide Bilò, Kleitos Papadopoulos
2018 J jnl
A fast algorithm for the gas station problem.
Inf. Process. Lett.
Kleitos Papadopoulos, Demetres Christofides
2018 J jnl
An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs.
CoRR
Davide Bilò, Kleitos Papadopoulos
2017 J jnl
A fast algorithm for the gas station problem.
CoRR
Kleitos Papadopoulos, Demetres Christofides