Author

Peter Kiss

1 paper 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.

Conference Jul 2026

Online Preemptive Matching Revisited

This result is the first result which shows hardness for instances where the optimal algorithm employs preemption, and improves upon the strongest previously known upper bound of $2-\sqrt{2} \approx 0.585$.

Péter Kiss, Mohammad Sharifi · International Colloquium on... · 1 citation