BibTeX records: Yann Disser

download as .bib file

@article{DBLP:journals/siamdm/DisserW24,
  author       = {Yann Disser and
                  David Weckbecker},
  title        = {Unified Greedy Approximability beyond Submodular Maximization},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {38},
  number       = {1},
  pages        = {348--379},
  year         = {2024},
  url          = {https://doi.org/10.1137/22m1526952},
  doi          = {10.1137/22M1526952},
  timestamp    = {Thu, 29 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamdm/DisserW24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DisserKLW24,
  author       = {Yann Disser and
                  Max Klimm and
                  Annette Lutz and
                  David Weckbecker},
  title        = {Fractionally Subadditive Maximization under an Incremental Knapsack
                  Constraint with Applications to Incremental Flows},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {38},
  number       = {1},
  pages        = {764--789},
  year         = {2024},
  url          = {https://doi.org/10.1137/23m1569265},
  doi          = {10.1137/23M1569265},
  timestamp    = {Thu, 29 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamdm/DisserKLW24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-13938,
  author       = {J{\'{u}}lia Balig{\'{a}}cs and
                  Yann Disser and
                  Andreas Emil Feldmann and
                  Anna Zych{-}Pawlewicz},
  title        = {A (5/3+{\(\epsilon\)})-Approximation for Tricolored Non-crossing Euclidean
                  {TSP}},
  journal      = {CoRR},
  volume       = {abs/2402.13938},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2402.13938},
  doi          = {10.48550/ARXIV.2402.13938},
  eprinttype    = {arXiv},
  eprint       = {2402.13938},
  timestamp    = {Fri, 22 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2402-13938.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BirxDS23,
  author       = {Alexander Birx and
                  Yann Disser and
                  Kevin Schewior},
  title        = {Improved Bounds for Open Online Dial-a-Ride on the Line},
  journal      = {Algorithmica},
  volume       = {85},
  number       = {5},
  pages        = {1372--1414},
  year         = {2023},
  url          = {https://doi.org/10.1007/s00453-022-01061-4},
  doi          = {10.1007/S00453-022-01061-4},
  timestamp    = {Sat, 29 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BirxDS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/EmdeZD23,
  author       = {Simon Emde and
                  Shohre Zehtabian and
                  Yann Disser},
  title        = {Point-to-point and milk run delivery scheduling: models, complexity
                  results, and algorithms based on Benders decomposition},
  journal      = {Ann. Oper. Res.},
  volume       = {322},
  number       = {1},
  pages        = {467--496},
  year         = {2023},
  url          = {https://doi.org/10.1007/s10479-022-04891-1},
  doi          = {10.1007/S10479-022-04891-1},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/anor/EmdeZD23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DisserFH23,
  author       = {Yann Disser and
                  Oliver Friedmann and
                  Alexander V. Hopp},
  title        = {An exponential lower bound for Zadeh's pivot rule},
  journal      = {Math. Program.},
  volume       = {199},
  number       = {1},
  pages        = {865--936},
  year         = {2023},
  url          = {https://doi.org/10.1007/s10107-022-01848-x},
  doi          = {10.1007/S10107-022-01848-X},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/DisserFH23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asiacrypt/DisserGSSWY23,
  author       = {Yann Disser and
                  Daniel G{\"{u}}nther and
                  Thomas Schneider and
                  Maximilian Stillger and
                  Arthur Wigandt and
                  Hossein Yalame},
  editor       = {Jian Guo and
                  Ron Steinfeld},
  title        = {Breaking the Size Barrier: Universal Circuits Meet Lookup Tables},
  booktitle    = {Advances in Cryptology - {ASIACRYPT} 2023 - 29th International Conference
                  on the Theory and Application of Cryptology and Information Security,
                  Guangzhou, China, December 4-8, 2023, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {14438},
  pages        = {3--37},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-981-99-8721-4\_1},
  doi          = {10.1007/978-981-99-8721-4\_1},
  timestamp    = {Fri, 26 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/asiacrypt/DisserGSSWY23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BaligacsDHS23,
  author       = {J{\'{u}}lia Balig{\'{a}}cs and
                  Yann Disser and
                  Irene Heinrich and
                  Pascal Schweitzer},
  editor       = {Inge Li G{\o}rtz and
                  Martin Farach{-}Colton and
                  Simon J. Puglisi and
                  Grzegorz Herman},
  title        = {Exploration of Graphs with Excluded Minors},
  booktitle    = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
                  4-6, 2023, Amsterdam, The Netherlands},
  series       = {LIPIcs},
  volume       = {274},
  pages        = {11:1--11:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2023.11},
  doi          = {10.4230/LIPICS.ESA.2023.11},
  timestamp    = {Wed, 30 Aug 2023 15:40:45 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/BaligacsDHS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DisserKSW23,
  author       = {Yann Disser and
                  Max Klimm and
                  Kevin Schewior and
                  David Weckbecker},
  editor       = {Kousha Etessami and
                  Uriel Feige and
                  Gabriele Puppis},
  title        = {Incremental Maximization via Continuization},
  booktitle    = {50th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
  series       = {LIPIcs},
  volume       = {261},
  pages        = {47:1--47:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2023.47},
  doi          = {10.4230/LIPICS.ICALP.2023.47},
  timestamp    = {Wed, 05 Jul 2023 16:19:52 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/DisserKSW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DisserM23,
  author       = {Yann Disser and
                  Nils Mosis},
  editor       = {Satoru Iwata and
                  Naonori Kakimura},
  title        = {A Unified Worst Case for Classical Simplex and Policy Iteration Pivot
                  Rules},
  booktitle    = {34th International Symposium on Algorithms and Computation, {ISAAC}
                  2023, December 3-6, 2023, Kyoto, Japan},
  series       = {LIPIcs},
  volume       = {283},
  pages        = {27:1--27:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.27},
  doi          = {10.4230/LIPICS.ISAAC.2023.27},
  timestamp    = {Tue, 28 Nov 2023 13:12:50 +0100},
  biburl       = {https://dblp.org/rec/conf/isaac/DisserM23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BaligacsDSW23,
  author       = {J{\'{u}}lia Balig{\'{a}}cs and
                  Yann Disser and
                  Farehe Soheil and
                  David Weckbecker},
  editor       = {Pat Morin and
                  Subhash Suri},
  title        = {Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride},
  booktitle    = {Algorithms and Data Structures - 18th International Symposium, {WADS}
                  2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {14079},
  pages        = {43--64},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-38906-1\_4},
  doi          = {10.1007/978-3-031-38906-1\_4},
  timestamp    = {Fri, 18 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/BaligacsDSW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-01310,
  author       = {Yann Disser and
                  Max Klimm and
                  Kevin Schewior and
                  David Weckbecker},
  title        = {Incremental Maximization via Continuization},
  journal      = {CoRR},
  volume       = {abs/2305.01310},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2305.01310},
  doi          = {10.48550/ARXIV.2305.01310},
  eprinttype    = {arXiv},
  eprint       = {2305.01310},
  timestamp    = {Fri, 05 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2305-01310.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-06823,
  author       = {J{\'{u}}lia Balig{\'{a}}cs and
                  Yann Disser and
                  Irene Heinrich and
                  Pascal Schweitzer},
  title        = {Exploration of graphs with excluded minors},
  journal      = {CoRR},
  volume       = {abs/2308.06823},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2308.06823},
  doi          = {10.48550/ARXIV.2308.06823},
  eprinttype    = {arXiv},
  eprint       = {2308.06823},
  timestamp    = {Wed, 23 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2308-06823.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-14034,
  author       = {Yann Disser and
                  Nils Mosis},
  title        = {A unified worst case for classical simplex and policy iteration pivot
                  rules},
  journal      = {CoRR},
  volume       = {abs/2309.14034},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2309.14034},
  doi          = {10.48550/ARXIV.2309.14034},
  eprinttype    = {arXiv},
  eprint       = {2309.14034},
  timestamp    = {Wed, 27 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2309-14034.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BernsteinD0H22,
  author       = {Aaron Bernstein and
                  Yann Disser and
                  Martin Gro{\ss} and
                  Sandra Himburg},
  title        = {General bounds for incremental maximization},
  journal      = {Math. Program.},
  volume       = {191},
  number       = {2},
  pages        = {953--979},
  year         = {2022},
  url          = {https://doi.org/10.1007/s10107-020-01576-0},
  doi          = {10.1007/S10107-020-01576-0},
  timestamp    = {Fri, 13 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BernsteinD0H22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/DisserW22,
  author       = {Yann Disser and
                  David Weckbecker},
  editor       = {Ivana Ljubic and
                  Francisco Barahona and
                  Santanu S. Dey and
                  Ali Ridha Mahjoub},
  title        = {Unified Greedy Approximability Beyond Submodular Maximization},
  booktitle    = {Combinatorial Optimization - 7th International Symposium, {ISCO} 2022,
                  Virtual Event, May 18-20, 2022, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {13526},
  pages        = {299--311},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-18530-4\_22},
  doi          = {10.1007/978-3-031-18530-4\_22},
  timestamp    = {Mon, 06 Nov 2023 13:38:03 +0100},
  biburl       = {https://dblp.org/rec/conf/iscopt/DisserW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/0001DF0Z22,
  author       = {Johannes Blum and
                  Yann Disser and
                  Andreas Emil Feldmann and
                  Siddharth Gupta and
                  Anna Zych{-}Pawlewicz},
  editor       = {Holger Dell and
                  Jesper Nederlof},
  title        = {On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension},
  booktitle    = {17th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2022, September 7-9, 2022, Potsdam, Germany},
  series       = {LIPIcs},
  volume       = {249},
  pages        = {5:1--5:23},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2022.5},
  doi          = {10.4230/LIPICS.IPEC.2022.5},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/0001DF0Z22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BaligacsDMW22,
  author       = {J{\'{u}}lia Balig{\'{a}}cs and
                  Yann Disser and
                  Nils Mosis and
                  David Weckbecker},
  editor       = {Parinya Chalermsook and
                  Bundit Laekhanukit},
  title        = {An Improved Algorithm for Open Online Dial-a-Ride},
  booktitle    = {Approximation and Online Algorithms - 20th International Workshop,
                  {WAOA} 2022, Potsdam, Germany, September 8-9, 2022, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13538},
  pages        = {154--171},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-18367-6\_8},
  doi          = {10.1007/978-3-031-18367-6\_8},
  timestamp    = {Mon, 05 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/waoa/BaligacsDMW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/22/DisserK22,
  author       = {Yann Disser and
                  Max Klimm},
  editor       = {Hannah Bast and
                  Claudius Korzen and
                  Ulrich Meyer and
                  Manuel Penschuck},
  title        = {The Space Complexity of Undirected Graph Exploration},
  booktitle    = {Algorithms for Big Data - {DFG} Priority Program 1736},
  series       = {Lecture Notes in Computer Science},
  volume       = {13201},
  pages        = {152--166},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-21534-6\_8},
  doi          = {10.1007/978-3-031-21534-6\_8},
  timestamp    = {Tue, 28 Feb 2023 10:35:03 +0100},
  biburl       = {https://dblp.org/rec/books/sp/22/DisserK22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-14132,
  author       = {Johannes Blum and
                  Yann Disser and
                  Andreas Emil Feldmann and
                  Siddharth Gupta and
                  Anna Zych{-}Pawlewicz},
  title        = {On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension},
  journal      = {CoRR},
  volume       = {abs/2208.14132},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2208.14132},
  doi          = {10.48550/ARXIV.2208.14132},
  eprinttype    = {arXiv},
  eprint       = {2208.14132},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2208-14132.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-13850,
  author       = {J{\'{u}}lia Balig{\'{a}}cs and
                  Yann Disser and
                  David Weckbecker},
  title        = {Tight analysis of lazy: an improved algorithm for open online dial-a-ride},
  journal      = {CoRR},
  volume       = {abs/2210.13850},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2210.13850},
  doi          = {10.48550/ARXIV.2210.13850},
  eprinttype    = {arXiv},
  eprint       = {2210.13850},
  timestamp    = {Mon, 31 Oct 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2210-13850.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-13854,
  author       = {J{\'{u}}lia Balig{\'{a}}cs and
                  Yann Disser and
                  Nils Mosis and
                  David Weckbecker},
  title        = {An Improved Algorithm for Open Online Dial-a-Ride},
  journal      = {CoRR},
  volume       = {abs/2210.13854},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2210.13854},
  doi          = {10.48550/ARXIV.2210.13854},
  eprinttype    = {arXiv},
  eprint       = {2210.13854},
  timestamp    = {Mon, 31 Oct 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2210-13854.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/DisserGSSWY22,
  author       = {Yann Disser and
                  Daniel G{\"{u}}nther and
                  Thomas Schneider and
                  Maximilian Stillger and
                  Arthur Wigandt and
                  Hossein Yalame},
  title        = {Improved Universal Circuits using Lookup Tables},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {1652},
  year         = {2022},
  url          = {https://eprint.iacr.org/2022/1652},
  timestamp    = {Thu, 05 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iacr/DisserGSSWY22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DisserFKK21,
  author       = {Yann Disser and
                  Andreas Emil Feldmann and
                  Max Klimm and
                  Jochen K{\"{o}}nemann},
  title        = {Travelling on Graphs with Small Highway Dimension},
  journal      = {Algorithmica},
  volume       = {83},
  number       = {5},
  pages        = {1352--1370},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00453-020-00785-5},
  doi          = {10.1007/S00453-020-00785-5},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DisserFKK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BjeldeHDHLMSSS21,
  author       = {Antje Bjelde and
                  Jan Hackfeld and
                  Yann Disser and
                  Christoph Hansknecht and
                  Maarten Lipmann and
                  Julie Mei{\ss}ner and
                  Miriam Schl{\"{o}}ter and
                  Kevin Schewior and
                  Leen Stougie},
  title        = {Tight Bounds for Online {TSP} on the Line},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {17},
  number       = {1},
  pages        = {3:1--3:58},
  year         = {2021},
  url          = {https://doi.org/10.1145/3422362},
  doi          = {10.1145/3422362},
  timestamp    = {Fri, 19 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/BjeldeHDHLMSSS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BirxDHK21,
  author       = {Alexander Birx and
                  Yann Disser and
                  Alexander V. Hopp and
                  Christina Karousatou},
  title        = {An improved lower bound for competitive graph exploration},
  journal      = {Theor. Comput. Sci.},
  volume       = {868},
  pages        = {65--86},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.tcs.2021.04.003},
  doi          = {10.1016/J.TCS.2021.04.003},
  timestamp    = {Sun, 16 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BirxDHK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChalopinDDLM21,
  author       = {J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Arnaud Labourel and
                  Mat{\'{u}}s Mihal{\'{a}}k},
  title        = {Collaborative delivery on a fixed path with homogeneous energy-constrained
                  agents},
  journal      = {Theor. Comput. Sci.},
  volume       = {868},
  pages        = {87--96},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.tcs.2021.04.004},
  doi          = {10.1016/J.TCS.2021.04.004},
  timestamp    = {Sun, 16 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ChalopinDDLM21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChenCDFHNPPSWZ21,
  author       = {Jiehua Chen and
                  Wojciech Czerwinski and
                  Yann Disser and
                  Andreas Emil Feldmann and
                  Danny Hermelin and
                  Wojciech Nadara and
                  Marcin Pilipczuk and
                  Michal Pilipczuk and
                  Manuel Sorge and
                  Bartlomiej Wr{\'{o}}blewski and
                  Anna Zych{-}Pawlewicz},
  editor       = {D{\'{a}}niel Marx},
  title        = {Efficient fully dynamic elimination forests with applications to detecting
                  long paths and cycles},
  booktitle    = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2021, Virtual Conference, January 10 - 13, 2021},
  pages        = {796--809},
  publisher    = {{SIAM}},
  year         = {2021},
  url          = {https://doi.org/10.1137/1.9781611976465.50},
  doi          = {10.1137/1.9781611976465.50},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ChenCDFHNPPSWZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DisserKW21,
  author       = {Yann Disser and
                  Max Klimm and
                  David Weckbecker},
  editor       = {Jochen K{\"{o}}nemann and
                  Britta Peis},
  title        = {Fractionally Subadditive Maximization Under an Incremental Knapsack
                  Constraint},
  booktitle    = {Approximation and Online Algorithms - 19th International Workshop,
                  {WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {12982},
  pages        = {206--223},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-92702-8\_13},
  doi          = {10.1007/978-3-030-92702-8\_13},
  timestamp    = {Fri, 21 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/waoa/DisserKW21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-14454,
  author       = {Yann Disser and
                  Max Klimm and
                  David Weckbecker},
  title        = {Fractionally Subadditive Maximization under an Incremental Knapsack
                  Constraint},
  journal      = {CoRR},
  volume       = {abs/2106.14454},
  year         = {2021},
  url          = {https://arxiv.org/abs/2106.14454},
  eprinttype    = {arXiv},
  eprint       = {2106.14454},
  timestamp    = {Wed, 30 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2106-14454.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DisserFGGKSST20,
  author       = {Yann Disser and
                  John Fearnley and
                  Martin Gairing and
                  Oliver G{\"{o}}bel and
                  Max Klimm and
                  Daniel Schmand and
                  Alexander Skopalik and
                  Andreas T{\"{o}}nnis},
  title        = {Hiring Secretaries over Time: The Benefit of Concurrent Employment},
  journal      = {Math. Oper. Res.},
  volume       = {45},
  number       = {1},
  pages        = {323--352},
  year         = {2020},
  url          = {https://doi.org/10.1287/moor.2019.0993},
  doi          = {10.1287/MOOR.2019.0993},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/DisserFGGKSST20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DisserM20,
  author       = {Yann Disser and
                  Jannik Matuschke},
  title        = {The complexity of computing a robust flow},
  journal      = {Oper. Res. Lett.},
  volume       = {48},
  number       = {1},
  pages        = {18--23},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.orl.2019.10.012},
  doi          = {10.1016/J.ORL.2019.10.012},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/orl/DisserM20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BirxD20,
  author       = {Alexander Birx and
                  Yann Disser},
  title        = {Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride
                  on the Line},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {34},
  number       = {2},
  pages        = {1409--1443},
  year         = {2020},
  url          = {https://doi.org/10.1137/19M1268513},
  doi          = {10.1137/19M1268513},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/BirxD20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BartschiCDDGGLM20,
  author       = {Andreas B{\"{a}}rtschi and
                  J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Barbara Geissmann and
                  Daniel Graf and
                  Arnaud Labourel and
                  Mat{\'{u}}s Mihal{\'{a}}k},
  title        = {Collaborative delivery with energy-constrained mobile robots},
  journal      = {Theor. Comput. Sci.},
  volume       = {810},
  pages        = {2--14},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2017.04.018},
  doi          = {10.1016/J.TCS.2017.04.018},
  timestamp    = {Sat, 16 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BartschiCDDGGLM20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DisserMNSS20,
  author       = {Yann Disser and
                  Frank Mousset and
                  Andreas Noever and
                  Nemanja Skoric and
                  Angelika Steger},
  title        = {A general lower bound for collaborative tree exploration},
  journal      = {Theor. Comput. Sci.},
  volume       = {811},
  pages        = {70--78},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2018.03.006},
  doi          = {10.1016/J.TCS.2018.03.006},
  timestamp    = {Tue, 18 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DisserMNSS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BosekDFPZ20,
  author       = {Bartlomiej Bosek and
                  Yann Disser and
                  Andreas Emil Feldmann and
                  Jakub Pawlewicz and
                  Anna Zych{-}Pawlewicz},
  editor       = {Susanne Albers},
  title        = {Recoloring Interval Graphs with Limited Recourse Budget},
  booktitle    = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
                  2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
  series       = {LIPIcs},
  volume       = {162},
  pages        = {17:1--17:23},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.SWAT.2020.17},
  doi          = {10.4230/LIPICS.SWAT.2020.17},
  timestamp    = {Tue, 16 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/BosekDFPZ20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-10958,
  author       = {Alexander Birx and
                  Yann Disser and
                  Alexander V. Hopp and
                  Christina Karousatou},
  title        = {Improved Lower Bound for Competitive Graph Exploration},
  journal      = {CoRR},
  volume       = {abs/2002.10958},
  year         = {2020},
  url          = {https://arxiv.org/abs/2002.10958},
  eprinttype    = {arXiv},
  eprint       = {2002.10958},
  timestamp    = {Tue, 03 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2002-10958.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-00571,
  author       = {Jiehua Chen and
                  Wojciech Czerwinski and
                  Yann Disser and
                  Andreas Emil Feldmann and
                  Danny Hermelin and
                  Wojciech Nadara and
                  Michal Pilipczuk and
                  Marcin Pilipczuk and
                  Manuel Sorge and
                  Bartlomiej Wr{\'{o}}blewski and
                  Anna Zych{-}Pawlewicz},
  title        = {On Dynamic Parameterized k-Path},
  journal      = {CoRR},
  volume       = {abs/2006.00571},
  year         = {2020},
  url          = {https://arxiv.org/abs/2006.00571},
  eprinttype    = {arXiv},
  eprint       = {2006.00571},
  timestamp    = {Mon, 30 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2006-00571.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-00962,
  author       = {Yann Disser and
                  David Weckbecker},
  title        = {Unified greedy approximability beyond submodular maximization},
  journal      = {CoRR},
  volume       = {abs/2011.00962},
  year         = {2020},
  url          = {https://arxiv.org/abs/2011.00962},
  eprinttype    = {arXiv},
  eprint       = {2011.00962},
  timestamp    = {Fri, 06 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2011-00962.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DisserKS19,
  author       = {Yann Disser and
                  Stefan Kratsch and
                  Manuel Sorge},
  title        = {The Minimum Feasible Tileset Problem},
  journal      = {Algorithmica},
  volume       = {81},
  number       = {3},
  pages        = {1126--1151},
  year         = {2019},
  url          = {https://doi.org/10.1007/s00453-018-0460-3},
  doi          = {10.1007/S00453-018-0460-3},
  timestamp    = {Sat, 02 Mar 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DisserKS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DisserHK19,
  author       = {Yann Disser and
                  Jan Hackfeld and
                  Max Klimm},
  title        = {Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple
                  Agents},
  journal      = {J. {ACM}},
  volume       = {66},
  number       = {6},
  pages        = {40:1--40:41},
  year         = {2019},
  url          = {https://doi.org/10.1145/3356883},
  doi          = {10.1145/3356883},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/DisserHK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jap/KhudaBukhshADK19,
  author       = {Wasiur R. KhudaBukhsh and
                  Arnab Auddy and
                  Yann Disser and
                  Heinz Koeppl},
  title        = {Approximate lumpability for Markovian agent-based models using local
                  symmetries},
  journal      = {J. Appl. Probab.},
  volume       = {56},
  number       = {3},
  pages        = {647--671},
  year         = {2019},
  url          = {https://doi.org/10.1017/jpr.2019.44},
  doi          = {10.1017/JPR.2019.44},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jap/KhudaBukhshADK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BernsteinDDKMS19,
  author       = {Aaron Bernstein and
                  Karl D{\"{a}}ubel and
                  Yann Disser and
                  Max Klimm and
                  Torsten M{\"{u}}tze and
                  Frieder Smolny},
  title        = {Distance-Preserving Graph Contractions},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {33},
  number       = {3},
  pages        = {1607--1636},
  year         = {2019},
  url          = {https://doi.org/10.1137/18M1169382},
  doi          = {10.1137/18M1169382},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/BernsteinDDKMS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DisserS19,
  author       = {Yann Disser and
                  Martin Skutella},
  title        = {The Simplex Algorithm Is NP-Mighty},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {15},
  number       = {1},
  pages        = {5:1--5:19},
  year         = {2019},
  url          = {https://doi.org/10.1145/3280847},
  doi          = {10.1145/3280847},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/DisserS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AbedCDGMMRR19,
  author       = {Fidaa Abed and
                  Lin Chen and
                  Yann Disser and
                  Martin Gro{\ss} and
                  Nicole Megow and
                  Julie Mei{\ss}ner and
                  Alexander T. Richter and
                  Roman Rischke},
  title        = {Scheduling maintenance jobs in networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {754},
  pages        = {107--121},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.02.020},
  doi          = {10.1016/J.TCS.2018.02.020},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AbedCDGMMRR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BirxDS19,
  author       = {Alexander Birx and
                  Yann Disser and
                  Kevin Schewior},
  editor       = {Dimitris Achlioptas and
                  L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
  title        = {Improved Bounds for Open Online Dial-a-Ride on the Line},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
                  Institute of Technology, Cambridge, MA, {USA}},
  series       = {LIPIcs},
  volume       = {145},
  pages        = {21:1--21:22},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.21},
  doi          = {10.4230/LIPICS.APPROX-RANDOM.2019.21},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BirxDS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/DisserH19,
  author       = {Yann Disser and
                  Alexander V. Hopp},
  editor       = {Andrea Lodi and
                  Viswanath Nagarajan},
  title        = {On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule},
  booktitle    = {Integer Programming and Combinatorial Optimization - 20th International
                  Conference, {IPCO} 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11480},
  pages        = {168--180},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-17953-3\_13},
  doi          = {10.1007/978-3-030-17953-3\_13},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/DisserH19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/Chalopin0DLM19,
  author       = {J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Arnaud Labourel and
                  Mat{\'{u}}s Mihal{\'{a}}k},
  editor       = {Keren Censor{-}Hillel and
                  Michele Flammini},
  title        = {Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained
                  Agents},
  booktitle    = {Structural Information and Communication Complexity - 26th International
                  Colloquium, {SIROCCO} 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11639},
  pages        = {139--153},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-24922-9\_10},
  doi          = {10.1007/978-3-030-24922-9\_10},
  timestamp    = {Mon, 15 Jul 2019 16:09:50 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/Chalopin0DLM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/DisserS19,
  author       = {Yann Disser and
                  S{\"{o}}ren Schmitt},
  editor       = {Keren Censor{-}Hillel and
                  Michele Flammini},
  title        = {Evacuating Two Robots from a Disk: {A} Second Cut},
  booktitle    = {Structural Information and Communication Complexity - 26th International
                  Colloquium, {SIROCCO} 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11639},
  pages        = {200--214},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-24922-9\_14},
  doi          = {10.1007/978-3-030-24922-9\_14},
  timestamp    = {Mon, 15 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/DisserS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BirxD19,
  author       = {Alexander Birx and
                  Yann Disser},
  editor       = {Rolf Niedermeier and
                  Christophe Paul},
  title        = {Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride
                  on the Line},
  booktitle    = {36th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2019, March 13-16, 2019, Berlin, Germany},
  series       = {LIPIcs},
  volume       = {126},
  pages        = {15:1--15:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2019.15},
  doi          = {10.4230/LIPICS.STACS.2019.15},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/BirxD19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DisserFKK19,
  author       = {Yann Disser and
                  Andreas Emil Feldmann and
                  Max Klimm and
                  Jochen K{\"{o}}nemann},
  editor       = {Ignasi Sau and
                  Dimitrios M. Thilikos},
  title        = {Travelling on Graphs with Small Highway Dimension},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 45th International
                  Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
                  2019, Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {11789},
  pages        = {175--189},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-30786-8\_14},
  doi          = {10.1007/978-3-030-30786-8\_14},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wg/DisserFKK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/algocloud/2018,
  editor       = {Yann Disser and
                  Vassilios S. Verykios},
  title        = {Algorithmic Aspects of Cloud Computing - 4th International Symposium,
                  {ALGOCLOUD} 2018, Helsinki, Finland, August 20-21, 2018, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {11409},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-19759-9},
  doi          = {10.1007/978-3-030-19759-9},
  isbn         = {978-3-030-19758-2},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/algocloud/2018.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-04272,
  author       = {Alexander Birx and
                  Yann Disser},
  title        = {Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride
                  on the Line},
  journal      = {CoRR},
  volume       = {abs/1901.04272},
  year         = {2019},
  url          = {http://arxiv.org/abs/1901.04272},
  eprinttype    = {arXiv},
  eprint       = {1901.04272},
  timestamp    = {Sun, 03 Feb 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1901-04272.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-07040,
  author       = {Yann Disser and
                  Andreas Emil Feldmann and
                  Max Klimm and
                  Jochen K{\"{o}}nemann},
  title        = {Travelling on Graphs with Small Highway Dimension},
  journal      = {CoRR},
  volume       = {abs/1902.07040},
  year         = {2019},
  url          = {http://arxiv.org/abs/1902.07040},
  eprinttype    = {arXiv},
  eprint       = {1902.07040},
  timestamp    = {Tue, 21 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1902-07040.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-10592,
  author       = {Yann Disser and
                  S{\"{o}}ren Schmitt},
  title        = {Evacuating Two Robots from a Disk: {A} Second Cut},
  journal      = {CoRR},
  volume       = {abs/1905.10592},
  year         = {2019},
  url          = {http://arxiv.org/abs/1905.10592},
  eprinttype    = {arXiv},
  eprint       = {1905.10592},
  timestamp    = {Mon, 03 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1905-10592.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01074,
  author       = {Yann Disser and
                  Oliver Friedmann and
                  Alexander V. Hopp},
  title        = {An Exponential Lower Bound for Zadeh's pivot rule},
  journal      = {CoRR},
  volume       = {abs/1911.01074},
  year         = {2019},
  url          = {http://arxiv.org/abs/1911.01074},
  eprinttype    = {arXiv},
  eprint       = {1911.01074},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1911-01074.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BernsteinDDKMS18,
  author       = {Aaron Bernstein and
                  Karl D{\"{a}}ubel and
                  Yann Disser and
                  Max Klimm and
                  Torsten M{\"{u}}tze and
                  Frieder Smolny},
  editor       = {Anna R. Karlin},
  title        = {Distance-Preserving Graph Contractions},
  booktitle    = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2018, January 11-14, 2018, Cambridge, MA, {USA}},
  series       = {LIPIcs},
  volume       = {94},
  pages        = {51:1--51:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2018.51},
  doi          = {10.4230/LIPICS.ITCS.2018.51},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/innovations/BernsteinDDKMS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-03476,
  author       = {Yann Disser and
                  Jan Hackfeld and
                  Max Klimm},
  title        = {Tight bounds for undirected graph exploration with pebbles and multiple
                  agents},
  journal      = {CoRR},
  volume       = {abs/1805.03476},
  year         = {2018},
  url          = {http://arxiv.org/abs/1805.03476},
  eprinttype    = {arXiv},
  eprint       = {1805.03476},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1805-03476.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DisserKMS17,
  author       = {Yann Disser and
                  Max Klimm and
                  Nicole Megow and
                  Sebastian Stiller},
  title        = {Packing a Knapsack of Unknown Capacity},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {31},
  number       = {3},
  pages        = {1477--1497},
  year         = {2017},
  url          = {https://doi.org/10.1137/16M1070049},
  doi          = {10.1137/16M1070049},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/DisserKMS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Abed0DGMMRR17,
  author       = {Fidaa Abed and
                  Lin Chen and
                  Yann Disser and
                  Martin Gro{\ss} and
                  Nicole Megow and
                  Julie Mei{\ss}ner and
                  Alexander T. Richter and
                  Roman Rischke},
  editor       = {Dimitris Fotakis and
                  Aris Pagourtzis and
                  Vangelis Th. Paschos},
  title        = {Scheduling Maintenance Jobs in Networks},
  booktitle    = {Algorithms and Complexity - 10th International Conference, {CIAC}
                  2017, Athens, Greece, May 24-26, 2017, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10236},
  pages        = {19--30},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-57586-5\_3},
  doi          = {10.1007/978-3-319-57586-5\_3},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ciac/Abed0DGMMRR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BernsteinDG17,
  author       = {Aaron Bernstein and
                  Yann Disser and
                  Martin Gro{\ss}},
  editor       = {Ioannis Chatzigiannakis and
                  Piotr Indyk and
                  Fabian Kuhn and
                  Anca Muscholl},
  title        = {General Bounds for Incremental Maximization},
  booktitle    = {44th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  series       = {LIPIcs},
  volume       = {80},
  pages        = {43:1--43:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2017.43},
  doi          = {10.4230/LIPICS.ICALP.2017.43},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/BernsteinDG17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/DisserMNSS17,
  author       = {Yann Disser and
                  Frank Mousset and
                  Andreas Noever and
                  Nemanja Skoric and
                  Angelika Steger},
  editor       = {Shantanu Das and
                  S{\'{e}}bastien Tixeuil},
  title        = {A General Lower Bound for Collaborative Tree Exploration},
  booktitle    = {Structural Information and Communication Complexity - 24th International
                  Colloquium, {SIROCCO} 2017, Porquerolles, France, June 19-22, 2017,
                  Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {10641},
  pages        = {125--139},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-72050-0\_8},
  doi          = {10.1007/978-3-319-72050-0\_8},
  timestamp    = {Tue, 14 May 2019 10:00:55 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/DisserMNSS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BjeldeDHHLMSSS17,
  author       = {Antje Bjelde and
                  Yann Disser and
                  Jan Hackfeld and
                  Christoph Hansknecht and
                  Maarten Lipmann and
                  Julie Mei{\ss}ner and
                  Kevin Schewior and
                  Miriam Schl{\"{o}}ter and
                  Leen Stougie},
  editor       = {Philip N. Klein},
  title        = {Tight Bounds for Online {TSP} on the Line},
  booktitle    = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
                  16-19},
  pages        = {994--1005},
  publisher    = {{SIAM}},
  year         = {2017},
  url          = {https://doi.org/10.1137/1.9781611974782.63},
  doi          = {10.1137/1.9781611974782.63},
  timestamp    = {Fri, 19 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BjeldeDHHLMSSS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BartschiC0D0HP17,
  author       = {Andreas B{\"{a}}rtschi and
                  J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Daniel Graf and
                  Jan Hackfeld and
                  Paolo Penna},
  editor       = {Heribert Vollmer and
                  Brigitte Vall{\'{e}}e},
  title        = {Energy-Efficient Delivery by Heterogeneous Mobile Agents},
  booktitle    = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
                  2017, March 8-11, 2017, Hannover, Germany},
  series       = {LIPIcs},
  volume       = {66},
  pages        = {10:1--10:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2017.10},
  doi          = {10.4230/LIPICS.STACS.2017.10},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BartschiC0D0HP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DisserK17,
  author       = {Yann Disser and
                  Stefan Kratsch},
  editor       = {Heribert Vollmer and
                  Brigitte Vall{\'{e}}e},
  title        = {Robust and Adaptive Search},
  booktitle    = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
                  2017, March 8-11, 2017, Hannover, Germany},
  series       = {LIPIcs},
  volume       = {66},
  pages        = {26:1--26:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2017.26},
  doi          = {10.4230/LIPICS.STACS.2017.26},
  timestamp    = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/DisserK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Abed0DGMMRR17,
  author       = {Fidaa Abed and
                  Lin Chen and
                  Yann Disser and
                  Martin Gro{\ss} and
                  Nicole Megow and
                  Julie Mei{\ss}ner and
                  Alexander T. Richter and
                  Roman Rischke},
  title        = {Scheduling Maintenance Jobs in Networks},
  journal      = {CoRR},
  volume       = {abs/1701.08809},
  year         = {2017},
  url          = {http://arxiv.org/abs/1701.08809},
  eprinttype    = {arXiv},
  eprint       = {1701.08809},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Abed0DGMMRR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DisserK17,
  author       = {Yann Disser and
                  Stefan Kratsch},
  title        = {Robust and adaptive search},
  journal      = {CoRR},
  volume       = {abs/1702.05932},
  year         = {2017},
  url          = {http://arxiv.org/abs/1702.05932},
  eprinttype    = {arXiv},
  eprint       = {1702.05932},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DisserK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DisserM17,
  author       = {Yann Disser and
                  Jannik Matuschke},
  title        = {The Complexity of Computing a Robust Flow},
  journal      = {CoRR},
  volume       = {abs/1704.08241},
  year         = {2017},
  url          = {http://arxiv.org/abs/1704.08241},
  eprinttype    = {arXiv},
  eprint       = {1704.08241},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DisserM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DaubelDKMS17,
  author       = {Karl D{\"{a}}ubel and
                  Yann Disser and
                  Max Klimm and
                  Torsten M{\"{u}}tze and
                  Frieder Smolny},
  title        = {Distance-preserving graph contractions},
  journal      = {CoRR},
  volume       = {abs/1705.04544},
  year         = {2017},
  url          = {http://arxiv.org/abs/1705.04544},
  eprinttype    = {arXiv},
  eprint       = {1705.04544},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DaubelDKMS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BernsteinDG17,
  author       = {Aaron Bernstein and
                  Yann Disser and
                  Martin Gro{\ss}},
  title        = {General Bounds for Incremental Maximization},
  journal      = {CoRR},
  volume       = {abs/1705.10253},
  year         = {2017},
  url          = {http://arxiv.org/abs/1705.10253},
  eprinttype    = {arXiv},
  eprint       = {1705.10253},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BernsteinDG17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DisserM16,
  author       = {Yann Disser and
                  Jannik Matuschke},
  title        = {Degree-constrained orientations of embedded graphs},
  journal      = {J. Comb. Optim.},
  volume       = {31},
  number       = {2},
  pages        = {758--773},
  year         = {2016},
  url          = {https://doi.org/10.1007/s10878-014-9786-1},
  doi          = {10.1007/S10878-014-9786-1},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jco/DisserM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BohmovaDMS16,
  author       = {Katerina B{\"{o}}hmov{\'{a}} and
                  Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Rastislav Sr{\'{a}}mek},
  editor       = {Evangelos Kranakis and
                  Gonzalo Navarro and
                  Edgar Ch{\'{a}}vez},
  title        = {Scheduling Transfers of Resources over Time: Towards Car-Sharing with
                  Flexible Drop-Offs},
  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        = {220--234},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-662-49529-2\_17},
  doi          = {10.1007/978-3-662-49529-2\_17},
  timestamp    = {Wed, 28 Feb 2024 00:16:41 +0100},
  biburl       = {https://dblp.org/rec/conf/latin/BohmovaDMS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BartschiC0DGGLM16,
  author       = {Andreas B{\"{a}}rtschi and
                  J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Barbara Geissmann and
                  Daniel Graf and
                  Arnaud Labourel and
                  Mat{\'{u}}s Mihal{\'{a}}k},
  editor       = {Jukka Suomela},
  title        = {Collaborative Delivery with Energy-Constrained Mobile Robots},
  booktitle    = {Structural Information and Communication Complexity - 23rd International
                  Colloquium, {SIROCCO} 2016, Helsinki, Finland, July 19-21, 2016, Revised
                  Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9988},
  pages        = {258--274},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-48314-6\_17},
  doi          = {10.1007/978-3-319-48314-6\_17},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/BartschiC0DGGLM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DisserHK16,
  author       = {Yann Disser and
                  Jan Hackfeld and
                  Max Klimm},
  editor       = {Robert Krauthgamer},
  title        = {Undirected Graph Exploration with {\(\circleddash\)}(log log \emph{n})
                  Pebbles},
  booktitle    = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages        = {25--39},
  publisher    = {{SIAM}},
  year         = {2016},
  url          = {https://doi.org/10.1137/1.9781611974331.ch3},
  doi          = {10.1137/1.9781611974331.CH3},
  timestamp    = {Tue, 02 Feb 2021 17:07:56 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/DisserHK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DisserFG0KSST16,
  author       = {Yann Disser and
                  John Fearnley and
                  Martin Gairing and
                  Oliver G{\"{o}}bel and
                  Max Klimm and
                  Daniel Schmand and
                  Alexander Skopalik and
                  Andreas T{\"{o}}nnis},
  title        = {Hiring Secretaries over Time: The Benefit of Concurrent Employment},
  journal      = {CoRR},
  volume       = {abs/1604.08125},
  year         = {2016},
  url          = {http://arxiv.org/abs/1604.08125},
  eprinttype    = {arXiv},
  eprint       = {1604.08125},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DisserFG0KSST16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BartschiC0DGGLM16,
  author       = {Andreas B{\"{a}}rtschi and
                  J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Barbara Geissmann and
                  Daniel Graf and
                  Arnaud Labourel and
                  Mat{\'{u}}s Mihal{\'{a}}k},
  title        = {Collaborative Delivery with Energy-Constrained Mobile Robots},
  journal      = {CoRR},
  volume       = {abs/1608.08500},
  year         = {2016},
  url          = {http://arxiv.org/abs/1608.08500},
  eprinttype    = {arXiv},
  eprint       = {1608.08500},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BartschiC0DGGLM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DisserMNSS16,
  author       = {Yann Disser and
                  Frank Mousset and
                  Andreas Noever and
                  Nemanja Skoric and
                  Angelika Steger},
  title        = {A general lower bound for collaborative tree exploration},
  journal      = {CoRR},
  volume       = {abs/1610.01753},
  year         = {2016},
  url          = {http://arxiv.org/abs/1610.01753},
  eprinttype    = {arXiv},
  eprint       = {1610.01753},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DisserMNSS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BartschiC0DGHP16,
  author       = {Andreas B{\"{a}}rtschi and
                  J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Daniel Graf and
                  Jan Hackfeld and
                  Paolo Penna},
  title        = {Energy-efficient Delivery by Heterogeneous Mobile Agents},
  journal      = {CoRR},
  volume       = {abs/1610.02361},
  year         = {2016},
  url          = {http://arxiv.org/abs/1610.02361},
  eprinttype    = {arXiv},
  eprint       = {1610.02361},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BartschiC0DGHP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DereniowskiDKPU15,
  author       = {Dariusz Dereniowski and
                  Yann Disser and
                  Adrian Kosowski and
                  Dominik Pajak and
                  Przemyslaw Uznanski},
  title        = {Fast collaborative graph exploration},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {37--49},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.005},
  doi          = {10.1016/J.IC.2014.12.005},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/DereniowskiDKPU15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Chalopin0DMW15,
  author       = {J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Peter Widmayer},
  title        = {Mapping Simple Polygons: The Power of Telling Convex from Reflex},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {11},
  number       = {4},
  pages        = {33:1--33:16},
  year         = {2015},
  url          = {https://doi.org/10.1145/2700223},
  doi          = {10.1145/2700223},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/Chalopin0DMW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DisserFKM15,
  author       = {Yann Disser and
                  Andreas Emil Feldmann and
                  Max Klimm and
                  Mat{\'{u}}s Mihal{\'{a}}k},
  title        = {Improving the Hk-bound on the price of stability in undirected Shapley
                  network design games},
  journal      = {Theor. Comput. Sci.},
  volume       = {562},
  pages        = {557--564},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2014.10.037},
  doi          = {10.1016/J.TCS.2014.10.037},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DisserFKM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DisserKL15,
  author       = {Yann Disser and
                  Max Klimm and
                  Elisabeth L{\"{u}}bbecke},
  editor       = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Kazuo Iwama and
                  Naoki Kobayashi and
                  Bettina Speckmann},
  title        = {Scheduling Bidirectional Traffic on a Path},
  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        = {406--418},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-47672-7\_33},
  doi          = {10.1007/978-3-662-47672-7\_33},
  timestamp    = {Fri, 27 Mar 2020 09:02:59 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/DisserKL15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DisserS15,
  author       = {Yann Disser and
                  Martin Skutella},
  editor       = {Piotr Indyk},
  title        = {The Simplex Algorithm is NP-mighty},
  booktitle    = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  pages        = {858--872},
  publisher    = {{SIAM}},
  year         = {2015},
  url          = {https://doi.org/10.1137/1.9781611973730.59},
  doi          = {10.1137/1.9781611973730.59},
  timestamp    = {Tue, 02 Feb 2021 17:07:30 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/DisserS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DisserKL15,
  author       = {Yann Disser and
                  Max Klimm and
                  Elisabeth L{\"{u}}bbecke},
  title        = {Scheduling Bidirectional Traffic on a Path},
  journal      = {CoRR},
  volume       = {abs/1504.07129},
  year         = {2015},
  url          = {http://arxiv.org/abs/1504.07129},
  eprinttype    = {arXiv},
  eprint       = {1504.07129},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DisserKL15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DisserGMW14,
  author       = {Yann Disser and
                  Subir Kumar Ghosh and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Peter Widmayer},
  title        = {Mapping a polygon with holes using a compass},
  journal      = {Theor. Comput. Sci.},
  volume       = {553},
  pages        = {106--113},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.12.010},
  doi          = {10.1016/J.TCS.2013.12.010},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DisserGMW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/DisserMMW14,
  author       = {Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Sandro Montanari and
                  Peter Widmayer},
  editor       = {Pierre Fouilhoux and
                  Luis Eduardo Neves Gouveia and
                  Ali Ridha Mahjoub and
                  Vangelis Th. Paschos},
  title        = {Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with
                  Neighborhoods},
  booktitle    = {Combinatorial Optimization - Third International Symposium, {ISCO}
                  2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8596},
  pages        = {208--220},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-09174-7\_18},
  doi          = {10.1007/978-3-319-09174-7\_18},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/iscopt/DisserMMW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DisserKMS14,
  author       = {Yann Disser and
                  Max Klimm and
                  Nicole Megow and
                  Sebastian Stiller},
  editor       = {Ernst W. Mayr and
                  Natacha Portier},
  title        = {Packing a Knapsack of Unknown Capacity},
  booktitle    = {31st International Symposium on Theoretical Aspects of Computer Science
                  {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
  series       = {LIPIcs},
  volume       = {25},
  pages        = {276--287},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2014},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2014.276},
  doi          = {10.4230/LIPICS.STACS.2014.276},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/DisserKMS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DisserKS14,
  author       = {Yann Disser and
                  Stefan Kratsch and
                  Manuel Sorge},
  editor       = {Evripidis Bampis and
                  Ola Svensson},
  title        = {The Minimum Feasible Tileset Problem},
  booktitle    = {Approximation and Online Algorithms - 12th International Workshop,
                  {WAOA} 2014, Wroc{\l}aw, Poland, September 11-12, 2014, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8952},
  pages        = {144--155},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-18263-6\_13},
  doi          = {10.1007/978-3-319-18263-6\_13},
  timestamp    = {Thu, 23 Sep 2021 11:48:40 +0200},
  biburl       = {https://dblp.org/rec/conf/waoa/DisserKS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DisserKS14,
  author       = {Yann Disser and
                  Stefan Kratsch and
                  Manuel Sorge},
  title        = {The Minimum Feasible Tileset problem},
  journal      = {CoRR},
  volume       = {abs/1409.8524},
  year         = {2014},
  url          = {http://arxiv.org/abs/1409.8524},
  eprinttype    = {arXiv},
  eprint       = {1409.8524},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DisserKS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Chalopin0DMW13,
  author       = {J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Peter Widmayer},
  title        = {Mapping Simple Polygons: How Robots Benefit from Looking Back},
  journal      = {Algorithmica},
  volume       = {65},
  number       = {1},
  pages        = {43--59},
  year         = {2013},
  url          = {https://doi.org/10.1007/s00453-011-9572-8},
  doi          = {10.1007/S00453-011-9572-8},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Chalopin0DMW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Chalopin0DMW13,
  author       = {J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Peter Widmayer},
  title        = {Simple agents learn to find their way: An introduction on mapping
                  polygons},
  journal      = {Discret. Appl. Math.},
  volume       = {161},
  number       = {10-11},
  pages        = {1287--1307},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.dam.2013.01.006},
  doi          = {10.1016/J.DAM.2013.01.006},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Chalopin0DMW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/BiloDGMPW13,
  author       = {Davide Bil{\`{o}} and
                  Yann Disser and
                  Luciano Gual{\`{a}} and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Guido Proietti and
                  Peter Widmayer},
  editor       = {Paola Flocchini and
                  Jie Gao and
                  Evangelos Kranakis and
                  Friedhelm Meyer auf der Heide},
  title        = {Polygon-Constrained Motion Planning Problems},
  booktitle    = {Algorithms for Sensor Systems - 9th International Symposium on Algorithms
                  and Experiments for Sensor Systems, Wireless Networks and Distributed
                  Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September
                  5-6, 2013, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8243},
  pages        = {67--82},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-45346-5\_6},
  doi          = {10.1007/978-3-642-45346-5\_6},
  timestamp    = {Sun, 12 Mar 2023 00:57:49 +0100},
  biburl       = {https://dblp.org/rec/conf/algosensors/BiloDGMPW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DisserFKM13,
  author       = {Yann Disser and
                  Andreas Emil Feldmann and
                  Max Klimm and
                  Mat{\'{u}}s Mihal{\'{a}}k},
  editor       = {Paul G. Spirakis and
                  Maria J. Serna},
  title        = {Improving the \emph{H} \({}_{\mbox{ \emph{k} }}\)-Bound on the Price
                  of Stability in Undirected Shapley Network Design Games},
  booktitle    = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
                  Barcelona, Spain, May 22-24, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7878},
  pages        = {158--169},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-38233-8\_14},
  doi          = {10.1007/978-3-642-38233-8\_14},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/ciac/DisserFKM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DereniowskiDKPU13,
  author       = {Dariusz Dereniowski and
                  Yann Disser and
                  Adrian Kosowski and
                  Dominik Pajak and
                  Przemyslaw Uznanski},
  editor       = {Fedor V. Fomin and
                  Rusins Freivalds and
                  Marta Z. Kwiatkowska and
                  David Peleg},
  title        = {Fast Collaborative Graph Exploration},
  booktitle    = {Automata, Languages, and Programming - 40th International Colloquium,
                  {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7966},
  pages        = {520--532},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-39212-2\_46},
  doi          = {10.1007/978-3-642-39212-2\_46},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/DereniowskiDKPU13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BohmovaDMW13,
  author       = {Katerina B{\"{o}}hmov{\'{a}} and
                  Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Peter Widmayer},
  editor       = {Frank Dehne and
                  Roberto Solis{-}Oba and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title        = {Interval Selection with Machine-Dependent Intervals},
  booktitle    = {Algorithms and Data Structures - 13th International Symposium, {WADS}
                  2013, London, ON, Canada, August 12-14, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8037},
  pages        = {170--181},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40104-6\_15},
  doi          = {10.1007/978-3-642-40104-6\_15},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/BohmovaDMW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DisserKMS13,
  author       = {Yann Disser and
                  Max Klimm and
                  Nicole Megow and
                  Sebastian Stiller},
  title        = {Packing a Knapsack of Unknown Capacity},
  journal      = {CoRR},
  volume       = {abs/1307.2806},
  year         = {2013},
  url          = {http://arxiv.org/abs/1307.2806},
  eprinttype    = {arXiv},
  eprint       = {1307.2806},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DisserKMS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DisserS13,
  author       = {Yann Disser and
                  Martin Skutella},
  title        = {In defense of the Simplex Algorithm's worst-case behavior},
  journal      = {CoRR},
  volume       = {abs/1311.5935},
  year         = {2013},
  url          = {http://arxiv.org/abs/1311.5935},
  eprinttype    = {arXiv},
  eprint       = {1311.5935},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DisserS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloDMSVW12,
  author       = {Davide Bil{\`{o}} and
                  Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Subhash Suri and
                  Elias Vicari and
                  Peter Widmayer},
  title        = {Reconstructing visibility graphs with simple robots},
  journal      = {Theor. Comput. Sci.},
  volume       = {444},
  pages        = {52--59},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.008},
  doi          = {10.1016/J.TCS.2012.01.008},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BiloDMSVW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/DisserGMW12,
  author       = {Yann Disser and
                  Subir Kumar Ghosh and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Peter Widmayer},
  editor       = {Amotz Bar{-}Noy and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {Mapping a Polygon with Holes Using a Compass},
  booktitle    = {Algorithms for Sensor Systems, 8th International Symposium on Algorithms
                  for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile
                  Entities, {ALGOSENSORS} 2012, Ljubljana, Slovenia, September 13-14,
                  2012. Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {7718},
  pages        = {78--89},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-36092-3\_9},
  doi          = {10.1007/978-3-642-36092-3\_9},
  timestamp    = {Tue, 14 May 2019 10:00:36 +0200},
  biburl       = {https://dblp.org/rec/conf/algosensors/DisserGMW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DisserM12,
  author       = {Yann Disser and
                  Jannik Matuschke},
  editor       = {Kun{-}Mao Chao and
                  Tsan{-}sheng Hsu and
                  Der{-}Tsai Lee},
  title        = {Degree-Constrained Orientations of Embedded Graphs},
  booktitle    = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
                  2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7676},
  pages        = {506--516},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-35261-4\_53},
  doi          = {10.1007/978-3-642-35261-4\_53},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/DisserM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wafr/DisserMW12,
  author       = {Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Peter Widmayer},
  editor       = {Emilio Frazzoli and
                  Tom{\'{a}}s Lozano{-}P{\'{e}}rez and
                  Nicholas Roy and
                  Daniela Rus},
  title        = {Mapping Polygons with Agents That Measure Angles},
  booktitle    = {Algorithmic Foundations of Robotics {X} - Proceedings of the Tenth
                  Workshop on the Algorithmic Foundations of Robotics, {WAFR} 2012,
                  MIT, Cambridge, Massachusetts, USA, June 13-15 2012},
  series       = {Springer Tracts in Advanced Robotics},
  volume       = {86},
  pages        = {415--425},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-36279-8\_25},
  doi          = {10.1007/978-3-642-36279-8\_25},
  timestamp    = {Fri, 19 May 2017 01:26:04 +0200},
  biburl       = {https://dblp.org/rec/conf/wafr/DisserMW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-3850,
  author       = {J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Peter Widmayer},
  title        = {Simple Agents Learn to Find Their Way: An Introduction on Mapping
                  Polygons},
  journal      = {CoRR},
  volume       = {abs/1204.3850},
  year         = {2012},
  url          = {http://arxiv.org/abs/1204.3850},
  eprinttype    = {arXiv},
  eprint       = {1204.3850},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1204-3850.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-2090,
  author       = {Yann Disser and
                  Andreas Emil Feldmann and
                  Max Klimm and
                  Mat{\'{u}}s Mihal{\'{a}}k},
  title        = {Improving the {\textdollar}H{\_}k{\textdollar}-Bound on the Price
                  of Stability in Undirected Shapley Network Design Games},
  journal      = {CoRR},
  volume       = {abs/1211.2090},
  year         = {2012},
  url          = {http://arxiv.org/abs/1211.2090},
  eprinttype    = {arXiv},
  eprint       = {1211.2090},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1211-2090.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ch/Disser2011,
  author       = {Yann Disser},
  title        = {Mapping Polygons},
  school       = {{ETH} Zurich},
  year         = {2011},
  url          = {https://d-nb.info/1017419175},
  doi          = {10.3929/ETHZ-A-006883263},
  isbn         = {978-3-8325-3023-5},
  timestamp    = {Wed, 17 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/phd/ch/Disser2011.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/DisserMW11,
  author       = {Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Peter Widmayer},
  title        = {A polygon is determined by its angles},
  journal      = {Comput. Geom.},
  volume       = {44},
  number       = {8},
  pages        = {418--426},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.comgeo.2011.04.003},
  doi          = {10.1016/J.COMGEO.2011.04.003},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/DisserMW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChalopinDDMW11,
  author       = {J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Peter Widmayer},
  editor       = {Thomas Schwentick and
                  Christoph D{\"{u}}rr},
  title        = {Telling convex from reflex allows to map a polygon},
  booktitle    = {28th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2011, March 10-12, 2011, Dortmund, Germany},
  series       = {LIPIcs},
  volume       = {9},
  pages        = {153--164},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2011},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2011.153},
  doi          = {10.4230/LIPICS.STACS.2011.153},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/ChalopinDDMW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChalopinDDMW10,
  author       = {J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Peter Widmayer},
  editor       = {Tiziana Calamoneri and
                  Josep D{\'{\i}}az},
  title        = {How Simple Robots Benefit from Looking Back},
  booktitle    = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
                  Rome, Italy, May 26-28, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6078},
  pages        = {229--239},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13073-1\_21},
  doi          = {10.1007/978-3-642-13073-1\_21},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/ciac/ChalopinDDMW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DisserMW10,
  author       = {Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Peter Widmayer},
  editor       = {Haim Kaplan},
  title        = {Reconstructing a Simple Polygon from Its Angles},
  booktitle    = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
                  on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6139},
  pages        = {13--24},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13731-0\_2},
  doi          = {10.1007/978-3-642-13731-0\_2},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/DisserMW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BiloDMSVW09,
  author       = {Davide Bil{\`{o}} and
                  Yann Disser and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Subhash Suri and
                  Elias Vicari and
                  Peter Widmayer},
  editor       = {Shay Kutten and
                  Janez Zerovnik},
  title        = {Reconstructing Visibility Graphs with Simple Robots},
  booktitle    = {Structural Information and Communication Complexity, 16th International
                  Colloquium, {SIROCCO} 2009, Piran, Slovenia, May 25-27, 2009, Revised
                  Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5869},
  pages        = {87--99},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-11476-2\_8},
  doi          = {10.1007/978-3-642-11476-2\_8},
  timestamp    = {Tue, 14 May 2019 10:00:55 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/BiloDMSVW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/DisserMS08,
  author       = {Yann Disser and
                  Matthias M{\"{u}}ller{-}Hannemann and
                  Mathias Schnee},
  editor       = {Catherine C. McGeoch},
  title        = {Multi-criteria Shortest Paths in Time-Dependent Train Networks},
  booktitle    = {Experimental Algorithms, 7th International Workshop, {WEA} 2008, Provincetown,
                  MA, USA, May 30-June 1, 2008, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5038},
  pages        = {347--361},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-68552-4\_26},
  doi          = {10.1007/978-3-540-68552-4\_26},
  timestamp    = {Tue, 14 May 2019 10:00:42 +0200},
  biburl       = {https://dblp.org/rec/conf/wea/DisserMS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics