Anna Zych-Pawlewicz

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 23

Top Topics

Approximation Schemes

Top Venues

Publications

Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz
A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP. CoRR (2024)
Anna Zych-Pawlewicz, Marek Zochowski
Dynamic Parameterized Feedback Problems in Tournaments. CoRR (2024)
Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz
Parameterized dynamic data structure for Split Completion. CoRR (2024)
François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. SODA (2023)
Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz
Dynamic Data Structures for Parameterized String Problems. STACS (2023)
Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz
Dynamic data structures for parameterized string problems. CoRR (2022)
Bartlomiej Bosek, Anna Zych-Pawlewicz
Recoloring Unit Interval Graphs with Logarithmic Recourse Budget. CoRR (2022)
Bartlomiej Bosek, Anna Zych-Pawlewicz
Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget. ESA (2022)
François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. CoRR (2022)
Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz
On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. CoRR (2022)
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
A tight bound for shortest augmenting paths on trees. Theor. Comput. Sci. 901 (2022)
Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz
Compact Representation for Matrices of Bounded Twin-Width. STACS (2022)
Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz
On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. IPEC (2022)
Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz
Compact representation for matrices of bounded twin-width. CoRR (2021)
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
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA (2021)
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
On Dynamic Parameterized k-Path. CoRR (2020)
Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz
Recoloring Interval Graphs with Limited Recourse Budget. SWAT (2020)
Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. Algorithmica 81 (10) (2019)
Anna Zych-Pawlewicz
Reoptimization of NP-Hard Problems. Adventures Between Lower Bounds and Higher Altitudes (2018)
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
A Tight Bound for Shortest Augmenting Paths on Trees. LATIN (2018)
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
Shortest Augmenting Paths for Online Matchings on Trees. Theory Comput. Syst. 62 (2) (2018)
Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz
An exponential lower bound for cut sparsifiers in planar graphs. CoRR (2017)
Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. IPEC (2017)