Soto, José A. (ed.); Wiese, Andreas (ed.) Latin 2024: theoretical informatics. 16th Latin American symposium, Puerto Varas, Chile, March 18–22, 2024. Proceedings. Part II. (English) Zbl 07815698 Lecture Notes in Computer Science 14579. Cham: Springer (ISBN 978-3-031-55600-5/pbk; 978-3-031-55601-2/ebook). xix, 350 p. (2024). MSC: 68-06 68Qxx 68Rxx 68Wxx 00B25 PDFBibTeX XMLCite \textit{J. A. Soto} (ed.) and \textit{A. Wiese} (ed.), Latin 2024: theoretical informatics. 16th Latin American symposium, Puerto Varas, Chile, March 18--22, 2024. Proceedings. Part II. Cham: Springer (2024; Zbl 07815698) Full Text: DOI
Soto, José A. (ed.); Wiese, Andreas (ed.) Latin 2024: theoretical informatics. 16th Latin American symposium, Puerto Varas, Chile, March 18–22, 2024. Proceedings. Part I. (English) Zbl 07815697 Lecture Notes in Computer Science 14578. Cham: Springer (ISBN 978-3-031-55597-8/pbk; 978-3-031-55598-5/ebook). xix, 352 p. (2024). MSC: 68-06 68Qxx 68Rxx 68Wxx 00B25 PDFBibTeX XMLCite \textit{J. A. Soto} (ed.) and \textit{A. Wiese} (ed.), Latin 2024: theoretical informatics. 16th Latin American symposium, Puerto Varas, Chile, March 18--22, 2024. Proceedings. Part I. Cham: Springer (2024; Zbl 07815697) Full Text: DOI
Cristi, Andrés; Mari, Mathieu; Wiese, Andreas Fixed-parameter algorithms for unsplittable flow cover. (English) Zbl 07680320 Theory Comput. Syst. 67, No. 1, 89-124 (2023). MSC: 68Qxx 68Wxx 90Cxx PDFBibTeX XMLCite \textit{A. Cristi} et al., Theory Comput. Syst. 67, No. 1, 89--124 (2023; Zbl 07680320) Full Text: DOI
Grandoni, Fabrizio; Mömke, Tobias; Wiese, Andreas A PTAS for unsplittable flow on a path. (English) Zbl 07774340 Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 289-302 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. Grandoni} et al., in: Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC '22, Rome, Italy June 20--24, 2022. New York, NY: Association for Computing Machinery (ACM). 289--302 (2022; Zbl 07774340) Full Text: DOI
Eberle, Franziska; Megow, Nicole; Nölke, Lukas; Simon, Bertrand; Wiese, Andreas Fully dynamic algorithms for knapsack problems with polylogarithmic update time. (English) Zbl 07799596 Bojańczyk, Mikołaj (ed.) et al., 41st IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2021, virtual conference, December 15–17, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 213, Article 18, 17 p. (2021). MSC: 68N30 68Qxx PDFBibTeX XMLCite \textit{F. Eberle} et al., LIPIcs -- Leibniz Int. Proc. Inform. 213, Article 18, 17 p. (2021; Zbl 07799596) Full Text: DOI arXiv
Rohwedder, Lars; Wiese, Andreas A \((2+\varepsilon)\)-approximation algorithm for preemptive weighted flow time on a single machine. (English) Zbl 07765230 Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 1042-1055 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{L. Rohwedder} and \textit{A. Wiese}, in: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC '21, virtual, Italy, June 21--25, 2021. New York, NY: Association for Computing Machinery (ACM). 1042--1055 (2021; Zbl 07765230) Full Text: DOI arXiv
Martínez-Muñoz, Tomás; Wiese, Andreas FPT and FPT-approximation algorithms for unsplittable flow on trees. (English) Zbl 07740922 Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 67, 15 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{T. Martínez-Muñoz} and \textit{A. Wiese}, LIPIcs -- Leibniz Int. Proc. Inform. 204, Article 67, 15 p. (2021; Zbl 07740922) Full Text: DOI
Grandoni, Fabrizio; Mömke, Tobias; Wiese, Andreas Faster \((1+ \varepsilon)\)-approximation for unsplittable flow on a path via resource augmentation and back. (English) Zbl 07740904 Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 49, 15 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. Grandoni} et al., LIPIcs -- Leibniz Int. Proc. Inform. 204, Article 49, 15 p. (2021; Zbl 07740904) Full Text: DOI
Gálvez, Waldo; Grandoni, Fabrizio; Ingala, Salvatore; Heydrich, Sandy; Khan, Arindam; Wiese, Andreas Approximating geometric knapsack via L-packings. (English) Zbl 07479303 ACM Trans. Algorithms 17, No. 4, Article No. 33, 67 p. (2021). MSC: 68-XX PDFBibTeX XMLCite \textit{W. Gálvez} et al., ACM Trans. Algorithms 17, No. 4, Article No. 33, 67 p. (2021; Zbl 07479303) Full Text: DOI arXiv
Henzinger, Monika; Neumann, Stefan; Wiese, Andreas Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. (English) Zbl 07760180 Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 51, 14 p. (2020). MSC: 68U05 PDFBibTeX XMLCite \textit{M. Henzinger} et al., LIPIcs -- Leibniz Int. Proc. Inform. 164, Article 51, 14 p. (2020; Zbl 07760180) Full Text: DOI arXiv
Cristi, Andrés; Wiese, Andreas Better approximations for general caching and UFP-cover under resource augmentation. (English) Zbl 07650929 Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 44, 14 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Cristi} and \textit{A. Wiese}, LIPIcs -- Leibniz Int. Proc. Inform. 154, Article 44, 14 p. (2020; Zbl 07650929) Full Text: DOI
Cristi, Andrés; Mari, Mathieu; Wiese, Andreas Fixed-parameter algorithms for unsplittable flow cover. (English) Zbl 07650927 Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 42, 17 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Cristi} et al., LIPIcs -- Leibniz Int. Proc. Inform. 154, Article 42, 17 p. (2020; Zbl 07650927) Full Text: DOI
Verdugo, Victor; Verschae, José; Wiese, Andreas Breaking symmetries to rescue sum of squares in the case of makespan scheduling. (English) Zbl 1453.90079 Math. Program. 183, No. 1-2 (B), 583-618 (2020). MSC: 90B35 68W25 90C23 90C59 PDFBibTeX XMLCite \textit{V. Verdugo} et al., Math. Program. 183, No. 1--2 (B), 583--618 (2020; Zbl 1453.90079) Full Text: DOI arXiv
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
Grandoni, Fabrizio; Wiese, Andreas Packing cars into narrow roads: PTASs for limited supply highway. (English) Zbl 07525491 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 54, 14 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. Grandoni} and \textit{A. Wiese}, LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 54, 14 p. (2019; Zbl 07525491) Full Text: DOI
Grandoni, Fabrizio; Kratsch, Stefan; Wiese, Andreas Parameterized approximation schemes for independent set of rectangles and geometric knapsack. (English) Zbl 07525490 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 53, 16 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. Grandoni} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 53, 16 p. (2019; Zbl 07525490) Full Text: DOI arXiv
Adamaszek, Anna; Har-Peled, Sariel; Wiese, Andreas Approximation schemes for independent set and sparse subsets of polygons. (English) Zbl 1473.68215 J. ACM 66, No. 4, Article No. 29, 40 p. (2019). MSC: 68W25 68R10 68U05 68W40 PDFBibTeX XMLCite \textit{A. Adamaszek} et al., J. ACM 66, No. 4, Article No. 29, 40 p. (2019; Zbl 1473.68215) Full Text: DOI arXiv
Heydrich, Sandy; Wiese, Andreas Faster approximation schemes for the two-dimensional knapsack problem. (English) Zbl 1454.68183 ACM Trans. Algorithms 15, No. 4, Article No. 47, 28 p. (2019). MSC: 68W25 68Q25 90C27 PDFBibTeX XMLCite \textit{S. Heydrich} and \textit{A. Wiese}, ACM Trans. Algorithms 15, No. 4, Article No. 47, 28 p. (2019; Zbl 1454.68183) Full Text: DOI
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
Wiese, Andreas Fixed-parameter approximation schemes for weighted flowtime. (English) Zbl 1521.68260 Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 28, 19 p. (2018). MSC: 68W25 68Q27 90B35 PDFBibTeX XMLCite \textit{A. Wiese}, LIPIcs -- Leibniz Int. Proc. Inform. 116, Article 28, 19 p. (2018; Zbl 1521.68260) Full Text: DOI
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
Adamaszek, Anna; Chalermsook, Parinya; Ene, Alina; Wiese, Andreas Submodular unsplittable flow on trees. (English) Zbl 1411.90285 Math. Program. 172, No. 1-2 (B), 565-589 (2018). MSC: 90C27 90C35 68W25 PDFBibTeX XMLCite \textit{A. Adamaszek} et al., Math. Program. 172, No. 1--2 (B), 565--589 (2018; Zbl 1411.90285) Full Text: DOI
Kurpisz, Adam; Mastrolilli, Monaldo; Mathieu, Claire; Mömke, Tobias; Verdugo, Victor; Wiese, Andreas Semidefinite and linear programming integrality gaps for scheduling identical machines. (English) Zbl 1402.90055 Math. Program. 172, No. 1-2 (B), 231-248 (2018). MSC: 90B35 68W25 90C05 90C22 PDFBibTeX XMLCite \textit{A. Kurpisz} et al., Math. Program. 172, No. 1--2 (B), 231--248 (2018; Zbl 1402.90055) Full Text: DOI
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
Das, Syamantak; Wiese, Andreas On minimizing the makespan when some jobs cannot be assigned on the same machine. (English) Zbl 1442.90071 Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 31, 14 p. (2017). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{S. Das} and \textit{A. Wiese}, LIPIcs -- Leibniz Int. Proc. Inform. 87, Article 31, 14 p. (2017; Zbl 1442.90071) 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
Antoniadis, Antonios; Hoeksma, Ruben; Meißner, Julie; Verschae, José; Wiese, Andreas A QPTAS for the general scheduling problem with identical release dates. (English) Zbl 1441.68287 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 31, 14 p. (2017). MSC: 68W25 90B35 PDFBibTeX XMLCite \textit{A. Antoniadis} et al., LIPIcs -- Leibniz Int. Proc. Inform. 80, Article 31, 14 p. (2017; Zbl 1441.68287) Full Text: DOI
Pilipczuk, Michał; van Leeuwen, Erik Jan; Wiese, Andreas Approximation and parameterized algorithms for geometric independent set with shrinking. (English) Zbl 1441.68270 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 42, 13 p. (2017). MSC: 68U05 68Q27 68W25 90C27 PDFBibTeX XMLCite \textit{M. Pilipczuk} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 42, 13 p. (2017; Zbl 1441.68270) Full Text: DOI arXiv
Grandoni, Fabrizio; Mömke, Tobias; Wiese, Andreas; Zhou, Hang To augment or not to augment: solving unsplittable flow on a path by creating slack. (English) Zbl 1411.68188 Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2411-2422 (2017). MSC: 68W25 68Q25 90B10 90C35 PDFBibTeX XMLCite \textit{F. Grandoni} et al., in: Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16--19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2411--2422 (2017; Zbl 1411.68188) Full Text: DOI
Heydrich, Sandy; Wiese, Andreas Faster approximation schemes for the two-dimensional knapsack problem. (English) Zbl 1411.68190 Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 79-98 (2017). MSC: 68W25 68Q25 90C27 PDFBibTeX XMLCite \textit{S. Heydrich} and \textit{A. Wiese}, in: Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16--19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 79--98 (2017; Zbl 1411.68190) Full Text: DOI
Lübbecke, Elisabeth; Maurer, Olaf; Megow, Nicole; Wiese, Andreas A new approach to online scheduling: approximating the optimal competitive ratio. (English) Zbl 1421.68251 ACM Trans. Algorithms 13, No. 1, Article No. 15, 34 p. (2016). MSC: 68W27 68W20 90B35 PDFBibTeX XMLCite \textit{E. Lübbecke} et al., ACM Trans. Algorithms 13, No. 1, Article No. 15, 34 p. (2016; Zbl 1421.68251) Full Text: DOI
Nadiradze, Giorgi; Wiese, Andreas On approximating strip packing with a better ratio than 3/2. (English) Zbl 1394.68442 Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-433-1). 1491-1510 (2016). MSC: 68W25 90C27 PDFBibTeX XMLCite \textit{G. Nadiradze} and \textit{A. Wiese}, in: Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10--12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1491--1510 (2016; Zbl 1394.68442) Full Text: DOI
Neumann, Stefan; Wiese, Andreas This house proves that debating is harder than soccer. (English) Zbl 1369.68245 Demaine, Erik D. (ed.) et al., 8th international conference on fun with algorithms, FUN 2016, La Maddalena, Italy, June 8–10, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-005-7). LIPIcs – Leibniz International Proceedings in Informatics 49, Article 25, 14 p. (2016). MSC: 68Q25 68Q17 68R05 PDFBibTeX XMLCite \textit{S. Neumann} and \textit{A. Wiese}, LIPIcs -- Leibniz Int. Proc. Inform. 49, Article 25, 14~p. (2016; Zbl 1369.68245) Full Text: DOI arXiv
Kurpisz, Adam; Mastrolilli, Monaldo; Mathieu, Claire; Mömke, Tobias; Verdugo, Victor; Wiese, Andreas Semidefinite and linear programming integrality gaps for scheduling identical machines. (English) Zbl 1402.90054 Louveaux, Quentin (ed.) et al., Integer programming and combinatorial optimization. 18th international conference, IPCO 2016, Liège, Belgium, June 1–3, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-33460-8/pbk; 978-3-319-33461-5/ebook). Lecture Notes in Computer Science 9682, 152-163 (2016). MSC: 90B35 68W25 90C05 90C22 PDFBibTeX XMLCite \textit{A. Kurpisz} et al., Lect. Notes Comput. Sci. 9682, 152--163 (2016; Zbl 1402.90054) Full Text: DOI
Megow, Nicole; Skutella, Martin; Verschae, José; Wiese, Andreas The power of recourse for online MST and TSP. (English) Zbl 1344.68289 SIAM J. Comput. 45, No. 3, 859-880 (2016). MSC: 68W27 90C27 90C35 PDFBibTeX XMLCite \textit{N. Megow} et al., SIAM J. Comput. 45, No. 3, 859--880 (2016; Zbl 1344.68289) Full Text: DOI Link
Wiese, Andreas Independent Set of Convex Polygons: from \(n^{\epsilon }\) to \(1+\epsilon\) via shrinking. (English) Zbl 1383.68094 Kranakis, Evangelos (ed.) et al., LATIN 2016: theoretical informatics. 12th Latin American symposium, Ensenada, Mexico, April 11–15, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-49528-5/pbk; 978-3-662-49529-2/ebook). Lecture Notes in Computer Science 9644, 700-711 (2016). MSC: 68U05 68Q25 68W25 PDFBibTeX XMLCite \textit{A. Wiese}, Lect. Notes Comput. Sci. 9644, 700--711 (2016; Zbl 1383.68094) 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 quasi-PTAS for the two-dimensional geometric knapsack problem. (English) Zbl 1371.90115 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). 1491-1505 (2015). MSC: 90C27 68W25 PDFBibTeX XMLCite \textit{A. Adamaszek} and \textit{A. Wiese}, 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). 1491--1505 (2015; Zbl 1371.90115) Full Text: DOI
Adamaszek, Anna; Chalermsook, Parinya; Wiese, Andreas How to tame rectangles: solving independent set and coloring of rectangles via shrinking. (English) Zbl 1375.68117 Garg, Naveen (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 18th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2015) and the 19th international workshop on randomization and computation (RANDOM 2015), Princeton, NJ, USA, August 24–26, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-89-7). LIPIcs – Leibniz International Proceedings in Informatics 40, 43-60 (2015). MSC: 68U05 68Q25 68W25 PDFBibTeX XMLCite \textit{A. Adamaszek} et al., LIPIcs -- Leibniz Int. Proc. Inform. 40, 43--60 (2015; Zbl 1375.68117) Full Text: DOI
Abed, Fidaa; Chalermsook, Parinya; Correa, José; Karrenbauer, Andreas; Pérez-Lantero, Pablo; Soto, José A.; Wiese, Andreas On guillotine cutting sequences. (English) Zbl 1375.68116 Garg, Naveen (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 18th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2015) and the 19th international workshop on randomization and computation (RANDOM 2015), Princeton, NJ, USA, August 24–26, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-89-7). LIPIcs – Leibniz International Proceedings in Informatics 40, 1-19 (2015). MSC: 68U05 68Q25 68W25 90C27 PDFBibTeX XMLCite \textit{F. Abed} et al., LIPIcs -- Leibniz Int. Proc. Inform. 40, 1--19 (2015; Zbl 1375.68116) Full Text: DOI
Mnich, Matthias; Wiese, Andreas Scheduling and fixed-parameter tractability. (English) Zbl 1332.68089 Math. Program. 154, No. 1-2 (B), 533-562 (2015). MSC: 68Q25 68Q17 68W05 90B35 90C10 90C27 PDFBibTeX XMLCite \textit{M. Mnich} and \textit{A. Wiese}, Math. Program. 154, No. 1--2 (B), 533--562 (2015; Zbl 1332.68089) Full Text: DOI
Mömke, Tobias; Wiese, Andreas A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem. (English) Zbl 1440.68336 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 973-984 (2015). MSC: 68W25 90C27 90C35 90C59 PDFBibTeX XMLCite \textit{T. Mömke} and \textit{A. Wiese}, Lect. Notes Comput. Sci. 9134, 973--984 (2015; Zbl 1440.68336) Full Text: DOI
Marchetti-Spaccamela, Alberto; Rutten, Cyriel; van der Ster, Suzanne; Wiese, Andreas Assigning sporadic tasks to unrelated machines. (English) Zbl 1334.68101 Math. Program. 152, No. 1-2 (A), 247-274 (2015). MSC: 68Q25 68W25 90B35 90C11 90C39 PDFBibTeX XMLCite \textit{A. Marchetti-Spaccamela} et al., Math. Program. 152, No. 1--2 (A), 247--274 (2015; Zbl 1334.68101) Full Text: DOI Link
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
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
Verschae, José; Wiese, Andreas On the configuration-LP for scheduling on unrelated machines. (English) Zbl 1305.68046 J. Sched. 17, No. 4, 371-383 (2014). MSC: 68M20 68W25 90B35 PDFBibTeX XMLCite \textit{J. Verschae} and \textit{A. Wiese}, J. Sched. 17, No. 4, 371--383 (2014; Zbl 1305.68046) Full Text: DOI
Bonsma, Paul; Schulz, Jens; Wiese, Andreas A constant-factor approximation algorithm for unsplittable flow on paths. (English) Zbl 1297.68185 SIAM J. Comput. 43, No. 2, 767-799 (2014). MSC: 68R05 68Q17 68W25 PDFBibTeX XMLCite \textit{P. Bonsma} et al., SIAM J. Comput. 43, No. 2, 767--799 (2014; Zbl 1297.68185) Full Text: DOI
Höhn, Wiebke; Mestre, Julián; Wiese, Andreas How unsplittable-flow-covering helps scheduling with job-dependent cost functions. (English) Zbl 1386.90055 Esparza, Javier (ed.) et al., Automata, languages, and programming. 41st international colloquium, ICALP 2014, Copenhagen, Denmark, July 8–11, 2014. Proceedings, Part I. Berlin: Springer (ISBN 978-3-662-43947-0/pbk). Lecture Notes in Computer Science 8572, 625-636 (2014). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{W. Höhn} et al., Lect. Notes Comput. Sci. 8572, 625--636 (2014; Zbl 1386.90055) Full Text: DOI Link
Mnich, Matthias; Wiese, Andreas Scheduling and fixed-parameter tractability. (English) Zbl 1332.68088 Lee, Jon (ed.) et al., Integer programming and combinatorial optimization. 17th international conference, IPCO 2014, Bonn, Germany, June 22–24, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-07556-3/pbk). Lecture Notes in Computer Science 8494, 381-392 (2014). MSC: 68Q25 68Q17 68W05 90B35 90C27 PDFBibTeX XMLCite \textit{M. Mnich} and \textit{A. Wiese}, Lect. Notes Comput. Sci. 8494, 381--392 (2014; Zbl 1332.68088) Full Text: DOI arXiv
Günther, Elisabeth; Maurer, Olaf; Megow, Nicole; Wiese, Andreas A new approach to online scheduling: approximating the optimal competitive ratio. (English) Zbl 1421.68247 Khanna, Sanjeev (ed.), Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6–8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 118-128 (2013). MSC: 68W27 68W20 90B35 PDFBibTeX XMLCite \textit{E. Günther} et al., in: Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6--8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 118--128 (2013; Zbl 1421.68247) Full Text: DOI arXiv
Wiese, Andreas; Bonifaci, Vincenzo; Baruah, Sanjoy Partitioned EDF scheduling on a few types of unrelated multiprocessors. (English) Zbl 1291.68098 Real-Time Syst. 49, No. 2, 219-238 (2013). MSC: 68M20 PDFBibTeX XMLCite \textit{A. Wiese} et al., Real-Time Syst. 49, No. 2, 219--238 (2013; Zbl 1291.68098) Full Text: DOI Link
Niemeier, Martin; Wiese, Andreas Scheduling with an orthogonal resource constraint. (English) Zbl 1394.68048 Erlebach, Thomas (ed.) et al., Approximation and online algorithms. 10th international workshop, WAOA 2012, Ljubljana, Slovenia, September 13–14, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-38015-0/pbk). Lecture Notes in Computer Science 7846, 242-256 (2013). MSC: 68M20 68W25 PDFBibTeX XMLCite \textit{M. Niemeier} and \textit{A. Wiese}, Lect. Notes Comput. Sci. 7846, 242--256 (2013; Zbl 1394.68048) Full Text: DOI Link
Sviridenko, Maxim; Wiese, Andreas Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines. (English) Zbl 1377.90034 Goemans, Michel (ed.) et al., Integer programming and combinatorial optimization. 16th international conference, IPCO 2013, Valparaíso, Chile, March 18–20, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36693-2/pbk). Lecture Notes in Computer Science 7801, 387-398 (2013). MSC: 90B35 68W25 90C05 PDFBibTeX XMLCite \textit{M. Sviridenko} and \textit{A. Wiese}, Lect. Notes Comput. Sci. 7801, 387--398 (2013; Zbl 1377.90034) Full Text: DOI
Megow, Nicole; Skutella, Martin; Verschae, José; Wiese, Andreas The power of recourse for online MST and TSP. (English) Zbl 1272.68472 Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 689-700 (2012). MSC: 68W27 90C27 90C35 PDFBibTeX XMLCite \textit{N. Megow} et al., Lect. Notes Comput. Sci. 7391, 689--700 (2012; Zbl 1272.68472) Full Text: DOI
Marchetti-Spaccamela, Alberto; Rutten, Cyriel; van der Ster, Suzanne; Wiese, Andreas Assigning sporadic tasks to unrelated parallel machines. (English) Zbl 1272.68069 Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 665-676 (2012). MSC: 68M20 68Q25 PDFBibTeX XMLCite \textit{A. Marchetti-Spaccamela} et al., Lect. Notes Comput. Sci. 7391, 665--676 (2012; Zbl 1272.68069) Full Text: DOI
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
Verschae, José; Wiese, Andreas On the configuration-LP for scheduling on unrelated machines. (English) Zbl 1348.90317 Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 530-542 (2011). MSC: 90B35 68W25 90C05 PDFBibTeX XMLCite \textit{J. Verschae} and \textit{A. Wiese}, Lect. Notes Comput. Sci. 6942, 530--542 (2011; Zbl 1348.90317) Full Text: DOI arXiv
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
Peis, Britta; Wiese, Andreas Universal packet routing with arbitrary bandwidths and transit times. (English) Zbl 1341.68007 Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 362-375 (2011). MSC: 68M10 68M20 68R10 PDFBibTeX XMLCite \textit{B. Peis} and \textit{A. Wiese}, Lect. Notes Comput. Sci. 6655, 362--375 (2011; Zbl 1341.68007) Full Text: DOI Link
Peis, Britta; Wiese, Andreas Throughput maximization for periodic packet routing on trees and grids. (English) Zbl 1314.68094 Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9–10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 213-224 (2011). MSC: 68M20 68W25 90B35 PDFBibTeX XMLCite \textit{B. Peis} and \textit{A. Wiese}, Lect. Notes Comput. Sci. 6534, 213--224 (2011; Zbl 1314.68094) Full Text: DOI
Stiller, Sebastian; Wiese, Andreas Increasing speed scheduling and flow scheduling. (English) Zbl 1311.90053 Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15–17, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17513-8/pbk). Lecture Notes in Computer Science 6507, 279-290 (2010). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{S. Stiller} and \textit{A. Wiese}, Lect. Notes Comput. Sci. 6507, 279--290 (2010; Zbl 1311.90053) Full Text: DOI Link
Peis, Britta; Stiller, Sebastian; Wiese, Andreas Policies for periodic packet routing. (English) Zbl 1310.68049 Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15–17, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17513-8/pbk). Lecture Notes in Computer Science 6507, 266-278 (2010). MSC: 68M20 90B35 PDFBibTeX XMLCite \textit{B. Peis} et al., Lect. Notes Comput. Sci. 6507, 266--278 (2010; Zbl 1310.68049) Full Text: DOI
Eisenbrand, Friedrich; Hähnle, Nicolai; Niemeier, Martin; Skutella, Martin; Verschae, José; Wiese, Andreas Scheduling periodic tasks in a hard real-time environment. (English) Zbl 1288.90026 Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 299-311 (2010). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{F. Eisenbrand} et al., Lect. Notes Comput. Sci. 6198, 299--311 (2010; Zbl 1288.90026) Full Text: DOI Link
Peis, Britta; Skutella, Martin; Wiese, Andreas Packet routing: complexity and algorithms. (English) Zbl 1284.68093 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10–11, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-12449-5/pbk). Lecture Notes in Computer Science 5893, 217-228 (2010). MSC: 68M20 68Q25 68R10 68W25 PDFBibTeX XMLCite \textit{B. Peis} et al., Lect. Notes Comput. Sci. 5893, 217--228 (2010; Zbl 1284.68093) Full Text: DOI Link
Peis, Britta; Skutella, Martin; Wiese, Andreas Packet routing on the grid. (English) Zbl 1283.68272 López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 120-130 (2010). MSC: 68R10 68M12 68M14 68M20 PDFBibTeX XMLCite \textit{B. Peis} et al., Lect. Notes Comput. Sci. 6034, 120--130 (2010; Zbl 1283.68272) 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
Bhattacharya, Binay; Burmester, Mike; Hu, Yuzhuang; Kranakis, Evangelos; Shi, Qiaosheng; Wiese, Andreas Optimal movement of mobile sensors for barrier coverage of a planar region. (English) Zbl 1192.68816 Theor. Comput. Sci. 410, No. 52, 5515-5528 (2009). MSC: 68W05 68U05 PDFBibTeX XMLCite \textit{B. Bhattacharya} et al., Theor. Comput. Sci. 410, No. 52, 5515--5528 (2009; Zbl 1192.68816) Full Text: DOI
Koch, Ronald; Peis, Britta; Skutella, Martin; Wiese, Andreas Real-time message routing and scheduling. (English) Zbl 1255.68047 Dinur, Irit (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03684-2/pbk). Lecture Notes in Computer Science 5687, 217-230 (2009). MSC: 68M20 68R10 PDFBibTeX XMLCite \textit{R. Koch} et al., Lect. Notes Comput. Sci. 5687, 217--230 (2009; Zbl 1255.68047) Full Text: DOI Link
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 Impact of locality on location aware unit disk graphs. (English) Zbl 1445.90053 Algorithms (Basel) 1, No. 1, 2-29 (2008). MSC: 90B80 68M10 90B18 PDFBibTeX XMLCite \textit{A. Wiese} and \textit{E. Kranakis}, Algorithms (Basel) 1, No. 1, 2--29 (2008; Zbl 1445.90053) Full Text: DOI
Bhattacharya, B.; Burmester, B.; Hu, Y.; Kranakis, E.; Shi, Q.; Wiese, A. Optimal movement of mobile sensors for barrier coverage of a planar region. (Extended abstract). (English) Zbl 1168.68589 Yang, Boting (ed.) et al., Combinatorial optimization and applications. Second international conference, COCOA 2008, St. John’s, NL, Canada, August 21–24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85096-0/pbk). Lecture Notes in Computer Science 5165, 103-115 (2008). MSC: 68U05 PDFBibTeX XMLCite \textit{B. Bhattacharya} et al., Lect. Notes Comput. Sci. 5165, 103--115 (2008; Zbl 1168.68589) 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