default search action
Marek Adamczyk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely:
An O(loglog n)-Approximation for Submodular Facility Location. ICALP 2024: 5:1-5:20 - 2022
- [i11]Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely:
An O(loglog n)-Approximation for Submodular Facility Location. CoRR abs/2211.05474 (2022) - 2020
- [i10]Marek Adamczyk, Brian Brubach, Fabrizio Grandoni, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Improved Approximation Algorithms for Stochastic-Matching Problems. CoRR abs/2010.08142 (2020)
2010 – 2019
- 2019
- [j4]Marek Adamczyk, Michal Wlodarczyk:
Multi-dimensional mechanism design via random order contention resolution schemes. SIGecom Exch. 17(2): 46-53 (2019) - [c7]Marek Adamczyk, Jaroslaw Byrka
, Jan Marcinkowski
Constant-Factor FPT Approximation for Capacitated k-Median. ESA 2019: 1:1-1:14 - 2018
- [c6]Marek Adamczyk, Michal Wlodarczyk:
Random Order Contention Resolution Schemes. FOCS 2018: 790-801 - [i9]Marek Adamczyk, Michal Wlodarczyk:
Random Order Contention Resolution Schemes. CoRR abs/1804.02584 (2018) - [i8]Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk:
Constant factor FPT approximation for capacitated k-median. CoRR abs/1809.05791 (2018) - 2017
- [j3]Marek Adamczyk, Allan Borodin, Diodato Ferraioli, Bart de Keijzer, Stefano Leonardi:
Sequential Posted-Price Mechanisms with Correlated Valuations. ACM Trans. Economics and Comput. 5(4): 22:1-22:39 (2017) - [c5]Marek Adamczyk, Fabrizio Grandoni
When the Optimum is also Blind: a New Perspective on Universal Optimization. ICALP 2017: 35:1-35:15 - [i7]Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk:
When the Optimum is also Blind: a New Perspective on Universal Optimization. CoRR abs/1707.01702 (2017) - 2016
- [j2]Marek Adamczyk, Maxim Sviridenko, Justin Ward:
Submodular Stochastic Probing on Matroids. Math. Oper. Res. 41(3): 1022-1038 (2016) - 2015
- [c4]Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee:
Improved Approximation Algorithms for Stochastic Matching. ESA 2015: 1-12 - [c3]Marek Adamczyk, Allan Borodin, Diodato Ferraioli, Bart de Keijzer, Stefano Leonardi:
Sequential Posted Price Mechanisms with Correlated Valuations. WINE 2015: 1-15 - [i6]Marek Adamczyk, Allan Borodin, Diodato Ferraioli, Bart de Keijzer, Stefano Leonardi:
Sequential Posted Price Mechanisms with Correlated Valuations. CoRR abs/1503.02200 (2015) - [i5]Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee:
Improved Approximation Algorithms for Stochastic Matching. CoRR abs/1505.01439 (2015) - [i4]Marek Adamczyk:
Non-negative submodular stochastic probing via stochastic contention resolution schemes. CoRR abs/1508.07771 (2015) - 2014
- [c2]Marek Adamczyk, Piotr Sankowski, Qiang Zhang:
Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching. SAGT 2014: 13-24 - [c1]Marek Adamczyk, Maxim Sviridenko, Justin Ward:
Submodular Stochastic Probing on Matroids. STACS 2014: 29-40 - [i3]Marek Adamczyk, Piotr Sankowski, Qiang Zhang:
Efficiency of Truthful and Symmetric Mechanisms in One-sided Matching. CoRR abs/1407.3957 (2014) - 2013
- [i2]Marek Adamczyk, Maxim Sviridenko, Justin Ward:
Submodular Stochastic Probing on Matroids. CoRR abs/1310.4415 (2013) - 2011
- [j1]Marek Adamczyk:
Improved analysis of the greedy algorithm for stochastic matching. Inf. Process. Lett. 111(15): 731-737 (2011) - 2010
- [i1]Marek Adamczyk:
Greedy algorithm for stochastic matching is a 2-approximation. CoRR abs/1007.3036 (2010)
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-07-03 20:42 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: