Publications

Wojciech Nadara

Number of publications: 17

2024

• Adam Karczmarz , Wojciech Nadara , Marek Sokołowski , Exact Shortest Paths with Rational Weights on the Word RAM, 35th 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, the United States of America, 7 January 2024 - 10 January 2024. See in PBN
• Tuukka Korhonen, Wojciech Nadara , Michał Pilipczuk , Marek Sokołowski , Fully dynamic approximation schemes on planar and apex-minor-free graphs, 35th 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, the United States of America, 7 January 2024 - 10 January 2024. See in PBN

2023

• Carla Groenland, Gwenaël Joret, Wojciech Nadara , Bartosz Walczak, Approximating pathwidth for graphs of small treewidth, ACM Transactions on Algorithms, 19 (2) 2023. See in PBN
• Tuukka Korhonen, Konrad Majewski , Wojciech Nadara , Michał Pilipczuk , Marek Sokołowski , Dynamic treewidth, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 November 2023 - 9 November 2023. See in PBN

2022

• Wojciech Nadara , Michał Pilipczuk , Marcin Smulewicz, Computing Treedepth in Polynomial Space and Linear {FPT} Time, 30th Annual European Symposium on Algorithms, Poczdam, Germany, 5 September 2022 - 7 September 2022, 244 2022, p. 79:1--79:14. See in PBN
• Wojciech Nadara , Marcin Smulewicz, Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph, Electronic Journal of Combinatorics, 29 (1) 2022. See in PBN
• Łukasz Kowalik , Shaohua Li, Wojciech Nadara , Marcin Smulewicz, Magnus Wahlström, Many-visits TSP revisited, Journal of Computer and System Sciences, 124 2022, p. 112-128. See in PBN

2021

• Carla Groenl, Gwenael Joret, Wojciech Nadara , Bartosz Walczak, Approximating pathwidth for graphs of small treewidth, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 January 2021 - 13 January 2021. See in PBN
• Wojciech Nadara , Mateusz Radecki, Marcin Smulewicz, Marek Sokołowski , Determining 4-Edge-Connected Components in Linear Time, 29th Annual European Symposium on Algorithms, Lizbona, Portugal, 6 September 2021 - 8 September 2021, 204 2021, p. 71:1--71:15. See in PBN
• Jiehua Chen, Wojciech Czerwiński , Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara , Marcin Pilipczuk , Michał Pilipczuk , Manuel Sorge, Bartłomiej Wróblewski, Anna Zych-Pawlewicz , Efficient fully dynamic elimination forests with applications to detecting long paths and cycles, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 January 2021 - 13 January 2021. See in PBN
• Wojciech Czerwiński , Wojciech Nadara , Marcin Pilipczuk , Improved Bounds for the Excluded-Minor Approximation of Treedepth, SIAM Journal on Discrete Mathematics, 35 (2) 2021, p. 934-947. See in PBN
• Marthe Bonamy, François Dross, Tomáš Masařík , Andrea Munaro, Wojciech Nadara , Marcin Pilipczuk , Michał Pilipczuk , Jones' Conjecture in Subcubic Graphs, Electronic Journal of Combinatorics, 28 (4) 2021, p. P4.5: 1-12. See in PBN

2020

• Łukasz Kowalik , Shaohua Li, Wojciech Nadara , Marcin Smulewicz, Magnus Wahlström, Many Visits TSP Revisited, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 September 2020 - 9 September 2020. See in PBN
• Łukasz Kowalik , Marcin Mucha , Wojciech Nadara , Marcin Pilipczuk , Manuel Sorge, Piotr Wygocki , The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, 14 December 2020 - 18 December 2020. See in PBN

2019

• Wojciech Nadara , Marcin Pilipczuk , Roman Rabinovich, Felix Reidl, Sebastian Siebertz, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness, Journal of Experimental Algorithmics, 24 2019, p. 1-34. See in PBN
• Wojciech Czerwiński , Wojciech Nadara , Marcin Pilipczuk , Improved Bounds for the Excluded-Minor Approximation of Treedepth, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019, 144 2019, p. 34:1--34:13. See in PBN

2018

• Wojciech Nadara , Marcin Pilipczuk , Roman Rabinovich, Felix Reidl, Sebastian Siebertz, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness, 17th International Symposium on Experimental Algorithms, L'Aquila, Italy, 27 June 2018 - 29 June 2018. See in PBN