1. Spyros
Angelopoulos
.
Online search with a hint
. In James R. Lee editor 12th Innovations in Theoretical Computer Science Conference ITCS
2021 January 6--8 2021 Virtual Conference volume
185
of
LIPIcs pages 51:1{51:
16
. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2021. Spyros Angelopoulos. Online search with a hint. In James R. Lee editor 12th Innovations in Theoretical Computer Science Conference ITCS 2021 January 6--8 2021 Virtual Conference volume 185 of LIPIcs pages 51:1{51:16. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2021.
2. Antonios
Antoniadis Matthias
Englert Nicolaos
Matsakis and
Pavel
Vesel--y.
Breaking the barrier of 2 for the competitiveness of Longest Queue Drop
. In Nikhil Bansal Emanuela Merelli and James Worrell editors 48th International Colloquium on Automata Languages and Programming ICALP
2021 July 12--16 2021 Glasgow Scotland (Virtual Conference) volume
198
of
LIPIcs pages 17:1{17:
20
. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2021. Antonios Antoniadis Matthias Englert Nicolaos Matsakis and Pavel Vesel--y. Breaking the barrier of 2 for the competitiveness of Longest Queue Drop. In Nikhil Bansal Emanuela Merelli and James Worrell editors 48th International Colloquium on Automata Languages and Programming ICALP 2021 July 12--16 2021 Glasgow Scotland (Virtual Conference) volume 198 of LIPIcs pages 17:1{17:20. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2021.
3. Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders