Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Tobias Mömke
@article{DBLP:journals/corr/abs-2403-06691, author = {Tobias M{\"{o}}mke and Alexandru Popa and Aida Roshany{-}Tabrizi and Michael Ruderer and Roland Vincze}, title = {Approximating Maximum Edge 2-Coloring by Normalizing Graphs}, journal = {CoRR}, volume = {abs/2403.06691}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2403.06691}, doi = {10.48550/ARXIV.2403.06691}, eprinttype = {arXiv}, eprint = {2403.06691}, timestamp = {Thu, 04 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2403-06691.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwoca/BockenhauerKMRS23, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Ralf Klasing and Tobias M{\"{o}}mke and Peter Rossmanith and Moritz Stocker and David Wehner}, editor = {Sun{-}Yuan Hsieh and Ling{-}Ju Hung and Chia{-}Wei Lee}, title = {Online Knapsack with Removal and Recourse}, booktitle = {Combinatorial Algorithms - 34th International Workshop, {IWOCA} 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13889}, pages = {123--135}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-34347-6\_11}, doi = {10.1007/978-3-031-34347-6\_11}, timestamp = {Mon, 26 Jun 2023 15:55:36 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/BockenhauerKMRS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sosa/Momke023, author = {Tobias M{\"{o}}mke and Hang Zhou}, editor = {Telikepalli Kavitha and Kurt Mehlhorn}, title = {Capacitated Vehicle Routing in Graphic Metrics}, booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence, Italy, January 23-25, 2023}, pages = {114--123}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977585.ch11}, doi = {10.1137/1.9781611977585.CH11}, timestamp = {Mon, 20 Mar 2023 16:52:56 +0100}, biburl = {https://dblp.org/rec/conf/sosa/Momke023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/waoa/MomkePRRV23, author = {Tobias M{\"{o}}mke and Alexandru Popa and Aida Roshany{-}Tabrizi and Michael Ruderer and Roland Vincze}, editor = {Jaroslaw Byrka and Andreas Wiese}, title = {Approximating Maximum Edge 2-Coloring by Normalizing Graphs}, booktitle = {Approximation and Online Algorithms - 21st International Workshop, {WAOA} 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {14297}, pages = {29--44}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-49815-2\_3}, doi = {10.1007/978-3-031-49815-2\_3}, timestamp = {Wed, 17 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/waoa/MomkePRRV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/KommKKM22, author = {Dennis Komm and Rastislav Kr{\'{a}}lovic and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke}, title = {Randomized Online Computation with High Probability Guarantees}, journal = {Algorithmica}, volume = {84}, number = {5}, pages = {1357--1384}, year = {2022}, url = {https://doi.org/10.1007/s00453-022-00925-z}, doi = {10.1007/S00453-022-00925-Z}, timestamp = {Wed, 18 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/KommKKM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/inoc/AnapolskaBKM22, author = {Mariia Anapolska and Christina B{\"{u}}sing and Tabea Krabs and Tobias M{\"{o}}mke}, editor = {Christina B{\"{u}}sing and Arie M. C. A. Koster}, title = {Coworking Scheduling with Network Flows}, booktitle = {Proceedings of the 10th International Network Optimization Conference, {INOC} 2022, Aachen, Germany, June 7-10, 2022}, pages = {1--6}, publisher = {OpenProceedings.org}, year = {2022}, url = {https://doi.org/10.48786/inoc.2022.03}, doi = {10.48786/INOC.2022.03}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/inoc/AnapolskaBKM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/Cohen-AddadMV22, author = {Vincent Cohen{-}Addad and Tobias M{\"{o}}mke and Victor Verdugo}, editor = {Karen I. Aardal and Laura Sanit{\`{a}}}, title = {A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in {FPT} Time}, booktitle = {Integer Programming and Combinatorial Optimization - 23rd International Conference, {IPCO} 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13265}, pages = {112--125}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-06901-7\_9}, doi = {10.1007/978-3-031-06901-7\_9}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/Cohen-AddadMV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GalvezKMMPW22, author = {Waldo G{\'{a}}lvez and Arindam Khan and Mathieu Mari and Tobias M{\"{o}}mke and Madhusudhan Reddy Pittu and Andreas Wiese}, editor = {Joseph (Seffi) Naor and Niv Buchbinder}, title = {A 3-Approximation Algorithm for Maximum Independent Set of Rectangles}, booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022}, pages = {894--905}, publisher = {{SIAM}}, year = {2022}, url = {https://doi.org/10.1137/1.9781611977073.38}, doi = {10.1137/1.9781611977073.38}, timestamp = {Tue, 12 Apr 2022 11:24:56 +0200}, biburl = {https://dblp.org/rec/conf/soda/GalvezKMMPW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GrandoniMW22, author = {Fabrizio Grandoni and Tobias M{\"{o}}mke and Andreas Wiese}, editor = {Joseph (Seffi) Naor and Niv Buchbinder}, title = {Unsplittable Flow on a Path: The Game!}, booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022}, pages = {906--926}, publisher = {{SIAM}}, year = {2022}, url = {https://doi.org/10.1137/1.9781611977073.39}, doi = {10.1137/1.9781611977073.39}, timestamp = {Tue, 12 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/GrandoniMW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/0001MW22, author = {Fabrizio Grandoni and Tobias M{\"{o}}mke and Andreas Wiese}, editor = {Stefano Leonardi and Anupam Gupta}, title = {A {PTAS} for unsplittable flow on a path}, booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022}, pages = {289--302}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519935.3519959}, doi = {10.1145/3519935.3519959}, timestamp = {Tue, 27 Dec 2022 09:06:31 +0100}, biburl = {https://dblp.org/rec/conf/stoc/0001MW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2210-09806, author = {Tobias M{\"{o}}mke and Hang Zhou}, title = {Capacitated Vehicle Routing in Graphic Metrics}, journal = {CoRR}, volume = {abs/2210.09806}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2210.09806}, doi = {10.48550/ARXIV.2210.09806}, eprinttype = {arXiv}, eprint = {2210.09806}, timestamp = {Tue, 25 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2210-09806.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/0001MW21, author = {Fabrizio Grandoni and Tobias M{\"{o}}mke and Andreas Wiese}, editor = {Petra Mutzel and Rasmus Pagh and Grzegorz Herman}, title = {Faster (1+{\(\epsilon\)})-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back}, booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)}, series = {LIPIcs}, volume = {204}, pages = {49:1--49:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ESA.2021.49}, doi = {10.4230/LIPICS.ESA.2021.49}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esa/0001MW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-00623, author = {Waldo G{\'{a}}lvez and Arindam Khan and Mathieu Mari and Tobias M{\"{o}}mke and Madhusudhan Reddy Pittu and Andreas Wiese}, title = {A 4-Approximation Algorithm for Maximum Independent Set of Rectangles}, journal = {CoRR}, volume = {abs/2106.00623}, year = {2021}, url = {https://arxiv.org/abs/2106.00623}, eprinttype = {arXiv}, eprint = {2106.00623}, timestamp = {Wed, 09 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-00623.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-06163, author = {Vincent Cohen{-}Addad and Tobias M{\"{o}}mke and Victor Verdugo}, title = {A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in {FPT} Time}, journal = {CoRR}, volume = {abs/2111.06163}, year = {2021}, url = {https://arxiv.org/abs/2111.06163}, eprinttype = {arXiv}, eprint = {2111.06163}, timestamp = {Tue, 16 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-06163.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/GoyalM20, author = {Keshav Goyal and Tobias M{\"{o}}mke}, title = {Robust Reoptimization of Steiner Trees}, journal = {Algorithmica}, volume = {82}, number = {7}, pages = {1966--1988}, year = {2020}, url = {https://doi.org/10.1007/s00453-020-00682-x}, doi = {10.1007/S00453-020-00682-X}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/GoyalM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcad/StockFMHBC20, author = {Gregory Stock and Juan A. Fraire and Tobias M{\"{o}}mke and Holger Hermanns and Fakhri Babayev and Eduardo Cruz}, title = {Managing Fleets of {LEO} Satellites: Nonlinear, Optimal, Efficient, Scalable, Usable, and Robust}, journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.}, volume = {39}, number = {11}, pages = {3762--3773}, year = {2020}, url = {https://doi.org/10.1109/TCAD.2020.3012751}, doi = {10.1109/TCAD.2020.3012751}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcad/StockFMHBC20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MomkeW20, author = {Tobias M{\"{o}}mke and Andreas Wiese}, editor = {Artur Czumaj and Anuj Dawar and Emanuela Merelli}, title = {Breaking the Barrier of 2 for the Storage Allocation Problem}, booktitle = {47th International Colloquium on Automata, Languages, and Programming, {ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)}, series = {LIPIcs}, volume = {168}, pages = {86:1--86:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.86}, doi = {10.4230/LIPICS.ICALP.2020.86}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MomkeW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1911-10871, author = {Tobias M{\"{o}}mke and Andreas Wiese}, title = {Breaking the Barrier of 2 for the Storage Allocation Problem}, journal = {CoRR}, volume = {abs/1911.10871}, year = {2019}, url = {http://arxiv.org/abs/1911.10871}, eprinttype = {arXiv}, eprint = {1911.10871}, timestamp = {Tue, 03 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1911-10871.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/MnichM18, author = {Matthias Mnich and Tobias M{\"{o}}mke}, title = {Improved integrality gap upper bounds for traveling salesperson problems with distances one and two}, journal = {Eur. J. Oper. Res.}, volume = {266}, number = {2}, pages = {436--457}, year = {2018}, url = {https://doi.org/10.1016/j.ejor.2017.09.036}, doi = {10.1016/J.EJOR.2017.09.036}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/MnichM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/KurpiszMMMVW18, author = {Adam Kurpisz and Monaldo Mastrolilli and Claire Mathieu and Tobias M{\"{o}}mke and Victor Verdugo and Andreas Wiese}, title = {Semidefinite and linear programming integrality gaps for scheduling identical machines}, journal = {Math. Program.}, volume = {172}, number = {1-2}, pages = {231--248}, year = {2018}, url = {https://doi.org/10.1007/s10107-017-1152-5}, doi = {10.1007/S10107-017-1152-5}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/KurpiszMMMVW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/KlasingM18, author = {Ralf Klasing and Tobias M{\"{o}}mke}, editor = {Hans{-}Joachim B{\"{o}}ckenhauer and Dennis Komm and Walter Unger}, title = {A Modern View on Stability of Approximation}, booktitle = {Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovi{\v{c}} on the Occasion of His 60th Birthday}, series = {Lecture Notes in Computer Science}, volume = {11011}, pages = {393--408}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-98355-4\_22}, doi = {10.1007/978-3-319-98355-4\_22}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/birthday/KlasingM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/GargM18, author = {Shilpa Garg and Tobias M{\"{o}}mke}, editor = {Yossi Azar and Hannah Bast and Grzegorz Herman}, title = {A {QPTAS} for Gapless {MEC}}, booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22, 2018, Helsinki, Finland}, series = {LIPIcs}, volume = {112}, pages = {34:1--34:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ESA.2018.34}, doi = {10.4230/LIPICS.ESA.2018.34}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/esa/GargM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AdamaszekA0M18, author = {Anna Adamaszek and Antonios Antoniadis and Amit Kumar and Tobias M{\"{o}}mke}, editor = {Rolf Niedermeier and Brigitte Vall{\'{e}}e}, title = {Approximating Airports and Railways}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS} 2018, February 28 to March 3, 2018, Caen, France}, series = {LIPIcs}, volume = {96}, pages = {5:1--5:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.STACS.2018.5}, doi = {10.4230/LIPICS.STACS.2018.5}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AdamaszekA0M18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/0001MW018, author = {Fabrizio Grandoni and Tobias M{\"{o}}mke and Andreas Wiese and Hang Zhou}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {A {(5/3} + {\(\epsilon\)})-approximation for unsplittable flow on a path: placing small tasks into boxes}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {607--619}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188894}, doi = {10.1145/3188745.3188894}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/0001MW018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-10930, author = {Shilpa Garg and Tobias M{\"{o}}mke}, title = {A {QPTAS} for Gapless {MEC}}, journal = {CoRR}, volume = {abs/1804.10930}, year = {2018}, url = {http://arxiv.org/abs/1804.10930}, eprinttype = {arXiv}, eprint = {1804.10930}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-10930.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/DellKLMM17, author = {Holger Dell and Eun Jung Kim and Michael Lampis and Valia Mitsou and Tobias M{\"{o}}mke}, title = {Complexity and Approximability of Parameterized MAX-CSPs}, journal = {Algorithmica}, volume = {79}, number = {1}, pages = {230--250}, year = {2017}, url = {https://doi.org/10.1007/s00453-017-0310-8}, doi = {10.1007/S00453-017-0310-8}, timestamp = {Wed, 26 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/DellKLMM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BockenhauerKKKM17, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Dennis Komm and Rastislav Kr{\'{a}}lovic and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke}, title = {Online algorithms with advice: The tape model}, journal = {Inf. Comput.}, volume = {254}, pages = {59--83}, year = {2017}, url = {https://doi.org/10.1016/j.ic.2017.03.001}, doi = {10.1016/J.IC.2017.03.001}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BockenhauerKKKM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DobrevEKKKKM17, author = {Stefan Dobrev and Jeff Edmonds and Dennis Komm and Rastislav Kr{\'{a}}lovic and Richard Kr{\'{a}}lovic and Sacha Krug and Tobias M{\"{o}}mke}, title = {Improved analysis of the online set cover problem with advice}, journal = {Theor. Comput. Sci.}, volume = {689}, pages = {96--107}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2017.05.029}, doi = {10.1016/J.TCS.2017.05.029}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DobrevEKKKKM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/0002M17, author = {L{\'{a}}szl{\'{o}} Kozma and Tobias M{\"{o}}mke}, editor = {Philip N. Klein}, title = {Maximum Scatter {TSP} in Doubling Metrics}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {143--153}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.10}, doi = {10.1137/1.9781611974782.10}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/0002M17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GrandoniMW017, author = {Fabrizio Grandoni and Tobias M{\"{o}}mke and Andreas Wiese and Hang Zhou}, editor = {Philip N. Klein}, title = {To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {2411--2422}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.159}, doi = {10.1137/1.9781611974782.159}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/GrandoniMW017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/MomkeS16, author = {Tobias M{\"{o}}mke and Ola Svensson}, title = {Removing and Adding Edges for the Traveling Salesman Problem}, journal = {J. {ACM}}, volume = {63}, number = {1}, pages = {2:1--2:28}, year = {2016}, url = {https://doi.org/10.1145/2739008}, doi = {10.1145/2739008}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/MomkeS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/KurpiszMMMVW16, author = {Adam Kurpisz and Monaldo Mastrolilli and Claire Mathieu and Tobias M{\"{o}}mke and Victor Verdugo and Andreas Wiese}, editor = {Quentin Louveaux and Martin Skutella}, title = {Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines}, booktitle = {Integer Programming and Combinatorial Optimization - 18th International Conference, {IPCO} 2016, Li{\`{e}}ge, Belgium, June 1-3, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9682}, pages = {152--163}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-33461-5\_13}, doi = {10.1007/978-3-319-33461-5\_13}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipco/KurpiszMMMVW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/DobrevHKKKM16, author = {Stefan Dobrev and Juraj Hromkovic and Dennis Komm and Richard Kr{\'{a}}lovic and Rastislav Kr{\'{a}}lovic and Tobias M{\"{o}}mke}, editor = {Rusins Martins Freivalds and Gregor Engels and Barbara Catania}, title = {The Complexity of Paging Against a Probabilistic Adversary}, booktitle = {{SOFSEM} 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9587}, pages = {265--276}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-49192-8\_22}, doi = {10.1007/978-3-662-49192-8\_22}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/DobrevHKKKM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AdamaszekAM16, author = {Anna Adamaszek and Antonios Antoniadis and Tobias M{\"{o}}mke}, editor = {Nicolas Ollinger and Heribert Vollmer}, title = {Airports and Railways: Facility Location Meets Network Design}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS} 2016, February 17-20, 2016, Orl{\'{e}}ans, France}, series = {LIPIcs}, volume = {47}, pages = {6:1--6:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.STACS.2016.6}, doi = {10.4230/LIPICS.STACS.2016.6}, timestamp = {Wed, 10 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AdamaszekAM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Momke15, author = {Tobias M{\"{o}}mke}, title = {An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality}, journal = {Inf. Process. Lett.}, volume = {115}, number = {11}, pages = {866--871}, year = {2015}, url = {https://doi.org/10.1016/j.ipl.2015.06.003}, doi = {10.1016/J.IPL.2015.06.003}, timestamp = {Thu, 28 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Momke15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/GoyalM15, author = {Keshav Goyal and Tobias M{\"{o}}mke}, editor = {Prahladh Harsha and G. Ramalingam}, title = {Robust Reoptimization of Steiner Trees}, booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015, Bangalore, India}, series = {LIPIcs}, volume = {45}, pages = {10--24}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.10}, doi = {10.4230/LIPICS.FSTTCS.2015.10}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/GoyalM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MomkeW15, author = {Tobias M{\"{o}}mke and Andreas Wiese}, editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Kazuo Iwama and Naoki Kobayashi and Bettina Speckmann}, title = {A (2+{\textbackslash}epsilon {)} {(} 2 + {\unicode{1013}} {)} -Approximation Algorithm for the Storage Allocation Problem}, booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {9134}, pages = {973--984}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-47672-7\_79}, doi = {10.1007/978-3-662-47672-7\_79}, timestamp = {Fri, 27 Mar 2020 09:02:59 +0100}, biburl = {https://dblp.org/rec/conf/icalp/MomkeW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/Dell0LMM15, author = {Holger Dell and Eun Jung Kim and Michael Lampis and Valia Mitsou and Tobias M{\"{o}}mke}, editor = {Thore Husfeldt and Iyad A. Kanj}, title = {Complexity and Approximability of Parameterized MAX-CSPs}, booktitle = {10th International Symposium on Parameterized and Exact Computation, {IPEC} 2015, September 16-18, 2015, Patras, Greece}, series = {LIPIcs}, volume = {43}, pages = {294--306}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.294}, doi = {10.4230/LIPICS.IPEC.2015.294}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/Dell0LMM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BatraG0MW15, author = {Jatin Batra and Naveen Garg and Amit Kumar and Tobias M{\"{o}}mke and Andreas Wiese}, editor = {Piotr Indyk}, title = {New Approximation Schemes for Unsplittable Flow on a Path}, booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015}, pages = {47--58}, publisher = {{SIAM}}, year = {2015}, url = {https://doi.org/10.1137/1.9781611973730.5}, doi = {10.1137/1.9781611973730.5}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/BatraG0MW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Dell0LMM15, author = {Holger Dell and Eun Jung Kim and Michael Lampis and Valia Mitsou and Tobias M{\"{o}}mke}, title = {Complexity and Approximability of Parameterized MAX-CSPs}, journal = {CoRR}, volume = {abs/1511.05546}, year = {2015}, url = {http://arxiv.org/abs/1511.05546}, eprinttype = {arXiv}, eprint = {1511.05546}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Dell0LMM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KozmaM15, author = {L{\'{a}}szl{\'{o}} Kozma and Tobias M{\"{o}}mke}, title = {A {PTAS} for Euclidean Maximum Scatter {TSP}}, journal = {CoRR}, volume = {abs/1512.02963}, year = {2015}, url = {http://arxiv.org/abs/1512.02963}, eprinttype = {arXiv}, eprint = {1512.02963}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KozmaM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KommKKM14, author = {Dennis Komm and Rastislav Kr{\'{a}}lovic and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Randomized Online Algorithms with High Probability Guarantees}, 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 = {470--481}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.470}, doi = {10.4230/LIPICS.STACS.2014.470}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/KommKKM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Momke14, author = {Tobias M{\"{o}}mke}, title = {An Improved Approximation Algorithm for the Traveling Salesman Problem with Relaxed Triangle Inequality}, journal = {CoRR}, volume = {abs/1412.6755}, year = {2014}, url = {http://arxiv.org/abs/1412.6755}, eprinttype = {arXiv}, eprint = {1412.6755}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Momke14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/BockenhauerMS13, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Tobias M{\"{o}}mke and Monika Steinov{\'{a}}}, title = {Improved approximations for {TSP} with simple precedence constraints}, journal = {J. Discrete Algorithms}, volume = {21}, pages = {32--40}, year = {2013}, url = {https://doi.org/10.1016/j.jda.2013.04.002}, doi = {10.1016/J.JDA.2013.04.002}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BockenhauerMS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1302-2805, author = {Dennis Komm and Rastislav Kr{\'{a}}lovic and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke}, title = {Randomized online computation with high probability guarantees}, journal = {CoRR}, volume = {abs/1302.2805}, year = {2013}, url = {http://arxiv.org/abs/1302.2805}, eprinttype = {arXiv}, eprint = {1302.2805}, timestamp = {Tue, 17 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1302-2805.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1303-2963, author = {Tobias M{\"{o}}mke}, title = {A Competitive Ratio Approximation Scheme for the k-Server Problem in Fixed Finite Metrics}, journal = {CoRR}, volume = {abs/1303.2963}, year = {2013}, url = {http://arxiv.org/abs/1303.2963}, eprinttype = {arXiv}, eprint = {1303.2963}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1303-2963.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/MnichM13, author = {Matthias Mnich and Tobias M{\"{o}}mke}, title = {Improved integrality gap upper bounds for {TSP} with distances one and two}, journal = {CoRR}, volume = {abs/1312.2502}, year = {2013}, url = {http://arxiv.org/abs/1312.2502}, eprinttype = {arXiv}, eprint = {1312.2502}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MnichM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/KapoutsisKM12, author = {Christos A. Kapoutsis and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke}, title = {Size complexity of rotating and sweeping automata}, journal = {J. Comput. Syst. Sci.}, volume = {78}, number = {2}, pages = {537--558}, year = {2012}, url = {https://doi.org/10.1016/j.jcss.2011.06.004}, doi = {10.1016/J.JCSS.2011.06.004}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/KapoutsisKM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/BockenhauerFHMSS12, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Karin Freiermuth and Juraj Hromkovic and Tobias M{\"{o}}mke and Andreas Sprock and Bj{\"{o}}rn Steffen}, title = {Steiner tree reoptimization in graphs with sharpened triangle inequality}, journal = {J. Discrete Algorithms}, volume = {11}, pages = {73--86}, year = {2012}, url = {https://doi.org/10.1016/j.jda.2011.03.014}, doi = {10.1016/J.JDA.2011.03.014}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BockenhauerFHMSS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/KommKM12, author = {Dennis Komm and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke}, editor = {Edward A. Hirsch and Juhani Karhum{\"{a}}ki and Arto Lepist{\"{o}} and Michail Kh. Prilutskii}, title = {On the Advice Complexity of the Set Cover Problem}, booktitle = {Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, {CSR} 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7353}, pages = {241--252}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-30642-6\_23}, doi = {10.1007/978-3-642-30642-6\_23}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/csr/KommKM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BiloBKKMSZ11, author = {Davide Bil{\`{o}} and Hans{-}Joachim B{\"{o}}ckenhauer and Dennis Komm and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke and Sebastian Seibert and Anna Zych}, title = {Reoptimization of the Shortest Common Superstring Problem}, journal = {Algorithmica}, volume = {61}, number = {2}, pages = {227--251}, year = {2011}, url = {https://doi.org/10.1007/s00453-010-9419-8}, doi = {10.1007/S00453-010-9419-8}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/BiloBKKMSZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/BockenhauerHM11, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Juraj Hromkovic and Tobias M{\"{o}}mke}, editor = {Cristian S. Calude and Grzegorz Rozenberg and Arto Salomaa}, title = {Improved Approximations for Hard Optimization Problems via Problem Instance Classification}, booktitle = {Rainbow of Computer Science - Dedicated to Hermann Maurer on the Occasion of His 70th Birthday}, series = {Lecture Notes in Computer Science}, volume = {6570}, pages = {3--19}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-19391-0\_1}, doi = {10.1007/978-3-642-19391-0\_1}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/birthday/BockenhauerHM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/MomkeS11, author = {Tobias M{\"{o}}mke and Ola Svensson}, editor = {Rafail Ostrovsky}, title = {Approximating Graphic {TSP} by Matchings}, booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS} 2011, Palm Springs, CA, USA, October 22-25, 2011}, pages = {560--569}, publisher = {{IEEE} Computer Society}, year = {2011}, url = {https://doi.org/10.1109/FOCS.2011.56}, doi = {10.1109/FOCS.2011.56}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/MomkeS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/Momke11, author = {Tobias M{\"{o}}mke}, editor = {Ivana Cern{\'{a}} and Tibor Gyim{\'{o}}thy and Juraj Hromkovic and Keith G. Jeffery and Rastislav Kr{\'{a}}lovic and Marko Vukolic and Stefan Wolf}, title = {Structural Properties of Hard Metric {TSP} Inputs - (Extended Abstract)}, booktitle = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}} Smokovec, Slovakia, January 22-28, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6543}, pages = {394--405}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-18381-2\_33}, doi = {10.1007/978-3-642-18381-2\_33}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/Momke11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1104-3090, author = {Tobias M{\"{o}}mke and Ola Svensson}, title = {Approximating Graphic {TSP} by Matchings}, journal = {CoRR}, volume = {abs/1104.3090}, year = {2011}, url = {http://arxiv.org/abs/1104.3090}, eprinttype = {arXiv}, eprint = {1104.3090}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1104-3090.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/BockenhauerKMS10, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Ralf Klasing and Tobias M{\"{o}}mke and Monika Steinov{\'{a}}}, editor = {Tiziana Calamoneri and Josep D{\'{\i}}az}, title = {Improved Approximations for {TSP} with Simple Precedence Constraints}, 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 = {61--72}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13073-1\_7}, doi = {10.1007/978-3-642-13073-1\_7}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/ciac/BockenhauerKMS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/BockenhauerFHMSS10, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Karin Freiermuth and Juraj Hromkovic and Tobias M{\"{o}}mke and Andreas Sprock and Bj{\"{o}}rn Steffen}, editor = {Tiziana Calamoneri and Josep D{\'{\i}}az}, title = {The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality}, 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 = {180--191}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13073-1\_17}, doi = {10.1007/978-3-642-13073-1\_17}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ciac/BockenhauerFHMSS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/basesearch/Momke09, author = {Tobias M{\"{o}}mke}, title = {Algorithmic Approaches for Solving Hard Problems: Approximation and Complexity}, school = {{ETH} Zurich, Z{\"{u}}rich, Switzerland}, year = {2009}, url = {https://hdl.handle.net/20.500.11850/72745}, doi = {10.3929/ETHZ-A-005981139}, timestamp = {Mon, 02 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/phd/basesearch/Momke09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Momke09, author = {Tobias M{\"{o}}mke}, title = {On the power of randomization for job shop scheduling with k-units length tasks}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {43}, number = {2}, pages = {189--207}, year = {2009}, url = {https://doi.org/10.1051/ita:2008024}, doi = {10.1051/ITA:2008024}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Momke09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BockenhauerHKMR09, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Juraj Hromkovic and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke and Peter Rossmanith}, title = {Reoptimization of Steiner trees: Changing the terminal set}, journal = {Theor. Comput. Sci.}, volume = {410}, number = {36}, pages = {3428--3435}, year = {2009}, url = {https://doi.org/10.1016/j.tcs.2008.04.039}, doi = {10.1016/J.TCS.2008.04.039}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BockenhauerHKMR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BiloBKKMSZ09, author = {Davide Bil{\`{o}} and Hans{-}Joachim B{\"{o}}ckenhauer and Dennis Komm and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke and Sebastian Seibert and Anna Zych}, editor = {Gregory Kucherov and Esko Ukkonen}, title = {Reoptimization of the Shortest Common Superstring Problem}, booktitle = {Combinatorial Pattern Matching, 20th Annual Symposium, {CPM} 2009, Lille, France, June 22-24, 2009, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5577}, pages = {78--91}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-02441-2\_8}, doi = {10.1007/978-3-642-02441-2\_8}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BiloBKKMSZ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BockenhauerKKKM09, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Dennis Komm and Rastislav Kr{\'{a}}lovic and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {On the Advice Complexity of Online Problems}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {331--340}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_35}, doi = {10.1007/978-3-642-10631-6\_35}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BockenhauerKKKM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dlt/KapoutsisKM08, author = {Christos A. Kapoutsis and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke}, editor = {Masami Ito and Masafumi Toyama}, title = {On the Size Complexity of Rotating and Sweeping Automata}, booktitle = {Developments in Language Theory, 12th International Conference, {DLT} 2008, Kyoto, Japan, September 16-19, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5257}, pages = {455--466}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85780-8\_36}, doi = {10.1007/978-3-540-85780-8\_36}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/dlt/KapoutsisKM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/BockenhauerHMW08, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Juraj Hromkovic and Tobias M{\"{o}}mke and Peter Widmayer}, editor = {Viliam Geffert and Juhani Karhum{\"{a}}ki and Alberto Bertoni and Bart Preneel and Pavol N{\'{a}}vrat and M{\'{a}}ria Bielikov{\'{a}}}, title = {On the Hardness of Reoptimization}, booktitle = {{SOFSEM} 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}} Smokovec, Slovakia, January 19-25, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4910}, pages = {50--65}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-77566-9\_5}, doi = {10.1007/978-3-540-77566-9\_5}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/BockenhauerHMW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/BiloBHKMWZ08, author = {Davide Bil{\`{o}} and Hans{-}Joachim B{\"{o}}ckenhauer and Juraj Hromkovic and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke and Peter Widmayer and Anna Zych}, editor = {Joachim Gudmundsson}, title = {Reoptimization of Steiner Trees}, booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5124}, pages = {258--269}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-69903-3\_24}, doi = {10.1007/978-3-540-69903-3\_24}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/swat/BiloBHKMWZ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aor/HromkovicMSW07, author = {Juraj Hromkovic and Tobias M{\"{o}}mke and Kathleen Steinh{\"{o}}fel and Peter Widmayer}, title = {Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms}, journal = {Algorithmic Oper. Res.}, volume = {2}, number = {1}, year = {2007}, url = {http://journals.hil.unb.ca/index.php/AOR/article/view/2729}, timestamp = {Wed, 10 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/aor/HromkovicMSW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fun/BockenhauerHKMS07, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Juraj Hromkovic and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke and Kathleen Steinh{\"{o}}fel}, editor = {Pierluigi Crescenzi and Giuseppe Prencipe and Geppino Pucci}, title = {Efficient Algorithms for the Spoonerism Problem}, booktitle = {Fun with Algorithms, 4th International Conference, {FUN} 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4475}, pages = {78--92}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-72914-3\_9}, doi = {10.1007/978-3-540-72914-3\_9}, timestamp = {Tue, 14 May 2019 10:00:45 +0200}, biburl = {https://dblp.org/rec/conf/fun/BockenhauerHKMS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/saga/KapoutsisKM07, author = {Christos A. Kapoutsis and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke}, editor = {Juraj Hromkovic and Richard Kr{\'{a}}lovic and Marc Nunkesser and Peter Widmayer}, title = {An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata}, booktitle = {Stochastic Algorithms: Foundations and Applications, 4th International Symposium, {SAGA} 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4665}, pages = {130--141}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74871-7\_12}, doi = {10.1007/978-3-540-74871-7\_12}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/saga/KapoutsisKM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.