Dr. Annamaria Kovacs
Dr. Annamaria Kovacs
Institute for Computer Science
Robert-Mayer-Straße 11-15
60325 Frankfurt am Main
Room 305
Tel: +49-69-798-28286
Fax: +49-69-798-28814
Email: panni@cs.uni-frankfurt.de
Research Interests
  • Combinatorial Optimization
  • Scheduling Problems
  • Algorithmic Mechanism Design
  • Graph Problems
Theses
2
Annamaria Kovacs
Fast Algorithms for Two Scheduling Problems
PhD thesis, Universität des Saarlandes, 2007.
1
Annamaria Kovacs
Applications of model theory in set theoretical topology
Master Thesis, ELTE Budapest, 1995.
Peer-Reviewed Conference Publications
12
Annamaria Kovacs, Angelina Vidali
A Characterization of n-Player Strongly Monotone Scheduling Mechanisms
In: IJCAI 2015: 568-574.
11
Annamaria Kovacs, Ulrich Meyer, Carmine Ventre
Mechanisms with Monitoring for Truthful RAM Allocation
In: WINE 2015: 398-412.
10
George Christodoulou, Annamaria Kovacs
A global characterization of envy-free truthful scheduling of two tasks
In: Internet and Network Economics - 7th International Workshop (WINE 2011), volume 7090 of LNCS, pages 84-96, Springer, 2011.
9
George Christodoulou, Annamaria Kovacs
A deterministic truthful PTAS for scheduling related machines
In: Proc. 21st Symposium on Discrete Algorithms (SODA 2010), pages 1005-1016, SIAM, 2010.
8
George Christodoulou, Annamaria Kovacs, Rob van Stee
A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics - 6th International Workshop (WINE 2010), volume 6484 of LNCS, pages 182-193, Springer, 2010.
7
Annamaria Kovacs, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
Online paging for flash memory devices
In: Proc. 20th Intl. Symp. on Algorithms and Computation, ISAAC 2009, volume 5878 of LNCS, pages 352-361.
6
George Christodoulou, Annamaria Kovacs, Michael Schapira
Bayesian Combinatorial Auction
In: Automata, Languages and Programming : 35th International Colloquium (ICALP 2008), volume 5125 of LNCS, pages 820-832, Springer, 2008.
5
George Christodoulou, Elias Koutsoupias, and Annamaria Kovacs
Mechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium (ICALP 2007), volume 4596 of LNCS, pages 40-52, Springer, 2007.
4
Annamaria Kovacs
Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, volume 3998 of LNCS, pages 187-198, Springer, 2006.
3
Annamaria Kovacs
Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, volume 3669 of LNCS, pages 616-627, Springer, 2005.
2
Annamaria Kovacs
Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim (ICALP 2005) volume 3580 of LNCS, pages 840-852, Springer 2005.
1
Annamaria Kovacs
Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), volume 2996 of LNCS, pages 68-80, Springer, 2004.
Peer-Reviewed Journal Publications
10
George Christodoulou, Annamária Kovács, Michael Schapira
Bayesian Combinatorial Auctions
In: J. ACM 63(2): 11:1-11:19 (2016).
9
George Christodoulou, Annamária Kovács, Alkmini Sgouritsa, Bo Tang
Tight Bounds for the Price of Anarchy of Simultaneous First-Price Auctions
In: ACM Trans. Economics and Comput. 4(2): 9:1-9:33 (2016).
8
Annamaria Kovacs, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
The optimal structure of algorithms for α-paging
In: Inf. Process. Lett. 115(12): 932-938 (2015).
7
George Christodoulou, Annamaria Kovacs
A Deterministic Truthful PTAS for Scheduling Related Machines
In: SIAM J. Comput. 42(4): 1572-1595 (2013).
6
George Christodoulou, Annamaria Kovacs, Rob van Stee
A truthful constant approximation for maximizing the minimum load on related machines
In: Theor. Comput. Sci. 489-490: 88-98 (2013).
5
George Christodoulou, Annamaria Kovacs
New approximation bounds for LPT scheduling
In: SIAM Journal on Computing, Vol. 42(4), pages 1572-1595, 2013.
4
George Christodoulou, Annamaria Kovacs, Rob van Stee
A Deterministic Truthful {PTAS} for Scheduling Related Machines
In: Theoretical Computer Science, Vol. 489-490, pages 88-98, 2013.
3
Annamaria Kovacs
New approximation bounds for LPT scheduling
In: Algorithmica, Vol. 57(2), pages 413-433, 2010.
2
George Christodoulou, Elias Koutsoupias, Annamaria Kovacs
Mechanism design for fractional scheduling on unrelated machines
In: ACM Transactions on Algorithms, Vol. 6(2), 2010.
1
Annamaria Kovacs
Tighter approximation bounds for LPT scheduling in two special cases
In: Journal of Discrete Algorithms, Vol. 7(3), pages 327-340, 2009.