Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Anna Zych

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Bartlomiej Bosek

> Home > Persons > Anna Zych

Publications

2022
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/BosekLSZ22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BosekLSZ22
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]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/esa/BosekZ22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/BosekZ22
Bartlomiej Bosek, Anna Zych-Pawlewicz:
Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget. ESA 2022: 25:1-25:14
[i9]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2202-08006
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2202-08006
Bartlomiej Bosek, Anna Zych-Pawlewicz:
Recoloring Unit Interval Graphs with Logarithmic Recourse Budget. CoRR abs/2202.08006 (2022)
2020
[c15]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/swat/BosekDFPZ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/swat/BosekDFPZ20
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
2018
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/mst/BosekLSZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/BosekLSZ18
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)
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/latin/BosekLSZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/BosekLSZ18
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
A Tight Bound for Shortest Augmenting Paths on Trees. LATIN 2018: 201-216
2017
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BosekLZS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BosekLZS17
Bartlomiej Bosek, Dariusz Leniowski, Anna Zych, Piotr Sankowski:
The Shortest Augmenting Paths for Online Matchings on Trees. CoRR abs/1704.02093 (2017)
2015
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/waoa/BosekLSZ15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/waoa/BosekLSZ15
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych:
Shortest Augmenting Paths for Online Matchings on Trees. WAOA 2015: 59-71
2014
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/BosekLSZ14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/BosekLSZ14
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych:
Online Bipartite Matching in Offline Time. FOCS 2014: 384-393

a service of

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.