Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Andreas Wiese
@inproceedings{DBLP:conf/soda/BuchemERW24,
author = {Moritz Buchem and
Katja Ettmayr and
Hugo K. K. Rosado and
Andreas Wiese},
editor = {David P. Woodruff},
title = {A {(3} + {\(\varepsilon\)})-approximation algorithm for the minimum
sum of radii problem with outliers and extensions for generalized
lower bounds},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {1738--1765},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.69},
doi = {10.1137/1.9781611977912.69},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/BuchemERW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/ArmbrusterRW24,
author = {Alexander Armbruster and
Lars Rohwedder and
Andreas Wiese},
editor = {Merav Parter and
Seth Pettie},
title = {Simpler constant factor approximation algorithms for weighted flow
time - now for any \emph{p}-norm},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {63--81},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.7},
doi = {10.1137/1.9781611977936.7},
timestamp = {Wed, 10 Apr 2024 20:26:09 +0200},
biburl = {https://dblp.org/rec/conf/sosa/ArmbrusterRW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/latin/2024-1,
editor = {Jos{\'{e}} A. Soto and
Andreas Wiese},
title = {{LATIN} 2024: Theoretical Informatics - 16th Latin American Symposium,
Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14578},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-55598-5},
doi = {10.1007/978-3-031-55598-5},
isbn = {978-3-031-55597-8},
timestamp = {Wed, 13 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/2024-1.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/latin/2024-2,
editor = {Jos{\'{e}} A. Soto and
Andreas Wiese},
title = {{LATIN} 2024: Theoretical Informatics - 16th Latin American Symposium,
Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {14579},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-55601-2},
doi = {10.1007/978-3-031-55601-2},
isbn = {978-3-031-55600-5},
timestamp = {Wed, 13 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/2024-2.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-02412,
author = {Arindam Khan and
Aditya Subramanian and
Tobias Widmann and
Andreas Wiese},
title = {On Approximation Schemes for Stabbing Rectilinear Polygons},
journal = {CoRR},
volume = {abs/2402.02412},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.02412},
doi = {10.48550/ARXIV.2402.02412},
eprinttype = {arXiv},
eprint = {2402.02412},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-02412.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-00536,
author = {Moritz Buchem and
Paul Deuker and
Andreas Wiese},
title = {Approximating the Geometric Knapsack Problem in Near-Linear Time and
Dynamically},
journal = {CoRR},
volume = {abs/2403.00536},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.00536},
doi = {10.48550/ARXIV.2403.00536},
eprinttype = {arXiv},
eprint = {2403.00536},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-00536.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CristiMW23,
author = {Andr{\'{e}}s Cristi and
Mathieu Mari and
Andreas Wiese},
title = {Fixed-Parameter Algorithms for Unsplittable Flow Cover},
journal = {Theory Comput. Syst.},
volume = {67},
number = {1},
pages = {89--124},
year = {2023},
url = {https://doi.org/10.1007/s00224-021-10048-7},
doi = {10.1007/S00224-021-10048-7},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/CristiMW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/0001LRSW23,
author = {Arindam Khan and
Aditya Lonkar and
Saladi Rahul and
Aditya Subramanian and
Andreas Wiese},
editor = {Erin W. Chambers and
Joachim Gudmundsson},
title = {Online and Dynamic Algorithms for Geometric Set Cover and Hitting
Set},
booktitle = {39th International Symposium on Computational Geometry, SoCG 2023,
June 12-15, 2023, Dallas, Texas, {USA}},
series = {LIPIcs},
volume = {258},
pages = {46:1--46:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2023.46},
doi = {10.4230/LIPICS.SOCG.2023.46},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/0001LRSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EeOSW23,
author = {Martijn van Ee and
Tim Oosterwijk and
Ren{\'{e}} Sitters and
Andreas Wiese},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {Exact and Approximation Algorithms for Routing a Convoy Through a
Graph},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {86:1--86:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.86},
doi = {10.4230/LIPICS.MFCS.2023.86},
timestamp = {Mon, 28 Aug 2023 15:00:20 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EeOSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BateniEFHJMW23,
author = {MohammadHossein Bateni and
Hossein Esfandiari and
Hendrik Fichtenberger and
Monika Henzinger and
Rajesh Jayaram and
Vahab Mirrokni and
Andreas Wiese},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Optimal Fully Dynamic \emph{k}-Center Clustering for Adaptive and
Oblivious Adversaries},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {2677--2727},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch101},
doi = {10.1137/1.9781611977554.CH101},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/BateniEFHJMW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ArmbrusterRW23,
author = {Alexander Armbruster and
Lars Rohwedder and
Andreas Wiese},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A {PTAS} for Minimizing Weighted Flow Time on a Single Machine},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1335--1344},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585146},
doi = {10.1145/3564246.3585146},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ArmbrusterRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2023,
editor = {Jaroslaw Byrka and
Andreas Wiese},
title = {Approximation and Online Algorithms - 21st International Workshop,
{WAOA} 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14297},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49815-2},
doi = {10.1007/978-3-031-49815-2},
isbn = {978-3-031-49814-5},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-09524,
author = {Arindam Khan and
Aditya Lonkar and
Saladi Rahul and
Aditya Subramanian and
Andreas Wiese},
title = {Online and Dynamic Algorithms for Geometric Set Cover and Hitting
Set},
journal = {CoRR},
volume = {abs/2303.09524},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.09524},
doi = {10.48550/ARXIV.2303.09524},
eprinttype = {arXiv},
eprint = {2303.09524},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-09524.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-11843,
author = {MohammadHossein Bateni and
Hossein Esfandiari and
Hendrik Fichtenberger and
Monika Henzinger and
Rajesh Jayaram and
Vahab Mirrokni and
Andreas Wiese},
title = {Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious
Adversaries},
journal = {CoRR},
volume = {abs/2303.11843},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.11843},
doi = {10.48550/ARXIV.2303.11843},
eprinttype = {arXiv},
eprint = {2303.11843},
timestamp = {Wed, 22 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-11843.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-06209,
author = {Alexander Armbruster and
Lars Rohwedder and
Andreas Wiese},
title = {Simpler constant factor approximation algorithms for weighted flow
time - now for any p-norm},
journal = {CoRR},
volume = {abs/2308.06209},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.06209},
doi = {10.48550/ARXIV.2308.06209},
eprinttype = {arXiv},
eprint = {2308.06209},
timestamp = {Wed, 23 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-06209.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-06111,
author = {Moritz Buchem and
Katja Ettmayr and
Hugo K. K. Rosado and
Andreas Wiese},
title = {A (3+{\(\epsilon\)})-approximation algorithm for the minimum sum of
radii problem with outliers and extensions for generalized lower bounds},
journal = {CoRR},
volume = {abs/2311.06111},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.06111},
doi = {10.48550/ARXIV.2311.06111},
eprinttype = {arXiv},
eprint = {2311.06111},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-06111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DasW22,
author = {Syamantak Das and
Andreas Wiese},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {A Simpler {QPTAS} for Scheduling Jobs with Precedence Constraints},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {40:1--40:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.40},
doi = {10.4230/LIPICS.ESA.2022.40},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/DasW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Kar0W22,
author = {Debajyoti Kar and
Arindam Khan and
Andreas Wiese},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Approximation Algorithms for Round-UFP and Round-SAP},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {71:1--71:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.71},
doi = {10.4230/LIPICS.ESA.2022.71},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Kar0W22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0001LMSW22,
author = {Arindam Khan and
Aditya Lonkar and
Arnab Maiti and
Amatya Sharma and
Andreas Wiese},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Tight Approximation Algorithms for Two-Dimensional Guillotine Strip
Packing},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {80:1--80:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.80},
doi = {10.4230/LIPICS.ICALP.2022.80},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/0001LMSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KhanSW22,
author = {Arindam Khan and
Aditya Subramanian and
Andreas Wiese},
editor = {Karen I. Aardal and
Laura Sanit{\`{a}}},
title = {A {PTAS} for the Horizontal Rectangle Stabbing Problem},
booktitle = {Integer Programming and Combinatorial Optimization - 23rd International
Conference, {IPCO} 2022, Eindhoven, The Netherlands, June 27-29, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13265},
pages = {361--374},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06901-7\_27},
doi = {10.1007/978-3-031-06901-7\_27},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/ipco/KhanSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GalvezKMMPW22,
author = {Waldo G{\'{a}}lvez and
Arindam Khan and
Mathieu Mari and
Tobias M{\"{o}}mke and
Madhusudhan Reddy Pittu and
Andreas Wiese},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {A 3-Approximation Algorithm for Maximum Independent Set of Rectangles},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {894--905},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.38},
doi = {10.1137/1.9781611977073.38},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/GalvezKMMPW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GrandoniMW22,
author = {Fabrizio Grandoni and
Tobias M{\"{o}}mke and
Andreas Wiese},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Unsplittable Flow on a Path: The Game!},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {906--926},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.39},
doi = {10.1137/1.9781611977073.39},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GrandoniMW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001MW22,
author = {Fabrizio Grandoni and
Tobias M{\"{o}}mke and
Andreas Wiese},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {A {PTAS} for unsplittable flow on a path},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {289--302},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519959},
doi = {10.1145/3519935.3519959},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0001MW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-03492,
author = {Debajyoti Kar and
Arindam Khan and
Andreas Wiese},
title = {Approximation Algorithms for {ROUND-UFP} and {ROUND-SAP}},
journal = {CoRR},
volume = {abs/2202.03492},
year = {2022},
url = {https://arxiv.org/abs/2202.03492},
eprinttype = {arXiv},
eprint = {2202.03492},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-03492.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-05989,
author = {Arindam Khan and
Aditya Lonkar and
Arnab Maiti and
Amatya Sharma and
Andreas Wiese},
title = {Tight Approximation Algorithms for Two Dimensional Guillotine Strip
Packing},
journal = {CoRR},
volume = {abs/2202.05989},
year = {2022},
url = {https://arxiv.org/abs/2202.05989},
eprinttype = {arXiv},
eprint = {2202.05989},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-05989.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-03127,
author = {Alexander Armbruster and
Lars Rohwedder and
Andreas Wiese},
title = {A {PTAS} for Minimizing Weighted Flow Time on a Single Machine},
journal = {CoRR},
volume = {abs/2208.03127},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.03127},
doi = {10.48550/ARXIV.2208.03127},
eprinttype = {arXiv},
eprint = {2208.03127},
timestamp = {Wed, 10 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-03127.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GalvezGIHKW21,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Salvatore Ingala and
Sandy Heydrich and
Arindam Khan and
Andreas Wiese},
title = {Approximating Geometric Knapsack via L-packings},
journal = {{ACM} Trans. Algorithms},
volume = {17},
number = {4},
pages = {33:1--33:67},
year = {2021},
url = {https://doi.org/10.1145/3473713},
doi = {10.1145/3473713},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/GalvezGIHKW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Galvez00RW21,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Arindam Khan and
Diego Ram{\'{\i}}rez{-}Romero and
Andreas Wiese},
editor = {Kevin Buchin and
{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing
into Multiple L-Shapes, Spirals, and More},
booktitle = {37th International Symposium on Computational Geometry, SoCG 2021,
June 7-11, 2021, Buffalo, NY, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {189},
pages = {39:1--39:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2021.39},
doi = {10.4230/LIPICS.SOCG.2021.39},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/Galvez00RW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/0001MSW21,
author = {Arindam Khan and
Arnab Maiti and
Amatya Sharma and
Andreas Wiese},
editor = {Kevin Buchin and
{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {On Guillotine Separable Packings for the Two-Dimensional Geometric
Knapsack Problem},
booktitle = {37th International Symposium on Computational Geometry, SoCG 2021,
June 7-11, 2021, Buffalo, NY, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {189},
pages = {48:1--48:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2021.48},
doi = {10.4230/LIPICS.SOCG.2021.48},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/0001MSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/0001MW21,
author = {Fabrizio Grandoni and
Tobias M{\"{o}}mke and
Andreas Wiese},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Faster (1+{\(\epsilon\)})-Approximation for Unsplittable Flow on a
Path via Resource Augmentation and Back},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {49:1--49:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.49},
doi = {10.4230/LIPICS.ESA.2021.49},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/0001MW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Martinez-MunozW21,
author = {Tom{\'{a}}s Mart{\'{\i}}nez{-}Mu{\~{n}}oz and
Andreas Wiese},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {{FPT} and FPT-Approximation Algorithms for Unsplittable Flow on Trees},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {67:1--67:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.67},
doi = {10.4230/LIPICS.ESA.2021.67},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Martinez-MunozW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/EberleMNSW21,
author = {Franziska Eberle and
Nicole Megow and
Lukas N{\"{o}}lke and
Bertrand Simon and
Andreas Wiese},
editor = {Mikolaj Bojanczyk and
Chandra Chekuri},
title = {Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic
Update Time},
booktitle = {41st {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2021, December 15-17, 2021,
Virtual Conference},
series = {LIPIcs},
volume = {213},
pages = {18:1--18:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.18},
doi = {10.4230/LIPICS.FSTTCS.2021.18},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/EberleMNSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BuchemRVW21,
author = {Moritz Buchem and
Lars Rohwedder and
Tjark Vredeveld and
Andreas Wiese},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Additive Approximation Schemes for Load Balancing Problems},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {42:1--42:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.42},
doi = {10.4230/LIPICS.ICALP.2021.42},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BuchemRVW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RohwedderW21,
author = {Lars Rohwedder and
Andreas Wiese},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A {(2} + \emph{{\(\epsilon\)}})-approximation algorithm for preemptive
weighted flow time on a single machine},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1042--1055},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451075},
doi = {10.1145/3406325.3451075},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RohwedderW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-09735,
author = {Arindam Khan and
Arnab Maiti and
Amatya Sharma and
Andreas Wiese},
title = {On Guillotine Separable Packings for the Two-dimensional Geometric
Knapsack Problem},
journal = {CoRR},
volume = {abs/2103.09735},
year = {2021},
url = {https://arxiv.org/abs/2103.09735},
eprinttype = {arXiv},
eprint = {2103.09735},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-09735.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-10406,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Arindam Khan and
Diego Ram{\'{\i}}rez{-}Romero and
Andreas Wiese},
title = {Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing
into Multiple L-Shapes, Spirals, and More},
journal = {CoRR},
volume = {abs/2103.10406},
year = {2021},
url = {https://arxiv.org/abs/2103.10406},
eprinttype = {arXiv},
eprint = {2103.10406},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-10406.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-00623,
author = {Waldo G{\'{a}}lvez and
Arindam Khan and
Mathieu Mari and
Tobias M{\"{o}}mke and
Madhusudhan Reddy Pittu and
Andreas Wiese},
title = {A 4-Approximation Algorithm for Maximum Independent Set of Rectangles},
journal = {CoRR},
volume = {abs/2106.00623},
year = {2021},
url = {https://arxiv.org/abs/2106.00623},
eprinttype = {arXiv},
eprint = {2106.00623},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-00623.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-05197,
author = {Arindam Khan and
Aditya Subramanian and
Andreas Wiese},
title = {A {PTAS} for the horizontal rectangle stabbing problem},
journal = {CoRR},
volume = {abs/2111.05197},
year = {2021},
url = {https://arxiv.org/abs/2111.05197},
eprinttype = {arXiv},
eprint = {2111.05197},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-05197.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-07217,
author = {Hendrik Fichtenberger and
Monika Henzinger and
Andreas Wiese},
title = {On fully dynamic constant-factor approximation algorithms for clustering
problems},
journal = {CoRR},
volume = {abs/2112.07217},
year = {2021},
url = {https://arxiv.org/abs/2112.07217},
eprinttype = {arXiv},
eprint = {2112.07217},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-07217.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PilipczukLW20,
author = {Michal Pilipczuk and
Erik Jan van Leeuwen and
Andreas Wiese},
title = {Quasi-Polynomial Time Approximation Schemes for Packing and Covering
Problems in Planar Graphs},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1703--1739},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00670-w},
doi = {10.1007/S00453-019-00670-W},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PilipczukLW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/VerdugoVW20,
author = {Victor Verdugo and
Jos{\'{e}} Verschae and
Andreas Wiese},
title = {Breaking symmetries to rescue sum of squares in the case of makespan
scheduling},
journal = {Math. Program.},
volume = {183},
number = {1},
pages = {583--618},
year = {2020},
url = {https://doi.org/10.1007/s10107-020-01511-3},
doi = {10.1007/S10107-020-01511-3},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/VerdugoVW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/TiwaryVW20,
author = {Hans Raj Tiwary and
Victor Verdugo and
Andreas Wiese},
title = {On the extension complexity of scheduling polytopes},
journal = {Oper. Res. Lett.},
volume = {48},
number = {4},
pages = {472--479},
year = {2020},
url = {https://doi.org/10.1016/j.orl.2020.05.008},
doi = {10.1016/J.ORL.2020.05.008},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/TiwaryVW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Henzinger0W20,
author = {Monika Henzinger and
Stefan Neumann and
Andreas Wiese},
editor = {Sergio Cabello and
Danny Z. Chen},
title = {Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes
and Hyperrectangles},
booktitle = {36th International Symposium on Computational Geometry, SoCG 2020,
June 23-26, 2020, Z{\"{u}}rich, Switzerland},
series = {LIPIcs},
volume = {164},
pages = {51:1--51:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2020.51},
doi = {10.4230/LIPICS.SOCG.2020.51},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Henzinger0W20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MerinoW20,
author = {Arturo I. Merino and
Andreas Wiese},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {On the Two-Dimensional Knapsack Problem for Convex Polygons},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {84:1--84:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.84},
doi = {10.4230/LIPICS.ICALP.2020.84},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MerinoW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MomkeW20,
author = {Tobias M{\"{o}}mke and
Andreas Wiese},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Breaking the Barrier of 2 for the Storage Allocation Problem},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {86:1--86:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.86},
doi = {10.4230/LIPICS.ICALP.2020.86},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MomkeW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CristiMW20,
author = {Andr{\'{e}}s Cristi and
Mathieu Mari and
Andreas Wiese},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Fixed-Parameter Algorithms for Unsplittable Flow Cover},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {42:1--42:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.42},
doi = {10.4230/LIPICS.STACS.2020.42},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CristiMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CristiW20,
author = {Andr{\'{e}}s Cristi and
Andreas Wiese},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Better Approximations for General Caching and UFP-Cover Under Resource
Augmentation},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {44:1--44:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.44},
doi = {10.4230/LIPICS.STACS.2020.44},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CristiW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-10142,
author = {Monika Henzinger and
Stefan Neumann and
Andreas Wiese},
title = {Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity},
journal = {CoRR},
volume = {abs/2002.10142},
year = {2020},
url = {https://arxiv.org/abs/2002.10142},
eprinttype = {arXiv},
eprint = {2002.10142},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-10142.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-02605,
author = {Monika Henzinger and
Stefan Neumann and
Andreas Wiese},
title = {Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes
and Hyperrectangles},
journal = {CoRR},
volume = {abs/2003.02605},
year = {2020},
url = {https://arxiv.org/abs/2003.02605},
eprinttype = {arXiv},
eprint = {2003.02605},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-02605.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-08415,
author = {Martin B{\"{o}}hm and
Franziska Eberle and
Nicole Megow and
Lukas N{\"{o}}lke and
Jens Schl{\"{o}}ter and
Bertrand Simon and
Andreas Wiese},
title = {Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic
Update Time},
journal = {CoRR},
volume = {abs/2007.08415},
year = {2020},
url = {https://arxiv.org/abs/2007.08415},
eprinttype = {arXiv},
eprint = {2007.08415},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-08415.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-09333,
author = {Moritz Buchem and
Lars Rohwedder and
Tjark Vredeveld and
Andreas Wiese},
title = {Additive Approximation Schemes for Load Balancing Problems},
journal = {CoRR},
volume = {abs/2007.09333},
year = {2020},
url = {https://arxiv.org/abs/2007.09333},
eprinttype = {arXiv},
eprint = {2007.09333},
timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-09333.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-16144,
author = {Arturo I. Merino and
Andreas Wiese},
title = {On the Two-Dimensional Knapsack Problem for Convex Polygons},
journal = {CoRR},
volume = {abs/2007.16144},
year = {2020},
url = {https://arxiv.org/abs/2007.16144},
eprinttype = {arXiv},
eprint = {2007.16144},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-16144.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-05676,
author = {Lars Rohwedder and
Andreas Wiese},
title = {A (2+{\(\epsilon\)})-approximation algorithm for preemptive weighted
flow time on a single machine},
journal = {CoRR},
volume = {abs/2011.05676},
year = {2020},
url = {https://arxiv.org/abs/2011.05676},
eprinttype = {arXiv},
eprint = {2011.05676},
timestamp = {Thu, 12 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-05676.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AdamaszekHW19,
author = {Anna Adamaszek and
Sariel Har{-}Peled and
Andreas Wiese},
title = {Approximation Schemes for Independent Set and Sparse Subsets of Polygons},
journal = {J. {ACM}},
volume = {66},
number = {4},
pages = {29:1--29:40},
year = {2019},
url = {https://doi.org/10.1145/3326122},
doi = {10.1145/3326122},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AdamaszekHW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HeydrichW19,
author = {Sandy Heydrich and
Andreas Wiese},
title = {Faster Approximation Schemes for the Two-Dimensional Knapsack Problem},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {4},
pages = {47:1--47:28},
year = {2019},
url = {https://doi.org/10.1145/3338512},
doi = {10.1145/3338512},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/HeydrichW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/topc/BonifaciWBMSS19,
author = {Vincenzo Bonifaci and
Andreas Wiese and
Sanjoy K. Baruah and
Alberto Marchetti{-}Spaccamela and
Sebastian Stiller and
Leen Stougie},
title = {A Generalized Parallel Task Model for Recurrent Real-Time Processes},
journal = {{ACM} Trans. Parallel Comput.},
volume = {6},
number = {1},
pages = {3:1--3:40},
year = {2019},
url = {https://doi.org/10.1145/3322809},
doi = {10.1145/3322809},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/topc/BonifaciWBMSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/0001KW19,
author = {Fabrizio Grandoni and
Stefan Kratsch and
Andreas Wiese},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Parameterized Approximation Schemes for Independent Set of Rectangles
and Geometric Knapsack},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {53:1--53:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.53},
doi = {10.4230/LIPICS.ESA.2019.53},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/0001KW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/0001W19,
author = {Fabrizio Grandoni and
Andreas Wiese},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Packing Cars into Narrow Roads: PTASs for Limited Supply Highway},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {54:1--54:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.54},
doi = {10.4230/LIPICS.ESA.2019.54},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/0001W19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-10271,
author = {Hans Raj Tiwary and
Victor Verdugo and
Andreas Wiese},
title = {On the extension complexity of scheduling},
journal = {CoRR},
volume = {abs/1902.10271},
year = {2019},
url = {http://arxiv.org/abs/1902.10271},
eprinttype = {arXiv},
eprint = {1902.10271},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-10271.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-10982,
author = {Fabrizio Grandoni and
Stefan Kratsch and
Andreas Wiese},
title = {Parameterized Approximation Schemes for Independent Set of Rectangles
and Geometric Knapsack},
journal = {CoRR},
volume = {abs/1906.10982},
year = {2019},
url = {http://arxiv.org/abs/1906.10982},
eprinttype = {arXiv},
eprint = {1906.10982},
timestamp = {Thu, 27 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-10982.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-10871,
author = {Tobias M{\"{o}}mke and
Andreas Wiese},
title = {Breaking the Barrier of 2 for the Storage Allocation Problem},
journal = {CoRR},
volume = {abs/1911.10871},
year = {2019},
url = {http://arxiv.org/abs/1911.10871},
eprinttype = {arXiv},
eprint = {1911.10871},
timestamp = {Tue, 03 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-10871.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Wiese18,
author = {Andreas Wiese},
title = {Independent Set of Convex Polygons: From {\textdollar}{\textdollar}n{\^{}}\{{\textbackslash}epsilon
\}{\textdollar}{\textdollar} n {\unicode{1013}} to {\textdollar}{\textdollar}1+{\textbackslash}epsilon
{\textdollar}{\textdollar} 1 + {\unicode{1013}} via Shrinking},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {918--934},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0347-8},
doi = {10.1007/S00453-017-0347-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Wiese18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HohnMW18,
author = {Wiebke H{\"{o}}hn and
Juli{\'{a}}n Mestre and
Andreas Wiese},
title = {How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent
Cost Functions},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1191--1213},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0300-x},
doi = {10.1007/S00453-017-0300-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HohnMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KurpiszMMMVW18,
author = {Adam Kurpisz and
Monaldo Mastrolilli and
Claire Mathieu and
Tobias M{\"{o}}mke and
Victor Verdugo and
Andreas Wiese},
title = {Semidefinite and linear programming integrality gaps for scheduling
identical machines},
journal = {Math. Program.},
volume = {172},
number = {1-2},
pages = {231--248},
year = {2018},
url = {https://doi.org/10.1007/s10107-017-1152-5},
doi = {10.1007/S10107-017-1152-5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KurpiszMMMVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AdamaszekCEW18,
author = {Anna Adamaszek and
Parinya Chalermsook and
Alina Ene and
Andreas Wiese},
title = {Submodular unsplittable flow on trees},
journal = {Math. Program.},
volume = {172},
number = {1-2},
pages = {565--589},
year = {2018},
url = {https://doi.org/10.1007/s10107-017-1218-4},
doi = {10.1007/S10107-017-1218-4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AdamaszekCEW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Anagnostopoulos18a,
author = {Aris Anagnostopoulos and
Fabrizio Grandoni and
Stefano Leonardi and
Andreas Wiese},
title = {A Mazing 2+{\unicode{1013}} Approximation for Unsplittable Flow on
a Path},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {4},
pages = {55:1--55:23},
year = {2018},
url = {https://doi.org/10.1145/3242769},
doi = {10.1145/3242769},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/Anagnostopoulos18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Wiese18,
author = {Andreas Wiese},
editor = {Eric Blais and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Steurer},
title = {Fixed-Parameter Approximation Schemes for Weighted Flowtime},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {116},
pages = {28:1--28:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.28},
doi = {10.4230/LIPICS.APPROX-RANDOM.2018.28},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Wiese18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/PilipczukLW18,
author = {Michal Pilipczuk and
Erik Jan van Leeuwen and
Andreas Wiese},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Quasi-Polynomial Time Approximation Schemes for Packing and Covering
Problems in Planar Graphs},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {65:1--65:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.65},
doi = {10.4230/LIPICS.ESA.2018.65},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/PilipczukLW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001MW018,
author = {Fabrizio Grandoni and
Tobias M{\"{o}}mke and
Andreas Wiese and
Hang Zhou},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {A {(5/3} + {\(\epsilon\)})-approximation for unsplittable flow on
a path: placing small tasks into boxes},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {607--619},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188894},
doi = {10.1145/3188745.3188894},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0001MW018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-07626,
author = {Michal Pilipczuk and
Erik Jan van Leeuwen and
Andreas Wiese},
title = {Quasi-polynomial time approximation schemes for packing and covering
problems in planar graphs},
journal = {CoRR},
volume = {abs/1807.07626},
year = {2018},
url = {http://arxiv.org/abs/1807.07626},
eprinttype = {arXiv},
eprint = {1807.07626},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-07626.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DasW17,
author = {Syamantak Das and
Andreas Wiese},
editor = {Kirk Pruhs and
Christian Sohler},
title = {On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the
Same Machine},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {31:1--31:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.31},
doi = {10.4230/LIPICS.ESA.2017.31},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/DasW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalvezGHI0W17,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Sandy Heydrich and
Salvatore Ingala and
Arindam Khan and
Andreas Wiese},
editor = {Chris Umans},
title = {Approximating Geometric Knapsack via L-Packings},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {260--271},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.32},
doi = {10.1109/FOCS.2017.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalvezGHI0W17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AntoniadisHMVW17,
author = {Antonios Antoniadis and
Ruben Hoeksma and
Julie Mei{\ss}ner and
Jos{\'{e}} Verschae and
Andreas Wiese},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {A {QPTAS} for the General Scheduling Problem with Identical Release
Dates},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {31:1--31:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.31},
doi = {10.4230/LIPICS.ICALP.2017.31},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AntoniadisHMVW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Wiese17,
author = {Andreas Wiese},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter
Running Time},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {67:1--67:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.67},
doi = {10.4230/LIPICS.ICALP.2017.67},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Wiese17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/PilipczukLW17,
author = {Michal Pilipczuk and
Erik Jan van Leeuwen and
Andreas Wiese},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Approximation and Parameterized Algorithms for Geometric Independent
Set with Shrinking},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {42:1--42:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.42},
doi = {10.4230/LIPICS.MFCS.2017.42},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/PilipczukLW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HeydrichW17,
author = {Sandy Heydrich and
Andreas Wiese},
editor = {Philip N. Klein},
title = {Faster approximation schemes for the two-dimensional knapsack problem},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {79--98},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.6},
doi = {10.1137/1.9781611974782.6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/HeydrichW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GrandoniMW017,
author = {Fabrizio Grandoni and
Tobias M{\"{o}}mke and
Andreas Wiese and
Hang Zhou},
editor = {Philip N. Klein},
title = {To Augment or Not to Augment: Solving Unsplittable Flow on a Path
by Creating Slack},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2411--2422},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.159},
doi = {10.1137/1.9781611974782.159},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GrandoniMW017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AdamaszekHW17,
author = {Anna Adamaszek and
Sariel Har{-}Peled and
Andreas Wiese},
title = {Approximation Schemes for Independent Set and Sparse Subsets of Polygons},
journal = {CoRR},
volume = {abs/1703.04758},
year = {2017},
url = {http://arxiv.org/abs/1703.04758},
eprinttype = {arXiv},
eprint = {1703.04758},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AdamaszekHW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-07710,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Sandy Heydrich and
Salvatore Ingala and
Arindam Khan and
Andreas Wiese},
title = {Approximating Geometric Knapsack via L-packings},
journal = {CoRR},
volume = {abs/1711.07710},
year = {2017},
url = {http://arxiv.org/abs/1711.07710},
eprinttype = {arXiv},
eprint = {1711.07710},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-07710.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcsb/NazariehWWHH16,
author = {Maryam Nazarieh and
Andreas Wiese and
Thorsten Will and
Mohamed Hamed and
Volkhard Helms},
title = {Identification of key player genes in gene regulatory networks},
journal = {{BMC} Syst. Biol.},
volume = {10},
pages = {88},
year = {2016},
url = {https://doi.org/10.1186/s12918-016-0329-5},
doi = {10.1186/S12918-016-0329-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcsb/NazariehWWHH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MegowSVW16,
author = {Nicole Megow and
Martin Skutella and
Jos{\'{e}} Verschae and
Andreas Wiese},
title = {The Power of Recourse for Online {MST} and {TSP}},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {3},
pages = {859--880},
year = {2016},
url = {https://doi.org/10.1137/130917703},
doi = {10.1137/130917703},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MegowSVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LubbeckeMMW16,
author = {Elisabeth L{\"{u}}bbecke and
Olaf Maurer and
Nicole Megow and
Andreas Wiese},
title = {A New Approach to Online Scheduling: Approximating the Optimal Competitive
Ratio},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {1},
pages = {15:1--15:34},
year = {2016},
url = {https://doi.org/10.1145/2996800},
doi = {10.1145/2996800},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/LubbeckeMMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/NeumannW16,
author = {Stefan Neumann and
Andreas Wiese},
editor = {Erik D. Demaine and
Fabrizio Grandoni},
title = {This House Proves That Debating is Harder Than Soccer},
booktitle = {8th International Conference on Fun with Algorithms, {FUN} 2016, June
8-10, 2016, La Maddalena, Italy},
series = {LIPIcs},
volume = {49},
pages = {25:1--25:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FUN.2016.25},
doi = {10.4230/LIPICS.FUN.2016.25},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fun/NeumannW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KurpiszMMMVW16,
author = {Adam Kurpisz and
Monaldo Mastrolilli and
Claire Mathieu and
Tobias M{\"{o}}mke and
Victor Verdugo and
Andreas Wiese},
editor = {Quentin Louveaux and
Martin Skutella},
title = {Semidefinite and Linear Programming Integrality Gaps for Scheduling
Identical Machines},
booktitle = {Integer Programming and Combinatorial Optimization - 18th International
Conference, {IPCO} 2016, Li{\`{e}}ge, Belgium, June 1-3, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9682},
pages = {152--163},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-33461-5\_13},
doi = {10.1007/978-3-319-33461-5\_13},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/KurpiszMMMVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/AdamaszekCEW16,
author = {Anna Adamaszek and
Parinya Chalermsook and
Alina Ene and
Andreas Wiese},
editor = {Quentin Louveaux and
Martin Skutella},
title = {Submodular Unsplittable Flow on Trees},
booktitle = {Integer Programming and Combinatorial Optimization - 18th International
Conference, {IPCO} 2016, Li{\`{e}}ge, Belgium, June 1-3, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9682},
pages = {337--349},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-33461-5\_28},
doi = {10.1007/978-3-319-33461-5\_28},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/AdamaszekCEW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Wiese16,
author = {Andreas Wiese},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {Independent Set of Convex Polygons: From n\({}^{\mbox{{\unicode{1013}}}}\)
to 1+{\unicode{1013}} via Shrinking},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {700--711},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_52},
doi = {10.1007/978-3-662-49529-2\_52},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/Wiese16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/NadiradzeW16,
author = {Giorgi Nadiradze and
Andreas Wiese},
editor = {Robert Krauthgamer},
title = {On approximating strip packing with a better ratio than 3/2},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1491--1510},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch102},
doi = {10.1137/1.9781611974331.CH102},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/NadiradzeW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NeumannW16,
author = {Stefan Neumann and
Andreas Wiese},
title = {This House Proves that Debating is Harder than Soccer},
journal = {CoRR},
volume = {abs/1605.03063},
year = {2016},
url = {http://arxiv.org/abs/1605.03063},
eprinttype = {arXiv},
eprint = {1605.03063},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NeumannW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PilipczukLW16,
author = {Michal Pilipczuk and
Erik Jan van Leeuwen and
Andreas Wiese},
title = {Approximation and parameterized algorithms for geometric independent
set with shrinking},
journal = {CoRR},
volume = {abs/1611.06501},
year = {2016},
url = {http://arxiv.org/abs/1611.06501},
eprinttype = {arXiv},
eprint = {1611.06501},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PilipczukLW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NiemeierW15,
author = {Martin Niemeier and
Andreas Wiese},
title = {Scheduling with an Orthogonal Resource Constraint},
journal = {Algorithmica},
volume = {71},
number = {4},
pages = {837--858},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9829-5},
doi = {10.1007/S00453-013-9829-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NiemeierW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Marchetti-Spaccamela15,
author = {Alberto Marchetti{-}Spaccamela and
Cyriel Rutten and
Suzanne van der Ster and
Andreas Wiese},
title = {Assigning sporadic tasks to unrelated machines},
journal = {Math. Program.},
volume = {152},
number = {1-2},
pages = {247--274},
year = {2015},
url = {https://doi.org/10.1007/s10107-014-0786-9},
doi = {10.1007/S10107-014-0786-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Marchetti-Spaccamela15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MnichW15,
author = {Matthias Mnich and
Andreas Wiese},
title = {Scheduling and fixed-parameter tractability},
journal = {Math. Program.},
volume = {154},
number = {1-2},
pages = {533--562},
year = {2015},
url = {https://doi.org/10.1007/s10107-014-0830-9},
doi = {10.1007/S10107-014-0830-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MnichW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AbedCCKPSW15,
author = {Fidaa Abed and
Parinya Chalermsook and
Jos{\'{e}} Correa and
Andreas Karrenbauer and
Pablo P{\'{e}}rez{-}Lantero and
Jos{\'{e}} A. Soto and
Andreas Wiese},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {On Guillotine Cutting Sequences},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {1--19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.1},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.1},
timestamp = {Wed, 03 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AbedCCKPSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AdamaszekCW15,
author = {Anna Adamaszek and
Parinya Chalermsook and
Andreas Wiese},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles
via Shrinking},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {43--60},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.43},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.43},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AdamaszekCW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MomkeW15,
author = {Tobias M{\"{o}}mke and
Andreas Wiese},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {A (2+{\textbackslash}epsilon {)} {(} 2 + {\unicode{1013}} {)} -Approximation
Algorithm for the Storage Allocation Problem},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {973--984},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_79},
doi = {10.1007/978-3-662-47672-7\_79},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/MomkeW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BatraG0MW15,
author = {Jatin Batra and
Naveen Garg and
Amit Kumar and
Tobias M{\"{o}}mke and
Andreas Wiese},
editor = {Piotr Indyk},
title = {New Approximation Schemes for Unsplittable Flow on a Path},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {47--58},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.5},
doi = {10.1137/1.9781611973730.5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BatraG0MW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AdamaszekW15,
author = {Anna Adamaszek and
Andreas Wiese},
editor = {Piotr Indyk},
title = {A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1491--1505},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.98},
doi = {10.1137/1.9781611973730.98},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AdamaszekW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/VerschaeW14,
author = {Jos{\'{e}} Verschae and
Andreas Wiese},
title = {On the configuration-LP for scheduling on unrelated machines},
journal = {J. Sched.},
volume = {17},
number = {4},
pages = {371--383},
year = {2014},
url = {https://doi.org/10.1007/s10951-013-0359-4},
doi = {10.1007/S10951-013-0359-4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/VerschaeW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BonsmaSW14,
author = {Paul S. Bonsma and
Jens Schulz and
Andreas Wiese},
title = {A Constant-Factor Approximation Algorithm for Unsplittable Flow on
Paths},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {2},
pages = {767--799},
year = {2014},
url = {https://doi.org/10.1137/120868360},
doi = {10.1137/120868360},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BonsmaSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HohnMW14,
author = {Wiebke H{\"{o}}hn and
Juli{\'{a}}n Mestre and
Andreas Wiese},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent
Cost Functions},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {625--636},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_52},
doi = {10.1007/978-3-662-43948-7\_52},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HohnMW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/MnichW14,
author = {Matthias Mnich and
Andreas Wiese},
editor = {Jon Lee and
Jens Vygen},
title = {Scheduling and Fixed-Parameter Tractability},
booktitle = {Integer Programming and Combinatorial Optimization - 17th International
Conference, {IPCO} 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8494},
pages = {381--392},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07557-0\_32},
doi = {10.1007/978-3-319-07557-0\_32},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/MnichW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AnagnostopoulosGLW14,
author = {Aris Anagnostopoulos and
Fabrizio Grandoni and
Stefano Leonardi and
Andreas Wiese},
editor = {Chandra Chekuri},
title = {A Mazing 2+\emph{{\unicode{8714}}} Approximation for Unsplittable
Flow on a Path},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {26--41},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.3},
doi = {10.1137/1.9781611973402.3},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AnagnostopoulosGLW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AdamaszekW14,
author = {Anna Adamaszek and
Andreas Wiese},
editor = {Chandra Chekuri},
title = {A {QPTAS} for Maximum Weight Independent Set of Polygons with Polylogarithmically
Many Vertices},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {645--656},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.49},
doi = {10.1137/1.9781611973402.49},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AdamaszekW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HohnMW14,
author = {Wiebke H{\"{o}}hn and
Juli{\'{a}}n Mestre and
Andreas Wiese},
title = {How Unsplittable-Flow-Covering helps Scheduling with Job-Dependent
Cost Functions},
journal = {CoRR},
volume = {abs/1403.1376},
year = {2014},
url = {http://arxiv.org/abs/1403.1376},
eprinttype = {arXiv},
eprint = {1403.1376},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HohnMW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rts/WieseBB13,
author = {Andreas Wiese and
Vincenzo Bonifaci and
Sanjoy K. Baruah},
title = {Partitioned {EDF} scheduling on a few types of unrelated multiprocessors},
journal = {Real Time Syst.},
volume = {49},
number = {2},
pages = {219--238},
year = {2013},
url = {https://doi.org/10.1007/s11241-012-9164-y},
doi = {10.1007/S11241-012-9164-Y},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rts/WieseBB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecrts/BonifaciMSW13,
author = {Vincenzo Bonifaci and
Alberto Marchetti{-}Spaccamela and
Sebastian Stiller and
Andreas Wiese},
title = {Feasibility Analysis in the Sporadic {DAG} Task Model},
booktitle = {25th Euromicro Conference on Real-Time Systems, {ECRTS} 2013, Paris,
France, July 9-12, 2013},
pages = {225--233},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/ECRTS.2013.32},
doi = {10.1109/ECRTS.2013.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ecrts/BonifaciMSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AdamaszekW13,
author = {Anna Adamaszek and
Andreas Wiese},
title = {Approximation Schemes for Maximum Weight Independent Set of Rectangles},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {400--409},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.50},
doi = {10.1109/FOCS.2013.50},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AdamaszekW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/AnagnostopoulosGLW13,
author = {Aris Anagnostopoulos and
Fabrizio Grandoni and
Stefano Leonardi and
Andreas Wiese},
editor = {Michel X. Goemans and
Jos{\'{e}} Correa},
title = {Constant Integrality Gap {LP} Formulations of Unsplittable Flow on
a Path},
booktitle = {Integer Programming and Combinatorial Optimization - 16th International
Conference, {IPCO} 2013, Valpara{\'{\i}}so, Chile, March 18-20,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7801},
pages = {25--36},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36694-9\_3},
doi = {10.1007/978-3-642-36694-9\_3},
timestamp = {Wed, 03 Apr 2024 19:56:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/AnagnostopoulosGLW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/SviridenkoW13,
author = {Maxim Sviridenko and
Andreas Wiese},
editor = {Michel X. Goemans and
Jos{\'{e}} Correa},
title = {Approximating the Configuration-LP for Minimizing Weighted Sum of
Completion Times on Unrelated Machines},
booktitle = {Integer Programming and Combinatorial Optimization - 16th International
Conference, {IPCO} 2013, Valpara{\'{\i}}so, Chile, March 18-20,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7801},
pages = {387--398},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36694-9\_33},
doi = {10.1007/978-3-642-36694-9\_33},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/SviridenkoW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rtss/BonifaciMMW13,
author = {Vincenzo Bonifaci and
Alberto Marchetti{-}Spaccamela and
Nicole Megow and
Andreas Wiese},
title = {Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time
Tasks},
booktitle = {Proceedings of the {IEEE} 34th Real-Time Systems Symposium, {RTSS}
2013, Vancouver, BC, Canada, December 3-6, 2013},
pages = {236--245},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/RTSS.2013.31},
doi = {10.1109/RTSS.2013.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/rtss/BonifaciMMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuntherMMW13,
author = {Elisabeth G{\"{u}}nther and
Olaf Maurer and
Nicole Megow and
Andreas Wiese},
editor = {Sanjeev Khanna},
title = {A New Approach to Online Scheduling: Approximating the Optimal Competitive
Ratio},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {118--128},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.9},
doi = {10.1137/1.9781611973105.9},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuntherMMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-1912,
author = {Nicole Megow and
Andreas Wiese},
title = {Competitive-Ratio Approximation Schemes for Minimizing the Makespan
in the Online-List Model},
journal = {CoRR},
volume = {abs/1303.1912},
year = {2013},
url = {http://arxiv.org/abs/1303.1912},
eprinttype = {arXiv},
eprint = {1303.1912},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-1912.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AdamaszekW13,
author = {Anna Adamaszek and
Andreas Wiese},
title = {Approximation Schemes for Maximum Weight Independent Set of Rectangles},
journal = {CoRR},
volume = {abs/1307.1774},
year = {2013},
url = {http://arxiv.org/abs/1307.1774},
eprinttype = {arXiv},
eprint = {1307.1774},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AdamaszekW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AdamaszekW13a,
author = {Anna Adamaszek and
Andreas Wiese},
title = {A {QPTAS} for Maximum Weight Independent Set of Polygons with Polylogarithmically
Many Vertices},
journal = {CoRR},
volume = {abs/1307.4257},
year = {2013},
url = {http://arxiv.org/abs/1307.4257},
eprinttype = {arXiv},
eprint = {1307.4257},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AdamaszekW13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MnichW13,
author = {Matthias Mnich and
Andreas Wiese},
title = {Scheduling Meets Fixed-Parameter Tractability},
journal = {CoRR},
volume = {abs/1311.4021},
year = {2013},
url = {http://arxiv.org/abs/1311.4021},
eprinttype = {arXiv},
eprint = {1311.4021},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MnichW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Marchetti-SpaccamelaRSW12,
author = {Alberto Marchetti{-}Spaccamela and
Cyriel Rutten and
Suzanne van der Ster and
Andreas Wiese},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Assigning Sporadic Tasks to Unrelated Parallel Machines},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {665--676},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_56},
doi = {10.1007/978-3-642-31594-7\_56},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Marchetti-SpaccamelaRSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MegowSVW12,
author = {Nicole Megow and
Martin Skutella and
Jos{\'{e}} Verschae and
Andreas Wiese},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {The Power of Recourse for Online {MST} and {TSP}},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {689--700},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_58},
doi = {10.1007/978-3-642-31594-7\_58},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/MegowSVW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rtss/BaruahBMSW12,
author = {Sanjoy K. Baruah and
Vincenzo Bonifaci and
Alberto Marchetti{-}Spaccamela and
Leen Stougie and
Andreas Wiese},
title = {A Generalized Parallel Task Model for Recurrent Real-time Processes},
booktitle = {Proceedings of the 33rd {IEEE} Real-Time Systems Symposium, {RTSS}
2012, San Juan, PR, USA, December 4-7, 2012},
pages = {63--72},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/RTSS.2012.59},
doi = {10.1109/RTSS.2012.59},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/rtss/BaruahBMSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/NiemeierW12,
author = {Martin Niemeier and
Andreas Wiese},
editor = {Thomas Erlebach and
Giuseppe Persiano},
title = {Scheduling with an Orthogonal Resource Constraint},
booktitle = {Approximation and Online Algorithms - 10th International Workshop,
{WAOA} 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {7846},
pages = {242--256},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-38016-7\_20},
doi = {10.1007/978-3-642-38016-7\_20},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/NiemeierW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-0897,
author = {Elisabeth G{\"{u}}nther and
Olaf Maurer and
Nicole Megow and
Andreas Wiese},
title = {A New Approach to Online Scheduling: Approximating the Optimal Competitive
Ratio},
journal = {CoRR},
volume = {abs/1204.0897},
year = {2012},
url = {http://arxiv.org/abs/1204.0897},
eprinttype = {arXiv},
eprint = {1204.0897},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-0897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-0974,
author = {Vincenzo Bonifaci and
Andreas Wiese},
title = {Scheduling Unrelated Machines of Few Different Types},
journal = {CoRR},
volume = {abs/1205.0974},
year = {2012},
url = {http://arxiv.org/abs/1205.0974},
eprinttype = {arXiv},
eprint = {1205.0974},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-0974.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-2670,
author = {Aris Anagnostopoulos and
Fabrizio Grandoni and
Stefano Leonardi and
Andreas Wiese},
title = {A Mazing 2+eps Approximation for Unsplittable Flow on a Path},
journal = {CoRR},
volume = {abs/1211.2670},
year = {2012},
url = {http://arxiv.org/abs/1211.2670},
eprinttype = {arXiv},
eprint = {1211.2670},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-2670.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-2778,
author = {Vincenzo Bonifaci and
Alberto Marchetti{-}Spaccamela and
Sebastian Stiller and
Andreas Wiese},
title = {Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic {DAG}
Model},
journal = {CoRR},
volume = {abs/1212.2778},
year = {2012},
url = {http://arxiv.org/abs/1212.2778},
eprinttype = {arXiv},
eprint = {1212.2778},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-2778.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Wiese11a,
author = {Andreas Wiese},
title = {Packet routing and scheduling},
school = {Berlin Institute of Technology},
year = {2011},
url = {https://d-nb.info/1014555116},
isbn = {978-3-86955-827-1},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Wiese11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HassinenKKPSW11,
author = {Marja Hassinen and
Joel Kaasinen and
Evangelos Kranakis and
Valentin Polishchuk and
Jukka Suomela and
Andreas Wiese},
title = {Analysing local algorithms in location-aware quasi-unit-disk graphs},
journal = {Discret. Appl. Math.},
volume = {159},
number = {15},
pages = {1566--1580},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.05.004},
doi = {10.1016/J.DAM.2011.05.004},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HassinenKKPSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/it/EisenbrandNSVW11,
author = {Friedrich Eisenbrand and
Martin Niemeier and
Martin Skutella and
Jos{\'{e}} Verschae and
Andreas Wiese},
title = {Real-time Avionics Optimization},
journal = {it Inf. Technol.},
volume = {53},
number = {6},
pages = {274--279},
year = {2011},
url = {https://doi.org/10.1524/itit.2011.0653},
doi = {10.1524/ITIT.2011.0653},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/it/EisenbrandNSVW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KanjWZ11,
author = {Iyad A. Kanj and
Andreas Wiese and
Fenghui Zhang},
title = {Local algorithms for edge colorings in UDGs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4704--4714},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.005},
doi = {10.1016/J.TCS.2011.05.005},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KanjWZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecrts/NiemeierWB11,
author = {Martin Niemeier and
Andreas Wiese and
Sanjoy K. Baruah},
editor = {Karl{-}Erik {\AA}rz{\'{e}}n},
title = {Partitioned Real-time Scheduling on Heterogeneous Shared-Memory Multiprocessors},
booktitle = {23rd Euromicro Conference on Real-Time Systems, {ECRTS} 2011, Porto,
Portugal, 5-8 July, 2011},
pages = {115--124},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/ECRTS.2011.19},
doi = {10.1109/ECRTS.2011.19},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ecrts/NiemeierWB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/VerschaeW11,
author = {Jos{\'{e}} Verschae and
Andreas Wiese},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {On the Configuration-LP for Scheduling on Unrelated Machines},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {530--542},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_45},
doi = {10.1007/978-3-642-23719-5\_45},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/VerschaeW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BonsmaSW11,
author = {Paul S. Bonsma and
Jens Schulz and
Andreas Wiese},
editor = {Rafail Ostrovsky},
title = {A Constant Factor Approximation Algorithm for Unsplittable Flow on
Paths},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {47--56},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.10},
doi = {10.1109/FOCS.2011.10},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BonsmaSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/PeisW11,
author = {Britta Peis and
Andreas Wiese},
editor = {Oktay G{\"{u}}nl{\"{u}}k and
Gerhard J. Woeginger},
title = {Universal Packet Routing with Arbitrary Bandwidths and Transit Times},
booktitle = {Integer Programming and Combinatoral Optimization - 15th International
Conference, {IPCO} 2011, New York, NY, USA, June 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6655},
pages = {362--375},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20807-2\_29},
doi = {10.1007/978-3-642-20807-2\_29},
timestamp = {Tue, 29 Dec 2020 18:40:14 +0100},
biburl = {https://dblp.org/rec/conf/ipco/PeisW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-3643,
author = {Paul S. Bonsma and
Jens Schulz and
Andreas Wiese},
title = {A Constant Factor Approximation Algorithm for Unsplittable Flow on
Paths},
journal = {CoRR},
volume = {abs/1102.3643},
year = {2011},
url = {http://arxiv.org/abs/1102.3643},
eprinttype = {arXiv},
eprint = {1102.3643},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-3643.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/EisenbrandKMNNSVW10,
author = {Friedrich Eisenbrand and
Karthikeyan Kesavan and
Raju S. Mattikalli and
Martin Niemeier and
Arnold W. Nordsieck and
Martin Skutella and
Jos{\'{e}} Verschae and
Andreas Wiese},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {11--22},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_2},
doi = {10.1007/978-3-642-15775-2\_2},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/EisenbrandKMNNSVW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EisenbrandHNSVW10,
author = {Friedrich Eisenbrand and
Nicolai H{\"{a}}hnle and
Martin Niemeier and
Martin Skutella and
Jos{\'{e}} Verschae and
Andreas Wiese},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Scheduling Periodic Tasks in a Hard Real-Time Environment},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {299--311},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_26},
doi = {10.1007/978-3-642-14165-2\_26},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EisenbrandHNSVW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/PeisSW10,
author = {Britta Peis and
Sebastian Stiller and
Andreas Wiese},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {Policies for Periodic Packet Routing},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6507},
pages = {266--278},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17514-5\_23},
doi = {10.1007/978-3-642-17514-5\_23},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/PeisSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/StillerW10,
author = {Sebastian Stiller and
Andreas Wiese},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {Increasing Speed Scheduling and Flow Scheduling},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6507},
pages = {279--290},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17514-5\_24},
doi = {10.1007/978-3-642-17514-5\_24},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/StillerW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/PeisSW10,
author = {Britta Peis and
Martin Skutella and
Andreas Wiese},
editor = {Alejandro L{\'{o}}pez{-}Ortiz},
title = {Packet Routing on the Grid},
booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6034},
pages = {120--130},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12200-2\_12},
doi = {10.1007/978-3-642-12200-2\_12},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/PeisSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/PeisW10,
author = {Britta Peis and
Andreas Wiese},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Throughput Maximization for Periodic Packet Routing on Trees and Grids},
booktitle = {Approximation and Online Algorithms - 8th International Workshop,
{WAOA} 2010, Liverpool, UK, September 9-10, 2010. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6534},
pages = {213--224},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18318-8\_19},
doi = {10.1007/978-3-642-18318-8\_19},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/PeisW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/EisenbrandHNSVW10,
author = {Friedrich Eisenbrand and
Nicolai H{\"{a}}hnle and
Martin Niemeier and
Martin Skutella and
Jos{\'{e}} Verschae and
Andreas Wiese},
editor = {Susanne Albers and
Sanjoy K. Baruah and
Rolf H. M{\"{o}}hring and
Kirk Pruhs},
title = {Scheduling periodic tasks in a hard real-time environment},
booktitle = {Scheduling, 14.02. - 19.02.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10071},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2534/},
timestamp = {Thu, 10 Jun 2021 13:02:08 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/EisenbrandHNSVW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-4957,
author = {Jos{\'{e}} Verschae and
Andreas Wiese},
title = {On the Configuration-LP for Scheduling on Unrelated Machines},
journal = {CoRR},
volume = {abs/1011.4957},
year = {2010},
url = {http://arxiv.org/abs/1011.4957},
eprinttype = {arXiv},
eprint = {1011.4957},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-4957.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ahswn/WieseK09,
author = {Andreas Wiese and
Evangelos Kranakis},
title = {Local {PTAS} for Independent Set and Vertex Cover in Location Aware
Unit Disk Graphs?},
journal = {Ad Hoc Sens. Wirel. Networks},
volume = {7},
number = {3-4},
pages = {273--293},
year = {2009},
url = {http://www.oldcitypublishing.com/journals/ahswn-home/ahswn-issue-contents/ahswn-volume-7-number-3-4-2009/ahswn-7-3-4-p-273-293/},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ahswn/WieseK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/WieseK09,
author = {Andreas Wiese and
Evangelos Kranakis},
title = {Local Construction and Coloring of Spanners of Location Aware Unit
Disk Graphs},
journal = {Discret. Math. Algorithms Appl.},
volume = {1},
number = {4},
pages = {555--588},
year = {2009},
url = {https://doi.org/10.1142/S1793830909000415},
doi = {10.1142/S1793830909000415},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/WieseK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BhattacharyaBHKSW09,
author = {Binay K. Bhattacharya and
Mike Burmester and
Yuzhuang Hu and
Evangelos Kranakis and
Qiaosheng Shi and
Andreas Wiese},
title = {Optimal movement of mobile sensors for barrier coverage of a planar
region},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5515--5528},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.007},
doi = {10.1016/J.TCS.2009.07.007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BhattacharyaBHKSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KochPSW09,
author = {Ronald Koch and
Britta Peis and
Martin Skutella and
Andreas Wiese},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {Real-Time Message Routing and Scheduling},
booktitle = {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},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {217--230},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_17},
doi = {10.1007/978-3-642-03685-9\_17},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/KochPSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/PeisSW09,
author = {Britta Peis and
Martin Skutella and
Andreas Wiese},
editor = {Evripidis Bampis and
Klaus Jansen},
title = {Packet Routing: Complexity and Algorithms},
booktitle = {Approximation and Online Algorithms, 7th International Workshop, {WAOA}
2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5893},
pages = {217--228},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-12450-1\_20},
doi = {10.1007/978-3-642-12450-1\_20},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/PeisSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KanjWZ09,
author = {Iyad A. Kanj and
Andreas Wiese and
Fenghui Zhang},
editor = {Christophe Paul and
Michel Habib},
title = {Local Algorithms for Edge Colorings in UDGs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {202--213},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_18},
doi = {10.1007/978-3-642-11409-0\_18},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KanjWZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/WieseK08,
author = {Andreas Wiese and
Evangelos Kranakis},
title = {Impact of Locality on Location Aware Unit Disk Graphs},
journal = {Algorithms},
volume = {1},
number = {1},
pages = {2--29},
year = {2008},
url = {https://doi.org/10.3390/a1010002},
doi = {10.3390/A1010002},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/WieseK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/adhoc-now/WieseK08,
author = {Andreas Wiese and
Evangelos Kranakis},
editor = {David Coudert and
David Simplot{-}Ryl and
Ivan Stojmenovic},
title = {Local Maximal Matching and Local 2-Approximation for Vertex Cover
in UDGs},
booktitle = {Ad-hoc, Mobile and Wireless Networks, 7th International Conference,
{ADHOC-NOW} 2008, Sophia-Antipolis, France, September 10-12, 2008,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5198},
pages = {1--14},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85209-4\_1},
doi = {10.1007/978-3-540-85209-4\_1},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/adhoc-now/WieseK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/BhattacharyaBHKSW08,
author = {Binay K. Bhattacharya and
Mike Burmester and
Yuzhuang Hu and
Evangelos Kranakis and
Qiaosheng Shi and
Andreas Wiese},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar
Region},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {103--115},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_10},
doi = {10.1007/978-3-540-85097-7\_10},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/BhattacharyaBHKSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcoss/WieseK08,
author = {Andreas Wiese and
Evangelos Kranakis},
editor = {Sotiris E. Nikoletseas and
Bogdan S. Chlebus and
David B. Johnson and
Bhaskar Krishnamachari},
title = {Local {PTAS} for Independent Set and Vertex Cover in Location Aware
Unit Disk Graphs},
booktitle = {Distributed Computing in Sensor Systems, 4th {IEEE} International
Conference, {DCOSS} 2008, Santorini Island, Greece, June 11-14, 2008,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5067},
pages = {415--431},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69170-9\_28},
doi = {10.1007/978-3-540-69170-9\_28},
timestamp = {Mon, 01 Jul 2019 18:18:38 +0200},
biburl = {https://dblp.org/rec/conf/dcoss/WieseK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/CaragiannisKKKW08,
author = {Ioannis Caragiannis and
Christos Kaklamanis and
Evangelos Kranakis and
Danny Krizanc and
Andreas Wiese},
editor = {Friedhelm Meyer auf der Heide and
Nir Shavit},
title = {Communication in wireless networks with directional antennas},
booktitle = {{SPAA} 2008: Proceedings of the 20th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, Munich, Germany, June 14-16, 2008},
pages = {344--351},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1378533.1378592},
doi = {10.1145/1378533.1378592},
timestamp = {Wed, 21 Nov 2018 11:14:43 +0100},
biburl = {https://dblp.org/rec/conf/spaa/CaragiannisKKKW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/WieseK08,
author = {Andreas Wiese and
Evangelos Kranakis},
editor = {Evripidis Bampis and
Martin Skutella},
title = {Local {PTAS} for Dominating and Connected Dominating Set in Location
Aware Unit Disk Graphs},
booktitle = {Approximation and Online Algorithms, 6th International Workshop, {WAOA}
2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5426},
pages = {227--240},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-93980-1\_18},
doi = {10.1007/978-3-540-93980-1\_18},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/WieseK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/WieseK08,
author = {Andreas Wiese and
Evangelos Kranakis},
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {Local Construction and Coloring of Spanners of Location Aware Unit
Disk Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
pages = {372--383},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3\_33},
doi = {10.1007/978-3-540-92248-3\_33},
timestamp = {Sun, 25 Oct 2020 23:07:56 +0100},
biburl = {https://dblp.org/rec/conf/wg/WieseK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-04-11 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
