List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| A tight bound for shortest augmenting paths on trees Theoretical Computer Science | 2022-01-18 | Paper |
| scientific article; zbMATH DE number 7378709 (Why is no real title available?) (available as arXiv preprint) | 2021-08-04 | Paper |
| Fully Dynamic k-Center Clustering in Low Dimensional Metrics 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
| Dynamic clustering to minimize the sum of radii Algorithmica | 2020-10-21 | Paper |
| Dynamic clustering to minimize the sum of radii (available as arXiv preprint) | 2020-05-27 | Paper |
| A tight bound for shortest augmenting paths on trees LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
| Shortest augmenting paths for online matchings on trees Theory of Computing Systems | 2018-04-12 | Paper |
| Shortest augmenting paths for online matchings on trees Lecture Notes in Computer Science | 2016-02-26 | Paper |
| The ring design game with fair cost allocation Theoretical Computer Science | 2014-12-02 | Paper |
Research outcomes over time
This page was built for person: Dariusz Leniowski
