| Approximating pathwidth for graphs of small treewidth C Groenland, G Joret, W Nadara, B Walczak ACM transactions on algorithms 19 (2), 1-19, 2023 | 27 | 2023 |
| Efficient fully dynamic elimination forests with applications to detecting long paths and cycles J Chen, W Czerwiński, Y Disser, AE Feldmann, D Hermelin, W Nadara, ... Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 26 | 2021 |
| Improved bounds for the excluded-minor approximation of treedepth W Czerwinski, W Nadara, M Pilipczuk SIAM Journal on Discrete Mathematics 35 (2), 934-947, 2021 | 26 | 2021 |
| Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness W Nadara, M Pilipczuk, R Rabinovich, F Reidl, S Siebertz Journal of Experimental Algorithmics (JEA) 24, 1-34, 2019 | 16 | 2019 |
| The PACE 2020 parameterized algorithms and computational experiments challenge: Treedepth Ł Kowalik, M Mucha, W Nadara, M Pilipczuk, M Sorge, P Wygocki 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020 | 14 | 2020 |
| Dynamic treewidth T Korhonen, K Majewski, W Nadara, M Pilipczuk, M Sokołowski 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 11 | 2023 |
| Computing treedepth in polynomial space and linear FPT time W Nadara, M Pilipczuk, M Smulewicz arXiv preprint arXiv:2205.02656, 2022 | 11 | 2022 |
| Determining 4-edge-connected components in linear time W Nadara, M Radecki, M Smulewicz, M Sokołowski arXiv preprint arXiv:2105.01699, 2021 | 11 | 2021 |
| Many-visits TSP revisited Ł Kowalik, S Li, W Nadara, M Smulewicz, M Wahlström Journal of Computer and System Sciences 124, 112-128, 2022 | 10 | 2022 |
| Decreasing the maximum average degree by deleting an independent set or a d-degenerate subgraph W Nadara, M Smulewicz arXiv preprint arXiv:1909.10701, 2019 | 7 | 2019 |
| Exact Shortest Paths with Rational Weights on the Word RAM A Karczmarz, W Nadara, M Sokołowski Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 3 | 2024 |
| Fully dynamic approximation schemes on planar and apex-minor-free graphs T Korhonen, W Nadara, M Pilipczuk, M Sokołowski Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 3 | 2024 |
| Jones' Conjecture in subcubic graphs M Bonamy, F Dross, T Masařík, W Nadara, M Pilipczuk, M Pilipczuk arXiv preprint arXiv:1912.01570, 2019 | 2 | 2019 |
| Experimental evaluation of kernelization algorithms to Dominating Set W Nadara arXiv preprint arXiv:1811.07831, 2018 | 2 | 2018 |
| Graphs with no long claws: An improved bound for the analog of the Gy\'{a} rf\'{a} s' path argument R Bourneuf, J Masaříková, W Nadara, M Pilipczuk arXiv preprint arXiv:2501.13907, 2025 | 1 | 2025 |
| Graph Width Parameters. Dependencies, Algorithms and Decompositions. W Nadara | | 2023 |
| Jones' Conjecture in Subcubic Graphs M Pilipczuk, A Munaro, F Dross, M Pilipczuk, M Bonamy, W Nadara, ... Electronic Journal of Combinatorics, 2021 | | 2021 |
| Approximating pathwidth for graphs of small treewidth B Walczak, C Groenl, G Joret, W Nadara | | 2021 |
| On Dynamic Parameterized -Path J Chen, W Czerwiński, Y Disser, AE Feldmann, D Hermelin, W Nadara, ... | | 2020 |
| Improved Bounds for the Excluded-Minor Approximation of Treedepth M Pilipczuk, W Nadara, W Czerwiński | | 2019 |
