| 2026 | STACS | The Communication Complexity of Combinatorial Auctions in Graphs. | George Christodoulou, Elias Koutsoupias, Annamria Kovcs, Ioannis Vlachos |
| 2023 | STOC | A Proof of the Nisan-Ronen Conjecture. | George Christodoulou, Elias Koutsoupias, Annamria Kovcs |
| 2021 | FOCS | On the Nisan-Ronen conjecture. | George Christodoulou, Elias Koutsoupias, Annamria Kovcs |
| 2021 | ICALP | Truthful Allocation in Graphs and Hypergraphs. | George Christodoulou, Elias Koutsoupias, Annamria Kovcs |
| 2020 | STOC | On the Nisan-Ronen conjecture for submodular valuations. | George Christodoulou, Elias Koutsoupias, Annamria Kovcs |
| 2015 | IJCAI | A Characterization of n-Player Strongly Monotone Scheduling Mechanisms. | Annamria Kovcs, Angelina Vidali |
| 2010 | SODA | A Deterministic Truthful PTAS for Scheduling Related Machines. | George Christodoulou, Annamria Kovcs |
| 2009 | ISAAC | Online paging for flash memory devices. | Annamria Kovcs, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu |
| 2008 | ICALP | Bayesian Combinatorial Auctions. | George Christodoulou, Annamria Kovcs, Michael Schapira |
| 2007 | ICALP | Mechanism Design for Fractional Scheduling on Unrelated Machines. | George Christodoulou, Elias Koutsoupias, Annamria Kovcs |
| 2006 | CIAC | Tighter Approximation Bounds for LPT Scheduling in Two Special Cases. | Annamria Kovcs |
| 2005 | ESA | Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines. | Annamria Kovcs |
| 2005 | ICALP | Polynomial Time Preemptive Sum-Multicoloring on Paths. | Annamria Kovcs |
| 2004 | STACS | Sum-Multicoloring on Paths. | Annamria Kovcs |