Anna Zych

According to our database, Anna Zych authored at least 30 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP.

Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz

CoRR, 2024

Parameterized dynamic data structure for Split Completion.

Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz

CoRR, 2024

2023

Dynamic Data Structures for Parameterized String Problems.

Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours.

François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

A tight bound for shortest augmenting paths on trees.

Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz

Theor. Comput. Sci., 2022

Recoloring Unit Interval Graphs with Logarithmic Recourse Budget.

Bartlomiej Bosek, Anna Zych-Pawlewicz

CoRR, 2022

Compact Representation for Matrices of Bounded Twin-Width.

Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension.

Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget.

Bartlomiej Bosek, Anna Zych-Pawlewicz

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.

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

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

On Dynamic Parameterized k-Path.

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

CoRR, 2020

Recoloring Interval Graphs with Limited Recourse Budget.

Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019

An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs.

Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz

Algorithmica, 2019

2018

Shortest Augmenting Paths for Online Matchings on Trees.

Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz

Theory Comput. Syst., 2018

Reoptimization of NP-Hard Problems.

Anna Zych-Pawlewicz

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2015

Selecting vertex disjoint paths in plane graphs.

Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych, Yusuke Kobayashi, Anita Schöbel

Networks, 2015

The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree.

Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014

Online Bipartite Matching in Offline Time.

Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

Dynamic Steiner Tree in Planar Graphs.

Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych

CoRR, 2013

2012

Reoptimization of NP-hard Problems.

Anna Zych

PhD thesis, 2012

New Advances in Reoptimizing the Minimum Steiner Tree Problem.

Davide Bilò, Anna Zych

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

New Reoptimization Techniques applied to Steiner Tree Problem.

Anna Zych, Davide Bilò

Electron. Notes Discret. Math., 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

Maximum Independent Set in 2-Direction Outersegment Graphs.

Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010

Vertex Disjoint Paths for Dispatching in Railways.

Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych

Proceedings of the ATMOS 2010, 2010

2008

Efficient key management for cryptographically enforced access control.

Anna Zych, Milan Petkovic, Willem Jonker

Comput. Stand. Interfaces, 2008

Reoptimization of Weighted Graph and Covering Problems.

Davide Bilò, Peter Widmayer, Anna Zych

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Reoptimization of Steiner Trees.

Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych

Proceedings of the Algorithm Theory, 2008

2007

A Key Management Method for Cryptographically Enforced Access Control.

Anna Zych, Milan Petkovic, Willem Jonker

Proceedings of the Security in Information Systems, 2007

The Interval Revocation Scheme for Broadcasting Messages to Stateless Receivers.

Anna Zych, Milan Petkovic, Willem Jonker

Proceedings of the Data and Applications Security XXI, 2007