var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https://dblp.uni-trier.de/pers/tb1/d/Damerius:Christoph.bib&jsonp=1&nocache=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https://dblp.uni-trier.de/pers/tb1/d/Damerius:Christoph.bib&jsonp=1&nocache=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https://dblp.uni-trier.de/pers/tb1/d/Damerius:Christoph.bib&jsonp=1&nocache=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2023\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Improved Scheduling with a Shared Resource.\n \n \n \n \n\n\n \n Damerius, C.; Kling, P.; and Schneider, F.\n\n\n \n\n\n\n In Wu, W.; and Guo, J., editor(s), Combinatorial Optimization and Applications - 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I, volume 14461, of Lecture Notes in Computer Science, pages 154–167, 2023. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ImprovedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/cocoa/DameriusKS23,\n  author       = {Christoph Damerius and\n                  Peter Kling and\n                  Florian Schneider},\n  editor       = {Weili Wu and\n                  Jianxiong Guo},\n  title        = {Improved Scheduling with a Shared Resource},\n  booktitle    = {Combinatorial Optimization and Applications - 17th International Conference,\n                  {COCOA} 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings,\n                  Part {I}},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {14461},\n  pages        = {154--167},\n  publisher    = {Springer},\n  year         = {2023},\n  url          = {https://doi.org/10.1007/978-3-031-49611-0\\_11},\n  doi          = {10.1007/978-3-031-49611-0\\_11},\n  timestamp    = {Thu, 08 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/cocoa/DameriusKS23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings.\n \n \n \n \n\n\n \n Damerius, C.; Kling, P.; Li, M.; Xu, C.; and Zhang, R.\n\n\n \n\n\n\n In Gørtz, I. L.; Farach-Colton, M.; Puglisi, S. J.; and Herman, G., editor(s), 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, volume 274, of LIPIcs, pages 38:1–38:15, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"SchedulingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/esa/DameriusKLX023,\n  author       = {Christoph Damerius and\n                  Peter Kling and\n                  Minming Li and\n                  Chenyang Xu and\n                  Ruilong Zhang},\n  editor       = {Inge Li G{\\o}rtz and\n                  Martin Farach{-}Colton and\n                  Simon J. Puglisi and\n                  Grzegorz Herman},\n  title        = {Scheduling with a Limited Testing Budget: Tight Results for the Offline\n                  and Oblivious Settings},\n  booktitle    = {31st Annual European Symposium on Algorithms, {ESA} 2023, September\n                  4-6, 2023, Amsterdam, The Netherlands},\n  series       = {LIPIcs},\n  volume       = {274},\n  pages        = {38:1--38:15},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2023},\n  url          = {https://doi.org/10.4230/LIPIcs.ESA.2023.38},\n  doi          = {10.4230/LIPICS.ESA.2023.38},\n  timestamp    = {Sun, 17 Dec 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/esa/DameriusKLX023.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Scheduling with a Limited Testing Budget.\n \n \n \n \n\n\n \n Damerius, C.; Kling, P.; Li, M.; Xu, C.; and Zhang, R.\n\n\n \n\n\n\n CoRR, abs/2306.15597. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"SchedulingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2306-15597,\n  author       = {Christoph Damerius and\n                  Peter Kling and\n                  Minming Li and\n                  Chenyang Xu and\n                  Ruilong Zhang},\n  title        = {Scheduling with a Limited Testing Budget},\n  journal      = {CoRR},\n  volume       = {abs/2306.15597},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2306.15597},\n  doi          = {10.48550/ARXIV.2306.15597},\n  eprinttype    = {arXiv},\n  eprint       = {2306.15597},\n  timestamp    = {Sun, 17 Dec 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2306-15597.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Improved Scheduling with a Shared Resource.\n \n \n \n \n\n\n \n Damerius, C.; Kling, P.; and Schneider, F.\n\n\n \n\n\n\n CoRR, abs/2310.05732. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"ImprovedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2310-05732,\n  author       = {Christoph Damerius and\n                  Peter Kling and\n                  Florian Schneider},\n  title        = {Improved Scheduling with a Shared Resource},\n  journal      = {CoRR},\n  volume       = {abs/2310.05732},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2310.05732},\n  doi          = {10.48550/ARXIV.2310.05732},\n  eprinttype    = {arXiv},\n  eprint       = {2310.05732},\n  timestamp    = {Thu, 08 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-05732.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On Greedily Packing Anchored Rectangles.\n \n \n \n \n\n\n \n Damerius, C.; Kaaser, D.; Kling, P.; and Schneider, F.\n\n\n \n\n\n\n In Bansal, N.; Merelli, E.; and Worrell, J., editor(s), 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), volume 198, of LIPIcs, pages 61:1–61:20, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/icalp/DameriusKKS21,\n  author       = {Christoph Damerius and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Florian Schneider},\n  editor       = {Nikhil Bansal and\n                  Emanuela Merelli and\n                  James Worrell},\n  title        = {On Greedily Packing Anchored Rectangles},\n  booktitle    = {48th International Colloquium on Automata, Languages, and Programming,\n                  {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},\n  series       = {LIPIcs},\n  volume       = {198},\n  pages        = {61:1--61:20},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2021},\n  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2021.61},\n  doi          = {10.4230/LIPICS.ICALP.2021.61},\n  timestamp    = {Thu, 08 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/icalp/DameriusKKS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Minimum Generalized Manhattan Connections.\n \n \n \n \n\n\n \n Antoniadis, A.; Capretto, M.; Chalermsook, P.; Damerius, C.; Kling, P.; Nölke, L.; Acosta, N. O.; and Spoerhase, J.\n\n\n \n\n\n\n In Lubiw, A.; and Salavatipour, M. R., editor(s), Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings, volume 12808, of Lecture Notes in Computer Science, pages 85–100, 2021. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/wads/AntoniadisCCDKN21,\n  author       = {Antonios Antoniadis and\n                  Margarita Capretto and\n                  Parinya Chalermsook and\n                  Christoph Damerius and\n                  Peter Kling and\n                  Lukas N{\\"{o}}lke and\n                  Nidia Obscura Acosta and\n                  Joachim Spoerhase},\n  editor       = {Anna Lubiw and\n                  Mohammad R. Salavatipour},\n  title        = {On Minimum Generalized Manhattan Connections},\n  booktitle    = {Algorithms and Data Structures - 17th International Symposium, {WADS}\n                  2021, Virtual Event, August 9-11, 2021, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {12808},\n  pages        = {85--100},\n  publisher    = {Springer},\n  year         = {2021},\n  url          = {https://doi.org/10.1007/978-3-030-83508-8\\_7},\n  doi          = {10.1007/978-3-030-83508-8\\_7},\n  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/wads/AntoniadisCCDKN21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Greedily Packing Anchored Rectangles.\n \n \n \n \n\n\n \n Damerius, C.; Kaaser, D.; Kling, P.; and Schneider, F.\n\n\n \n\n\n\n CoRR, abs/2102.08181. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2102-08181,\n  author       = {Christoph Damerius and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Florian Schneider},\n  title        = {On Greedily Packing Anchored Rectangles},\n  journal      = {CoRR},\n  volume       = {abs/2102.08181},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2102.08181},\n  eprinttype    = {arXiv},\n  eprint       = {2102.08181},\n  timestamp    = {Thu, 08 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2102-08181.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Improved Scheduling with a Shared Resource via Structural Insights.\n \n \n \n \n\n\n \n Damerius, C.; Kling, P.; Li, M.; Schneider, F.; and Zhang, R.\n\n\n \n\n\n\n In Wu, W.; and Zhang, Z., editor(s), Combinatorial Optimization and Applications - 14th International Conference, COCOA 2020, Dallas, TX, USA, December 11-13, 2020, Proceedings, volume 12577, of Lecture Notes in Computer Science, pages 168–182, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ImprovedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/cocoa/DameriusKLSZ20,\n  author       = {Christoph Damerius and\n                  Peter Kling and\n                  Minming Li and\n                  Florian Schneider and\n                  Ruilong Zhang},\n  editor       = {Weili Wu and\n                  Zhongnan Zhang},\n  title        = {Improved Scheduling with a Shared Resource via Structural Insights},\n  booktitle    = {Combinatorial Optimization and Applications - 14th International Conference,\n                  {COCOA} 2020, Dallas, TX, USA, December 11-13, 2020, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {12577},\n  pages        = {168--182},\n  publisher    = {Springer},\n  year         = {2020},\n  url          = {https://doi.org/10.1007/978-3-030-64843-5\\_12},\n  doi          = {10.1007/978-3-030-64843-5\\_12},\n  timestamp    = {Thu, 08 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/cocoa/DameriusKLSZ20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Minimum Generalized Manhattan Connections.\n \n \n \n \n\n\n \n Antoniadis, A.; Capretto, M.; Chalermsook, P.; Damerius, C.; Kling, P.; Nölke, L.; Acosta, N. O.; and Spoerhase, J.\n\n\n \n\n\n\n CoRR, abs/2010.14338. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2010-14338,\n  author       = {Antonios Antoniadis and\n                  Margarita Capretto and\n                  Parinya Chalermsook and\n                  Christoph Damerius and\n                  Peter Kling and\n                  Lukas N{\\"{o}}lke and\n                  Nidia Obscura Acosta and\n                  Joachim Spoerhase},\n  title        = {On Minimum Generalized Manhattan Connections},\n  journal      = {CoRR},\n  volume       = {abs/2010.14338},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2010.14338},\n  eprinttype    = {arXiv},\n  eprint       = {2010.14338},\n  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-14338.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On the Complexity of Anchored Rectangle Packing.\n \n \n \n \n\n\n \n Antoniadis, A.; Biermeier, F.; Cristi, A.; Damerius, C.; Hoeksma, R.; Kaaser, D.; Kling, P.; and Nölke, L.\n\n\n \n\n\n\n In Bender, M. A.; Svensson, O.; and Herman, G., editor(s), 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany, volume 144, of LIPIcs, pages 8:1–8:14, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/esa/AntoniadisBCDHK19,\n  author       = {Antonios Antoniadis and\n                  Felix Biermeier and\n                  Andr{\\'{e}}s Cristi and\n                  Christoph Damerius and\n                  Ruben Hoeksma and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Lukas N{\\"{o}}lke},\n  editor       = {Michael A. Bender and\n                  Ola Svensson and\n                  Grzegorz Herman},\n  title        = {On the Complexity of Anchored Rectangle Packing},\n  booktitle    = {27th Annual European Symposium on Algorithms, {ESA} 2019, September\n                  9-11, 2019, Munich/Garching, Germany},\n  series       = {LIPIcs},\n  volume       = {144},\n  pages        = {8:1--8:14},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2019},\n  url          = {https://doi.org/10.4230/LIPIcs.ESA.2019.8},\n  doi          = {10.4230/LIPICS.ESA.2019.8},\n  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/esa/AntoniadisBCDHK19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);