Wojciech Nadara

Available identifiers

Publication	Date of Publication	Type
Fully dynamic approximation schemes on planar and apex-minor-free graphs	2024-11-28	Paper
Exact shortest paths with rational weights on the word RAM	2024-11-28	Paper
https://portal.mardi4nfdi.de/entity/Q6147300	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6147373	2024-01-15	Paper
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.	2023-11-13	Paper
Approximating Pathwidth for Graphs of Small Treewidth	2023-10-23	Paper
Determining 4-Edge-Connected Components in Linear Time	2023-09-20	Paper
Many Visits TSP Revisited	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5075772	2022-05-11	Paper
Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph	2022-04-04	Paper
Many-visits TSP revisited	2021-11-25	Paper
Jones' conjecture in subcubic graphs	2021-10-26	Paper
Improved Bounds for the Excluded-Minor Approximation of Treedepth	2021-05-28	Paper
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness	2021-04-21	Paper
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness	2020-12-16	Paper

This page was built for person: Wojciech Nadara