| Tight approximation ratio for minimum maximal matching S Dudycz, M Lewandowski, J Marcinkowski International Conference on Integer Programming and Combinatorial …, 2019 | 11 | 2019 |
| Approximation algorithms for node-weighted prize-collecting Steiner tree problems on planar graphs J Byrka, M Lewandowski, C Moldenhauer arXiv preprint arXiv:1601.02481, 2016 | 6 | 2016 |
| Concave connection cost facility location and the star inventory routing problem J Byrka, M Lewandowski Approximation and Online Algorithms: 18th International Workshop, WAOA 2020 …, 2021 | 2 | 2021 |
| PTAS for Steiner Tree on Map Graphs J Byrka, M Lewandowski, SM Meesum, J Spoerhase, S Uniyal Latin American Symposium on Theoretical Informatics, 3-14, 2020 | 1 | 2020 |
| Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications M Bartoszkiewicz, J Chorowski, A Kosowski, J Kowalski, S Kulik, ... arXiv preprint arXiv:2307.13116, 2023 | | 2023 |
| Submodularity Gaps for Selected Network Design and Matching Problems M Böhm, J Byrka, M Lewandowski, J Marcinkowski arXiv preprint arXiv:2305.10935, 2023 | | 2023 |
| Approximating Node-Weighted k-MST on Planar Graphs J Byrka, M Lewandowski, J Spoerhase Theory of Computing Systems 64, 626-644, 2020 | | 2020 |
| Dense Steiner problems: Approximation algorithms and inapproximability M Karpinski, M Lewandowski, SM Meesum, M Mnich arXiv preprint arXiv:2004.14102, 2020 | | 2020 |
| Approximating Node-Weighted k-MST on Planar Graphs J law Byrka, M Lewandowski, J Spoerhase arXiv preprint arXiv:1801.00313, 2018 | | 2018 |
| 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016) Z Friggstad, M Rezapour, MR Salavatipour, J Byrka, M Lewandowski, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2016 | | 2016 |
