default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Zych
Person information
- affiliation: University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz:
A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP. ESA 2024: 15:1-15:15- [c22]Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz:
Parameterized Dynamic Data Structure for Split Completion. ESA 2024: 87:1-87:17 - [i12]Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz:
Parameterized dynamic data structure for Split Completion. CoRR abs/2402.08816 (2024) - [i11]Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz:
A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP. CoRR abs/2402.13938 (2024) - [i10]Anna Zych-Pawlewicz, Marek Zochowski:
Dynamic Parameterized Feedback Problems in Tournaments. CoRR abs/2404.12907 (2024) - 2023
- [c21]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: 1433-1463 - [c20]Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz:
Dynamic Data Structures for Parameterized String Problems. STACS 2023: 50:1-50:22 - 2022
- [j7]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
A tight bound for shortest augmenting paths on trees. Theor. Comput. Sci. 901: 45-61 (2022) - [c19]Bartlomiej Bosek, Anna Zych-Pawlewicz:
Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget. ESA 2022: 25:1-25:14 - [c18]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: 5:1-5:23 - [c17]Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz:
Compact Representation for Matrices of Bounded Twin-Width. STACS 2022: 52:1-52:14 - [i9]Bartlomiej Bosek, Anna Zych-Pawlewicz:
Recoloring Unit Interval Graphs with Logarithmic Recourse Budget. CoRR abs/2202.08006 (2022) - [i8]Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz:
Dynamic data structures for parameterized string problems. CoRR abs/2205.00441 (2022) - [i7]Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz:
On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. CoRR abs/2208.14132 (2022) - [i6]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 abs/2209.08904 (2022) - 2021
- [c16]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: 796-809 - [i5]Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz:
Compact representation for matrices of bounded twin-width. CoRR abs/2110.08106 (2021) - 2020
- [c15]Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz:
Recoloring Interval Graphs with Limited Recourse Budget. SWAT 2020: 17:1-17:23 - [i4]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 abs/2006.00571 (2020)
2010 – 2019
- 2019
- [j6]Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz:
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. Algorithmica 81(10): 4029-4042 (2019) - 2018
- [j5]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
Shortest Augmenting Paths for Online Matchings on Trees. Theory Comput. Syst. 62(2): 337-348 (2018) - [c14]Anna Zych-Pawlewicz:
Reoptimization of NP-Hard Problems. Adventures Between Lower Bounds and Higher Altitudes 2018: 477-494 - [c13]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
A Tight Bound for Shortest Augmenting Paths on Trees. LATIN 2018: 201-216 - 2017
- [c12]Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz:
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. IPEC 2017: 24:1-24:11 - [i3]Bartlomiej Bosek, Dariusz Leniowski, Anna Zych, Piotr Sankowski:
The Shortest Augmenting Paths for Online Matchings on Trees. CoRR abs/1704.02093 (2017) - [i2]Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz:
An exponential lower bound for cut sparsifiers in planar graphs. CoRR abs/1706.06086 (2017) - 2015
- [j4]Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych, Yusuke Kobayashi, Anita Schöbel:
Selecting vertex disjoint paths in plane graphs. Networks 66(2): 136-144 (2015) - [c11]Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych:
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree. STOC 2015: 11-20 - [c10]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych:
Shortest Augmenting Paths for Online Matchings on Trees. WAOA 2015: 59-71 - 2014
- [c9]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych:
Online Bipartite Matching in Offline Time. FOCS 2014: 384-393 - 2013
- [i1]Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych:
Dynamic Steiner Tree in Planar Graphs. CoRR abs/1308.3336 (2013) - 2012
- [b1]Anna Zych:
Reoptimization of NP-hard Problems. ETH Zurich, Zürich, Switzerland, 2012 - [c8]Davide Bilò, Anna Zych:
New Advances in Reoptimizing the Minimum Steiner Tree Problem. MFCS 2012: 184-197 - 2011
- [j3]Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych:
Reoptimization of the Shortest Common Superstring Problem. Algorithmica 61(2): 227-251 (2011) - [j2]Anna Zych, Davide Bilò:
New Reoptimization Techniques applied to Steiner Tree Problem. Electron. Notes Discret. Math. 37: 387-392 (2011) - [c7]Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych:
Maximum Independent Set in 2-Direction Outersegment Graphs. WG 2011: 155-166 - 2010
- [c6]Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych:
Vertex Disjoint Paths for Dispatching in Railways. ATMOS 2010: 61-73
2000 – 2009
- 2009
- [c5]Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych:
Reoptimization of the Shortest Common Superstring Problem. CPM 2009: 78-91 - 2008
- [j1]Anna Zych, Milan Petkovic, Willem Jonker:
Efficient key management for cryptographically enforced access control. Comput. Stand. Interfaces 30(6): 410-417 (2008) - [c4]Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych:
Reoptimization of Steiner Trees. SWAT 2008: 258-269 - [c3]Davide Bilò, Peter Widmayer, Anna Zych:
Reoptimization of Weighted Graph and Covering Problems. WAOA 2008: 201-213 - 2007
- [c2]Anna Zych, Milan Petkovic, Willem Jonker:
The Interval Revocation Scheme for Broadcasting Messages to Stateless Receivers. DBSec 2007: 95-97 - [c1]Anna Zych, Milan Petkovic, Willem Jonker:
A Key Management Method for Cryptographically Enforced Access Control. WOSIS 2007: 9-22
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 01:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
