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
Pilipczuk, Michal; van Leeuwen, Erik Jan; Wiese, Andreas Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. (English) Zbl 1524.68239 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 65, 13 p. (2018). MSC: 68R10 05C10 05C69 05C70 05C85 68U05 68W25 PDFBibTeX XMLCite \textit{M. Pilipczuk} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 65, 13 p. (2018; Zbl 1524.68239) Full Text: DOI arXiv
Grandoni, Fabrizio; Mömke, Tobias; Wiese, Andreas; Zhou, Hang A \((5/3+\varepsilon)\)-approximation for unsplittable flow on a path: placing small tasks into boxes. (English) Zbl 1422.68298 Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 607-619 (2018). MSC: 68W25 05C21 68R10 90C35 90C59 PDFBibTeX XMLCite \textit{F. Grandoni} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 607--619 (2018; Zbl 1422.68298) Full Text: DOI
Anagnostopoulos, Aris; Grandoni, Fabrizio; Leonardi, Stefano; Wiese, Andreas A mazing \(2+\epsilon\) approximation for unsplittable flow on a path. (English) Zbl 1422.68278 ACM Trans. Algorithms 14, No. 4, Article No. 55, 23 p. (2018). MSC: 68W25 05C21 68R10 90C35 90C59 PDFBibTeX XMLCite \textit{A. Anagnostopoulos} et al., ACM Trans. Algorithms 14, No. 4, Article No. 55, 23 p. (2018; Zbl 1422.68278) Full Text: DOI
Wiese, Andreas A \((1+\varepsilon)\)-approximation for unsplittable flow on a path in fixed-parameter running time. (English) Zbl 1441.68291 Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 67, 13 p. (2017). MSC: 68W25 05C21 68Q27 68W40 90C27 PDFBibTeX XMLCite \textit{A. Wiese}, LIPIcs -- Leibniz Int. Proc. Inform. 80, Article 67, 13 p. (2017; Zbl 1441.68291) Full Text: DOI
Batra, Jatin; Garg, Naveen; Kumar, Amit; Mömke, Tobias; Wiese, Andreas New approximation schemes for unsplittable flow on a path. (English) Zbl 1372.68296 Indyk, Piotr (ed.), Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4–6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-374-7; 978-1-61197-373-0/ebook). 47-58 (2015). MSC: 68W25 05C21 05C85 PDFBibTeX XMLCite \textit{J. Batra} et al., in: Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4--6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 47--58 (2015; Zbl 1372.68296) Full Text: DOI
Adamaszek, Anna; Wiese, Andreas A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices. (English) Zbl 1422.68229 Chekuri, Chandra (ed.), Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5–7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 645-656 (2014). MSC: 68U05 05C69 68R10 68W25 68W40 PDFBibTeX XMLCite \textit{A. Adamaszek} and \textit{A. Wiese}, in: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5--7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 645--656 (2014; Zbl 1422.68229) Full Text: DOI arXiv
Anagnostopoulos, Aris; Grandoni, Fabrizio; Leonardi, Stefano; Wiese, Andreas A mazing \(2+\varepsilon\) approximation for unsplittable flow on a path. (English) Zbl 1422.68279 Chekuri, Chandra (ed.), Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5–7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 26-41 (2014). MSC: 68W25 05C21 68R10 90C35 90C59 PDFBibTeX XMLCite \textit{A. Anagnostopoulos} et al., in: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5--7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 26--41 (2014; Zbl 1422.68279) Full Text: DOI arXiv
Bonsma, Paul; Schulz, Jens; Wiese, Andreas A constant factor approximation algorithm for unsplittable flow on paths. (English) Zbl 1292.68162 Ostrovsky, Rafail (ed.), Proceedings of the 2011 IEEE 52nd annual symposium on foundations of computer science – FOCS 2011, Palm Springs, CA, USA, October 22–25. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-4571-4; 978-1-4577-1843-4/ebook). 47-56 (2011). MSC: 68W25 90C35 05C85 05C82 PDFBibTeX XMLCite \textit{P. Bonsma} et al., in: Proceedings of the 2011 IEEE 52nd annual symposium on foundations of computer science -- FOCS 2011, Palm Springs, CA, USA, October 22--25. Los Alamitos, CA: IEEE Computer Society. 47--56 (2011; Zbl 1292.68162) Full Text: DOI
Hassinen, Marja; Kaasinen, Joel; Kranakis, Evangelos; Polishchuk, Valentin; Suomela, Jukka; Wiese, Andreas Analysing local algorithms in location-aware quasi-unit-disk graphs. (English) Zbl 1228.05273 Discrete Appl. Math. 159, No. 15, 1566-1580 (2011). MSC: 05C85 PDFBibTeX XMLCite \textit{M. Hassinen} et al., Discrete Appl. Math. 159, No. 15, 1566--1580 (2011; Zbl 1228.05273) Full Text: DOI
Kanj, Iyad A.; Wiese, Andreas; Zhang, Fenghui Local algorithms for edge colorings in UDGs. (English) Zbl 1223.68082 Theor. Comput. Sci. 412, No. 35, 4704-4714 (2011). MSC: 68R10 05C15 68W25 68W10 PDFBibTeX XMLCite \textit{I. A. Kanj} et al., Theor. Comput. Sci. 412, No. 35, 4704--4714 (2011; Zbl 1223.68082) Full Text: DOI
Kanj, Iyad A.; Wiese, Andreas; Zhang, Fenghui Local algorithms for edge colorings in UDGs. (English) Zbl 1273.68279 Paul, Christophe (ed.) et al., Graph-theoretic concepts in computer science. 35th international workshop, WG 2009, Montpellier, France, June 24–26, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11408-3/pbk). Lecture Notes in Computer Science 5911, 202-213 (2010). MSC: 68R10 05C15 05C85 PDFBibTeX XMLCite \textit{I. A. Kanj} et al., Lect. Notes Comput. Sci. 5911, 202--213 (2010; Zbl 1273.68279) Full Text: DOI
Wiese, Andreas; Kranakis, Evangelos Local construction and coloring of spanners of location aware unit disk graphs. (English) Zbl 1194.05046 Discrete Math. Algorithms Appl. 1, No. 4, 555-588 (2009). MSC: 05C15 05C85 68W25 68W15 PDFBibTeX XMLCite \textit{A. Wiese} and \textit{E. Kranakis}, Discrete Math. Algorithms Appl. 1, No. 4, 555--588 (2009; Zbl 1194.05046) Full Text: DOI
Wiese, Andreas; Kranakis, Evangelos Local PTAS for dominating and connected dominating set in location aware unit disk graphs. (English) Zbl 1209.68655 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18–19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-93979-5/pbk). Lecture Notes in Computer Science 5426, 227-240 (2009). MSC: 68W25 05C69 05C85 PDFBibTeX XMLCite \textit{A. Wiese} and \textit{E. Kranakis}, Lect. Notes Comput. Sci. 5426, 227--240 (2009; Zbl 1209.68655) Full Text: DOI
Wiese, Andreas; Kranakis, Evangelos Local construction and coloring of spanners of location aware unit disk graphs (extended abstract). (English) Zbl 1202.05048 Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 372-383 (2008). MSC: 05C15 05C05 05C62 68R10 68W25 PDFBibTeX XMLCite \textit{A. Wiese} and \textit{E. Kranakis}, Lect. Notes Comput. Sci. 5344, 372--383 (2008; Zbl 1202.05048) Full Text: DOI