Anna Zych-Pawlewicz

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