Wojciech Nadara

According to our database, Wojciech Nadara authored at least 17 papers between 2018 and 2024.

Collaborative distances:

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

2024

Fully dynamic approximation schemes on planar and apex-minor-free graphs.

Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Exact Shortest Paths with Rational Weights on the Word RAM.

Adam Karczmarz, Wojciech Nadara, Marek Sokolowski

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Approximating Pathwidth for Graphs of Small Treewidth.

Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak

ACM Trans. Algorithms, April, 2023

Dynamic treewidth.

Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 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

Improved Bounds for the Excluded-Minor Approximation of Treedepth.

Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk

SIAM J. Discret. Math., 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

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.

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

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 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

On Dynamic Parameterized k-Path.

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

CoRR, 2020

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.

Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness.

Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz

ACM J. Exp. Algorithmics, 2019

Jones' Conjecture in subcubic graphs.

Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk

CoRR, 2019

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

Wojciech Nadara, Marcin Smulewicz

CoRR, 2019

2018

Experimental evaluation of kernelization algorithms to Dominating Set.

Wojciech Nadara

CoRR, 2018