Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs. - Jaroslaw Byrka; Mateusz Lewandowski; Carsten Moldenhauer (SWAT, 2016)

Sound Source Detection, Localization and Classification using Consecutive Ensemble of CRNN Models. - Slawomir Kapka; Mateusz Lewandowski (DCASE, 2019)

Tight Approximation Ratio for Minimum Maximal Matching. - Szymon Dudycz; Mateusz Lewandowski; Jan Marcinkowski (IPCO, 2019)

PTAS for Steiner Tree on Map Graphs. - Jaroslaw Byrka; Mateusz Lewandowski; Syed Mohammad Meesum; Joachim Spoerhase; Sumedha Uniyal (LATIN, 2020)

Concave Connection Cost Facility Location and the Star Inventory Routing Problem. - Jaroslaw Byrka; Mateusz Lewandowski (WAOA, 2020)

Dense Steiner problems: Approximation algorithms and inapproximability. - Marek Karpinski; Mateusz Lewandowski; Syed Mohammad Meesum; Matthias Mnich (CoRR, 2020)

Approximating Node-Weighted k-MST on Planar Graphs. - Jaroslaw Byrka; Mateusz Lewandowski; Joachim Spoerhase (Theory Comput. Syst., 2020)

Submodularity Gaps for Selected Network Design and Matching Problems. - Martin Böhm 001; Jaroslaw Byrka; Mateusz Lewandowski; Jan Marcinkowski (CoRR, 2023)

Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications. - Michal Bartoszkiewicz; Jan Chorowski; Adrian Kosowski; Jakub Kowalski; Sergey Kulik; Mateusz Lewandowski; Krzysztof Nowicki 002; Kamil Piechowiak; Olivier Ruas; Zuzanna Stamirowska; Przemyslaw Uznanski (CoRR, 2023)