Wojciech Nadara

40 papers A* 7A 4B 4Journal 25

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Polynomial Coreset for Furthest Neighbor in Planar Metrics. CoRR Kacper Kluk, Hung Le, Wojciech Nadara, Marcin Pilipczuk, Hector Tierno, Vinayak
2026	J	`jnl`	Dynamic data structures for twin-ordered matrices. CoRR Bartlomiej Bosek, Jadwiga Czyzewska, Evangelos Kipouridis, Wojciech Nadara, Michal Pilipczuk, Karol Wegrzycki, Anna Zych-Pawlewicz
2026	A*	`conf`	Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP. SODA Adam Karczmarz, Wojciech Nadara, Marek Sokolowski
2025	B	`conf`	A Parameterized Complexity Analysis of Bounded Height Depth-First Search Trees. WG Lars Jaffke, Paloma Thomé de Lima, Wojciech Nadara, Emmanuel Sam
2025	J	`jnl`	A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees. CoRR Lars Jaffke, Paloma T. Lima, Wojciech Nadara, Emmanuel Sam
2025	A*	`conf`	Fully Dynamic Biconnectivity in Õ(log² n) Time. STOC Jacob Holm, Wojciech Nadara, Eva Rotenberg, Marek Sokolowski
2025	J	`jnl`	Fully dynamic biconnectivity in Õ(log² n) time. CoRR Jacob Holm, Wojciech Nadara, Eva Rotenberg, Marek Sokolowski
2025	B	`conf`	Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument. MFCS Romain Bourneuf, Jana Masaríková, Wojciech Nadara, Marcin Pilipczuk
2025	J	`jnl`	Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument. CoRR Romain Bourneuf, Jana Masaríková, Wojciech Nadara, Marcin Pilipczuk
2025	J	`jnl`	Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP. CoRR Adam Karczmarz, Wojciech Nadara, Marek Sokolowski
2024	A*	`conf`	Exact Shortest Paths with Rational Weights on the Word RAM. SODA Adam Karczmarz, Wojciech Nadara, Marek Sokolowski
2024	A*	`conf`	Fully dynamic approximation schemes on planar and apex-minor-free graphs. SODA Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
2023	J	`jnl`	Approximating Pathwidth for Graphs of Small Treewidth. ACM Trans. Algorithms Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
2023	A*	`conf`	Dynamic treewidth. FOCS Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
2023	J	`jnl`	Dynamic treewidth. CoRR Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
2023	J	`jnl`	Exact Shortest Paths with Rational Weights on the Word RAM. CoRR Adam Karczmarz, Wojciech Nadara, Marek Sokolowski
2023	J	`jnl`	Fully dynamic approximation schemes on planar and apex-minor-free graphs. CoRR Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
2022	A	`conf`	Computing Treedepth in Polynomial Space and Linear FPT Time. ESA Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz
2022	J	`jnl`	Computing treedepth in polynomial space and linear fpt time. CoRR Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz
2022	J	`jnl`	Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph. Electron. J. Comb. Wojciech Nadara, Marcin Smulewicz
2022	J	`jnl`	Many-visits TSP revisited. J. Comput. Syst. Sci. Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
2021	A*	`conf`	Approximating Pathwidth for Graphs of Small Treewidth. SODA Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
2021	A	`conf`	Determining 4-Edge-Connected Components in Linear Time. ESA Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski
2021	J	`jnl`	Determining 4-edge-connected components in linear time. CoRR Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski
2021	A*	`conf`	Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA 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
2021	J	`jnl`	Improved Bounds for the Excluded-Minor Approximation of Treedepth. SIAM J. Discret. Math. Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
2021	J	`jnl`	Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
2020	J	`jnl`	Approximating pathwidth for graphs of small treewidth. CoRR Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
2020	A	`conf`	Many Visits TSP Revisited. ESA Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
2020	J	`jnl`	Many visits TSP revisited. CoRR Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
2020	J	`jnl`	On Dynamic Parameterized k-Path. CoRR 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
2020	B	`conf`	The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki
2019	J	`jnl`	Decreasing maximum average degree by deleting independent set or d-degenerate subgraph. CoRR Wojciech Nadara, Marcin Smulewicz
2019	J	`jnl`	Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. ACM J. Exp. Algorithmics Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
2019	A	`conf`	Improved Bounds for the Excluded-Minor Approximation of Treedepth. ESA Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
2019	J	`jnl`	Improved bounds for the excluded-minor approximation of treedepth. CoRR Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
2019	J	`jnl`	Jones' Conjecture in subcubic graphs. CoRR Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
2018	B	`conf`	Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. SEA Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
2018	J	`jnl`	Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. CoRR Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
2018	J	`jnl`	Experimental evaluation of kernelization algorithms to Dominating Set. CoRR Wojciech Nadara