Marcin Smulewicz

According to our database, Marcin Smulewicz authored at least 8 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Fully Dynamic Strongly Connected Components in Planar Digraphs.

Adam Karczmarz, Marcin Smulewicz

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

On Fully Dynamic Strongly Connected Components.

Adam Karczmarz, Marcin Smulewicz

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Many-visits TSP revisited.

Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström

J. Comput. Syst. Sci., 2022

Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph.

Wojciech Nadara, Marcin Smulewicz

Electron. J. Comb., 2022

Computing Treedepth in Polynomial Space and Linear FPT Time.

Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Determining 4-Edge-Connected Components in Linear Time.

Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Improved approximation for Fractionally Subadditive Network Design.

Marcin Mucha, Marcin Smulewicz

Inf. Process. Lett., 2020

2019

Decreasing maximum average degree by deleting independent set or d-degenerate subgraph.

Wojciech Nadara, Marcin Smulewicz

CoRR, 2019