Pilipczuk, Michał; van Leeuwen, Erik Jan; Wiese, Andreas Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. (English) Zbl 1433.68307 Algorithmica 82, No. 6, 1703-1739 (2020). MSC: 68R10 05C10 05C69 05C70 05C85 68U05 68W25 PDFBibTeX XMLCite \textit{M. Pilipczuk} et al., Algorithmica 82, No. 6, 1703--1739 (2020; Zbl 1433.68307) Full Text: DOI Link
Höhn, Wiebke; Mestre, Julián; Wiese, Andreas How unsplittable-flow-covering helps scheduling with job-dependent cost functions. (English) Zbl 1390.90314 Algorithmica 80, No. 4, 1191-1213 (2018). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{W. Höhn} et al., Algorithmica 80, No. 4, 1191--1213 (2018; Zbl 1390.90314) Full Text: DOI arXiv Link
Wiese, Andreas Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking. (English) Zbl 1390.68733 Algorithmica 80, No. 3, 918-934 (2018). MSC: 68U05 68Q25 68R10 68W25 PDFBibTeX XMLCite \textit{A. Wiese}, Algorithmica 80, No. 3, 918--934 (2018; Zbl 1390.68733) Full Text: DOI
Niemeier, Martin; Wiese, Andreas Scheduling with an orthogonal resource constraint. (English) Zbl 1325.68038 Algorithmica 71, No. 4, 837-858 (2015). MSC: 68M20 68W25 90B35 PDFBibTeX XMLCite \textit{M. Niemeier} and \textit{A. Wiese}, Algorithmica 71, No. 4, 837--858 (2015; Zbl 1325.68038) Full Text: DOI Link