Annamária Kovács

Affiliations:
  • Goethe University Frankfurt am Main, Institute for Computer Science, Germany
  • Max Planck Institute for Informatics (MPII), Saaruuml;cken, Germany


According to our database1, Annamária Kovács authored at least 22 papers between 2004 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Proof of the Nisan-Ronen Conjecture.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
On the nisan-ronen conjecture.
SIGecom Exch., July, 2022

2021
Truthful Allocation in Graphs and Hypergraphs.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
On the Nisan-Ronen conjecture for submodular valuations.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2017
EEG correlates of speech: Examination of event related potentials elicited by phoneme classes.
Proceedings of the 8th IEEE International Conference on Cognitive Infocommunications, 2017

2016
Tight Bounds for the Price of Anarchy of Simultaneous First-Price Auctions.
ACM Trans. Economics and Comput., 2016

Bayesian Combinatorial Auctions.
J. ACM, 2016

2015
The optimal structure of algorithms for α-paging.
Inf. Process. Lett., 2015

Mechanisms with Monitoring for Truthful RAM Allocation.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

A Characterization of n-Player Strongly Monotone Scheduling Mechanisms.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Comparison of skewness-based salient event detector algorithms in speech.
Proceedings of the 6th IEEE International Conference on Cognitive Infocommunications, 2015

2013
A truthful constant approximation for maximizing the minimum load on related machines.
Theor. Comput. Sci., 2013

A Deterministic Truthful PTAS for Scheduling Related Machines.
SIAM J. Comput., 2013

2011
A Global Characterization of Envy-Free Truthful Scheduling of Two Tasks.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

2010
Mechanism design for fractional scheduling on unrelated machines.
ACM Trans. Algorithms, 2010

New Approximation Bounds for Lpt Scheduling.
Algorithmica, 2010

2009
Tighter approximation bounds for LPT scheduling in two special cases.
J. Discrete Algorithms, 2009

Online paging for flash memory devices.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2006
Fast algorithms for two scheduling problems.
PhD thesis, 2006

2005
Polynomial Time Preemptive Sum-Multicoloring on Paths.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines.
Proceedings of the Algorithms, 2005

2004
Sum-Multicoloring on Paths.
Proceedings of the STACS 2004, 2004


  Loading...