 | 2011 |
|---|
| 14 |       | George Christodoulou,
Annamária Kovács:
A Global Characterization of Envy-Free Truthful Scheduling of Two Tasks.
WINE 2011: 84-96 |
| 2010 |
|---|
| 13 | | George Christodoulou,
Annamária Kovács:
A Deterministic Truthful PTAS for Scheduling Related Machines.
SODA 2010: 1005-1016 |
| 12 | | George Christodoulou,
Annamária Kovács,
Rob van Stee:
A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines.
WINE 2010: 182-193 |
| 11 | | George Christodoulou,
Elias Koutsoupias,
Annamária Kovács:
Mechanism design for fractional scheduling on unrelated machines.
ACM Transactions on Algorithms 6(2): (2010) |
| 10 | | Annamária Kovács:
New Approximation Bounds for Lpt Scheduling.
Algorithmica 57(2): 413-433 (2010) |
| 2009 |
|---|
| 9 | | Annamária Kovács,
Ulrich Meyer,
Gabriel Moruz,
Andrei Negoescu:
Online paging for flash memory devices.
ISAAC 2009: 352-361 |
| 8 | | George Christodoulou,
Annamária Kovács:
A deterministic truthful PTAS for scheduling related machines
CoRR abs/0907.3068: (2009) |
| 7 | | Annamária Kovács:
Tighter approximation bounds for LPT scheduling in two special cases.
J. Discrete Algorithms 7(3): 327-340 (2009) |
| 2008 |
|---|
| 6 | | George Christodoulou,
Annamária Kovács,
Michael Schapira:
Bayesian Combinatorial Auctions.
ICALP (1) 2008: 820-832 |
| 2007 |
|---|
| 5 | | George Christodoulou,
Elias Koutsoupias,
Annamária Kovács:
Mechanism Design for Fractional Scheduling on Unrelated Machines.
ICALP 2007: 40-52 |
| 2006 |
|---|
| 4 | | Annamária Kovács:
Tighter Approximation Bounds for LPT Scheduling in Two Special Cases.
CIAC 2006: 187-198 |
| 2005 |
|---|
| 3 | | Annamária Kovács:
Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines.
ESA 2005: 616-627 |
| 2 | | Annamária Kovács:
Polynomial Time Preemptive Sum-Multicoloring on Paths.
ICALP 2005: 840-852 |
| 2004 |
|---|
| 1 | | Annamária Kovács:
Sum-Multicoloring on Paths.
STACS 2004: 68-80 |
Data released under the ODC-BY 1.0 license — See also our legal information page