default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Marcinkowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i10]Martin Böhm, Jaroslaw Byrka, Mateusz Lewandowski, Jan Marcinkowski:
Submodularity Gaps for Selected Network Design and Matching Problems. CoRR abs/2305.10935 (2023)- 2022
- [c10]Marcin Bienkowski
, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski:
Online Facility Location with Linear Delay. APPROX/RANDOM 2022: 45:1-45:17 - 2021
- [c9]Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski:
Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems. WAOA 2021: 48-64 - [i9]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski:
Online Facility Location with Linear Delay. CoRR abs/2110.15155 (2021) - 2020
- [j3]Marcin Bienkowski, David Fuchssteiner, Jan Marcinkowski, Stefan Schmid:
Online Dynamic B-Matching: With Applications to Reconfigurable Datacenter Networks. SIGMETRICS Perform. Evaluation Rev. 48(3): 99-108 (2020) - [c8]Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Krzysztof Sornat:
Tight Approximation for Proportional Approval Voting. IJCAI 2020: 276-282 - [c7]Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk:
To Close Is Easier Than To Open: Dual Parameterization To k-Median. WAOA 2020: 113-126 - [i8]Marcin Bienkowski, David Fuchssteiner, Jan Marcinkowski, Stefan Schmid:
A Competitive B-Matching Algorithm for Reconfigurable Datacenter Networks. CoRR abs/2006.10692 (2020) - [i7]Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk:
To Close Is Easier Than To Open: Dual Parameterization To k-Median. CoRR abs/2011.08083 (2020)
2010 – 2019
- 2019
- [c6]Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk:
Constant-Factor FPT Approximation for Capacitated k-Median. ESA 2019: 1:1-1:14 - [c5]Szymon Dudycz, Mateusz Lewandowski, Jan Marcinkowski:
Tight Approximation Ratio for Minimum Maximal Matching. IPCO 2019: 181-193 - 2018
- [j2]Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý:
Logarithmic price of buffer downscaling on line metrics. Theor. Comput. Sci. 707: 89-93 (2018) - [j1]Klaus-Tycho Foerster, Arne Ludwig, Jan Marcinkowski, Stefan Schmid:
Loop-Free Route Updates for Software-Defined Networks. IEEE/ACM Trans. Netw. 26(1): 328-341 (2018) - [i6]Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk:
Constant factor FPT approximation for capacitated k-median. CoRR abs/1809.05791 (2018) - [i5]Szymon Dudycz, Mateusz Lewandowski, Jan Marcinkowski:
Tight Approximation Ratio for Minimum Maximal Matching. CoRR abs/1811.08506 (2018) - 2017
- [c4]Szymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki:
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. IPCO 2017: 173-185 - [c3]Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid, Aleksandra Spyra:
Online Tree Caching. SPAA 2017: 329-338 - 2016
- [c2]Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid:
Transiently Consistent SDN Updates: Being Greedy is Hard. SIROCCO 2016: 391-406 - [i4]Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid, Aleksandra Spyra:
Online Tree Caching. CoRR abs/1602.08563 (2016) - [i3]Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid:
Transiently Consistent SDN Updates: Being Greedy is Hard. CoRR abs/1605.03158 (2016) - [i2]Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý:
Logarithmic price of buffer downscaling on line metrics. CoRR abs/1610.04915 (2016) - 2015
- [c1]Arne Ludwig, Jan Marcinkowski, Stefan Schmid:
Scheduling Loop-free Network Updates: It's Good to Relax! PODC 2015: 13-22 - [i1]Szymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki:
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. CoRR abs/1512.09236 (2015)
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-05-08 21:03 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:
