Publications

Anna Zych-Pawlewicz

Number of publications: 15

2024

• Julia Baligacs, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz , A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP, 32nd Annual European Symposium on Algorithms, London, the United Kingdom of Great Britain and Northern Ireland, 2 September 2024 - 4 September 2024. See in PBN
• Konrad Majewski , Michał Pilipczuk , Anna Zych-Pawlewicz , Parameterized Dynamic Data Structure for Split Completion, 32nd Annual European Symposium on Algorithms, London, the United Kingdom of Great Britain and Northern Ireland, 2 September 2024 - 4 September 2024. See in PBN

2023

• Jędrzej Olkowski, Michał Pilipczuk , Mateusz Rychlicki, Karol Węgrzycki, Anna Zych-Pawlewicz , Dynamic Data Structures for Parameterized String Problems, 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 7 March 2023 - 9 March 2023. See in PBN
• 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, 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florencja, Italy, 22 January 2023 - 25 January 2023. See in PBN

2022

• Anna Zych-Pawlewicz , Piotr Sankowski , Dariusz Leniowski, Bartłomiej Bosek, A tight bound for shortest augmenting paths on trees, Theoretical Computer Science, 901 2022, p. 45-61. See in PBN
• Michał Pilipczuk , Marek Sokołowski , Anna Zych-Pawlewicz , Compact Representation for Matrices of Bounded Twin-Width, 39th International Symposium on Theoretical Aspects of Computer Science, Marseille, France, 15 April 2022 - 18 April 2022, 219 (52) 2022, p. 1-14. See in PBN
• Bartłomiej Bosek, Anna Zych-Pawlewicz , Dynamic coloring of unit interval graphs with limited recourse budget, 30TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS, Berlin/Potsdam, Germany, 5 September 2022 - 7 September 2022. See in PBN
• Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz , On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension, 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, Poczdam, Germany, 7 September 2022 - 9 September 2022. See in PBN

2021

• Jiehua Chen, Wojciech Czerwiński , Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara , Marcin Pilipczuk , Michał Pilipczuk , Manuel Sorge, Bartłomiej Wróblewski, Anna Zych-Pawlewicz , Efficient fully dynamic elimination forests with applications to detecting long paths and cycles, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 January 2021 - 13 January 2021. See in PBN

2020

• Bartłomiej Bosek, Yann Disser, Andreas Emil, Jakub Pawlewicz , Anna Zych-Pawlewicz , Recoloring interval graphs with limited recourse budget, Leibniz International Proceedings in Informatics, LIPIcs, 17th Scandinavian Symposium and Workshops on Algorithm Theory, Torshavn, the Faroe Islands, 22 June 2020 - 24 June 2020. See in PBN

2019

• Nikolai Karpov, Marcin Pilipczuk , Anna Zych-Pawlewicz , An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs, Algorithmica, 81 (10) 2019, p. 4029-4042. See in PBN

2018

• Nikolai Karpov, Marcin Pilipczuk , Anna Zych-Pawlewicz , An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs, 12th International Symposium on Parameterized and Exact Computation, Vienna, Austria, 6 September 2017 - 8 September 2017. See in PBN
• Bartłomiej Bosek, Dariusz Leniowski, Anna Zych-Pawlewicz , Piotr Sankowski , Shortest augmenting paths for online matchings on trees, Theory of Computing Systems, 62 (2) 2018, p. 337-348. See in PBN

2015

• Jakub Oćwieja, Marcin Pilipczuk , Piotr Sankowski , Anna Zych-Pawlewicz , Jakub Łącki, The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree, Forty-Seventh Annual ACM on Symposium on Theory of Computing, Portland, the United States of America, 14 June 2015 - 17 June 2015. See in PBN

2014

• Dariusz Leniowski, Piotr Sankowski , Anna Zych-Pawlewicz , Bartłomiej Bosek, Online Bipartite Matching in Offline Time, 55th IEEE Symposium on Foundations of Computer Science (FOCS14), Filadelfia, the United States of America, 18 October 2014 - 21 October 2014. See in PBN