Wojciech Nadara

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 30

Top Topics

Bounded Treewidth

Approximation Schemes

Empirical Evaluation

Independent Set

Top Venues

Electron. J. Comb.

Publications

Adam Karczmarz, Wojciech Nadara, Marek Sokolowski
Exact Shortest Paths with Rational Weights on the Word RAM. SODA (2024)
Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
Fully dynamic approximation schemes on planar and apex-minor-free graphs. SODA (2024)
Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
Fully dynamic approximation schemes on planar and apex-minor-free graphs. CoRR (2023)
Adam Karczmarz, Wojciech Nadara, Marek Sokolowski
Exact Shortest Paths with Rational Weights on the Word RAM. CoRR (2023)
Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
Dynamic treewidth. FOCS (2023)
Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
Dynamic treewidth. CoRR (2023)
Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Approximating Pathwidth for Graphs of Small Treewidth. ACM Trans. Algorithms 19 (2) (2023)
Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
Many-visits TSP revisited. J. Comput. Syst. Sci. 124 (2022)
Wojciech Nadara, Marcin Smulewicz
Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph. Electron. J. Comb. 29 (1) (2022)
Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz
Computing treedepth in polynomial space and linear fpt time. CoRR (2022)
Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz
Computing Treedepth in Polynomial Space and Linear FPT Time. ESA (2022)
Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
Improved Bounds for the Excluded-Minor Approximation of Treedepth. SIAM J. Discret. Math. 35 (2) (2021)
Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. 28 (4) (2021)
Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Approximating Pathwidth for Graphs of Small Treewidth. SODA (2021)
Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski
Determining 4-edge-connected components in linear time. CoRR (2021)
Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski
Determining 4-Edge-Connected Components in Linear Time. ESA (2021)
Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA (2021)
Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Michal Pilipczuk, Marcin Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
On Dynamic Parameterized k-Path. CoRR (2020)
Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
Many Visits TSP Revisited. ESA (2020)
Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC (2020)
Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
Many visits TSP revisited. CoRR (2020)
Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Approximating pathwidth for graphs of small treewidth. CoRR (2020)
Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. ACM J. Exp. Algorithmics 24 (1) (2019)
Wojciech Nadara, Marcin Smulewicz
Decreasing maximum average degree by deleting independent set or d-degenerate subgraph. CoRR (2019)
Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
Improved bounds for the excluded-minor approximation of treedepth. CoRR (2019)
Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
Improved Bounds for the Excluded-Minor Approximation of Treedepth. ESA (2019)
Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
Jones' Conjecture in subcubic graphs. CoRR (2019)
Wojciech Nadara
Experimental evaluation of kernelization algorithms to Dominating Set. CoRR (2018)
Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. CoRR (2018)
Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. SEA (2018)