Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 92 matches
- 2023
- Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli:
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. SIAM J. Comput. 52(3): 718-739 (2023) - Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation Schemes for Clustering with General Norm Objectives. FOCS 2023: 1377-1399 - Jaroslaw Byrka, Andreas Wiese:
Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings. Lecture Notes in Computer Science 14297, Springer 2023, ISBN 978-3-031-49814-5 [contents] - Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation Schemes for Clustering with General Norm Objectives. CoRR abs/2304.03146 (2023) - Andrzej Turko, Jaroslaw Byrka:
Sublogarithmic Approximation for Tollbooth Pricing on a Cactus. CoRR abs/2305.05405 (2023) - Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces. CoRR abs/2305.07316 (2023) - Martin Böhm, Jaroslaw Byrka, Mateusz Lewandowski, Jan Marcinkowski:
Submodularity Gaps for Selected Network Design and Matching Problems. CoRR abs/2305.10935 (2023) - 2022
- Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski:
Online Facility Location with Linear Delay. APPROX/RANDOM 2022: 45:1-45:17 - 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) - 2021
- Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
New results on multi-level aggregation. Theor. Comput. Sci. 861: 133-143 (2021) - Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski:
Online Facility Location with Linear Delay. CoRR abs/2110.15155 (2021) - 2020
- Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multilevel Aggregation. Oper. Res. 68(1): 214-232 (2020) - Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase:
Approximating Node-Weighted k-MST on Planar Graphs. Theory Comput. Syst. 64(4): 626-644 (2020) - Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal:
PTAS for Steiner Tree on Map Graphs. LATIN 2020: 3-14 - Marcin Bienkowski, Jaroslaw Byrka, Christian Coester, Lukasz Jez:
Unbounded lower bound for k-server against weak adversaries. STOC 2020: 1165-1169 - Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli:
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. STOC 2020: 815-825 - 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 - Jaroslaw Byrka, Mateusz Lewandowski:
Concave Connection Cost Facility Location and the Star Inventory Routing Problem. WAOA 2020: 174-188 - Jaroslaw Byrka, Raghu Meka:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference. LIPIcs 176, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-164-1 [contents] - 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) - 2019
- Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha:
Dynamic Beats Fixed: On Phase-based Algorithms for File Migration. ACM Trans. Algorithms 15(4): 46:1-46:21 (2019) - 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 - Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias:
Better Bounds for Online Line Chasing. MFCS 2019: 8:1-8:13 - Marcin Bienkowski, Jaroslaw Byrka, Christian Coester, Lukasz Jez:
Unbounded lower bound for k-server against weak adversaries. CoRR abs/1911.01592 (2019) - Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli:
Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree. CoRR abs/1911.02259 (2019) - Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal:
PTAS for Steiner Tree on Map Graphs. CoRR abs/1912.00717 (2019) - Jaroslaw Byrka, Mateusz Lewandowski:
Concave connection cost Facility Location and the Star Inventory Routing problem. CoRR abs/1912.00770 (2019) - 2018
- Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. Algorithmica 80(4): 1093-1114 (2018) - Jaroslaw Byrka, Aravind Srinivasan:
Approximation Algorithms for Stochastic and Risk-Averse Optimization. SIAM J. Discret. Math. 32(1): 44-63 (2018) - Jaroslaw Byrka, Piotr Skowron, Krzysztof Sornat:
Proportional Approval Voting, Harmonic k-median, and Negative Association. ICALP 2018: 26:1-26:14
skipping 62 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-05 16:30 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint