Experimental evaluation of kernelization algorithms to Dominating Set. - Wojciech Nadara (CoRR, 2018)

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

Jones' Conjecture in subcubic graphs. - Marthe Bonamy; François Dross; Tomás Masarík; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2019)

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. - Wojciech Nadara; Marcin Pilipczuk; Roman Rabinovich 001; Felix Reidl; Sebastian Siebertz (ACM J. Exp. Algorithmics, 2019)

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. - Lukasz Kowalik; Marcin Mucha; Wojciech Nadara; Marcin Pilipczuk; Manuel Sorge; Piotr Wygocki (IPEC, 2020)

On Dynamic Parameterized k-Path. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Michal Pilipczuk; Marcin Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (CoRR, 2020)

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

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (SODA, 2021)

Jones' Conjecture in Subcubic Graphs. - Marthe Bonamy; François Dross; Tomás Masarík; Andrea Munaro; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk (Electron. J. Comb., 2021)

Improved Bounds for the Excluded-Minor Approximation of Treedepth. - Wojciech Czerwinski; Wojciech Nadara; Marcin Pilipczuk (SIAM J. Discret. Math., 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)

Dynamic treewidth. - Tuukka Korhonen; Konrad Majewski; Wojciech Nadara; Michal Pilipczuk; Marek Sokolowski 001 (FOCS, 2023)

Approximating Pathwidth for Graphs of Small Treewidth. - Carla Groenland; Gwenaël Joret; Wojciech Nadara; Bartosz Walczak (ACM Trans. Algorithms, 2023)

Exact Shortest Paths with Rational Weights on the Word RAM. - Adam Karczmarz; Wojciech Nadara; Marek Sokolowski 001 (SODA, 2024)

Fully dynamic approximation schemes on planar and apex-minor-free graphs. - Tuukka Korhonen; Wojciech Nadara; Michal Pilipczuk; Marek Sokolowski 001 (SODA, 2024)

Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument. - Romain Bourneuf; Jana Masaríková; Wojciech Nadara; Marcin Pilipczuk (MFCS, 2025)

Fully Dynamic Biconnectivity in Õ(log² n) Time. - Jacob Holm; Wojciech Nadara; Eva Rotenberg; Marek Sokolowski 001 (STOC, 2025)

A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees. - Lars Jaffke; Paloma T. Lima; Wojciech Nadara; Emmanuel Sam (CoRR, 2025)