The Interval Revocation Scheme for Broadcasting Messages to Stateless Receivers. - Anna Zych; Milan Petkovic; Willem Jonker (DBSec, 2007)

A Key Management Method for Cryptographically Enforced Access Control. - Anna Zych; Milan Petkovic; Willem Jonker (WOSIS, 2007)

Reoptimization of Steiner Trees. - Davide Bilò; Hans-Joachim Böckenhauer; Juraj Hromkovic; Richard Královic; Tobias Mömke; Peter Widmayer; Anna Zych (SWAT, 2008)

Reoptimization of Weighted Graph and Covering Problems. - Davide Bilò; Peter Widmayer; Anna Zych (WAOA, 2008)

Efficient key management for cryptographically enforced access control. - Anna Zych; Milan Petkovic; Willem Jonker (Comput. Stand. Interfaces, 2008)

Vertex Disjoint Paths for Dispatching in Railways. - Holger Flier; Matús Mihalák; Anita Schöbel; Peter Widmayer; Anna Zych (ATMOS, 2010)

Maximum Independent Set in 2-Direction Outersegment Graphs. - Holger Flier; Matús Mihalák; Peter Widmayer; Anna Zych (WG, 2011)

Reoptimization of the Shortest Common Superstring Problem. - Davide Bilò; Hans-Joachim Böckenhauer; Dennis Komm; Richard Královic; Tobias Mömke; Sebastian Seibert; Anna Zych (Algorithmica, 2011)

New Reoptimization Techniques applied to Steiner Tree Problem. - Anna Zych; Davide Bilò (Electron. Notes Discret. Math., 2011)

New Advances in Reoptimizing the Minimum Steiner Tree Problem. - Davide Bilò; Anna Zych (MFCS, 2012)

Reoptimization of NP-hard Problems. - Anna Zych (2012)

Dynamic Steiner Tree in Planar Graphs. - Jakub Lacki; Jakub Ocwieja; Marcin Pilipczuk; Piotr Sankowski; Anna Zych (CoRR, 2013)

Online Bipartite Matching in Offline Time. - Bartlomiej Bosek; Dariusz Leniowski; Piotr Sankowski; Anna Zych (FOCS, 2014)

The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree. - Jakub Lacki; Jakub Ocwieja; Marcin Pilipczuk; Piotr Sankowski; Anna Zych (STOC, 2015)

Selecting vertex disjoint paths in plane graphs. - Holger Flier; Matús Mihalák; Peter Widmayer; Anna Zych; Yusuke Kobayashi 001; Anita Schöbel (Networks, 2015)

Reoptimization of NP-Hard Problems. - Anna Zych-Pawlewicz (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Shortest Augmenting Paths for Online Matchings on Trees. - Bartlomiej Bosek; Dariusz Leniowski; Piotr Sankowski; Anna Zych-Pawlewicz (Theory Comput. Syst., 2018)

An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. - Nikolai Karpov; Marcin Pilipczuk; Anna Zych-Pawlewicz (Algorithmica, 2019)

Recoloring Interval Graphs with Limited Recourse Budget. - Bartlomiej Bosek; Yann Disser; Andreas Emil Feldmann; Jakub Pawlewicz; Anna Zych-Pawlewicz (SWAT, 2020)

On Dynamic Parameterized k-Path. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Michal Pilipczuk; Marcin Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (CoRR, 2020)

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (SODA, 2021)

Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget. - Bartlomiej Bosek; Anna Zych-Pawlewicz (ESA, 2022)

On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. - Johannes Blum 001; Yann Disser; Andreas Emil Feldmann; Siddharth Gupta 002; Anna Zych-Pawlewicz (IPEC, 2022)

Compact Representation for Matrices of Bounded Twin-Width. - Michal Pilipczuk; Marek Sokolowski 001; Anna Zych-Pawlewicz (STACS, 2022)

Recoloring Unit Interval Graphs with Logarithmic Recourse Budget. - Bartlomiej Bosek; Anna Zych-Pawlewicz (CoRR, 2022)

A tight bound for shortest augmenting paths on trees. - Bartlomiej Bosek; Dariusz Leniowski; Piotr Sankowski; Anna Zych-Pawlewicz (Theor. Comput. Sci., 2022)

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. - François Dross; Krzysztof Fleszar 001; Karol Wegrzycki; Anna Zych-Pawlewicz (SODA, 2023)

Dynamic Data Structures for Parameterized String Problems. - Jedrzej Olkowski; Michal Pilipczuk; Mateusz Rychlicki; Karol Wegrzycki; Anna Zych-Pawlewicz (STACS, 2023)

A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP. - Júlia Baligács; Yann Disser; Andreas Emil Feldmann; Anna Zych-Pawlewicz (ESA, 2024)

Parameterized Dynamic Data Structure for Split Completion. - Konrad Majewski; Michal Pilipczuk; Anna Zych-Pawlewicz (ESA, 2024)

Dynamic Parameterized Feedback Problems in Tournaments. - Anna Zych-Pawlewicz; Marek Zochowski (IPEC, 2024)

Fair Vertex Problems Parameterized by Cluster Vertex Deletion. - Tomás Masarík; Jedrzej Olkowski; Anna Zych-Pawlewicz (CoRR, 2025)