Wojciech Nadara

Orcid: 0000-0001-8371-425X

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fully dynamic approximation schemes on planar and apex-minor-free graphs.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Exact Shortest Paths with Rational Weights on the Word RAM.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Approximating Pathwidth for Graphs of Small Treewidth.
ACM Trans. Algorithms, April, 2023

Dynamic treewidth.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Many-visits TSP revisited.
J. Comput. Syst. Sci., 2022

Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph.
Electron. J. Comb., 2022

Computing Treedepth in Polynomial Space and Linear FPT Time.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Improved Bounds for the Excluded-Minor Approximation of Treedepth.
SIAM J. Discret. Math., 2021

Jones' Conjecture in Subcubic Graphs.
Electron. J. Comb., 2021

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Determining 4-Edge-Connected Components in Linear Time.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
On Dynamic Parameterized k-Path.
CoRR, 2020

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
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.
ACM J. Exp. Algorithmics, 2019

Jones' Conjecture in subcubic graphs.
CoRR, 2019

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

2018
Experimental evaluation of kernelization algorithms to Dominating Set.
CoRR, 2018


  Loading...