default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnamária Kovács
Person information
- affiliation: Goethe University Frankfurt am Main, Institute for Computer Science, Germany
- affiliation: Max Planck Institute for Informatics (MPII), Saaruuml;cken, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c18]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
A Proof of the Nisan-Ronen Conjecture. STOC 2023: 672-685- [i6]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
A proof of the Nisan-Ronen conjecture. CoRR abs/2301.11905 (2023) - 2022
- [j9]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the nisan-ronen conjecture. SIGecom Exch. 20(1): 41-46 (2022) - 2021
- [c17]George Christodoulou
, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture. FOCS 2021: 839-850 - [c16]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Truthful Allocation in Graphs and Hypergraphs. ICALP 2021: 56:1-56:20 - [i5]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Truthful allocation in graphs and hypergraphs. CoRR abs/2106.03724 (2021) - 2020
- [c15]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture for submodular valuations. STOC 2020: 1086-1096 - [i4]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture. CoRR abs/2011.14434 (2020)
2010 – 2019
- 2019
- [i3]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture for submodular valuations. CoRR abs/1907.12733 (2019) - 2017
- [c14]Annamária Kovács, István Winkler, Klára Vicsi:
EEG correlates of speech: Examination of event related potentials elicited by phoneme classes. CogInfoCom 2017: 115-120 - 2016
- [j8]George Christodoulou, Annamária Kovács, Michael Schapira:
Bayesian Combinatorial Auctions. J. ACM 63(2): 11:1-11:19 (2016) - [j7]George Christodoulou, Annamária Kovács, Alkmini Sgouritsa, Bo Tang:
Tight Bounds for the Price of Anarchy of Simultaneous First-Price Auctions. ACM Trans. Economics and Comput. 4(2): 9:1-9:33 (2016) - 2015
- [j6]Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu:
The optimal structure of algorithms for α-paging. Inf. Process. Lett. 115(12): 932-938 (2015) - [c13]Annamária Kovács, Gábor Kiss, Klára Vicsi, István Winkler, Martin Coath:
Comparison of skewness-based salient event detector algorithms in speech. CogInfoCom 2015: 285-290 - [c12]Annamária Kovács, Angelina Vidali:
A Characterization of n-Player Strongly Monotone Scheduling Mechanisms. IJCAI 2015: 568-574 - [c11]Annamária Kovács, Ulrich Meyer, Carmine Ventre:
Mechanisms with Monitoring for Truthful RAM Allocation. WINE 2015: 398-412 - 2013
- [j5]George Christodoulou, Annamária Kovács:
A Deterministic Truthful PTAS for Scheduling Related Machines. SIAM J. Comput. 42(4): 1572-1595 (2013) - [j4]George Christodoulou, Annamária Kovács, Rob van Stee:
A truthful constant approximation for maximizing the minimum load on related machines. Theor. Comput. Sci. 489-490: 88-98 (2013) - [i2]George Christodoulou, Annamária Kovács, Alkmini Sgouritsa, Bo Tang:
Tight Bounds for the Price of Anarchy of Simultaneous First Price Auctions. CoRR abs/1312.2371 (2013) - 2011
- [c10]George Christodoulou, Annamária Kovács:
A Global Characterization of Envy-Free Truthful Scheduling of Two Tasks. WINE 2011: 84-96 - 2010
- [j3]Annamária Kovács:
New Approximation Bounds for Lpt Scheduling. Algorithmica 57(2): 413-433 (2010) - [j2]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Mechanism design for fractional scheduling on unrelated machines. ACM Trans. Algorithms 6(2): 38:1-38:18 (2010) - [c9]George Christodoulou, Annamária Kovács:
A Deterministic Truthful PTAS for Scheduling Related Machines. SODA 2010: 1005-1016 - [c8]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
2000 – 2009
- 2009
- [j1]Annamária Kovács:
Tighter approximation bounds for LPT scheduling in two special cases. J. Discrete Algorithms 7(3): 327-340 (2009) - [c7]Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu:
Online paging for flash memory devices. ISAAC 2009: 352-361 - [i1]George Christodoulou, Annamária Kovács:
A deterministic truthful PTAS for scheduling related machines. CoRR abs/0907.3068 (2009) - 2008
- [c6]George Christodoulou, Annamária Kovács, Michael Schapira:
Bayesian Combinatorial Auctions. ICALP (1) 2008: 820-832 - 2007
- [c5]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Mechanism Design for Fractional Scheduling on Unrelated Machines. ICALP 2007: 40-52 - 2006
- [b1]Annamária Kovács:
Fast algorithms for two scheduling problems. Saarland University, Germany, 2006 - [c4]Annamária Kovács:
Tighter Approximation Bounds for LPT Scheduling in Two Special Cases. CIAC 2006: 187-198 - 2005
- [c3]Annamária Kovács:
Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines. ESA 2005: 616-627 - [c2]Annamária Kovács:
Polynomial Time Preemptive Sum-Multicoloring on Paths. ICALP 2005: 840-852 - 2004
- [c1]Annamária Kovács:
Sum-Multicoloring on Paths. STACS 2004: 68-80
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
