Author

Charalampos Platanos

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities

We study prophet inequalities under intersections of $q$ partition matroids, where an online algorithm irrevocably selects elements with independent nonnegative values drawn from known distributions and revealed in an adversarial order. We prove an $\Omega(q/\log q)$ lower bound on the competitive ratio. Together with...

Dimitris Fotakis, Charalampos Platanos, Thanos Tolias · 0 citations

Jul 2026

Online Sorting with Our Eyes Wide Shut

This work studies Random-Order Online Sorting, a model interpolating between the adversarial and stochastic settings, that was posed as a challenging open question by Hermansen (ESA'26), and proves an O(\log^2 n)-competitive algorithm with high probability, matching the state-of-the-art high probability guarantee for t...

Charalampos Platanos, Thanos Tolias · arXiv.org · 0 citations