Decreasing maximum average degree by deleting independent set or d-degenerate subgraph. - Wojciech Nadara; Marcin Smulewicz (CoRR, 2019)

Improved approximation for Fractionally Subadditive Network Design. - Marcin Mucha; Marcin Smulewicz (Inf. Process. Lett., 2020)

Determining 4-Edge-Connected Components in Linear Time. - Wojciech Nadara; Mateusz Radecki; Marcin Smulewicz; Marek Sokolowski 001 (ESA, 2021)

Computing Treedepth in Polynomial Space and Linear FPT Time. - Wojciech Nadara; Michal Pilipczuk; Marcin Smulewicz (ESA, 2022)

Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph. - Wojciech Nadara; Marcin Smulewicz (Electron. J. Comb., 2022)

Many-visits TSP revisited. - Lukasz Kowalik; Shaohua Li 005; Wojciech Nadara; Marcin Smulewicz; Magnus Wahlström (J. Comput. Syst. Sci., 2022)

On Fully Dynamic Strongly Connected Components. - Adam Karczmarz; Marcin Smulewicz (ESA, 2023)

Fully Dynamic Strongly Connected Components in Planar Digraphs. - Adam Karczmarz; Marcin Smulewicz (ICALP, 2024)