#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2006

2015

- This year (0)
- Last 5 years (6)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Davide Bilò, Peter Widmayer, Anna Zych
- WAOA
- 2008

- Davide Bilò, Hans-Joachim Böckenhauer, +4 authors Anna Zych
- SWAT
- 2008

- Davide Bilò, Hans-Joachim Böckenhauer, +4 authors Anna Zych
- Algorithmica
- 2009

A reoptimization problem describes the following scenario: given an instance of an optimization problem together with an optimal solution for it, we want to find a good solution for a locally modified instance. In this paper, we deal with reoptimization variants of the shortest common superstring problem (SCS) where the local modifications consist of adding… (More)

- Anna Zych, Milan Petkovic, Willem Jonker
- Computer Standards & Interfaces
- 2008

Available online 8 March 2008 Cryptographic enforcement of access control mechanisms relies on encrypting protected data with the keys stored by authorized users. This approach poses the problem of the distribution of secret keys. In this paper, a key management scheme is presented where each user stores a single key and is capable of efficiently… (More)

- Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych
- 2014 IEEE 55th Annual Symposium on Foundations of…
- 2014

This paper investigates the problem of maintaining maximum size matchings in incremental bipartite graphs. In this problem a bipartite graph G between n clients and n servers is revealed online. The clients arrive in an arbitrary order and request to be matched to a subset of servers. In our model we allow the clients to switch between servers and want to… (More)

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

We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization, and routingin-rounds problem. Although all considered variants are NP-hard in planar graphs, restrictions on the location of the terminals, motivated by railway applications,… (More)

- Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych
- STOC
- 2015

In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an n-vertex graph G=(V,E,w) with positive real edge weights, and our goal is to maintain a tree which is a good approximation of the minimum Steiner tree spanning a terminal set S ⊆ V, which changes over time. The changes applied… (More)

- Davide Bilò, Anna Zych
- MFCS
- 2012

- Anna Zych, Milan Petkovic, Willem Jonker
- WOSIS
- 2007

This paper describes a key management method for cryptographically enforced access control. In particular, we propose an algorithm that based on the containment relation transforms an arbitrary access control matrix into a hierarchy, to which public private key pairs are assigned based on the DiffieHellman key generation scheme. Therefore, the users have to… (More)

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