Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Kurt Mehlhorn
@article{DBLP:journals/jacm/ChaudhuryGM24, author = {Bhaskar Ray Chaudhury and Jugal Garg and Kurt Mehlhorn}, title = {{EFX} Exists for Three Agents}, journal = {J. {ACM}}, volume = {71}, number = {1}, pages = {4:1--4:27}, year = {2024}, url = {https://doi.org/10.1145/3616009}, doi = {10.1145/3616009}, timestamp = {Sat, 16 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/ChaudhuryGM24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/AkramiCGMM23, author = {Hannaneh Akrami and Bhaskar Ray Chaudhury and Jugal Garg and Kurt Mehlhorn and Ruta Mehta}, title = {Fair and Efficient Allocation of Indivisible Chores with Surplus}, booktitle = {Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao, SAR, China}, pages = {2494--2502}, publisher = {ijcai.org}, year = {2023}, url = {https://doi.org/10.24963/ijcai.2023/277}, doi = {10.24963/IJCAI.2023/277}, timestamp = {Mon, 28 Aug 2023 17:23:07 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/AkramiCGMM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/AkramiMSS23, author = {Hannaneh Akrami and Kurt Mehlhorn and Masoud Seddighin and Golnoosh Shahkarami}, editor = {Alice Oh and Tristan Naumann and Amir Globerson and Kate Saenko and Moritz Hardt and Sergey Levine}, title = {Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations}, booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023}, year = {2023}, url = {http://papers.nips.cc/paper\_files/paper/2023/hash/b7ed46bd87cd51d4c031b96d9b1a8eb6-Abstract-Conference.html}, timestamp = {Fri, 01 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/AkramiMSS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/AkramiACGMM23, author = {Hannaneh Akrami and Noga Alon and Bhaskar Ray Chaudhury and Jugal Garg and Kurt Mehlhorn and Ruta Mehta}, editor = {Kevin Leyton{-}Brown and Jason D. Hartline and Larry Samuelson}, title = {{EFX:} {A} Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number}, booktitle = {Proceedings of the 24th {ACM} Conference on Economics and Computation, {EC} 2023, London, United Kingdom, July 9-12, 2023}, pages = {61}, publisher = {{ACM}}, year = {2023}, url = {https://doi.org/10.1145/3580507.3597799}, doi = {10.1145/3580507.3597799}, timestamp = {Fri, 21 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/AkramiACGMM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/sosa/2023, editor = {Telikepalli Kavitha and Kurt Mehlhorn}, title = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence, Italy, January 23-25, 2023}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977585}, doi = {10.1137/1.9781611977585}, isbn = {978-1-61197-758-5}, timestamp = {Mon, 20 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sosa/2023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2305-04788, author = {Hannaneh Akrami and Bhaskar Ray Chaudhury and Jugal Garg and Kurt Mehlhorn and Ruta Mehta}, title = {Fair and Efficient Allocation of Indivisible Chores with Surplus}, journal = {CoRR}, volume = {abs/2305.04788}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2305.04788}, doi = {10.48550/ARXIV.2305.04788}, eprinttype = {arXiv}, eprint = {2305.04788}, timestamp = {Fri, 12 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2305-04788.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2308-14545, author = {Hannaneh Akrami and Masoud Seddighin and Kurt Mehlhorn and Golnoosh Shahkarami}, title = {Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations}, journal = {CoRR}, volume = {abs/2308.14545}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2308.14545}, doi = {10.48550/ARXIV.2308.14545}, eprinttype = {arXiv}, eprint = {2308.14545}, timestamp = {Fri, 01 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2308-14545.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/HalperinHMOS22, author = {Dan Halperin and Sariel Har{-}Peled and Kurt Mehlhorn and Eunjin Oh and Micha Sharir}, title = {The Maximum-Level Vertex in an Arrangement of Lines}, journal = {Discret. Comput. Geom.}, volume = {67}, number = {2}, pages = {439--461}, year = {2022}, url = {https://doi.org/10.1007/s00454-021-00338-9}, doi = {10.1007/S00454-021-00338-9}, timestamp = {Wed, 23 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/HalperinHMOS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/ChaudhuryCGGHM22, author = {Bhaskar Ray Chaudhury and Yun Kuen Cheung and Jugal Garg and Naveen Garg and Martin Hoefer and Kurt Mehlhorn}, title = {Fair Division of Indivisible Goods for a Class of Concave Valuations}, journal = {J. Artif. Intell. Res.}, volume = {74}, pages = {111--142}, year = {2022}, url = {https://doi.org/10.1613/jair.1.12911}, doi = {10.1613/JAIR.1.12911}, timestamp = {Wed, 25 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jair/ChaudhuryCGGHM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BonifaciFFKKMMS22, author = {Vincenzo Bonifaci and Enrico Facca and Frederic Folz and Andreas Karrenbauer and Pavel Kolev and Kurt Mehlhorn and Giovanna Morigi and Golnoosh Shahkarami and Quentin Vermande}, title = {Physarum-inspired multi-commodity flow dynamics}, journal = {Theor. Comput. Sci.}, volume = {920}, pages = {1--20}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.02.001}, doi = {10.1016/J.TCS.2022.02.001}, timestamp = {Wed, 18 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BonifaciFFKKMMS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaai/AkramiC0MSSVVW22, author = {Hannaneh Akrami and Bhaskar Ray Chaudhury and Martin Hoefer and Kurt Mehlhorn and Marco Schmalhofer and Golnoosh Shahkarami and Giovanna Varricchio and Quentin Vermande and Ernest van Wijland}, title = {Maximizing Nash Social Welfare in 2-Value Instances}, booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI} 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22 - March 1, 2022}, pages = {4760--4767}, publisher = {{AAAI} Press}, year = {2022}, url = {https://doi.org/10.1609/aaai.v36i5.20402}, doi = {10.1609/AAAI.V36I5.20402}, timestamp = {Mon, 04 Sep 2023 12:29:24 +0200}, biburl = {https://dblp.org/rec/conf/aaai/AkramiC0MSSVVW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2205-07638, author = {Hannaneh Akrami and Bhaskar Ray Chaudhury and Jugal Garg and Kurt Mehlhorn and Ruta Mehta}, title = {{EFX} Allocations: Simplifications and Improvements}, journal = {CoRR}, volume = {abs/2205.07638}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2205.07638}, doi = {10.48550/ARXIV.2205.07638}, eprinttype = {arXiv}, eprint = {2205.07638}, timestamp = {Wed, 18 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2205-07638.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-02476, author = {Andreas Karrenbauer and Leonie Krull and Kurt Mehlhorn and Pranabendu Misra and Paolo Luigi Rinaldi and Anna Twelsiek}, title = {Improving Order with Queues}, journal = {CoRR}, volume = {abs/2207.02476}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.02476}, doi = {10.48550/ARXIV.2207.02476}, eprinttype = {arXiv}, eprint = {2207.02476}, timestamp = {Wed, 13 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-02476.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-10949, author = {Hannaneh Akrami and Bhaskar Ray Chaudhury and Martin Hoefer and Kurt Mehlhorn and Marco Schmalhofer and Golnoosh Shahkarami and Giovanna Varricchio and Quentin Vermande and Ernest van Wijland}, title = {Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case}, journal = {CoRR}, volume = {abs/2207.10949}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.10949}, doi = {10.48550/ARXIV.2207.10949}, eprinttype = {arXiv}, eprint = {2207.10949}, timestamp = {Mon, 25 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-10949.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ChaudhuryKMS21, author = {Bhaskar Ray Chaudhury and Telikepalli Kavitha and Kurt Mehlhorn and Alkmini Sgouritsa}, title = {A Little Charity Guarantees Almost Envy-Freeness}, journal = {{SIAM} J. Comput.}, volume = {50}, number = {4}, pages = {1336--1358}, year = {2021}, url = {https://doi.org/10.1137/20M1359134}, doi = {10.1137/20M1359134}, timestamp = {Tue, 05 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ChaudhuryKMS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/ChaudhuryGMMM21, author = {Bhaskar Ray Chaudhury and Jugal Garg and Kurt Mehlhorn and Ruta Mehta and Pranabendu Misra}, editor = {P{\'{e}}ter Bir{\'{o}} and Shuchi Chawla and Federico Echenique}, title = {Improving {EFX} Guarantees through Rainbow Cycle Number}, booktitle = {{EC} '21: The 22nd {ACM} Conference on Economics and Computation, Budapest, Hungary, July 18-23, 2021}, pages = {310--311}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3465456.3467605}, doi = {10.1145/3465456.3467605}, timestamp = {Fri, 09 Feb 2024 20:36:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/ChaudhuryGMMM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2103-01628, author = {Bhaskar Ray Chaudhury and Jugal Garg and Kurt Mehlhorn and Ruta Mehta and Pranabendu Misra}, title = {Improving {EFX} Guarantees through Rainbow Cycle Number}, journal = {CoRR}, volume = {abs/2103.01628}, year = {2021}, url = {https://arxiv.org/abs/2103.01628}, eprinttype = {arXiv}, eprint = {2103.01628}, timestamp = {Thu, 04 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2103-01628.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-14816, author = {Hannaneh Akrami and Bhaskar Ray Chaudhury and Kurt Mehlhorn and Golnoosh Shahkarami and Quentin Vermande}, title = {Nash Social Welfare for 2-value Instances}, journal = {CoRR}, volume = {abs/2106.14816}, year = {2021}, url = {https://arxiv.org/abs/2106.14816}, eprinttype = {arXiv}, eprint = {2106.14816}, timestamp = {Wed, 30 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-14816.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FaccaKKM20, author = {Enrico Facca and Andreas Karrenbauer and Pavel Kolev and Kurt Mehlhorn}, title = {Convergence of the non-uniform directed Physarum model}, journal = {Theor. Comput. Sci.}, volume = {816}, pages = {184--194}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2020.01.034}, doi = {10.1016/J.TCS.2020.01.034}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/FaccaKKM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KarrenbauerKM20, author = {Andreas Karrenbauer and Pavel Kolev and Kurt Mehlhorn}, title = {Convergence of the non-uniform Physarum dynamics}, journal = {Theor. Comput. Sci.}, volume = {816}, pages = {260--269}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2020.02.032}, doi = {10.1016/J.TCS.2020.02.032}, timestamp = {Fri, 03 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/KarrenbauerKM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/ChaudhuryGM20, author = {Bhaskar Ray Chaudhury and Jugal Garg and Kurt Mehlhorn}, editor = {P{\'{e}}ter Bir{\'{o}} and Jason D. Hartline and Michael Ostrovsky and Ariel D. Procaccia}, title = {{EFX} Exists for Three Agents}, booktitle = {{EC} '20: The 21st {ACM} Conference on Economics and Computation, Virtual Event, Hungary, July 13-17, 2020}, pages = {1--19}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3391403.3399511}, doi = {10.1145/3391403.3399511}, timestamp = {Fri, 09 Feb 2024 20:36:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/ChaudhuryGM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChaudhuryKMS20, author = {Bhaskar Ray Chaudhury and Telikepalli Kavitha and Kurt Mehlhorn and Alkmini Sgouritsa}, editor = {Shuchi Chawla}, title = {A Little Charity Guarantees Almost Envy-Freeness}, booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020}, pages = {2658--2672}, publisher = {{SIAM}}, year = {2020}, url = {https://doi.org/10.1137/1.9781611975994.162}, doi = {10.1137/1.9781611975994.162}, timestamp = {Thu, 15 Jul 2021 13:48:53 +0200}, biburl = {https://dblp.org/rec/conf/soda/ChaudhuryKMS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-05119, author = {Bhaskar Ray Chaudhury and Jugal Garg and Kurt Mehlhorn}, title = {{EFX} Exists for Three Agents}, journal = {CoRR}, volume = {abs/2002.05119}, year = {2020}, url = {https://arxiv.org/abs/2002.05119}, eprinttype = {arXiv}, eprint = {2002.05119}, timestamp = {Fri, 14 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-05119.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2003-00518, author = {Dan Halperin and Sariel Har{-}Peled and Kurt Mehlhorn and Eunjin Oh and Micha Sharir}, title = {The Maximum-Level Vertex in an Arrangement of Lines}, journal = {CoRR}, volume = {abs/2003.00518}, year = {2020}, url = {https://arxiv.org/abs/2003.00518}, eprinttype = {arXiv}, eprint = {2003.00518}, timestamp = {Fri, 13 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2003-00518.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2009-01498, author = {Vincenzo Bonifaci and Enrico Facca and Frederic Folz and Andreas Karrenbauer and Pavel Kolev and Kurt Mehlhorn and Giovanna Morigi and Golnoosh Shahkarami and Quentin Vermande}, title = {Physarum Multi-Commodity Flow Dynamics}, journal = {CoRR}, volume = {abs/2009.01498}, year = {2020}, url = {https://arxiv.org/abs/2009.01498}, eprinttype = {arXiv}, eprint = {2009.01498}, timestamp = {Wed, 16 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2009-01498.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/sp/SandersMDD19, author = {Peter Sanders and Kurt Mehlhorn and Martin Dietzfelbinger and Roman Dementiev}, title = {Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-25209-0}, doi = {10.1007/978-3-030-25209-0}, isbn = {978-3-030-25208-3}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/sp/SandersMDD19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AfshaniADDLM19, author = {Peyman Afshani and Manindra Agrawal and Benjamin Doerr and Carola Doerr and Kasper Green Larsen and Kurt Mehlhorn}, title = {The query complexity of a permutation-based variant of Mastermind}, journal = {Discret. Appl. Math.}, volume = {260}, pages = {28--50}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.01.007}, doi = {10.1016/J.DAM.2019.01.007}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/AfshaniADDLM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AkramiMO19, author = {Hannaneh Akrami and Kurt Mehlhorn and Tommy Odland}, title = {Ratio-balanced maximum flows}, journal = {Inf. Process. Lett.}, volume = {150}, pages = {13--17}, year = {2019}, url = {https://doi.org/10.1016/j.ipl.2019.06.003}, doi = {10.1016/J.IPL.2019.06.003}, timestamp = {Wed, 21 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AkramiMO19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BeckerBKKM19, author = {Ruben Becker and Vincenzo Bonifaci and Andreas Karrenbauer and Pavel Kolev and Kurt Mehlhorn}, title = {Two results on slime mold computations}, journal = {Theor. Comput. Sci.}, volume = {773}, pages = {79--106}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.08.027}, doi = {10.1016/J.TCS.2018.08.027}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BeckerBKKM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/BeiGHM19, author = {Xiaohui Bei and Jugal Garg and Martin Hoefer and Kurt Mehlhorn}, title = {Earning and Utility Limits in Fisher Markets}, journal = {{ACM} Trans. Economics and Comput.}, volume = {7}, number = {2}, pages = {10:1--10:35}, year = {2019}, url = {https://doi.org/10.1145/3340234}, doi = {10.1145/3340234}, timestamp = {Fri, 26 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/teco/BeiGHM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/AbdulazizMN19, author = {Mohammad Abdulaziz and Kurt Mehlhorn and Tobias Nipkow}, editor = {Peter Rossmanith and Pinar Heggernes and Joost{-}Pieter Katoen}, title = {Trustworthy Graph Algorithms (Invited Talk)}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany}, series = {LIPIcs}, volume = {138}, pages = {1:1--1:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.1}, doi = {10.4230/LIPICS.MFCS.2019.1}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/AbdulazizMN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1901-07231, author = {Andreas Karrenbauer and Pavel Kolev and Kurt Mehlhorn}, title = {Convergence of the Non-Uniform Physarum Dynamics}, journal = {CoRR}, volume = {abs/1901.07231}, year = {2019}, url = {http://arxiv.org/abs/1901.07231}, eprinttype = {arXiv}, eprint = {1901.07231}, timestamp = {Fri, 01 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1901-07231.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-11047, author = {Hannaneh Akrami and Kurt Mehlhorn and Tommy Odland}, title = {Ratio-Balanced Maximum Flows}, journal = {CoRR}, volume = {abs/1902.11047}, year = {2019}, url = {http://arxiv.org/abs/1902.11047}, eprinttype = {arXiv}, eprint = {1902.11047}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-11047.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1906-07781, author = {Enrico Facca and Andreas Karrenbauer and Pavel Kolev and Kurt Mehlhorn}, title = {Convergence of the Non-Uniform Directed Physarum Model}, journal = {CoRR}, volume = {abs/1906.07781}, year = {2019}, url = {http://arxiv.org/abs/1906.07781}, eprinttype = {arXiv}, eprint = {1906.07781}, timestamp = {Mon, 24 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1906-07781.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1907-04065, author = {Mohammad Abdulaziz and Kurt Mehlhorn and Tobias Nipkow}, title = {Trustworthy Graph Algorithms}, journal = {CoRR}, volume = {abs/1907.04065}, year = {2019}, url = {http://arxiv.org/abs/1907.04065}, eprinttype = {arXiv}, eprint = {1907.04065}, timestamp = {Wed, 17 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1907-04065.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1907-04596, author = {Bhaskar Ray Chaudhury and Telikepalli Kavitha and Kurt Mehlhorn and Alkmini Sgouritsa}, title = {A Little Charity Guarantees Almost Envy-Freeness}, journal = {CoRR}, volume = {abs/1907.04596}, year = {2019}, url = {http://arxiv.org/abs/1907.04596}, eprinttype = {arXiv}, eprint = {1907.04596}, timestamp = {Wed, 17 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1907-04596.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CroitoruM18, author = {Cosmina Croitoru and Kurt Mehlhorn}, title = {On testing substitutability}, journal = {Inf. Process. Lett.}, volume = {138}, pages = {19--21}, year = {2018}, url = {https://doi.org/10.1016/j.ipl.2018.05.006}, doi = {10.1016/J.IPL.2018.05.006}, timestamp = {Mon, 23 Jul 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CroitoruM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsc/KoprowskiMR18, author = {Przemyslaw Koprowski and Kurt Mehlhorn and Saurabh Ray}, title = {Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" {[J.} Symb. Comput. 45 {(2010)} 677-683]}, journal = {J. Symb. Comput.}, volume = {87}, pages = {238--241}, year = {2018}, url = {https://doi.org/10.1016/j.jsc.2017.05.008}, doi = {10.1016/J.JSC.2017.05.008}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsc/KoprowskiMR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/ChaudhuryCG0HM18, author = {Bhaskar Ray Chaudhury and Yun Kuen Cheung and Jugal Garg and Naveen Garg and Martin Hoefer and Kurt Mehlhorn}, editor = {Sumit Ganguly and Paritosh K. Pandya}, title = {On Fair Division for Indivisible Items}, booktitle = {38th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2018, December 11-13, 2018, Ahmedabad, India}, series = {LIPIcs}, volume = {122}, pages = {25:1--25:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.25}, doi = {10.4230/LIPICS.FSTTCS.2018.25}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/ChaudhuryCG0HM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/ChaudhuryM18, author = {Bhaskar Ray Chaudhury and Kurt Mehlhorn}, editor = {Sumit Ganguly and Paritosh K. Pandya}, title = {Combinatorial Algorithms for General Linear Arrow-Debreu Markets}, booktitle = {38th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2018, December 11-13, 2018, Ahmedabad, India}, series = {LIPIcs}, volume = {122}, pages = {26:1--26:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.26}, doi = {10.4230/LIPICS.FSTTCS.2018.26}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/ChaudhuryM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChalermsookG0MS18, author = {Parinya Chalermsook and Mayank Goswami and L{\'{a}}szl{\'{o}} Kozma and Kurt Mehlhorn and Thatchaphol Saranurak}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Multi-Finger Binary Search Trees}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {55:1--55:26}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.55}, doi = {10.4230/LIPICS.ISAAC.2018.55}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChalermsookG0MS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GargHM18, author = {Jugal Garg and Martin Hoefer and Kurt Mehlhorn}, editor = {Artur Czumaj}, title = {Approximating the Nash Social Welfare with Budget-Additive Valuations}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018}, pages = {2326--2340}, publisher = {{SIAM}}, year = {2018}, url = {https://doi.org/10.1137/1.9781611975031.150}, doi = {10.1137/1.9781611975031.150}, timestamp = {Fri, 26 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/GargHM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1805-06232, author = {Yun Kuen Cheung and Bhaskar Chaudhuri and Jugal Garg and Naveen Garg and Martin Hoefer and Kurt Mehlhorn}, title = {On Fair Division of Indivisible Items}, journal = {CoRR}, volume = {abs/1805.06232}, year = {2018}, url = {http://arxiv.org/abs/1805.06232}, eprinttype = {arXiv}, eprint = {1805.06232}, timestamp = {Fri, 26 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1805-06232.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1805-07642, author = {Cosmina Croitoru and Kurt Mehlhorn}, title = {On testing substitutability}, journal = {CoRR}, volume = {abs/1805.07642}, year = {2018}, url = {http://arxiv.org/abs/1805.07642}, eprinttype = {arXiv}, eprint = {1805.07642}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1805-07642.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1809-01759, author = {Parinya Chalermsook and Mayank Goswami and L{\'{a}}szl{\'{o}} Kozma and Kurt Mehlhorn and Thatchaphol Saranurak}, title = {Multi-finger binary search trees}, journal = {CoRR}, volume = {abs/1809.01759}, year = {2018}, url = {http://arxiv.org/abs/1809.01759}, eprinttype = {arXiv}, eprint = {1809.01759}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1809-01759.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1810-01237, author = {Bhaskar Ray Chaudhury and Kurt Mehlhorn}, title = {Combinatorial Algorithms for General Linear Arrow-Debreu Markets}, journal = {CoRR}, volume = {abs/1810.01237}, year = {2018}, url = {http://arxiv.org/abs/1810.01237}, eprinttype = {arXiv}, eprint = {1810.01237}, timestamp = {Tue, 30 Oct 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1810-01237.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1812-08480, author = {Peyman Afshani and Manindra Agrawal and Benjamin Doerr and Carola Doerr and Kasper Green Larsen and Kurt Mehlhorn}, title = {The Query Complexity of a Permutation-Based Variant of Mastermind}, journal = {CoRR}, volume = {abs/1812.08480}, year = {2018}, url = {http://arxiv.org/abs/1812.08480}, eprinttype = {arXiv}, eprint = {1812.08480}, timestamp = {Wed, 02 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1812-08480.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/MehlhornNS17, author = {Kurt Mehlhorn and Adrian Neumann and Jens M. Schmidt}, title = {Certifying 3-Edge-Connectivity}, journal = {Algorithmica}, volume = {77}, number = {2}, pages = {309--335}, year = {2017}, url = {https://doi.org/10.1007/s00453-015-0075-x}, doi = {10.1007/S00453-015-0075-X}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/MehlhornNS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sagt/BeiGHM17, author = {Xiaohui Bei and Jugal Garg and Martin Hoefer and Kurt Mehlhorn}, editor = {Vittorio Bil{\`{o}} and Michele Flammini}, title = {Earning Limits in Fisher Markets with Spending-Constraint Utilities}, booktitle = {Algorithmic Game Theory - 10th International Symposium, {SAGT} 2017, L'Aquila, Italy, September 12-14, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10504}, pages = {67--79}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-66700-3\_6}, doi = {10.1007/978-3-319-66700-3\_6}, timestamp = {Fri, 26 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sagt/BeiGHM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/MehlhornN017, author = {Kurt Mehlhorn and Stefan N{\"{a}}her and Peter Sanders}, title = {Engineering DFS-Based Graph Algorithms}, journal = {CoRR}, volume = {abs/1703.10023}, year = {2017}, url = {http://arxiv.org/abs/1703.10023}, eprinttype = {arXiv}, eprint = {1703.10023}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MehlhornN017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GargHM17, author = {Jugal Garg and Martin Hoefer and Kurt Mehlhorn}, title = {Approximating the Nash Social Welfare with Budget-Additive Valuations}, journal = {CoRR}, volume = {abs/1707.04428}, year = {2017}, url = {http://arxiv.org/abs/1707.04428}, eprinttype = {arXiv}, eprint = {1707.04428}, timestamp = {Fri, 26 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/GargHM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BeckerBKKM17, author = {Ruben Becker and Vincenzo Bonifaci and Andreas Karrenbauer and Pavel Kolev and Kurt Mehlhorn}, title = {Two Results on Slime Mold Computations}, journal = {CoRR}, volume = {abs/1707.06631}, year = {2017}, url = {http://arxiv.org/abs/1707.06631}, eprinttype = {arXiv}, eprint = {1707.06631}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BeckerBKKM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/HuangKM016, author = {Chien{-}Chung Huang and Telikepalli Kavitha and Kurt Mehlhorn and Dimitrios Michail}, title = {Fair Matchings and Related Problems}, journal = {Algorithmica}, volume = {74}, number = {3}, pages = {1184--1203}, year = {2016}, url = {https://doi.org/10.1007/s00453-015-9994-9}, doi = {10.1007/S00453-015-9994-9}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/HuangKM016.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/csr/MehlhornS16, author = {Kurt Mehlhorn and Sanjeev Saxena}, title = {A still simpler way of introducing interior-point method for linear programming}, journal = {Comput. Sci. Rev.}, volume = {22}, pages = {1--11}, year = {2016}, url = {https://doi.org/10.1016/j.cosrev.2016.07.001}, doi = {10.1016/J.COSREV.2016.07.001}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/csr/MehlhornS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DarwishM16, author = {Omar Darwish and Kurt Mehlhorn}, title = {Improved balanced flow computation using parametric flow}, journal = {Inf. Process. Lett.}, volume = {116}, number = {9}, pages = {560--563}, year = {2016}, url = {https://doi.org/10.1016/j.ipl.2016.04.008}, doi = {10.1016/J.IPL.2016.04.008}, timestamp = {Thu, 28 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/DarwishM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsc/SagraloffM16, author = {Michael Sagraloff and Kurt Mehlhorn}, title = {Computing real roots of real polynomials}, journal = {J. Symb. Comput.}, volume = {73}, pages = {46--86}, year = {2016}, url = {https://doi.org/10.1016/j.jsc.2015.03.004}, doi = {10.1016/J.JSC.2015.03.004}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jsc/SagraloffM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/ElbassioniMR16, author = {Khaled M. Elbassioni and Kurt Mehlhorn and Fahimeh Ramezani}, title = {Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design}, journal = {Theory Comput. Syst.}, volume = {59}, number = {4}, pages = {641--663}, year = {2016}, url = {https://doi.org/10.1007/s00224-016-9704-2}, doi = {10.1007/S00224-016-9704-2}, timestamp = {Thu, 31 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/ElbassioniMR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BeiGHM16, author = {Xiaohui Bei and Jugal Garg and Martin Hoefer and Kurt Mehlhorn}, editor = {Piotr Sankowski and Christos D. Zaroliagis}, title = {Computing Equilibria in Markets with Budget-Additive Utilities}, booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24, 2016, Aarhus, Denmark}, series = {LIPIcs}, volume = {57}, pages = {8:1--8:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ESA.2016.8}, doi = {10.4230/LIPICS.ESA.2016.8}, timestamp = {Fri, 26 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esa/BeiGHM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/KolevM16, author = {Pavel Kolev and Kurt Mehlhorn}, editor = {Piotr Sankowski and Christos D. Zaroliagis}, title = {A Note On Spectral Clustering}, booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24, 2016, Aarhus, Denmark}, series = {LIPIcs}, volume = {57}, pages = {57:1--57:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ESA.2016.57}, doi = {10.4230/LIPICS.ESA.2016.57}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/KolevM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/jelia/CroitoruM16, author = {Cosmina Croitoru and Kurt Mehlhorn}, editor = {Loizos Michael and Antonis C. Kakas}, title = {Opposition Frameworks}, booktitle = {Logics in Artificial Intelligence - 15th European Conference, {JELIA} 2016, Larnaca, Cyprus, November 9-11, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10021}, pages = {190--206}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-48758-8\_13}, doi = {10.1007/978-3-319-48758-8\_13}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/jelia/CroitoruM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DuanGM16, author = {Ran Duan and Jugal Garg and Kurt Mehlhorn}, editor = {Robert Krauthgamer}, title = {An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016}, pages = {90--106}, publisher = {{SIAM}}, year = {2016}, url = {https://doi.org/10.1137/1.9781611974331.ch7}, doi = {10.1137/1.9781611974331.CH7}, timestamp = {Tue, 02 Feb 2021 17:07:56 +0100}, biburl = {https://dblp.org/rec/conf/soda/DuanGM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ChalermsookG0MS16, author = {Parinya Chalermsook and Mayank Goswami and L{\'{a}}szl{\'{o}} Kozma and Kurt Mehlhorn and Thatchaphol Saranurak}, title = {The landscape of bounds for binary search trees}, journal = {CoRR}, volume = {abs/1603.04892}, year = {2016}, url = {http://arxiv.org/abs/1603.04892}, eprinttype = {arXiv}, eprint = {1603.04892}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChalermsookG0MS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BeiGHM16, author = {Xiaohui Bei and Jugal Garg and Martin Hoefer and Kurt Mehlhorn}, title = {Computing Equilibria in Markets with Budget-Additive Utilities}, journal = {CoRR}, volume = {abs/1603.07210}, year = {2016}, url = {http://arxiv.org/abs/1603.07210}, eprinttype = {arXiv}, eprint = {1603.07210}, timestamp = {Fri, 26 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/BeiGHM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BeckerKM16, author = {Ruben Becker and Andreas Karrenbauer and Kurt Mehlhorn}, title = {An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions}, journal = {CoRR}, volume = {abs/1612.04689}, year = {2016}, url = {http://arxiv.org/abs/1612.04689}, eprinttype = {arXiv}, eprint = {1612.04689}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BeckerKM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ElbassioniMMR15, author = {Khaled M. Elbassioni and Kazuhisa Makino and Kurt Mehlhorn and Fahimeh Ramezani}, title = {On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets}, journal = {Algorithmica}, volume = {73}, number = {2}, pages = {441--459}, year = {2015}, url = {https://doi.org/10.1007/s00453-014-9902-8}, doi = {10.1007/S00453-014-9902-8}, timestamp = {Thu, 31 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ElbassioniMMR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/DuanM15, author = {Ran Duan and Kurt Mehlhorn}, title = {A combinatorial polynomial algorithm for the linear Arrow-Debreu market}, journal = {Inf. Comput.}, volume = {243}, pages = {112--132}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.12.009}, doi = {10.1016/J.IC.2014.12.009}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/DuanM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsc/MehlhornSW15, author = {Kurt Mehlhorn and Michael Sagraloff and Pengming Wang}, title = {From approximate factorization to root isolation with application to cylindrical algebraic decomposition}, journal = {J. Symb. Comput.}, volume = {66}, pages = {34--69}, year = {2015}, url = {https://doi.org/10.1016/j.jsc.2014.02.001}, doi = {10.1016/J.JSC.2014.02.001}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jsc/MehlhornSW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/bionetics/BecchettiBDKMV15, author = {Luca Becchetti and Vincenzo Bonifaci and Michael Dirnberger and Andreas Karrenbauer and Kurt Mehlhorn and Girish Varma}, editor = {Junichi Suzuki and Tadashi Nakano and Henry Hess}, title = {P. polycephalum Can Compute Shortest Paths}, booktitle = {{BICT} 2015, Proceedings of the 9th {EAI} International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS), New York City, United States, December 3-5, 2015}, pages = {587}, publisher = {{ICST/ACM}}, year = {2015}, url = {http://dl.acm.org/citation.cfm?id=2954741}, timestamp = {Fri, 03 Feb 2017 18:36:35 +0100}, biburl = {https://dblp.org/rec/conf/bionetics/BecchettiBDKMV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/bionetics/DirnbergerKMMN15, author = {Michael Dirnberger and Tim Kehl and Tim Mehlhorn and Kurt Mehlhorn and Adrian Neumann}, editor = {Junichi Suzuki and Tadashi Nakano and Henry Hess}, title = {Towards an open online repository of P. polycephalum networks and their corresponding graph representations}, booktitle = {{BICT} 2015, Proceedings of the 9th {EAI} International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS), New York City, United States, December 3-5, 2015}, pages = {588}, publisher = {{ICST/ACM}}, year = {2015}, url = {http://dl.acm.org/citation.cfm?id=2954740}, timestamp = {Fri, 03 Feb 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/bionetics/DirnbergerKMMN15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/Mehlhorn15, author = {Kurt Mehlhorn}, editor = {Christos D. Zaroliagis and Grammati E. Pantziou and Spyros C. Kontogiannis}, title = {On the Implementation of Combinatorial Algorithms for the Linear Exchange Market}, booktitle = {Algorithms, Probability, Networks, and Games - Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday}, series = {Lecture Notes in Computer Science}, volume = {9295}, pages = {87--94}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-24024-4\_7}, doi = {10.1007/978-3-319-24024-4\_7}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/birthday/Mehlhorn15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/ChalermsookG0MS15, author = {Parinya Chalermsook and Mayank Goswami and L{\'{a}}szl{\'{o}} Kozma and Kurt Mehlhorn and Thatchaphol Saranurak}, editor = {Nikhil Bansal and Irene Finocchi}, title = {Self-Adjusting Binary Search Trees: What Makes Them Tick?}, booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9294}, pages = {300--312}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48350-3\_26}, doi = {10.1007/978-3-662-48350-3\_26}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/ChalermsookG0MS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/ChalermsookG0MS15, author = {Parinya Chalermsook and Mayank Goswami and L{\'{a}}szl{\'{o}} Kozma and Kurt Mehlhorn and Thatchaphol Saranurak}, editor = {Venkatesan Guruswami}, title = {Pattern-Avoiding Access in Binary Search Trees}, booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS} 2015, Berkeley, CA, USA, 17-20 October, 2015}, pages = {410--423}, publisher = {{IEEE} Computer Society}, year = {2015}, url = {https://doi.org/10.1109/FOCS.2015.32}, doi = {10.1109/FOCS.2015.32}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/ChalermsookG0MS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sagt/ElbassioniMR15, author = {Khaled M. Elbassioni and Kurt Mehlhorn and Fahimeh Ramezani}, editor = {Martin Hoefer}, title = {Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design}, booktitle = {Algorithmic Game Theory - 8th International Symposium, {SAGT} 2015, Saarbr{\"{u}}cken, Germany, September 28-30, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9347}, pages = {98--109}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48433-3\_8}, doi = {10.1007/978-3-662-48433-3\_8}, timestamp = {Thu, 31 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sagt/ElbassioniMR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/ChalermsookG0MS15, author = {Parinya Chalermsook and Mayank Goswami and L{\'{a}}szl{\'{o}} Kozma and Kurt Mehlhorn and Thatchaphol Saranurak}, editor = {Frank Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Ulrike Stege}, title = {Greedy Is an Almost Optimal Deque}, booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS} 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9214}, pages = {152--165}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-21840-3\_13}, doi = {10.1007/978-3-319-21840-3\_13}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/ChalermsookG0MS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ChalermsookG0MS15, author = {Parinya Chalermsook and Mayank Goswami and L{\'{a}}szl{\'{o}} Kozma and Kurt Mehlhorn and Thatchaphol Saranurak}, title = {A Global Geometric View of Splaying}, journal = {CoRR}, volume = {abs/1503.03105}, year = {2015}, url = {http://arxiv.org/abs/1503.03105}, eprinttype = {arXiv}, eprint = {1503.03105}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChalermsookG0MS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ChalermsookG0MS15a, author = {Parinya Chalermsook and Mayank Goswami and L{\'{a}}szl{\'{o}} Kozma and Kurt Mehlhorn and Thatchaphol Saranurak}, title = {Greedy Is an Almost Optimal Deque}, journal = {CoRR}, volume = {abs/1506.08319}, year = {2015}, url = {http://arxiv.org/abs/1506.08319}, eprinttype = {arXiv}, eprint = {1506.08319}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChalermsookG0MS15a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ChalermsookG0MS15b, author = {Parinya Chalermsook and Mayank Goswami and L{\'{a}}szl{\'{o}} Kozma and Kurt Mehlhorn and Thatchaphol Saranurak}, title = {Pattern-avoiding access in binary search trees}, journal = {CoRR}, volume = {abs/1507.06953}, year = {2015}, url = {http://arxiv.org/abs/1507.06953}, eprinttype = {arXiv}, eprint = {1507.06953}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChalermsookG0MS15b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KolevM15, author = {Pavel Kolev and Kurt Mehlhorn}, title = {A Note On Spectral Clustering}, journal = {CoRR}, volume = {abs/1509.09188}, year = {2015}, url = {http://arxiv.org/abs/1509.09188}, eprinttype = {arXiv}, eprint = {1509.09188}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KolevM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DuanGM15, author = {Ran Duan and Jugal Garg and Kurt Mehlhorn}, title = {An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market}, journal = {CoRR}, volume = {abs/1510.02694}, year = {2015}, url = {http://arxiv.org/abs/1510.02694}, eprinttype = {arXiv}, eprint = {1510.02694}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DuanGM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/MehlhornS15, author = {Kurt Mehlhorn and Sanjeev Saxena}, title = {A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming}, journal = {CoRR}, volume = {abs/1510.03339}, year = {2015}, url = {http://arxiv.org/abs/1510.03339}, eprinttype = {arXiv}, eprint = {1510.03339}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MehlhornS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DarwishM15a, author = {Omar Darwish and Kurt Mehlhorn}, title = {Improved Balanced Flow Computation Using Parametric Flow}, journal = {CoRR}, volume = {abs/1512.05974}, year = {2015}, url = {http://arxiv.org/abs/1512.05974}, eprinttype = {arXiv}, eprint = {1512.05974}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DarwishM15a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0033948, author = {Martin Dietzfelbinger and Kurt Mehlhorn and Peter Sanders}, title = {Algorithmen und Datenstrukturen - die Grundwerkzeuge}, series = {eXamen.press}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-642-05472-3}, doi = {10.1007/978-3-642-05472-3}, isbn = {978-3-642-05471-6}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/daglib/0033948.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ChristodoulouMP14, author = {Giorgos Christodoulou and Kurt Mehlhorn and Evangelia Pyrga}, title = {Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms}, journal = {Algorithmica}, volume = {69}, number = {3}, pages = {619--640}, year = {2014}, url = {https://doi.org/10.1007/s00453-013-9753-8}, doi = {10.1007/S00453-013-9753-8}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ChristodoulouMP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/AlkassarBMR14, author = {Eyad Alkassar and Sascha B{\"{o}}hme and Kurt Mehlhorn and Christine Rizkallah}, title = {A Framework for the Verification of Certifying Computations}, journal = {J. Autom. Reason.}, volume = {52}, number = {3}, pages = {241--273}, year = {2014}, url = {https://doi.org/10.1007/s10817-013-9289-2}, doi = {10.1007/S10817-013-9289-2}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/AlkassarBMR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/JurkiewiczM14, author = {Tomasz Jurkiewicz and Kurt Mehlhorn}, title = {On a Model of Virtual Address Translation}, journal = {{ACM} J. Exp. Algorithmics}, volume = {19}, number = {1}, year = {2014}, url = {https://doi.org/10.1145/2656337}, doi = {10.1145/2656337}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/JurkiewiczM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nfm/NoschinskiRM14, author = {Lars Noschinski and Christine Rizkallah and Kurt Mehlhorn}, editor = {Julia M. Badger and Kristin Yvonne Rozier}, title = {Verification of Certifying Computations through AutoCorres and Simpl}, booktitle = {{NASA} Formal Methods - 6th International Symposium, {NFM} 2014, Houston, TX, USA, April 29 - May 1, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8430}, pages = {46--61}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-06200-6\_4}, doi = {10.1007/978-3-319-06200-6\_4}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/nfm/NoschinskiRM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/BhattacharyaCMN14, author = {Sayan Bhattacharya and Parinya Chalermsook and Kurt Mehlhorn and Adrian Neumann}, editor = {R. Ravi and Inge Li G{\o}rtz}, title = {New Approximability Results for the Robust k-Median Problem}, booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8503}, pages = {50--61}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-08404-6\_5}, doi = {10.1007/978-3-319-08404-6\_5}, timestamp = {Sun, 02 Jun 2019 21:15:18 +0200}, biburl = {https://dblp.org/rec/conf/swat/BhattacharyaCMN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/walcom/Mehlhorn14, author = {Kurt Mehlhorn}, editor = {Sudebkumar Prasant Pal and Kunihiko Sadakane}, title = {Algorithms for Equilibrium Prices in Linear Market Models}, booktitle = {Algorithms and Computation - 8th International Workshop, {WALCOM} 2014, Chennai, India, February 13-15, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8344}, pages = {1--4}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-04657-0\_1}, doi = {10.1007/978-3-319-04657-0\_1}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/walcom/Mehlhorn14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/JurkiewiczMN14, author = {Tomasz Jurkiewicz and Kurt Mehlhorn and Patrick K. Nicholson}, title = {Cache-Oblivious VAT-Algorithms}, journal = {CoRR}, volume = {abs/1404.3577}, year = {2014}, url = {http://arxiv.org/abs/1404.3577}, eprinttype = {arXiv}, eprint = {1404.3577}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/JurkiewiczMN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ElbassioniMR14, author = {Khaled M. Elbassioni and Kurt Mehlhorn and Fahimeh Ramezani}, title = {Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design}, journal = {CoRR}, volume = {abs/1408.1577}, year = {2014}, url = {http://arxiv.org/abs/1408.1577}, eprinttype = {arXiv}, eprint = {1408.1577}, timestamp = {Fri, 01 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ElbassioniMR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/MegiddoMSV14, author = {Nimrod Megiddo and Kurt Mehlhorn and Rahul Savani and Vijay V. Vazirani}, title = {Equilibrium Computation (Dagstuhl Seminar 14342)}, journal = {Dagstuhl Reports}, volume = {4}, number = {8}, pages = {73--88}, year = {2014}, url = {https://doi.org/10.4230/DagRep.4.8.73}, doi = {10.4230/DAGREP.4.8.73}, timestamp = {Wed, 07 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/MegiddoMSV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ElmasryMS13, author = {Amr Elmasry and Kurt Mehlhorn and Jens M. Schmidt}, title = {Every {DFS} Tree of a 3-Connected Graph Contains a Contractible Edge}, journal = {J. Graph Theory}, volume = {72}, number = {1}, pages = {112--121}, year = {2013}, url = {https://doi.org/10.1002/jgt.21635}, doi = {10.1002/JGT.21635}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ElmasryMS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/JurkiewiczM13, author = {Tomasz Jurkiewicz and Kurt Mehlhorn}, editor = {Peter Sanders and Norbert Zeh}, title = {The cost of address translation}, booktitle = {Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, {ALENEX} 2013, New Orleans, Louisiana, USA, January 7, 2013}, pages = {148--162}, publisher = {{SIAM}}, year = {2013}, url = {https://doi.org/10.1137/1.9781611972931.13}, doi = {10.1137/1.9781611972931.13}, timestamp = {Fri, 19 May 2017 01:26:03 +0200}, biburl = {https://dblp.org/rec/conf/alenex/JurkiewiczM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/AfshaniADDLM13, author = {Peyman Afshani and Manindra Agrawal and Benjamin Doerr and Carola Doerr and Kasper Green Larsen and Kurt Mehlhorn}, editor = {Andrej Brodnik and Alejandro L{\'{o}}pez{-}Ortiz and Venkatesh Raman and Alfredo Viola}, title = {The Query Complexity of Finding a Hidden Permutation}, booktitle = {Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday}, series = {Lecture Notes in Computer Science}, volume = {8066}, pages = {1--11}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40273-9\_1}, doi = {10.1007/978-3-642-40273-9\_1}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/birthday/AfshaniADDLM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/ElbassioniMMR13, author = {Khaled M. Elbassioni and Kazuhisa Makino and Kurt Mehlhorn and Fahimeh Ramezani}, editor = {Ding{-}Zhu Du and Guochuan Zhang}, title = {On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets}, booktitle = {Computing and Combinatorics, 19th International Conference, {COCOON} 2013, Hangzhou, China, June 21-23, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7936}, pages = {65--76}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38768-5\_8}, doi = {10.1007/978-3-642-38768-5\_8}, timestamp = {Thu, 31 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/ElbassioniMMR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/HuangKM013, author = {Chien{-}Chung Huang and Telikepalli Kavitha and Kurt Mehlhorn and Dimitrios Michail}, editor = {Anil Seth and Nisheeth K. Vishnoi}, title = {Fair Matchings and Related Problems}, booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2013, December 12-14, 2013, Guwahati, India}, series = {LIPIcs}, volume = {24}, pages = {339--350}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2013}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2013.339}, doi = {10.4230/LIPICS.FSTTCS.2013.339}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/HuangKM013.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DuanM13, author = {Ran Duan and Kurt Mehlhorn}, editor = {Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg}, title = {A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market}, booktitle = {Automata, Languages, and Programming - 40th International Colloquium, {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {7965}, pages = {425--436}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-39206-1\_36}, doi = {10.1007/978-3-642-39206-1\_36}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DuanM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BecchettiBDKM13, author = {Luca Becchetti and Vincenzo Bonifaci and Michael Dirnberger and Andreas Karrenbauer and Kurt Mehlhorn}, editor = {Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg}, title = {Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds}, 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 = {472--483}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-39212-2\_42}, doi = {10.1007/978-3-642-39212-2\_42}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BecchettiBDKM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/issac/MehlhornSW13, author = {Kurt Mehlhorn and Michael Sagraloff and Pengming Wang}, editor = {Manuel Kauers}, title = {From approximate factorization to root isolation}, booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'13, Boston, MA, USA, June 26-29, 2013}, pages = {283--290}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2465506.2465523}, doi = {10.1145/2465506.2465523}, timestamp = {Tue, 24 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/issac/MehlhornSW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Mehlhorn13, author = {Kurt Mehlhorn}, editor = {Natacha Portier and Thomas Wilke}, title = {Physarum Computations (Invited talk)}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2013, February 27 - March 2, 2013, Kiel, Germany}, series = {LIPIcs}, volume = {20}, pages = {5--6}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2013}, url = {https://doi.org/10.4230/LIPIcs.STACS.2013.5}, doi = {10.4230/LIPICS.STACS.2013.5}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/Mehlhorn13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MehlhornNS13, author = {Kurt Mehlhorn and Adrian Neumann and Jens M. Schmidt}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Certifying 3-Edge-Connectivity}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {358--369}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_31}, doi = {10.1007/978-3-642-45043-3\_31}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/MehlhornNS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1301-4870, author = {Kurt Mehlhorn and Michael Sagraloff and Pengming Wang}, title = {From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition}, journal = {CoRR}, volume = {abs/1301.4870}, year = {2013}, url = {http://arxiv.org/abs/1301.4870}, eprinttype = {arXiv}, eprint = {1301.4870}, timestamp = {Tue, 24 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1301-4870.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1301-5290, author = {Khaled M. Elbassioni and Kazuhisa Makino and Kurt Mehlhorn and Fahimeh Ramezani}, title = {On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets}, journal = {CoRR}, volume = {abs/1301.5290}, year = {2013}, url = {http://arxiv.org/abs/1301.5290}, eprinttype = {arXiv}, eprint = {1301.5290}, timestamp = {Fri, 01 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1301-5290.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1301-7462, author = {Eyad Alkassar and Sascha B{\"{o}}hme and Kurt Mehlhorn and Christine Rizkallah}, title = {A Framework for the Verification of Certifying Computations}, journal = {CoRR}, volume = {abs/1301.7462}, year = {2013}, url = {http://arxiv.org/abs/1301.7462}, eprinttype = {arXiv}, eprint = {1301.7462}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1301-7462.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/SagraloffM13, author = {Michael Sagraloff and Kurt Mehlhorn}, title = {Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration}, journal = {CoRR}, volume = {abs/1308.4088}, year = {2013}, url = {http://arxiv.org/abs/1308.4088}, eprinttype = {arXiv}, eprint = {1308.4088}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/SagraloffM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BhattacharyaCMN13, author = {Sayan Bhattacharya and Parinya Chalermsook and Kurt Mehlhorn and Adrian Neumann}, title = {New Approximability Results for the Robust k-Median Problem}, journal = {CoRR}, volume = {abs/1309.4602}, year = {2013}, url = {http://arxiv.org/abs/1309.4602}, eprinttype = {arXiv}, eprint = {1309.4602}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BhattacharyaCMN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/CheongMT13, author = {Otfried Cheong and Kurt Mehlhorn and Monique Teillaud}, title = {Computational Geometry (Dagstuhl Seminar 13101)}, journal = {Dagstuhl Reports}, volume = {3}, number = {3}, pages = {1--23}, year = {2013}, url = {https://doi.org/10.4230/DagRep.3.3.1}, doi = {10.4230/DAGREP.3.3.1}, timestamp = {Wed, 07 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/CheongMT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ElmasryMS12, author = {Amr Elmasry and Kurt Mehlhorn and Jens M. Schmidt}, title = {An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs}, journal = {Algorithmica}, volume = {62}, number = {3-4}, pages = {754--766}, year = {2012}, url = {https://doi.org/10.1007/s00453-010-9481-2}, doi = {10.1007/S00453-010-9481-2}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/ElmasryMS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/MehlhornS12, author = {Kurt Mehlhorn and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {CGTA-Awards 2011}, journal = {Comput. Geom.}, volume = {45}, number = {4}, pages = {139}, year = {2012}, url = {https://doi.org/10.1016/j.comgeo.2011.11.005}, doi = {10.1016/J.COMGEO.2011.11.005}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/MehlhornS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MegowMS12, author = {Nicole Megow and Kurt Mehlhorn and Pascal Schweitzer}, title = {Online graph exploration: New results on old and new algorithms}, journal = {Theor. Comput. Sci.}, volume = {463}, pages = {62--72}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.06.034}, doi = {10.1016/J.TCS.2012.06.034}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MegowMS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KaneMSS12, author = {Daniel M. Kane and Kurt Mehlhorn and Thomas Sauerwald and He Sun}, editor = {Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts and Roger Wattenhofer}, title = {Counting Arbitrary Subgraphs in Data Streams}, booktitle = {Automata, Languages, and Programming - 39th International Colloquium, {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {7392}, pages = {598--609}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31585-5\_53}, doi = {10.1007/978-3-642-31585-5\_53}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KaneMSS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BonifaciMV12, author = {Vincenzo Bonifaci and Kurt Mehlhorn and Girish Varma}, editor = {Yuval Rabani}, title = {Physarum can compute shortest paths}, booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012}, pages = {233--240}, publisher = {{SIAM}}, year = {2012}, url = {https://doi.org/10.1137/1.9781611973099.21}, doi = {10.1137/1.9781611973099.21}, timestamp = {Tue, 02 Feb 2021 17:07:31 +0100}, biburl = {https://dblp.org/rec/conf/soda/BonifaciMV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/icalp/2012-1, editor = {Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts and Roger Wattenhofer}, title = {Automata, Languages, and Programming - 39th International Colloquium, {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {7391}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31594-7}, doi = {10.1007/978-3-642-31594-7}, isbn = {978-3-642-31593-0}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/2012-1.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/icalp/2012-2, editor = {Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts and Roger Wattenhofer}, title = {Automata, Languages, and Programming - 39th International Colloquium, {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {7392}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31585-5}, doi = {10.1007/978-3-642-31585-5}, isbn = {978-3-642-31584-8}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/2012-2.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1202-2293, author = {Karl Bringmann and Kurt Mehlhorn and Adrian Neumann}, title = {Remarks on Category-Based Routing in Social Networks}, journal = {CoRR}, volume = {abs/1202.2293}, year = {2012}, url = {http://arxiv.org/abs/1202.2293}, eprinttype = {arXiv}, eprint = {1202.2293}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1202-2293.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1202-2877, author = {George Christodoulou and Kurt Mehlhorn and Evangelia Pyrga}, title = {Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms}, journal = {CoRR}, volume = {abs/1202.2877}, year = {2012}, url = {http://arxiv.org/abs/1202.2877}, eprinttype = {arXiv}, eprint = {1202.2877}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1202-2877.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1211-6553, author = {Kurt Mehlhorn and Adrian Neumann and Jens M. Schmidt}, title = {Certifying 3-Edge-Connectivity}, journal = {CoRR}, volume = {abs/1211.6553}, year = {2012}, url = {http://arxiv.org/abs/1211.6553}, eprinttype = {arXiv}, eprint = {1211.6553}, timestamp = {Sat, 23 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1211-6553.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1212-0703, author = {Tomasz Jurkiewicz and Kurt Mehlhorn}, title = {The Cost of Address Translation}, journal = {CoRR}, volume = {abs/1212.0703}, year = {2012}, url = {http://arxiv.org/abs/1212.0703}, eprinttype = {arXiv}, eprint = {1212.0703}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1212-0703.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1212-0979, author = {Ran Duan and Kurt Mehlhorn}, title = {A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market}, journal = {CoRR}, volume = {abs/1212.0979}, year = {2012}, url = {http://arxiv.org/abs/1212.0979}, eprinttype = {arXiv}, eprint = {1212.0979}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1212-0979.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/MehlhornVH12, author = {Kurt Mehlhorn and Moshe Y. Vardi and Marc Herbstritt}, title = {Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452)}, journal = {Dagstuhl Reports}, volume = {2}, number = {11}, pages = {20--44}, year = {2012}, url = {https://doi.org/10.4230/DagRep.2.11.20}, doi = {10.4230/DAGREP.2.11.20}, timestamp = {Wed, 07 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/MehlhornVH12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AfshaniADCLM12, author = {Peyman Afshani and Manindra Agrawal and Benjamin Doerr and Carola Winzen and Kasper Green Larsen and Kurt Mehlhorn}, title = {The Deterministic and Randomized Query Complexity of a Simple Guessing Game}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-087}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/087}, eprinttype = {ECCC}, eprint = {TR12-087}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AfshaniADCLM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/KavithaMM11, author = {Telikepalli Kavitha and Kurt Mehlhorn and Dimitrios Michail}, title = {New Approximation Algorithms for Minimum Cycle Bases of Graphs}, journal = {Algorithmica}, volume = {59}, number = {4}, pages = {471--488}, year = {2011}, url = {https://doi.org/10.1007/s00453-009-9313-4}, doi = {10.1007/S00453-009-9313-4}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/KavithaMM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/HalperinM11, author = {Dan Halperin and Kurt Mehlhorn}, title = {Guest Editorial: Selected Papers from European Symposium on Algorithms}, journal = {Algorithmica}, volume = {60}, number = {1}, pages = {1--2}, year = {2011}, url = {https://doi.org/10.1007/s00453-010-9409-x}, doi = {10.1007/S00453-010-9409-X}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/HalperinM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/MehlhornOS11, author = {Kurt Mehlhorn and Ralf Osbild and Michael Sagraloff}, title = {A general approach to the analysis of controlled perturbation algorithms}, journal = {Comput. Geom.}, volume = {44}, number = {9}, pages = {507--528}, year = {2011}, url = {https://doi.org/10.1016/j.comgeo.2011.06.001}, doi = {10.1016/J.COMGEO.2011.06.001}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/MehlhornOS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/csr/McConnellMNS11, author = {Ross M. McConnell and Kurt Mehlhorn and Stefan N{\"{a}}her and Pascal Schweitzer}, title = {Certifying algorithms}, journal = {Comput. Sci. Rev.}, volume = {5}, number = {2}, pages = {119--161}, year = {2011}, url = {https://doi.org/10.1016/j.cosrev.2010.09.009}, doi = {10.1016/J.COSREV.2010.09.009}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/csr/McConnellMNS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/it/AlkassarBMRS11, author = {Eyad Alkassar and Sascha B{\"{o}}hme and Kurt Mehlhorn and Christine Rizkallah and Pascal Schweitzer}, title = {An Introduction to Certifying Algorithms}, journal = {it Inf. Technol.}, volume = {53}, number = {6}, pages = {287--293}, year = {2011}, url = {https://doi.org/10.1524/itit.2011.0655}, doi = {10.1524/ITIT.2011.0655}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/it/AlkassarBMRS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jmlr/ShervashidzeSLMB11, author = {Nino Shervashidze and Pascal Schweitzer and Erik Jan van Leeuwen and Kurt Mehlhorn and Karsten M. Borgwardt}, title = {Weisfeiler-Lehman Graph Kernels}, journal = {J. Mach. Learn. Res.}, volume = {12}, pages = {2539--2561}, year = {2011}, url = {https://dl.acm.org/doi/10.5555/1953048.2078187}, doi = {10.5555/1953048.2078187}, timestamp = {Thu, 02 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jmlr/ShervashidzeSLMB11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsc/MehlhornS11, author = {Kurt Mehlhorn and Michael Sagraloff}, title = {A deterministic algorithm for isolating real roots of a real polynomial}, journal = {J. Symb. Comput.}, volume = {46}, number = {1}, pages = {70--90}, year = {2011}, url = {https://doi.org/10.1016/j.jsc.2010.09.004}, doi = {10.1016/J.JSC.2010.09.004}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jsc/MehlhornS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cav/AlkassarBMR11, author = {Eyad Alkassar and Sascha B{\"{o}}hme and Kurt Mehlhorn and Christine Rizkallah}, editor = {Ganesh Gopalakrishnan and Shaz Qadeer}, title = {Verification of Certifying Computations}, booktitle = {Computer Aided Verification - 23rd International Conference, {CAV} 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6806}, pages = {67--82}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22110-1\_7}, doi = {10.1007/978-3-642-22110-1\_7}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cav/AlkassarBMR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/ChristodoulouMP11, author = {George Christodoulou and Kurt Mehlhorn and Evangelia Pyrga}, editor = {Camil Demetrescu and Magn{\'{u}}s M. Halld{\'{o}}rsson}, title = {Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms}, booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken, Germany, September 5-9, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6942}, pages = {119--130}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-23719-5\_11}, doi = {10.1007/978-3-642-23719-5\_11}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/ChristodoulouMP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/ManjunathMPS11, author = {Madhusudan Manjunath and Kurt Mehlhorn and Konstantinos Panagiotou and He Sun}, editor = {Camil Demetrescu and Magn{\'{u}}s M. Halld{\'{o}}rsson}, title = {Approximate Counting of Cycles in Streams}, booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken, Germany, September 5-9, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6942}, pages = {677--688}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-23719-5\_57}, doi = {10.1007/978-3-642-23719-5\_57}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/ManjunathMPS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MegowMS11, author = {Nicole Megow and Kurt Mehlhorn and Pascal Schweitzer}, editor = {Luca Aceto and Monika Henzinger and Jir{\'{\i}} Sgall}, title = {Online Graph Exploration: New Results on Old and New Algorithms}, booktitle = {Automata, Languages and Programming - 38th International Colloquium, {ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6756}, pages = {478--489}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22012-8\_38}, doi = {10.1007/978-3-642-22012-8\_38}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MegowMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/walcom/Mehlhorn11, author = {Kurt Mehlhorn}, editor = {Naoki Katoh and Amit Kumar}, title = {The Physarum Computer}, booktitle = {{WALCOM:} Algorithms and Computation - 5th International Workshop, {WALCOM} 2011, New Delhi, India, February 18-20, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6552}, pages = {8}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-19094-0\_3}, doi = {10.1007/978-3-642-19094-0\_3}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/walcom/Mehlhorn11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/sp/voecking2011/EigenwilligM11, author = {Arno Eigenwillig and Kurt Mehlhorn}, editor = {Berthold V{\"{o}}cking and Helmut Alt and Martin Dietzfelbinger and R{\"{u}}diger Reischuk and Christian Scheideler and Heribert Vollmer and Dorothea Wagner}, title = {Multiplication of Long Integers - Faster than Long Multiplication}, booktitle = {Algorithms Unplugged}, pages = {101--109}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-15328-0\_11}, doi = {10.1007/978-3-642-15328-0\_11}, timestamp = {Wed, 14 Jun 2017 20:29:01 +0200}, biburl = {https://dblp.org/rec/books/sp/voecking2011/EigenwilligM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1106-0423, author = {Vincenzo Bonifaci and Kurt Mehlhorn and Girish Varma}, title = {Physarum Can Compute Shortest Paths}, journal = {CoRR}, volume = {abs/1106.0423}, year = {2011}, url = {http://arxiv.org/abs/1106.0423}, eprinttype = {arXiv}, eprint = {1106.0423}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1106-0423.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/AgarwalMT11, author = {Pankaj K. Agarwal and Kurt Mehlhorn and Monique Teillaud}, title = {Computational Geometry (Dagstuhl Seminar 11111)}, journal = {Dagstuhl Reports}, volume = {1}, number = {3}, pages = {19--41}, year = {2011}, url = {https://doi.org/10.4230/DagRep.1.3.19}, doi = {10.4230/DAGREP.1.3.19}, timestamp = {Wed, 07 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/AgarwalMT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/GargKKMM10, author = {Naveen Garg and Telikepalli Kavitha and Amit Kumar and Kurt Mehlhorn and Juli{\'{a}}n Mestre}, title = {Assigning Papers to Referees}, journal = {Algorithmica}, volume = {58}, number = {1}, pages = {119--136}, year = {2010}, url = {https://doi.org/10.1007/s00453-009-9386-0}, doi = {10.1007/S00453-009-9386-0}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/GargKKMM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/MehlhornS10, author = {Kurt Mehlhorn and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Editorial}, journal = {Comput. Geom.}, volume = {43}, number = {6-7}, pages = {555}, year = {2010}, url = {https://doi.org/10.1016/j.comgeo.2010.03.001}, doi = {10.1016/J.COMGEO.2010.03.001}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/MehlhornS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsc/MehlhornR10, author = {Kurt Mehlhorn and Saurabh Ray}, title = {Faster algorithms for computing Hong's bound on absolute positiveness}, journal = {J. Symb. Comput.}, volume = {45}, number = {6}, pages = {677--683}, year = {2010}, url = {https://doi.org/10.1016/j.jsc.2010.02.002}, doi = {10.1016/J.JSC.2010.02.002}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jsc/MehlhornR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mics/BerberichFHMW10, author = {Eric Berberich and Efi Fogel and Dan Halperin and Kurt Mehlhorn and Ron Wein}, title = {Arrangements on Parametric Surfaces {I:} General Framework and Infrastructure}, journal = {Math. Comput. Sci.}, volume = {4}, number = {1}, pages = {45--66}, year = {2010}, url = {https://doi.org/10.1007/s11786-010-0042-5}, doi = {10.1007/S11786-010-0042-5}, timestamp = {Wed, 12 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mics/BerberichFHMW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/BaswanaKMP10, author = {Surender Baswana and Telikepalli Kavitha and Kurt Mehlhorn and Seth Pettie}, title = {Additive spanners and (alpha, beta)-spanners}, journal = {{ACM} Trans. Algorithms}, volume = {7}, number = {1}, pages = {5:1--5:26}, year = {2010}, url = {https://doi.org/10.1145/1868237.1868242}, doi = {10.1145/1868237.1868242}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/BaswanaKMP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/faw/MehlhornS10, author = {Kurt Mehlhorn and Pascal Schweitzer}, editor = {Der{-}Tsai Lee and Danny Z. Chen and Shi Ying}, title = {Progress on Certifying Algorithms}, booktitle = {Frontiers in Algorithmics, 4th International Workshop, {FAW} 2010, Wuhan, China, August 11-13, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6213}, pages = {1--5}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14553-7\_1}, doi = {10.1007/978-3-642-14553-7\_1}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/faw/MehlhornS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icms/Mehlhorn10, author = {Kurt Mehlhorn}, editor = {Komei Fukuda and Joris van der Hoeven and Michael Joswig and Nobuki Takayama}, title = {Reliable and Efficient Geometric Computing}, booktitle = {Mathematical Software - {ICMS} 2010, Third International Congress on Mathematical Software, Kobe, Japan, September 13-17, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6327}, pages = {10--11}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-15582-6\_3}, doi = {10.1007/978-3-642-15582-6\_3}, timestamp = {Mon, 28 Aug 2023 21:17:32 +0200}, biburl = {https://dblp.org/rec/conf/icms/Mehlhorn10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BurnikelFMSS09, author = {Christoph Burnikel and Stefan Funke and Kurt Mehlhorn and Stefan Schirra and Susanne Schmitt}, title = {A Separation Bound for Real Algebraic Expressions}, journal = {Algorithmica}, volume = {55}, number = {1}, pages = {14--28}, year = {2009}, url = {https://doi.org/10.1007/s00453-007-9132-4}, doi = {10.1007/S00453-007-9132-4}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BurnikelFMSS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/MehlhornSZ09, author = {Kurt Mehlhorn and J{\"{o}}rg{-}R{\"{u}}diger Sack and Joseph Zaks}, title = {Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 {(4)} (May 2009) 352-361]}, journal = {Comput. Geom.}, volume = {42}, number = {6-7}, pages = {722}, year = {2009}, url = {https://doi.org/10.1016/j.comgeo.2009.03.001}, doi = {10.1016/J.COMGEO.2009.03.001}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/MehlhornSZ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/csr/KavithaLMMRUZ09, author = {Telikepalli Kavitha and Christian Liebchen and Kurt Mehlhorn and Dimitrios Michail and Romeo Rizzi and Torsten Ueckerdt and Katharina Anna Zweig}, title = {Cycle bases in graphs characterization, algorithms, complexity, and applications}, journal = {Comput. Sci. Rev.}, volume = {3}, number = {4}, pages = {199--243}, year = {2009}, url = {https://doi.org/10.1016/j.cosrev.2009.08.001}, doi = {10.1016/J.COSREV.2009.08.001}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/csr/KavithaLMMRUZ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/MehlhornM09, author = {Kurt Mehlhorn and Dimitrios Michail}, title = {Minimum cycle bases: Faster and simpler}, journal = {{ACM} Trans. Algorithms}, volume = {6}, number = {1}, pages = {8:1--8:13}, year = {2009}, url = {https://doi.org/10.1145/1644015.1644023}, doi = {10.1145/1644015.1644023}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/MehlhornM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/AmaldiIJMR09, author = {Edoardo Amaldi and Claudio Iuliano and Tomasz Jurkiewicz and Kurt Mehlhorn and Romeo Rizzi}, editor = {Amos Fiat and Peter Sanders}, title = {Breaking the O(m\({}^{\mbox{2}}\)n) Barrier for Minimum Cycle Bases}, booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5757}, pages = {301--312}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-04128-0\_28}, doi = {10.1007/978-3-642-04128-0\_28}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/AmaldiIJMR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Mehlhorn09, author = {Kurt Mehlhorn}, editor = {Susanne Albers and Alberto Marchetti{-}Spaccamela and Yossi Matias and Sotiris E. Nikoletseas and Wolfgang Thomas}, title = {Assigning Papers to Referees}, booktitle = {Automata, Languages and Programming, 36th International Colloquium, {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {5555}, pages = {1--2}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-02927-1\_1}, doi = {10.1007/978-3-642-02927-1\_1}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Mehlhorn09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/issac/MehlhornS09, author = {Kurt Mehlhorn and Michael Sagraloff}, editor = {Jeremy R. Johnson and Hyungju Park and Erich L. Kaltofen}, title = {Isolating real roots of real polynomials}, booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC} 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings}, pages = {247--254}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1576702.1576737}, doi = {10.1145/1576702.1576737}, timestamp = {Mon, 03 Apr 2023 17:23:32 +0200}, biburl = {https://dblp.org/rec/conf/issac/MehlhornS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/jmlr/ShervashidzeVPMB09, author = {Nino Shervashidze and S. V. N. Vishwanathan and Tobias Petri and Kurt Mehlhorn and Karsten M. Borgwardt}, editor = {David A. Van Dyk and Max Welling}, title = {Efficient graphlet kernels for large graph comparison}, booktitle = {Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics, {AISTATS} 2009, Clearwater Beach, Florida, USA, April 16-18, 2009}, series = {{JMLR} Proceedings}, volume = {5}, pages = {488--495}, publisher = {JMLR.org}, year = {2009}, url = {http://proceedings.mlr.press/v5/shervashidze09a.html}, timestamp = {Wed, 29 May 2019 08:41:44 +0200}, biburl = {https://dblp.org/rec/journals/jmlr/ShervashidzeVPMB09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/sp/MehlhornS2008, author = {Kurt Mehlhorn and Peter Sanders}, title = {Algorithms and Data Structures: The Basic Toolbox}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-77978-0}, doi = {10.1007/978-3-540-77978-0}, isbn = {978-3-540-77977-3}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/sp/MehlhornS2008.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/KavithaMMP08, author = {Telikepalli Kavitha and Kurt Mehlhorn and Dimitrios Michail and Katarzyna E. Paluch}, title = {An [(\emph{O}){\textbackslash}tilde](\emph{m}\({}^{\mbox{2}}\)\emph{n}){\textbackslash}tilde\{O\}(m{\^{}}\{2\}n) Algorithm for Minimum Cycle Basis of Graphs}, journal = {Algorithmica}, volume = {52}, number = {3}, pages = {333--349}, year = {2008}, url = {https://doi.org/10.1007/s00453-007-9064-z}, doi = {10.1007/S00453-007-9064-Z}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/KavithaMMP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/KettnerMPSY08, author = {Lutz Kettner and Kurt Mehlhorn and Sylvain Pion and Stefan Schirra and Chee{-}Keng Yap}, title = {Classroom examples of robustness problems in geometric computations}, journal = {Comput. Geom.}, volume = {40}, number = {1}, pages = {61--78}, year = {2008}, url = {https://doi.org/10.1016/j.comgeo.2007.06.003}, doi = {10.1016/J.COMGEO.2007.06.003}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/KettnerMPSY08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HariharanKM08, author = {Ramesh Hariharan and Telikepalli Kavitha and Kurt Mehlhorn}, title = {Faster Algorithms for Minimum Cycle Basis in Directed Graphs}, journal = {{SIAM} J. Comput.}, volume = {38}, number = {4}, pages = {1430--1447}, year = {2008}, url = {https://doi.org/10.1137/060670730}, doi = {10.1137/060670730}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HariharanKM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/EigenwilligM08, author = {Arno Eigenwillig and Kurt Mehlhorn}, editor = {Berthold V{\"{o}}cking and Helmut Alt and Martin Dietzfelbinger and R{\"{u}}diger Reischuk and Christian Scheideler and Heribert Vollmer and Dorothea Wagner}, title = {Multiplikation langer Zahlen (schneller als in der Schule)}, booktitle = {Taschenbuch der Algorithmen}, series = {eXamen.press}, pages = {109--118}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-76394-9\_11}, doi = {10.1007/978-3-540-76394-9\_11}, timestamp = {Tue, 16 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/EigenwilligM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/esa/2008, editor = {Dan Halperin and Kurt Mehlhorn}, title = {Algorithms - {ESA} 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5193}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-87744-8}, doi = {10.1007/978-3-540-87744-8}, isbn = {978-3-540-87743-1}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/2008.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cagd/GotsmanKMMP07, author = {Craig Gotsman and Kanela Kaligosi and Kurt Mehlhorn and Dimitrios Michail and Evangelia Pyrga}, title = {Cycle bases of graphs and sampled manifolds}, journal = {Comput. Aided Geom. Des.}, volume = {24}, number = {8-9}, pages = {464--480}, year = {2007}, url = {https://doi.org/10.1016/j.cagd.2006.07.001}, doi = {10.1016/J.CAGD.2006.07.001}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cagd/GotsmanKMMP07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/HachenbergerKM07, author = {Peter Hachenberger and Lutz Kettner and Kurt Mehlhorn}, title = {Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments}, journal = {Comput. Geom.}, volume = {38}, number = {1-2}, pages = {64--99}, year = {2007}, url = {https://doi.org/10.1016/j.comgeo.2006.11.009}, doi = {10.1016/J.COMGEO.2006.11.009}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/HachenbergerKM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/KavithaM07, author = {Telikepalli Kavitha and Kurt Mehlhorn}, title = {Algorithms to Compute Minimum Cycle Basis in Directed Graphs}, journal = {Theory Comput. Syst.}, volume = {40}, number = {4}, pages = {485--505}, year = {2007}, url = {https://doi.org/10.1007/s00224-006-1319-6}, doi = {10.1007/S00224-006-1319-6}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/KavithaM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AbrahamIKM07, author = {David J. Abraham and Robert W. Irving and Telikepalli Kavitha and Kurt Mehlhorn}, title = {Popular Matchings}, journal = {{SIAM} J. Comput.}, volume = {37}, number = {4}, pages = {1030--1045}, year = {2007}, url = {https://doi.org/10.1137/06067328X}, doi = {10.1137/06067328X}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AbrahamIKM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/KavithaMMP07, author = {Telikepalli Kavitha and Kurt Mehlhorn and Dimitrios Michail and Katarzyna E. Paluch}, title = {Strongly stable matchings in time \emph{O}(\emph{nm}) and extension to the hospitals-residents problem}, journal = {{ACM} Trans. Algorithms}, volume = {3}, number = {2}, pages = {15}, year = {2007}, url = {https://doi.org/10.1145/1240233.1240238}, doi = {10.1145/1240233.1240238}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/KavithaMMP07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoa/Mehlhorn07, author = {Kurt Mehlhorn}, editor = {Andreas W. M. Dress and Yinfeng Xu and Binhai Zhu}, title = {Matchings in Graphs Variations of the Problem}, booktitle = {Combinatorial Optimization and Applications, First International Conference, {COCOA} 2007, Xi'an, China, August 14-16, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4616}, pages = {1--2}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-73556-4\_1}, doi = {10.1007/978-3-540-73556-4\_1}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/cocoa/Mehlhorn07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BerberichFHMW07, author = {Eric Berberich and Efi Fogel and Dan Halperin and Kurt Mehlhorn and Ron Wein}, editor = {Lars Arge and Michael Hoffmann and Emo Welzl}, title = {Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: {A} First Step}, booktitle = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4698}, pages = {645--656}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-75520-3\_57}, doi = {10.1007/978-3-540-75520-3\_57}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/BerberichFHMW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Mehlhorn07, author = {Kurt Mehlhorn}, editor = {Ludek Kucera and Anton{\'{\i}}n Kucera}, title = {Minimum Cycle Bases in Graphs Algorithms and Applications}, booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic, August 26-31, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4708}, pages = {13--14}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74456-6\_3}, doi = {10.1007/978-3-540-74456-6\_3}, timestamp = {Fri, 30 Aug 2019 10:02:28 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Mehlhorn07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KavithaMM07, author = {Telikepalli Kavitha and Kurt Mehlhorn and Dimitrios Michail}, editor = {Wolfgang Thomas and Pascal Weil}, title = {New Approximation Algorithms for Minimum Cycle Bases of Graphs}, booktitle = {{STACS} 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4393}, pages = {512--523}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-70918-3\_44}, doi = {10.1007/978-3-540-70918-3\_44}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/KavithaMM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijcga/AronovAKMT06, author = {Boris Aronov and Tetsuo Asano and Naoki Katoh and Kurt Mehlhorn and Takeshi Tokuyama}, title = {Polyline Fitting of Planar Points under Min-sum Criteria}, journal = {Int. J. Comput. Geom. Appl.}, volume = {16}, number = {2-3}, pages = {97--116}, year = {2006}, url = {https://doi.org/10.1142/S0218195906001951}, doi = {10.1142/S0218195906001951}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijcga/AronovAKMT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/MehlhornM06, author = {Kurt Mehlhorn and Dimitrios Michail}, title = {Implementing minimum cycle basis algorithms}, journal = {{ACM} J. Exp. Algorithmics}, volume = {11}, year = {2006}, url = {https://doi.org/10.1145/1187436.1216582}, doi = {10.1145/1187436.1216582}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/MehlhornM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsc/KrandickM06, author = {Werner Krandick and Kurt Mehlhorn}, title = {New bounds for the Descartes method}, journal = {J. Symb. Comput.}, volume = {41}, number = {1}, pages = {49--66}, year = {2006}, url = {https://doi.org/10.1016/j.jsc.2005.02.004}, doi = {10.1016/J.JSC.2005.02.004}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jsc/KrandickM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BastMST06, author = {Hannah Bast and Kurt Mehlhorn and Guido Sch{\"{a}}fer and Hisao Tamaki}, title = {Matching Algorithms Are Fast in Sparse Random Graphs}, journal = {Theory Comput. Syst.}, volume = {39}, number = {1}, pages = {3--14}, year = {2006}, url = {https://doi.org/10.1007/s00224-005-1254-y}, doi = {10.1007/S00224-005-1254-Y}, timestamp = {Mon, 14 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/BastMST06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KratschMMS06, author = {Dieter Kratsch and Ross M. McConnell and Kurt Mehlhorn and Jeremy P. Spinrad}, title = {Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs}, journal = {{SIAM} J. Comput.}, volume = {36}, number = {2}, pages = {326--353}, year = {2006}, url = {https://doi.org/10.1137/S0097539703437855}, doi = {10.1137/S0097539703437855}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KratschMMS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/IrvingKMMP06, author = {Robert W. Irving and Telikepalli Kavitha and Kurt Mehlhorn and Dimitrios Michail and Katarzyna E. Paluch}, title = {Rank-maximal matchings}, journal = {{ACM} Trans. Algorithms}, volume = {2}, number = {4}, pages = {602--610}, year = {2006}, url = {https://doi.org/10.1145/1198513.1198520}, doi = {10.1145/1198513.1198520}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/IrvingKMMP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/Mehlhorn06, author = {Kurt Mehlhorn}, editor = {Tiziana Calamoneri and Irene Finocchi and Giuseppe F. Italiano}, title = {Reliable and Efficient Geometric Computing}, booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome, Italy, May 29-31, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3998}, pages = {1--2}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11758471\_1}, doi = {10.1007/11758471\_1}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/ciac/Mehlhorn06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/Mehlhorn06, author = {Kurt Mehlhorn}, editor = {Yossi Azar and Thomas Erlebach}, title = {Reliable and Efficient Geometric Computing}, booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4168}, pages = {2}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11841036\_2}, doi = {10.1007/11841036\_2}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/Mehlhorn06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/HariharanKM06, author = {Ramesh Hariharan and Telikepalli Kavitha and Kurt Mehlhorn}, editor = {Michele Bugliesi and Bart Preneel and Vladimiro Sassone and Ingo Wegener}, title = {A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs}, booktitle = {Automata, Languages and Programming, 33rd International Colloquium, {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {4051}, pages = {250--261}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11786986\_23}, doi = {10.1007/11786986\_23}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/HariharanKM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MehlhornOS06, author = {Kurt Mehlhorn and Ralf Osbild and Michael Sagraloff}, editor = {Michele Bugliesi and Bart Preneel and Vladimiro Sassone and Ingo Wegener}, title = {Reliable and Efficient Computational Geometry Via Controlled Perturbation}, booktitle = {Automata, Languages and Programming, 33rd International Colloquium, {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {4051}, pages = {299--310}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11786986\_27}, doi = {10.1007/11786986\_27}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MehlhornOS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iccsa/KettnerMPSY06, author = {Lutz Kettner and Kurt Mehlhorn and Sylvain Pion and Stefan Schirra and Chee{-}Keng Yap}, editor = {Marina L. Gavrilova and Osvaldo Gervasi and Vipin Kumar and Chih Jeng Kenneth Tan and David Taniar and Antonio Lagan{\`{a}} and Youngsong Mun and Hyunseung Choo}, title = {Reply to "Backward Error Analysis ..."}, booktitle = {Computational Science and Its Applications - {ICCSA} 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {3980}, pages = {60--60}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11751540\_7}, doi = {10.1007/11751540\_7}, timestamp = {Thu, 28 Apr 2022 16:17:38 +0200}, biburl = {https://dblp.org/rec/conf/iccsa/KettnerMPSY06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/or/Mehlhorn06, author = {Kurt Mehlhorn}, editor = {Karl{-}Heinz Waldmann and Ulrike M. Stocker}, title = {Reliable Geometric Computing}, booktitle = {Operations Research, Proceedings 2006, Selected Papers of the Annual International Conference of the German Operations ResearchSociety (GOR), Jointly Organized with the Austrian Society of Operations Research ({\"{O}}GOR) and the Swiss Society of Operations Research (SVOR), Karlsruhe, Germany, September 6-8, 2006}, pages = {111}, year = {2006}, url = {https://doi.org/10.1007/978-3-540-69995-8\_17}, doi = {10.1007/978-3-540-69995-8\_17}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/or/Mehlhorn06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/MehlhornEKKSW06, author = {Kurt Mehlhorn and Arno Eigenwillig and Lutz Kettner and Werner Krandick and Susanne Schmitt and Nicola Wolpert}, editor = {Peter Hertling and Christoph M. Hoffmann and Wolfram Luther and Nathalie Revol}, title = {A Descartes Algorithms for Polynomials with Bit-Stream Coefficients}, booktitle = {Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01. - 13.01.2006}, series = {Dagstuhl Seminar Proceedings}, volume = {06021}, publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany}, year = {2006}, url = {http://drops.dagstuhl.de/opus/volltexte/2006/715}, timestamp = {Thu, 10 Jun 2021 13:02:09 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/MehlhornEKKSW06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cca/KrandickM05, author = {Werner Krandick and Kurt Mehlhorn}, title = {New bounds for the Descartes method}, journal = {{SIGSAM} Bull.}, volume = {39}, number = {3}, pages = {94}, year = {2005}, url = {https://doi.org/10.1145/1113439.1113453}, doi = {10.1145/1113439.1113453}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cca/KrandickM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/FunkeMN05, author = {Stefan Funke and Kurt Mehlhorn and Stefan N{\"{a}}her}, title = {Structural filtering: a paradigm for efficient and exact geometric programs}, journal = {Comput. Geom.}, volume = {31}, number = {3}, pages = {179--194}, year = {2005}, url = {https://doi.org/10.1016/j.comgeo.2004.12.007}, doi = {10.1016/J.COMGEO.2004.12.007}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/FunkeMN05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/casc/EigenwilligKKMSW05, author = {Arno Eigenwillig and Lutz Kettner and Werner Krandick and Kurt Mehlhorn and Susanne Schmitt and Nicola Wolpert}, editor = {Victor G. Ganzha and Ernst W. Mayr and Evgenii V. Vorozhtsov}, title = {A Descartes Algorithm for Polynomials with Bit-Stream Coefficients}, booktitle = {Computer Algebra in Scientific Computing, 8th International Workshop, {CASC} 2005, Kalamata, Greece, September 12-16, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3718}, pages = {138--149}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11555964\_12}, doi = {10.1007/11555964\_12}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/casc/EigenwilligKKMSW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BerberichEHHKMRSSW05, author = {Eric Berberich and Arno Eigenwillig and Michael Hemmer and Susan Hert and Lutz Kettner and Kurt Mehlhorn and Joachim Reichel and Susanne Schmitt and Elmar Sch{\"{o}}mer and Nicola Wolpert}, editor = {Gerth St{\o}lting Brodal and Stefano Leonardi}, title = {{EXACUS:} Efficient and Exact Algorithms for Curves and Surfaces}, booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3669}, pages = {155--166}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11561071\_16}, doi = {10.1007/11561071\_16}, timestamp = {Tue, 27 Dec 2022 09:06:31 +0100}, biburl = {https://dblp.org/rec/conf/esa/BerberichEHHKMRSSW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gd/Mehlhorn05, author = {Kurt Mehlhorn}, editor = {Patrick Healy and Nikola S. Nikolov}, title = {Minimum Cycle Bases and Surface Reconstruction}, booktitle = {Graph Drawing, 13th International Symposium, {GD} 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3843}, pages = {532--532}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11618058\_55}, doi = {10.1007/11618058\_55}, timestamp = {Sun, 13 Nov 2022 09:57:32 +0100}, biburl = {https://dblp.org/rec/conf/gd/Mehlhorn05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KaligosiMMS05, author = {Kanela Kaligosi and Kurt Mehlhorn and J. Ian Munro and Peter Sanders}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Towards Optimal Multiple Selection}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {103--114}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_9}, doi = {10.1007/11523468\_9}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KaligosiMMS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AbrahamCMM05, author = {David J. Abraham and Katar{\'{\i}}na Cechl{\'{a}}rov{\'{a}} and David F. Manlove and Kurt Mehlhorn}, editor = {Xiaotie Deng and Ding{-}Zhu Du}, title = {Pareto Optimality in House Allocation Problems}, booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC} 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3827}, pages = {1163--1175}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11602613\_115}, doi = {10.1007/11602613\_115}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AbrahamCMM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AbrahamIKM05, author = {David J. Abraham and Robert W. Irving and Telikepalli Kavitha and Kurt Mehlhorn}, title = {Popular matchings}, booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}, pages = {424--432}, publisher = {{SIAM}}, year = {2005}, url = {http://dl.acm.org/citation.cfm?id=1070432.1070491}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/AbrahamIKM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BaswanaKMP05, author = {Surender Baswana and Telikepalli Kavitha and Kurt Mehlhorn and Seth Pettie}, title = {New constructions of (alpha, beta)-spanners and purely additive spanners}, booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}, pages = {672--681}, publisher = {{SIAM}}, year = {2005}, url = {http://dl.acm.org/citation.cfm?id=1070432.1070526}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BaswanaKMP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FunkeKMS05, author = {Stefan Funke and Christian Klein and Kurt Mehlhorn and Susanne Schmitt}, title = {Controlled perturbation for Delaunay triangulations}, booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}, pages = {1047--1056}, publisher = {{SIAM}}, year = {2005}, url = {http://dl.acm.org/citation.cfm?id=1070432.1070582}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/FunkeKMS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KavithaM05, author = {Telikepalli Kavitha and Kurt Mehlhorn}, editor = {Volker Diekert and Bruno Durand}, title = {A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs}, booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3404}, pages = {654--665}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/978-3-540-31856-9\_54}, doi = {10.1007/978-3-540-31856-9\_54}, timestamp = {Wed, 19 May 2021 12:05:43 +0200}, biburl = {https://dblp.org/rec/conf/stacs/KavithaM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/MehlhornM05, author = {Kurt Mehlhorn and Dimitrios Michail}, editor = {Sotiris E. Nikoletseas}, title = {Implementing Minimum Cycle Basis Algorithms}, booktitle = {Experimental and Efficient Algorithms, 4th InternationalWorkshop, {WEA} 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3503}, pages = {32--43}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11427186\_5}, doi = {10.1007/11427186\_5}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wea/MehlhornM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/dagstuhl/2004P4301, editor = {Lars Arge and Michael A. Bender and Erik D. Demaine and Charles E. Leiserson and Kurt Mehlhorn}, title = {Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004}, series = {Dagstuhl Seminar Proceedings}, volume = {04301}, publisher = {IBFI, Schloss Dagstuhl, Germany}, year = {2005}, url = {http://drops.dagstuhl.de/portals/04301/}, timestamp = {Thu, 10 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/2004P4301.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/KettnerMPSY04, author = {Lutz Kettner and Kurt Mehlhorn and Sylvain Pion and Stefan Schirra and Chee{-}Keng Yap}, editor = {Susanne Albers and Tomasz Radzik}, title = {Classroom Examples of Robustness Problems in Geometric Computations}, booktitle = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3221}, pages = {702--713}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30140-0\_62}, doi = {10.1007/978-3-540-30140-0\_62}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/KettnerMPSY04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KavithaMMP04, author = {Telikepalli Kavitha and Kurt Mehlhorn and Dimitrios Michail and Katarzyna E. Paluch}, editor = {Josep D{\'{\i}}az and Juhani Karhum{\"{a}}ki and Arto Lepist{\"{o}} and Donald Sannella}, title = {A Faster Algorithm for Minimum Cycle Basis of Graphs}, booktitle = {Automata, Languages and Programming: 31st International Colloquium, {ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3142}, pages = {846--857}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-27836-8\_71}, doi = {10.1007/978-3-540-27836-8\_71}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KavithaMMP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AbrahamCMM04, author = {David J. Abraham and Katar{\'{\i}}na Cechl{\'{a}}rov{\'{a}} and David F. Manlove and Kurt Mehlhorn}, editor = {Rudolf Fleischer and Gerhard Trippen}, title = {Pareto Optimality in House Allocation Problems}, booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC} 2004, Hong Kong, China, December 20-22, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3341}, pages = {3--15}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30551-4\_3}, doi = {10.1007/978-3-540-30551-4\_3}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AbrahamCMM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AronovAKMT04, author = {Boris Aronov and Tetsuo Asano and Naoki Katoh and Kurt Mehlhorn and Takeshi Tokuyama}, editor = {Rudolf Fleischer and Gerhard Trippen}, title = {Polyline Fitting of Planar Points Under Min-sum Criteria}, booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC} 2004, Hong Kong, China, December 20-22, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3341}, pages = {77--88}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30551-4\_9}, doi = {10.1007/978-3-540-30551-4\_9}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AronovAKMT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/IrvingKMMP04, author = {Robert W. Irving and Telikepalli Kavitha and Kurt Mehlhorn and Dimitrios Michail and Katarzyna E. Paluch}, editor = {J. Ian Munro}, title = {Rank-maximal matchings}, booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14, 2004}, pages = {68--75}, publisher = {{SIAM}}, year = {2004}, url = {http://dl.acm.org/citation.cfm?id=982792.982802}, timestamp = {Thu, 20 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/IrvingKMMP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AlthausEFM04, author = {Ernst Althaus and Friedrich Eisenbrand and Stefan Funke and Kurt Mehlhorn}, editor = {J. Ian Munro}, title = {Point containment in the integer hull of a polyhedron}, booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14, 2004}, pages = {929--933}, publisher = {{SIAM}}, year = {2004}, url = {http://dl.acm.org/citation.cfm?id=982792.982932}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AlthausEFM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BastMST04, author = {Hannah Bast and Kurt Mehlhorn and Guido Sch{\"{a}}fer and Hisao Tamaki}, editor = {Volker Diekert and Michel Habib}, title = {Matching Algorithms Are Fast in Sparse Random Graphs}, booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2996}, pages = {81--92}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-24749-4\_8}, doi = {10.1007/978-3-540-24749-4\_8}, timestamp = {Mon, 14 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/BastMST04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KavithaMMP04, author = {Telikepalli Kavitha and Kurt Mehlhorn and Dimitrios Michail and Katarzyna E. Paluch}, editor = {Volker Diekert and Michel Habib}, title = {Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem}, booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2996}, pages = {222--233}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-24749-4\_20}, doi = {10.1007/978-3-540-24749-4\_20}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/KavithaMMP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/ArgeBDLM04, author = {Lars Arge and Michael A. Bender and Erik D. Demaine and Charles E. Leiserson and Kurt Mehlhorn}, editor = {Lars Arge and Michael A. Bender and Erik D. Demaine and Charles E. Leiserson and Kurt Mehlhorn}, title = {04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms}, booktitle = {Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004}, series = {Dagstuhl Seminar Proceedings}, volume = {04301}, publisher = {IBFI, Schloss Dagstuhl, Germany}, year = {2004}, url = {http://drops.dagstuhl.de/opus/volltexte/2005/157}, timestamp = {Thu, 10 Jun 2021 13:02:05 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/ArgeBDLM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/MehlhornS03, author = {Kurt Mehlhorn and Peter Sanders}, title = {Scanning Multiple Sequences Via Cache Memory}, journal = {Algorithmica}, volume = {35}, number = {1}, pages = {75--93}, year = {2003}, url = {https://doi.org/10.1007/s00453-002-0993-2}, doi = {10.1007/S00453-002-0993-2}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/MehlhornS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BastMS03, author = {Hannah Bast and Kurt Mehlhorn and Guido Sch{\"{a}}fer}, title = {A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms}, journal = {Algorithmica}, volume = {36}, number = {1}, pages = {75--88}, year = {2003}, url = {https://doi.org/10.1007/s00453-002-1008-z}, doi = {10.1007/S00453-002-1008-Z}, timestamp = {Mon, 14 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/BastMS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijcga/MehlhornS03, author = {Kurt Mehlhorn and Michael Seel}, title = {Infimaximal Frames: {A} Technique for Making Lines Look Like Segments}, journal = {Int. J. Comput. Geom. Appl.}, volume = {13}, number = {3}, pages = {241--255}, year = {2003}, url = {https://doi.org/10.1142/S0218195903001141}, doi = {10.1142/S0218195903001141}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijcga/MehlhornS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KwekM03, author = {Stephen Kwek and Kurt Mehlhorn}, title = {Optimal search for rationals}, journal = {Inf. Process. Lett.}, volume = {86}, number = {1}, pages = {23--26}, year = {2003}, url = {https://doi.org/10.1016/S0020-0190(02)00455-6}, doi = {10.1016/S0020-0190(02)00455-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KwekM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/AlthausDKMNT03, author = {Ernst Althaus and Denys Duchier and Alexander Koller and Kurt Mehlhorn and Joachim Niehren and Sven Thiel}, title = {An efficient graph algorithm for dominance constraints}, journal = {J. Algorithms}, volume = {48}, number = {1}, pages = {194--219}, year = {2003}, url = {https://doi.org/10.1016/S0196-6774(03)00050-6}, doi = {10.1016/S0196-6774(03)00050-6}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/AlthausDKMNT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/Mehlhorn03, author = {Kurt Mehlhorn}, editor = {Rolf Klein and Hans{-}Werner Six and Lutz M. Wegner}, title = {The Reliable Algorithmic Software Challenge {RASC}}, booktitle = {Computer Science in Perspective, Essays Dedicated to Thomas Ottmann}, series = {Lecture Notes in Computer Science}, volume = {2598}, pages = {255--263}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/3-540-36477-3\_19}, doi = {10.1007/3-540-36477-3\_19}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/birthday/Mehlhorn03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/GranadosHHKMS03, author = {Miguel Granados and Peter Hachenberger and Susan Hert and Lutz Kettner and Kurt Mehlhorn and Michael Seel}, editor = {Giuseppe Di Battista and Uri Zwick}, title = {Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation}, booktitle = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2832}, pages = {654--666}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39658-1\_59}, doi = {10.1007/978-3-540-39658-1\_59}, timestamp = {Sun, 02 Jun 2019 21:14:37 +0200}, biburl = {https://dblp.org/rec/conf/esa/GranadosHHKMS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BanderierBM03, author = {Cyril Banderier and Ren{\'{e}} Beier and Kurt Mehlhorn}, editor = {Branislav Rovan and Peter Vojt{\'{a}}s}, title = {Smoothed Analysis of Three Combinatorial Problems}, booktitle = {Mathematical Foundations of Computer Science 2003, 28th International Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2747}, pages = {198--207}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45138-9\_14}, doi = {10.1007/978-3-540-45138-9\_14}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/BanderierBM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KratschMMS03, author = {Dieter Kratsch and Ross M. McConnell and Kurt Mehlhorn and Jeremy P. Spinrad}, title = {Certifying algorithms for recognizing interval graphs and permutation graphs}, booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}}, pages = {158--167}, publisher = {{ACM/SIAM}}, year = {2003}, url = {http://dl.acm.org/citation.cfm?id=644108.644137}, timestamp = {Wed, 01 Apr 2015 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/KratschMMS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DhiflaouiFKMSSSW03, author = {Marcel Dhiflaoui and Stefan Funke and Carsten Kwappik and Kurt Mehlhorn and Michael Seel and Elmar Sch{\"{o}}mer and Ralph Schulte and Dennis Weber}, title = {Certifying and repairing solutions to large LPs how good are LP-solvers?}, booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}}, pages = {255--256}, publisher = {{ACM/SIAM}}, year = {2003}, url = {http://dl.acm.org/citation.cfm?id=644108.644152}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/DhiflaouiFKMSSSW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/Mehlhorn03, author = {Kurt Mehlhorn}, editor = {Klaus Jansen and Marian Margraf and Monaldo Mastrolilli and Jos{\'{e}} D. P. Rolim}, title = {The Reliable Algorithmic Software Challenge {RASC}}, booktitle = {Experimental and Efficient Algorithms, Second International Workshop, {WEA} 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2647}, pages = {222}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/3-540-44867-5\_18}, doi = {10.1007/3-540-44867-5\_18}, timestamp = {Sun, 25 Oct 2020 22:45:48 +0100}, biburl = {https://dblp.org/rec/conf/wea/Mehlhorn03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/FunkeM02, author = {Stefan Funke and Kurt Mehlhorn}, title = {{LOOK:} {A} Lazy Object-Oriented Kernel design for geometric computation}, journal = {Comput. Geom.}, volume = {22}, number = {1-3}, pages = {99--118}, year = {2002}, url = {https://doi.org/10.1016/S0925-7721(01)00046-3}, doi = {10.1016/S0925-7721(01)00046-3}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/FunkeM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MehlhornPSS02, author = {Kurt Mehlhorn and Volker Priebe and Guido Sch{\"{a}}fer and Naveen Sivadasan}, title = {All-pairs shortest-paths computation in the presence of negative cycles}, journal = {Inf. Process. Lett.}, volume = {81}, number = {6}, pages = {341--343}, year = {2002}, url = {https://doi.org/10.1016/S0020-0190(01)00242-3}, doi = {10.1016/S0020-0190(01)00242-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MehlhornPSS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/MehlhornS02, author = {Kurt Mehlhorn and Guido Sch{\"{a}}fer}, title = {Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures}, journal = {{ACM} J. Exp. Algorithmics}, volume = {7}, pages = {4}, year = {2002}, url = {https://doi.org/10.1145/944618.944622}, doi = {10.1145/944618.944622}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/MehlhornS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/AlthausBEJKM02, author = {Ernst Althaus and Alexander Bockmayr and Matthias Elf and Michael J{\"{u}}nger and Thomas Kasper and Kurt Mehlhorn}, editor = {Rolf H. M{\"{o}}hring and Rajeev Raman}, title = {{SCIL} - Symbolic Constraints in Integer Linear Programming}, booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2461}, pages = {75--87}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45749-6\_11}, doi = {10.1007/3-540-45749-6\_11}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/AlthausBEJKM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BerberichEHHMS02, author = {Eric Berberich and Arno Eigenwillig and Michael Hemmer and Susan Hert and Kurt Mehlhorn and Elmar Sch{\"{o}}mer}, editor = {Rolf H. M{\"{o}}hring and Rajeev Raman}, title = {A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons}, booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2461}, pages = {174--186}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45749-6\_19}, doi = {10.1007/3-540-45749-6\_19}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/BerberichEHHMS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/MehlhornM02, author = {Kurt Mehlhorn and Ulrich Meyer}, editor = {Rolf H. M{\"{o}}hring and Rajeev Raman}, title = {External-Memory Breadth-First Search with Sublinear {I/O}}, booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2461}, pages = {723--735}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45749-6\_63}, doi = {10.1007/3-540-45749-6\_63}, timestamp = {Tue, 25 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/MehlhornM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijcga/CrauserFMMR01, author = {Andreas Crauser and Paolo Ferragina and Kurt Mehlhorn and Ulrich Meyer and Edgar A. Ramos}, title = {Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems}, journal = {Int. J. Comput. Geom. Appl.}, volume = {11}, number = {3}, pages = {305--337}, year = {2001}, url = {https://doi.org/10.1142/S0218195901000523}, doi = {10.1142/S0218195901000523}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ijcga/CrauserFMMR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijcga/MehlhornMR01, author = {Kurt Mehlhorn and Stefan Meiser and Ronald Rasch}, title = {Furthest Site Abstract Voronoi Diagrams}, journal = {Int. J. Comput. Geom. Appl.}, volume = {11}, number = {6}, pages = {583--616}, year = {2001}, url = {https://doi.org/10.1142/S0218195901000663}, doi = {10.1142/S0218195901000663}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijcga/MehlhornMR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AlthausM01, author = {Ernst Althaus and Kurt Mehlhorn}, title = {Traveling Salesman-Based Curve Reconstruction in Polynomial Time}, journal = {{SIAM} J. Comput.}, volume = {31}, number = {1}, pages = {27--66}, year = {2001}, url = {https://doi.org/10.1137/S0097539700366115}, doi = {10.1137/S0097539700366115}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AlthausM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/MehlhornZ01, author = {Kurt Mehlhorn and Mark Ziegelmann}, editor = {Adam L. Buchsbaum and Jack Snoeyink}, title = {{CNOP} - {A} Package for Constrained Network Optimization}, booktitle = {Algorithm Engineering and Experimentation, Third International Workshop, {ALENEX} 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2153}, pages = {17--31}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-44808-X\_2}, doi = {10.1007/3-540-44808-X\_2}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/alenex/MehlhornZ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/Mehlhorn01, author = {Kurt Mehlhorn}, editor = {Reinhard Wilhelm}, title = {From Algorithm to Program to Software Library}, booktitle = {Informatics - 10 Years Back. 10 Years Ahead}, series = {Lecture Notes in Computer Science}, volume = {2000}, pages = {268--273}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-44577-3\_19}, doi = {10.1007/3-540-44577-3\_19}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/Mehlhorn01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/MehlhornS01, author = {Kurt Mehlhorn and Guido Sch{\"{a}}fer}, editor = {Friedhelm Meyer auf der Heide}, title = {A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms}, booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2161}, pages = {242--253}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-44676-1\_20}, doi = {10.1007/3-540-44676-1\_20}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/MehlhornS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BurnikelFMSS01, author = {Christoph Burnikel and Stefan Funke and Kurt Mehlhorn and Stefan Schirra and Susanne Schmitt}, editor = {Friedhelm Meyer auf der Heide}, title = {A Separation Bound for Real Algebraic Expressions}, booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2161}, pages = {254--265}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-44676-1\_21}, doi = {10.1007/3-540-44676-1\_21}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/BurnikelFMSS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/hercma/Mehlhorn01, author = {Kurt Mehlhorn}, editor = {Elias A. Lipitakis}, title = {Exact geometric computation}, booktitle = {Proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), Athens, Greece, September 20-22, 2001}, pages = {87}, publisher = {{LEA} Press, Athens, Hellas}, year = {2001}, timestamp = {Wed, 20 Jun 2018 09:48:24 +0200}, biburl = {https://dblp.org/rec/conf/hercma/Mehlhorn01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AlthausDKMNT01, author = {Ernst Althaus and Denys Duchier and Alexander Koller and Kurt Mehlhorn and Joachim Niehren and Sven Thiel}, editor = {S. Rao Kosaraju}, title = {An efficient algorithm for the configuration problem of dominance graphs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {815--824}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365788}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/AlthausDKMNT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/sp/alefeld01/MehlhornS01, author = {Kurt Mehlhorn and Stefan Schirra}, editor = {G{\"{o}}tz Alefeld and Jiri Rohn and Siegfried M. Rump and Tetsuro Yamamoto}, title = {Exact Computation with leda{\_}real - Theory and geometric Applications}, booktitle = {Symbolic Algebraic Methods and Verification Methods}, pages = {163--172}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/978-3-7091-6280-4\_16}, doi = {10.1007/978-3-7091-6280-4\_16}, timestamp = {Thu, 27 Jun 2019 15:50:12 +0200}, biburl = {https://dblp.org/rec/books/sp/alefeld01/MehlhornS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BurnikelFMS00, author = {Christoph Burnikel and Rudolf Fleischer and Kurt Mehlhorn and Stefan Schirra}, title = {A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals}, journal = {Algorithmica}, volume = {27}, number = {1}, pages = {87--99}, year = {2000}, url = {https://doi.org/10.1007/s004530010005}, doi = {10.1007/S004530010005}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BurnikelFMS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/DeyMR00, author = {Tamal K. Dey and Kurt Mehlhorn and Edgar A. Ramos}, title = {Curve reconstruction: Connecting dots with good reason}, journal = {Comput. Geom.}, volume = {15}, number = {4}, pages = {229--244}, year = {2000}, url = {https://doi.org/10.1016/S0925-7721(99)00051-6}, doi = {10.1016/S0925-7721(99)00051-6}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/DeyMR00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/MehlhornS00, author = {Kurt Mehlhorn and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Editorial}, journal = {Comput. Geom.}, volume = {17}, number = {1-2}, pages = {1--2}, year = {2000}, url = {https://doi.org/10.1016/S0925-7721(00)00018-3}, doi = {10.1016/S0925-7721(00)00018-3}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/MehlhornS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KececiogluLMMRV00, author = {John D. Kececioglu and Hans{-}Peter Lenhof and Kurt Mehlhorn and Petra Mutzel and Knut Reinert and Martin Vingron}, title = {A polyhedral approach to sequence alignment problems}, journal = {Discret. Appl. Math.}, volume = {104}, number = {1-3}, pages = {143--186}, year = {2000}, url = {https://doi.org/10.1016/S0166-218X(00)00194-3}, doi = {10.1016/S0166-218X(00)00194-3}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KececiogluLMMRV00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/CooperFMP00, author = {Colin Cooper and Alan M. Frieze and Kurt Mehlhorn and Volker Priebe}, title = {Average-case complexity of shortest-paths problems in the vertex-potential model}, journal = {Random Struct. Algorithms}, volume = {16}, number = {1}, pages = {33--46}, year = {2000}, url = {https://doi.org/10.1002/(SICI)1098-2418(200001)16:1\&\#60;33::AID-RSA3\&\#62;3.0.CO;2-0}, doi = {10.1002/(SICI)1098-2418(200001)16:1\&\#60;33::AID-RSA3\&\#62;3.0.CO;2-0}, timestamp = {Mon, 06 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/CooperFMP00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/acl/KollerMN00, author = {Alexander Koller and Kurt Mehlhorn and Joachim Niehren}, title = {A Polynomial-Time Fragment of Dominance Constraints}, booktitle = {38th Annual Meeting of the Association for Computational Linguistics, Hong Kong, China, October 1-8, 2000}, pages = {376--383}, publisher = {{ACL}}, year = {2000}, url = {https://aclanthology.org/P00-1047/}, doi = {10.3115/1075218.1075265}, timestamp = {Fri, 06 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/acl/KollerMN00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/FunkeM00, author = {Stefan Funke and Kurt Mehlhorn}, editor = {Siu{-}Wing Cheng and Otfried Cheong and Pankaj K. Agarwal and Steven Fortune}, title = {Look - a Lazy Object-Oriented Kernel for geometric computation}, booktitle = {Proceedings of the Sixteenth Annual Symposium on Computational Geometry, Clear Water Bay, Hong Kong, China, June 12-14, 2000}, pages = {156--165}, publisher = {{ACM}}, year = {2000}, url = {https://doi.org/10.1145/336154.336196}, doi = {10.1145/336154.336196}, timestamp = {Mon, 14 Jun 2021 16:25:02 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/FunkeM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cp/MehlhornT00, author = {Kurt Mehlhorn and Sven Thiel}, editor = {Rina Dechter}, title = {Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint}, booktitle = {Principles and Practice of Constraint Programming - {CP} 2000, 6th International Conference, Singapore, September 18-21, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1894}, pages = {306--319}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-45349-0\_23}, doi = {10.1007/3-540-45349-0\_23}, timestamp = {Tue, 14 May 2019 10:00:45 +0200}, biburl = {https://dblp.org/rec/conf/cp/MehlhornT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/MehlhornZ00, author = {Kurt Mehlhorn and Mark Ziegelmann}, editor = {Mike Paterson}, title = {Resource Constrained Shortest Paths}, booktitle = {Algorithms - {ESA} 2000, 8th Annual European Symposium, Saarbr{\"{u}}cken, Germany, September 5-8, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1879}, pages = {326--337}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-45253-2\_30}, doi = {10.1007/3-540-45253-2\_30}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/MehlhornZ00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Mehlhorn00, author = {Kurt Mehlhorn}, editor = {Ugo Montanari and Jos{\'{e}} D. P. Rolim and Emo Welzl}, title = {Constraint Programming and Graph Algorithms}, booktitle = {Automata, Languages and Programming, 27th International Colloquium, {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1853}, pages = {571--575}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-45022-X\_48}, doi = {10.1007/3-540-45022-X\_48}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Mehlhorn00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AlthausM00, author = {Ernst Althaus and Kurt Mehlhorn}, editor = {David B. Shmoys}, title = {TSP-based curve reconstruction in polynomial time}, booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, {USA}}, pages = {686--695}, publisher = {{ACM/SIAM}}, year = {2000}, url = {http://dl.acm.org/citation.cfm?id=338219.338627}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/AlthausM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wae/MehlhornS00, author = {Kurt Mehlhorn and Guido Sch{\"{a}}fer}, editor = {Stefan N{\"{a}}her and Dorothea Wagner}, title = {Implementation of {O} (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures}, booktitle = {Algorithm Engineering, 4th International Workshop, {WAE} 2000, Saarbr{\"{u}}cken, Germany, September 5-8, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1982}, pages = {23--38}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-44691-5\_3}, doi = {10.1007/3-540-44691-5\_3}, timestamp = {Fri, 07 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wae/MehlhornS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/gi/2000, editor = {Kurt Mehlhorn and Gregor Snelting}, title = {Informatik 2000, Neue Horizonte im neuen Jahrhundert 30. Jahrestagung der Gesellschaft f{\"{u}}r Informatik Berlin, 19.-22. September 2000}, series = {Informatik aktuell}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/978-3-642-58322-3}, doi = {10.1007/978-3-642-58322-3}, isbn = {978-3-540-67880-9}, timestamp = {Thu, 27 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/gi/2000.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/cu/MehlhornN99, author = {Kurt Mehlhorn and Stefan N{\"{a}}her}, title = {{LEDA:} {A} Platform for Combinatorial and Geometric Computing}, publisher = {Cambridge University Press}, year = {1999}, url = {http://www.mpi-sb.mpg.de/\%7Emehlhorn/LEDAbook.html}, isbn = {0-521-56329-1}, timestamp = {Wed, 10 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/cu/MehlhornN99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/MehlhornNSSSSU99, author = {Kurt Mehlhorn and Stefan N{\"{a}}her and Michael Seel and Raimund Seidel and Thomas Schilz and Stefan Schirra and Christian Uhrig}, title = {Checking geometric programs or verification of geometric structures}, journal = {Comput. Geom.}, volume = {12}, number = {1-2}, pages = {85--103}, year = {1999}, url = {https://doi.org/10.1016/S0925-7721(98)00036-4}, doi = {10.1016/S0925-7721(98)00036-4}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/MehlhornNSSSSU99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/MehlhornSU99, author = {Kurt Mehlhorn and J{\"{o}}rg{-}R{\"{u}}diger Sack and Jorge Urrutia}, title = {Editorial}, journal = {Comput. Geom.}, volume = {12}, number = {3-4}, pages = {153--154}, year = {1999}, url = {https://doi.org/10.1016/S0925-7721(99)00010-3}, doi = {10.1016/S0925-7721(99)00010-3}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/MehlhornSU99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CheriyanM99, author = {Joseph Cheriyan and Kurt Mehlhorn}, title = {An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow}, journal = {Inf. Process. Lett.}, volume = {69}, number = {5}, pages = {239--242}, year = {1999}, url = {https://doi.org/10.1016/S0020-0190(99)00019-8}, doi = {10.1016/S0020-0190(99)00019-8}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/CheriyanM99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ArikatiM99, author = {Srinivasa Rao Arikati and Kurt Mehlhorn}, title = {A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm}, journal = {Inf. Process. Lett.}, volume = {70}, number = {5}, pages = {251--254}, year = {1999}, url = {https://doi.org/10.1016/S0020-0190(99)00071-X}, doi = {10.1016/S0020-0190(99)00071-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ArikatiM99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/FunkeMN99, author = {Stefan Funke and Kurt Mehlhorn and Stefan N{\"{a}}her}, title = {Structural filtering: {A} paradigm for efficient and exact geometric programs}, booktitle = {Proceedings of the 11th Canadian Conference on Computational Geometry, UBC, Vancouver, British Columbia, Canada, August 15-18, 1999}, year = {1999}, url = {http://www.cccg.ca/proceedings/1999/fp25.pdf}, timestamp = {Wed, 12 May 2021 14:19:37 +0200}, biburl = {https://dblp.org/rec/conf/cccg/FunkeMN99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/DeyMR99, author = {Tamal K. Dey and Kurt Mehlhorn and Edgar A. Ramos}, editor = {Victor Milenkovic}, title = {Curve Reconstruction: Connecting Dots with Good Reason}, booktitle = {Proceedings of the Fifteenth Annual Symposium on Computational Geometry, Miami Beach, Florida, USA, June 13-16, 1999}, pages = {197--206}, publisher = {{ACM}}, year = {1999}, url = {https://doi.org/10.1145/304893.304972}, doi = {10.1145/304893.304972}, timestamp = {Mon, 14 Jun 2021 16:25:07 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/DeyMR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/BurnikelFMS99, author = {Christoph Burnikel and Rudolf Fleischer and Kurt Mehlhorn and Stefan Schirra}, editor = {Victor Milenkovic}, title = {Efficient Exact Geometric Computation Made Easy}, booktitle = {Proceedings of the Fifteenth Annual Symposium on Computational Geometry, Miami Beach, Florida, USA, June 13-16, 1999}, pages = {341--350}, publisher = {{ACM}}, year = {1999}, url = {https://doi.org/10.1145/304893.304988}, doi = {10.1145/304893.304988}, timestamp = {Mon, 14 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/BurnikelFMS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/Mehlhorn99, author = {Kurt Mehlhorn}, editor = {C. Pandu Rangan and Venkatesh Raman and Ramaswamy Ramanujam}, title = {The Engineering of some Bipartite Matching Programs}, booktitle = {Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1738}, pages = {446--449}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46691-6\_36}, doi = {10.1007/3-540-46691-6\_36}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/Mehlhorn99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Mehlhorn99, author = {Kurt Mehlhorn}, editor = {Alok Aggarwal and C. Pandu Rangan}, title = {The Engineering of Some Bipartite Matching Programs}, booktitle = {Algorithms and Computation, 10th International Symposium, {ISAAC} '99, Chennai, India, December 16-18, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1741}, pages = {1--3}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46632-0\_1}, doi = {10.1007/3-540-46632-0\_1}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Mehlhorn99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FinklerM99, author = {Ulrich Finkler and Kurt Mehlhorn}, editor = {Robert Endre Tarjan and Tandy J. Warnow}, title = {Checking Priority Queues}, booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, {USA}}, pages = {901--902}, publisher = {{ACM/SIAM}}, year = {1999}, url = {http://dl.acm.org/citation.cfm?id=314500.315078}, timestamp = {Thu, 05 Jul 2018 07:29:57 +0200}, biburl = {https://dblp.org/rec/conf/soda/FinklerM99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wae/Mehlhorn99, author = {Kurt Mehlhorn}, editor = {Jeffrey Scott Vitter and Christos D. Zaroliagis}, title = {Ten Years of {LEDA} Some Thoughts (Abstract)}, booktitle = {Algorithm Engineering, 3rd International Workshop, {WAE} '99, London, UK, July 19-21, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1668}, pages = {14}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48318-7\_3}, doi = {10.1007/3-540-48318-7\_3}, timestamp = {Fri, 07 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wae/Mehlhorn99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wae/CrauserM99, author = {Andreas Crauser and Kurt Mehlhorn}, editor = {Jeffrey Scott Vitter and Christos D. Zaroliagis}, title = {{LEDA-SM} Extending {LEDA} to Secondary Memory}, booktitle = {Algorithm Engineering, 3rd International Workshop, {WAE} '99, London, UK, July 19-21, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1668}, pages = {229--243}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48318-7\_19}, doi = {10.1007/3-540-48318-7\_19}, timestamp = {Fri, 07 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wae/CrauserM99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/MehlhornMNSSUZ98, author = {Kurt Mehlhorn and Michael M{\"{u}}ller and Stefan N{\"{a}}her and Stefan Schirra and Michael Seel and Christian Uhrig and Joachim Ziegler}, title = {A computational basis for higher-dimensional computational geometry and applications}, journal = {Comput. Geom.}, volume = {10}, number = {4}, pages = {289--303}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(98)00011-X}, doi = {10.1016/S0925-7721(98)00011-X}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/MehlhornMNSSUZ98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AlthausM98, author = {Ernst Althaus and Kurt Mehlhorn}, title = {Maximum Network Flow with Floating Point Arithmetic}, journal = {Inf. Process. Lett.}, volume = {66}, number = {3}, pages = {109--113}, year = {1998}, url = {https://doi.org/10.1016/S0020-0190(98)00043-X}, doi = {10.1016/S0020-0190(98)00043-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AlthausM98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/CrauserFMMR98, author = {Andreas Crauser and Paolo Ferragina and Kurt Mehlhorn and Ulrich Meyer and Edgar A. Ramos}, editor = {Ravi Janardan}, title = {Randomized External-Memory Algorithms for Some Geometric Problems}, booktitle = {Proceedings of the Fourteenth Annual Symposium on Computational Geometry, Minneapolis, Minnesota, USA, June 7-10, 1998}, pages = {259--268}, publisher = {{ACM}}, year = {1998}, url = {https://doi.org/10.1145/276884.276914}, doi = {10.1145/276884.276914}, timestamp = {Mon, 14 Jun 2021 16:25:00 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/CrauserFMMR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dimacs/CrauserFMMR98, author = {Andreas Crauser and Paolo Ferragina and Kurt Mehlhorn and Ulrich Meyer and Edgar A. Ramos}, editor = {James M. Abello and Jeffrey Scott Vitter}, title = {I/O-optimal computation of segment intersections}, booktitle = {External Memory Algorithms, Proceedings of a {DIMACS} Workshop, New Brunswick, New Jersey, USA, May 20-22, 1998}, series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science}, volume = {50}, pages = {131--138}, publisher = {{DIMACS/AMS}}, year = {1998}, url = {https://doi.org/10.1090/dimacs/050/07}, doi = {10.1090/DIMACS/050/07}, timestamp = {Mon, 22 May 2023 16:07:35 +0200}, biburl = {https://dblp.org/rec/conf/dimacs/CrauserFMMR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ifip/MehlhornN98, author = {Kurt Mehlhorn and Stefan N{\"{a}}her}, editor = {Kurt Mehlhorn}, title = {From Algorithms to Working Programs on the Use of Program Checking in {LEDA}}, booktitle = {Fundamentals - Foundations of Computer Science, {IFIP} World Computer Congress 1998, August 31 - September 4, 1998, Vienna/Austria and Budapest/Hungary}, series = {books@ocg.at}, volume = {117}, pages = {81--88}, publisher = {Austrian Computer Society}, year = {1998}, timestamp = {Wed, 23 Feb 2005 08:46:34 +0100}, biburl = {https://dblp.org/rec/conf/ifip/MehlhornN98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/MehlhornN98, author = {Kurt Mehlhorn and Stefan N{\"{a}}her}, editor = {Lubos Brim and Jozef Gruska and Jir{\'{\i}} Zlatuska}, title = {From Algorithms to Working Programs: On the Use of Program Checking in {LEDA}}, booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1450}, pages = {84--93}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/BFb0055759}, doi = {10.1007/BFB0055759}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/MehlhornN98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/CrauserMMS98, author = {Andreas Crauser and Kurt Mehlhorn and Ulrich Meyer and Peter Sanders}, editor = {Lubos Brim and Jozef Gruska and Jir{\'{\i}} Zlatuska}, title = {A Parallelization of Dijkstra's Shortest Path Algorithm}, booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1450}, pages = {722--731}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/BFb0055823}, doi = {10.1007/BFB0055823}, timestamp = {Tue, 25 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/CrauserMMS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/ifip/1998-1, editor = {Kurt Mehlhorn}, title = {Fundamentals - Foundations of Computer Science, {IFIP} World Computer Congress 1998, August 31 - September 4, 1998, Vienna/Austria and Budapest/Hungary}, series = {books@ocg.at}, volume = {117}, publisher = {Austrian Computer Society}, year = {1998}, isbn = {3-85403-117-3}, timestamp = {Wed, 23 Feb 2005 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ifip/1998-1.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wae/1998, editor = {Kurt Mehlhorn}, title = {Algorithm Engineering, 2nd International Workshop, {WAE} '92, Saarbr{\"{u}}cken, Germany, August 20-22, 1998, Proceedings}, publisher = {Max-Planck-Institut f{\"{u}}r Informatik}, year = {1998}, url = {http://www.mpi-sb.mpg.de/\%7Ewae98/PROCEEDINGS/}, timestamp = {Mon, 10 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wae/1998.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/MehlhornSU97, author = {Kurt Mehlhorn and R. Sundar and Christian Uhrig}, title = {Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time}, journal = {Algorithmica}, volume = {17}, number = {2}, pages = {183--198}, year = {1997}, url = {https://doi.org/10.1007/BF02522825}, doi = {10.1007/BF02522825}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/MehlhornSU97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/MehlhornP97, author = {Kurt Mehlhorn and Volker Priebe}, title = {On the all-pairs shortest-path algorithm of Moffat and Takaoka}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {205--220}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\&\#60;205::AID-RSA11\&\#62;3.0.CO;2-7}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\&\#60;205::AID-RSA11\&\#62;3.0.CO;2-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/MehlhornP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/MehlhornSY97, author = {Kurt Mehlhorn and Thomas C. Shermer and Chee{-}Keng Yap}, editor = {Jean{-}Daniel Boissonnat}, title = {A Complete Roundness Classification Procedure}, booktitle = {Proceedings of the Thirteenth Annual Symposium on Computational Geometry, Nice, France, June 4-6, 1997}, pages = {129--138}, publisher = {{ACM}}, year = {1997}, url = {https://doi.org/10.1145/262839.262917}, doi = {10.1145/262839.262917}, timestamp = {Mon, 14 Jun 2021 16:25:04 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/MehlhornSY97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/MehlhornMNSSUZ97, author = {Kurt Mehlhorn and Michael M{\"{u}}ller and Stefan N{\"{a}}her and Stefan Schirra and Michael Seel and Christian Uhrig and Joachim Ziegler}, editor = {Jean{-}Daniel Boissonnat}, title = {A Computational Basis for Higher-Dimensional Computational Geometry and Applications}, booktitle = {Proceedings of the Thirteenth Annual Symposium on Computational Geometry, Nice, France, June 4-6, 1997}, pages = {254--263}, publisher = {{ACM}}, year = {1997}, url = {https://doi.org/10.1145/262839.262982}, doi = {10.1145/262839.262982}, timestamp = {Mon, 14 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/MehlhornMNSSUZ97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MehlhornNU97, author = {Kurt Mehlhorn and Stefan N{\"{a}}her and Christian Uhrig}, editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti{-}Spaccamela}, title = {The {LEDA} Platform of Combinatorial and Geometric Computing}, booktitle = {Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1256}, pages = {7--16}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/3-540-63165-8\_161}, doi = {10.1007/3-540-63165-8\_161}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MehlhornNU97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/CooperFMP97, author = {Colin Cooper and Alan M. Frieze and Kurt Mehlhorn and Volker Priebe}, editor = {Jos{\'{e}} D. P. Rolim}, title = {Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model}, booktitle = {Randomization and Approximation Techniques in Computer Science, International Workshop, RANDOM'97, Bolognna, Italy, July 11-12. 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1269}, pages = {15--26}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/3-540-63248-4\_2}, doi = {10.1007/3-540-63248-4\_2}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/random/CooperFMP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/recomb/ReinertLMMK97, author = {Knut Reinert and Hans{-}Peter Lenhof and Petra Mutzel and Kurt Mehlhorn and John D. Kececioglu}, editor = {Michael S. Waterman}, title = {A branch-and-cut algorithm for multiple sequence alignment}, booktitle = {Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, {RECOMB} 1997, Santa Fe, NM, USA, January 20-23, 1997}, pages = {241--250}, publisher = {{ACM}}, year = {1997}, url = {https://doi.org/10.1145/267521.267845}, doi = {10.1145/267521.267845}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/recomb/ReinertLMMK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FinklerM97, author = {Ulrich Finkler and Kurt Mehlhorn}, editor = {Michael E. Saks}, title = {Runtime Prediction of Real Programs on Real Machines}, booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}}, pages = {380--389}, publisher = {{ACM/SIAM}}, year = {1997}, url = {http://dl.acm.org/citation.cfm?id=314161.314326}, timestamp = {Thu, 05 Jul 2018 07:29:42 +0200}, biburl = {https://dblp.org/rec/conf/soda/FinklerM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BurnikelFMS97, author = {Christoph Burnikel and Rudolf Fleischer and Kurt Mehlhorn and Stefan Schirra}, editor = {Michael E. Saks}, title = {A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots}, booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}}, pages = {702--709}, publisher = {{ACM/SIAM}}, year = {1997}, url = {http://dl.acm.org/citation.cfm?id=314161.314421}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BurnikelFMS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wae/BartuschkaMN97, author = {Ulrike Bartuschka and Kurt Mehlhorn and Stefan N{\"{a}}her}, editor = {Giuseppe F. Italiano and Salvatore Orlando}, title = {A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem}, booktitle = {Workshop on Algorithm Engineering, {WAE} '97, Venezia, Italy, September 11-13, 1997. Proceedings}, pages = {124--135}, publisher = {Universit{\`{a}} Ca' Foscari di Venezia}, year = {1997}, timestamp = {Mon, 10 May 2021 14:20:29 +0200}, biburl = {https://dblp.org/rec/conf/wae/BartuschkaMN97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/CheriyanM96, author = {Joseph Cheriyan and Kurt Mehlhorn}, title = {Algorithms for Dense Graphs and Networks on the Random Access Computer}, journal = {Algorithmica}, volume = {15}, number = {6}, pages = {521--549}, year = {1996}, url = {https://doi.org/10.1007/BF01940880}, doi = {10.1007/BF01940880}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/CheriyanM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/MehlhornM96, author = {Kurt Mehlhorn and Petra Mutzel}, title = {On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm}, journal = {Algorithmica}, volume = {16}, number = {2}, pages = {233--242}, year = {1996}, url = {https://doi.org/10.1007/BF01940648}, doi = {10.1007/BF01940648}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/MehlhornM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/AltGMKW96, author = {Helmut Alt and Leonidas J. Guibas and Kurt Mehlhorn and Richard M. Karp and Avi Wigderson}, title = {A Method for Obtaining Randomized Algorithms with Small Tail Probabilities}, journal = {Algorithmica}, volume = {16}, number = {4/5}, pages = {543--547}, year = {1996}, url = {https://doi.org/10.1007/BF01940879}, doi = {10.1007/BF01940879}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/AltGMKW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CheriyanHM96, author = {Joseph Cheriyan and Torben Hagerup and Kurt Mehlhorn}, title = {An o(n{\({^3}\)})-Time Algorithm Maximum-Flow Algorithm}, journal = {{SIAM} J. Comput.}, volume = {25}, number = {6}, pages = {1144--1170}, year = {1996}, url = {https://doi.org/10.1137/S0097539791278376}, doi = {10.1137/S0097539791278376}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/CheriyanHM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/MehlhornNSSSSU96, author = {Kurt Mehlhorn and Stefan N{\"{a}}her and Thomas Schilz and Stefan Schirra and Michael Seel and Raimund Seidel and Christian Uhrig}, editor = {Sue Whitesides}, title = {Checking Geometric Programs or Verification of Geometric Structures}, booktitle = {Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, USA, May 24-26, 1996}, pages = {159--165}, publisher = {{ACM}}, year = {1996}, url = {https://doi.org/10.1145/237218.237344}, doi = {10.1145/237218.237344}, timestamp = {Mon, 14 Jun 2021 16:25:18 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/MehlhornNSSSSU96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gi/MehlhornNU96, author = {Kurt Mehlhorn and Stefan N{\"{a}}her and Christian Uhrig}, editor = {Heinrich C. Mayr}, title = {The {LEDA} Platform for Combinatorial and Geometric Computing}, booktitle = {Beherrschung von Informationssystemen, Tagungsband der Informatik '96, Klagenfurt, Austria, 25.-27. September 1996}, series = {books@ocg.at}, volume = {88}, pages = {43--50}, publisher = {Austrian Computer Society}, year = {1996}, timestamp = {Mon, 21 Mar 2016 16:40:19 +0100}, biburl = {https://dblp.org/rec/conf/gi/MehlhornNU96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wacg/Mehlhorn96, author = {Kurt Mehlhorn}, editor = {Ming C. Lin and Dinesh Manocha}, title = {Position Paper for Panel Discussion}, booktitle = {Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Philadelphia, PA, USA, May 27-28, 1996, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1148}, pages = {51--52}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/BFb0014483}, doi = {10.1007/BFB0014483}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/wacg/Mehlhorn96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/DietzMRU95, author = {Paul F. Dietz and Kurt Mehlhorn and Rajeev Raman and Christian Uhrig}, title = {Lower Bounds for Set Intersection Queries}, journal = {Algorithmica}, volume = {14}, number = {2}, pages = {154--168}, year = {1995}, url = {https://doi.org/10.1007/BF01293666}, doi = {10.1007/BF01293666}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/DietzMRU95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cacm/MehlhornN95, author = {Kurt Mehlhorn and Stefan N{\"{a}}her}, title = {{LEDA:} {A} Platform for Combinatorial and Geometric Computing}, journal = {Commun. {ACM}}, volume = {38}, number = {1}, pages = {96--102}, year = {1995}, url = {https://doi.org/10.1145/204865.204889}, doi = {10.1145/204865.204889}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cacm/MehlhornN95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/Mehlhorn95, author = {Kurt Mehlhorn}, title = {Guest Editor's Foreword}, journal = {Discret. Comput. Geom.}, volume = {14}, number = {4}, pages = {363}, year = {1995}, url = {https://doi.org/10.1007/BF02570712}, doi = {10.1007/BF02570712}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/Mehlhorn95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/FleischerJM95, author = {Rudolf Fleischer and Hermann Jung and Kurt Mehlhorn}, title = {A Communication-Randomness Tradeoff for Two-Processor Systems}, journal = {Inf. Comput.}, volume = {116}, number = {2}, pages = {155--161}, year = {1995}, url = {https://doi.org/10.1006/inco.1995.1011}, doi = {10.1006/INCO.1995.1011}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/FleischerJM95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/BurnikelKMNSU95, author = {Christoph Burnikel and Jochen K{\"{o}}nemann and Kurt Mehlhorn and Stefan N{\"{a}}her and Stefan Schirra and Christian Uhrig}, editor = {Jack Snoeyink}, title = {Exact Geometric Computation in {LEDA}}, booktitle = {Proceedings of the Eleventh Annual Symposium on Computational Geometry, Vancouver, B.C., Canada, June 5-12, 1995}, pages = {C18--C19}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/220279.220330}, doi = {10.1145/220279.220330}, timestamp = {Mon, 14 Jun 2021 16:25:05 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/BurnikelKMNSU95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/MehlhornP95, author = {Kurt Mehlhorn and Volker Priebe}, editor = {Paul G. Spirakis}, title = {On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka}, booktitle = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {979}, pages = {185--198}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60313-1\_143}, doi = {10.1007/3-540-60313-1\_143}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/MehlhornP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/Mehlhorn95, author = {Kurt Mehlhorn}, editor = {Selim G. Akl and Frank K. H. A. Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Nicola Santoro}, title = {Experiences with the Implementation of Geometric Algorithms (Abstract)}, booktitle = {Algorithms and Data Structures, 4th International Workshop, {WADS} '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {955}, pages = {518}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60220-8\_90}, doi = {10.1007/3-540-60220-8\_90}, timestamp = {Sun, 02 Jun 2019 21:24:17 +0200}, biburl = {https://dblp.org/rec/conf/wads/Mehlhorn95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BilardiCDM94, author = {Gianfranco Bilardi and Shiva Chaudhuri and Devdatt P. Dubhashi and Kurt Mehlhorn}, title = {A Lower Bound for Area-Universal Graphs}, journal = {Inf. Process. Lett.}, volume = {51}, number = {2}, pages = {101--105}, year = {1994}, url = {https://doi.org/10.1016/0020-0190(94)00070-0}, doi = {10.1016/0020-0190(94)00070-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BilardiCDM94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/BaumgartenJM94, author = {Hanna Baumgarten and Hermann Jung and Kurt Mehlhorn}, title = {Dynamic Point Location in General Subdivisions}, journal = {J. Algorithms}, volume = {17}, number = {3}, pages = {342--380}, year = {1994}, url = {https://doi.org/10.1006/jagm.1994.1040}, doi = {10.1006/JAGM.1994.1040}, timestamp = {Fri, 22 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/BaumgartenJM94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KaufmannM94, author = {Michael Kaufmann and Kurt Mehlhorn}, title = {A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs}, journal = {{SIAM} J. Comput.}, volume = {23}, number = {2}, pages = {227--246}, year = {1994}, url = {https://doi.org/10.1137/S0097539789162109}, doi = {10.1137/S0097539789162109}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KaufmannM94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DietzfelbingerKMHRT94, author = {Martin Dietzfelbinger and Anna R. Karlin and Kurt Mehlhorn and Friedhelm Meyer auf der Heide and Hans Rohnert and Robert Endre Tarjan}, title = {Dynamic Perfect Hashing: Upper and Lower Bounds}, journal = {{SIAM} J. Comput.}, volume = {23}, number = {4}, pages = {738--761}, year = {1994}, url = {https://doi.org/10.1137/S0097539791194094}, doi = {10.1137/S0097539791194094}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/DietzfelbingerKMHRT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BurnekelMS94, author = {Christoph Burnikel and Kurt Mehlhorn and Stefan Schirra}, editor = {Jan van Leeuwen}, title = {How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results}, booktitle = {Algorithms - {ESA} '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {855}, pages = {227--239}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/BFb0049411}, doi = {10.1007/BFB0049411}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/BurnekelMS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ifip/MehlhornN94, author = {Kurt Mehlhorn and Stefan N{\"{a}}her}, editor = {Bj{\"{o}}rn Pehrson and Imre Simon}, title = {The Implementation of Geometric Algorithms}, booktitle = {Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the {IFIP} 13th World Computer Congress, Hamburg, Germany, 28 August - 2 September, 1994}, series = {{IFIP} Transactions}, volume = {{A-51}}, pages = {223--231}, publisher = {North-Holland}, year = {1994}, timestamp = {Tue, 15 Mar 2016 13:03:03 +0100}, biburl = {https://dblp.org/rec/conf/ifip/MehlhornN94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BurnikelMS94, author = {Christoph Burnikel and Kurt Mehlhorn and Stefan Schirra}, editor = {Daniel Dominic Sleator}, title = {On Degeneracy in Geometric Computations}, booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, {USA}}, pages = {16--23}, publisher = {{ACM/SIAM}}, year = {1994}, url = {http://dl.acm.org/citation.cfm?id=314464.314474}, timestamp = {Thu, 05 Jul 2018 07:29:19 +0200}, biburl = {https://dblp.org/rec/conf/soda/BurnikelMS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/MehlhornSU94, author = {Kurt Mehlhorn and R. Sundar and Christian Uhrig}, editor = {Daniel Dominic Sleator}, title = {Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time}, booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, {USA}}, pages = {213--222}, publisher = {{ACM/SIAM}}, year = {1994}, url = {http://dl.acm.org/citation.cfm?id=314464.314496}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/MehlhornSU94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/compgeom/1994, editor = {Kurt Mehlhorn}, title = {Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, USA, June 6-8, 1994}, publisher = {{ACM}}, year = {1994}, url = {https://doi.org/10.1145/177424}, doi = {10.1145/177424}, isbn = {0-89791-648-4}, timestamp = {Mon, 14 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/1994.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/KleinMM93, author = {Rolf Klein and Kurt Mehlhorn and Stefan Meiser}, title = {Randomized Incremental Construction of Abstract Voronoi Diagrams}, journal = {Comput. Geom.}, volume = {3}, pages = {157--184}, year = {1993}, url = {https://doi.org/10.1016/0925-7721(93)90033-3}, doi = {10.1016/0925-7721(93)90033-3}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/KleinMM93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/ClarksonMS93, author = {Kenneth L. Clarkson and Kurt Mehlhorn and Raimund Seidel}, title = {Four Results on Randomized Incremental Constructions}, journal = {Comput. Geom.}, volume = {3}, pages = {185--212}, year = {1993}, url = {https://doi.org/10.1016/0925-7721(93)90009-U}, doi = {10.1016/0925-7721(93)90009-U}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/ClarksonMS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/MehlhornSW93, author = {Kurt Mehlhorn and Micha Sharir and Emo Welzl}, title = {Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection}, journal = {Comput. Geom.}, volume = {3}, pages = {235--246}, year = {1993}, url = {https://doi.org/10.1016/0925-7721(93)90011-T}, doi = {10.1016/0925-7721(93)90011-T}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/MehlhornSW93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/MehlhornT93, author = {Kurt Mehlhorn and Athanasios K. Tsakalidis}, title = {Dynamic Interpolation Search}, journal = {J. {ACM}}, volume = {40}, number = {3}, pages = {621--634}, year = {1993}, url = {https://doi.org/10.1145/174130.174139}, doi = {10.1145/174130.174139}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/MehlhornT93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/MehlhornCT93, author = {Kurt Mehlhorn and Volker Claus and Wolfgang Thomas}, editor = {Reinhard Wilhelm}, title = {Komplexit{\"{a}}tstheorie und Algorithmik}, booktitle = {Informatik: Grundlagen - Amwendungen - Perspektiven [Forum "Perspektiven der Informatik", Dagstuhl, November 1993]}, pages = {113--116}, publisher = {Verlag C. H. Beck}, year = {1993}, timestamp = {Wed, 10 Jul 2002 11:30:54 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/MehlhornCT93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/DubhashiMRT93, author = {Devdatt P. Dubhashi and Kurt Mehlhorn and Desh Ranjan and Christian Thiel}, editor = {R. K. Shyamasundar}, title = {Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets}, booktitle = {Foundations of Software Technology and Theoretical Computer Science, 13th Conference, Bombay, India, December 15-17, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {761}, pages = {436--443}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57529-4\_75}, doi = {10.1007/3-540-57529-4\_75}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/DubhashiMRT93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/HagerupMM93, author = {Torben Hagerup and Kurt Mehlhorn and J. Ian Munro}, editor = {Andrzej Lingas and Rolf G. Karlsson and Svante Carlsson}, title = {Maintaining Discrete Probability Distributions Optimally}, booktitle = {Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {700}, pages = {253--264}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-56939-1\_77}, doi = {10.1007/3-540-56939-1\_77}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/HagerupMM93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DietzMRU93, author = {Paul F. Dietz and Kurt Mehlhorn and Rajeev Raman and Christian Uhrig}, editor = {Vijaya Ramachandran}, title = {Lower Bounds for Set Intersection Queries}, booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas, {USA}}, pages = {194--201}, publisher = {{ACM/SIAM}}, year = {1993}, url = {http://dl.acm.org/citation.cfm?id=313559.313686}, timestamp = {Thu, 05 Jul 2018 07:29:11 +0200}, biburl = {https://dblp.org/rec/conf/soda/DietzMRU93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KuceraMPS93, author = {Ludek Kucera and Kurt Mehlhorn and B. Preis and Erik Schwarzenecker}, editor = {Patrice Enjalbert and Alain Finkel and Klaus W. Wagner}, title = {Exact Algorithms for a Geometric Packing Problem (Extended Abstract)}, booktitle = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {665}, pages = {317--322}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-56503-5\_32}, doi = {10.1007/3-540-56503-5\_32}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/KuceraMPS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/DobrindtMY93, author = {Katrin Dobrindt and Kurt Mehlhorn and Mariette Yvinec}, editor = {Frank K. H. A. Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Nicola Santoro and Sue Whitesides}, title = {A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron}, booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al, Canada, August 11-13, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {709}, pages = {314--324}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57155-8\_258}, doi = {10.1007/3-540-57155-8\_258}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/wads/DobrindtMY93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FleischerMRWY92, author = {Rudolf Fleischer and Kurt Mehlhorn and G{\"{u}}nter Rote and Emo Welzl and Chee{-}Keng Yap}, title = {Simultaneous Inner and Outer Approximation of Shapes}, journal = {Algorithmica}, volume = {8}, number = {5{\&}6}, pages = {365--389}, year = {1992}, url = {https://doi.org/10.1007/BF01758852}, doi = {10.1007/BF01758852}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/FleischerMRWY92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/AltFKMNSU92, author = {Helmut Alt and Rudolf Fleischer and Michael Kaufmann and Kurt Mehlhorn and Stefan N{\"{a}}her and Stefan Schirra and Christian Uhrig}, title = {Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures}, journal = {Algorithmica}, volume = {8}, number = {5{\&}6}, pages = {391--406}, year = {1992}, url = {https://doi.org/10.1007/BF01758853}, doi = {10.1007/BF01758853}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/AltFKMNSU92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/MehlhornPU92, author = {Kurt Mehlhorn and Wolfgang J. Paul and Christian Uhrig}, title = {k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs}, journal = {Inf. Comput.}, volume = {101}, number = {1}, pages = {123--129}, year = {1992}, url = {https://doi.org/10.1016/0890-5401(92)90078-T}, doi = {10.1016/0890-5401(92)90078-T}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/MehlhornPU92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AltGM92, author = {Helmut Alt and Viliam Geffert and Kurt Mehlhorn}, title = {A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition}, journal = {Inf. Process. Lett.}, volume = {42}, number = {1}, pages = {25--27}, year = {1992}, url = {https://doi.org/10.1016/0020-0190(92)90127-H}, doi = {10.1016/0020-0190(92)90127-H}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AltGM92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KaufmannM92, author = {Michael Kaufmann and Kurt Mehlhorn}, title = {On local routing of two-terminal nets}, journal = {J. Comb. Theory, Ser. {B}}, volume = {55}, number = {1}, pages = {33--72}, year = {1992}, url = {https://doi.org/10.1016/0095-8956(92)90031-R}, doi = {10.1016/0095-8956(92)90031-R}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/KaufmannM92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dfg/FleischerFMMNRSSTU92, author = {Rudolf Fleischer and Otfried Fries and Kurt Mehlhorn and Stefan Meiser and Stefan N{\"{a}}her and Hans Rohnert and Stefan Schirra and Klaus Simon and Athanasios K. Tsakalidis and Christian Uhrig}, editor = {Burkhard Monien and Thomas Ottmann}, title = {Selected Topics from Computational Geometry, Data Structures and Motion Planning}, booktitle = {Data Structures and Efficient Algorithms, Final Report on the {DFG} Special Joint Initiative}, series = {Lecture Notes in Computer Science}, volume = {594}, pages = {25--43}, publisher = {Springer}, year = {1992}, url = {https://doi.org/10.1007/3-540-55488-2\_20}, doi = {10.1007/3-540-55488-2\_20}, timestamp = {Fri, 17 Jul 2020 16:12:47 +0200}, biburl = {https://dblp.org/rec/conf/dfg/FleischerFMMNRSSTU92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/Mehlhorn92, author = {Kurt Mehlhorn}, editor = {R. K. Shyamasundar}, title = {Recent Developments in Algorithms for the Maximum-Flow Problem (Abstract)}, booktitle = {Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18-20, 1992, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {652}, pages = {404}, publisher = {Springer}, year = {1992}, url = {https://doi.org/10.1007/3-540-56287-7\_122}, doi = {10.1007/3-540-56287-7\_122}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/Mehlhorn92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ifip/MehlhornN92, author = {Kurt Mehlhorn and Stefan N{\"{a}}her}, editor = {Jan van Leeuwen}, title = {Algorithm Design and Software Libraries: Recent Developments in the {LEDA} Project}, booktitle = {Algorithms, Software, Architecture - Information Processing '92, Volume 1, Proceedings of the {IFIP} 12th World Computer Congress, Madrid, Spain, 7-11 September 1992}, series = {{IFIP} Transactions}, volume = {{A-12}}, pages = {493--505}, publisher = {North-Holland}, year = {1992}, timestamp = {Wed, 14 Aug 2002 08:51:19 +0200}, biburl = {https://dblp.org/rec/conf/ifip/MehlhornN92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/MehlhornSW92, author = {Kurt Mehlhorn and Micha Sharir and Emo Welzl}, editor = {Greg N. Frederickson}, title = {Tail Estimates for the Space Complexity of Randomized Incremental Algorithms}, booktitle = {Proceedings of the Third Annual {ACM/SIGACT-SIAM} Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, {USA}}, pages = {89--93}, publisher = {{ACM/SIAM}}, year = {1992}, url = {http://dl.acm.org/citation.cfm?id=139404.139423}, timestamp = {Thu, 05 Jul 2018 07:29:02 +0200}, biburl = {https://dblp.org/rec/conf/soda/MehlhornSW92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BaumgartenJM92, author = {Hanna Baumgarten and Hermann Jung and Kurt Mehlhorn}, editor = {Greg N. Frederickson}, title = {Dynamic Point Location in General Subdivisions}, booktitle = {Proceedings of the Third Annual {ACM/SIGACT-SIAM} Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, {USA}}, pages = {250--258}, publisher = {{ACM/SIAM}}, year = {1992}, url = {http://dl.acm.org/citation.cfm?id=139404.139458}, timestamp = {Fri, 22 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BaumgartenJM92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ClarksonMS92, author = {Kenneth L. Clarkson and Kurt Mehlhorn and Raimund Seidel}, editor = {Alain Finkel and Matthias Jantzen}, title = {Four Results on Randomized Incremental Constructions}, booktitle = {{STACS} 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {577}, pages = {463--474}, publisher = {Springer}, year = {1992}, url = {https://doi.org/10.1007/3-540-55210-3\_205}, doi = {10.1007/3-540-55210-3\_205}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ClarksonMS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/sp/92/KleinMM92, author = {Rolf Klein and Kurt Mehlhorn and Stefan Meiser}, editor = {Johannes Buchmann and Harald Ganzinger and Wolfgang J. Paul}, title = {Randomized Incremental Construction of Abstract Voronoi Diagrams}, booktitle = {Informatik, Festschrift zum 60. Geburtstag von G{\"{u}}nter Hotz}, series = {Teubner-Texte zur Informatik}, volume = {1}, pages = {283--308}, publisher = {Teubner / Springer}, year = {1992}, url = {https://doi.org/10.1007/978-3-322-95233-2\_17}, doi = {10.1007/978-3-322-95233-2\_17}, timestamp = {Tue, 16 Jul 2019 08:16:16 +0200}, biburl = {https://dblp.org/rec/books/sp/92/KleinMM92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/MehlhornMO91, author = {Kurt Mehlhorn and Stefan Meiser and Colm {\'{O}}'D{\'{u}}nlaing}, title = {On the Construction of Abstract Voronoi Diagrams}, journal = {Discret. Comput. Geom.}, volume = {6}, pages = {211--224}, year = {1991}, url = {https://doi.org/10.1007/BF02574686}, doi = {10.1007/BF02574686}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/MehlhornMO91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AltBMP91, author = {Helmut Alt and Norbert Blum and Kurt Mehlhorn and Markus Paul}, title = {Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O({\^{}}1.5 sqrt m/log n)}, journal = {Inf. Process. Lett.}, volume = {37}, number = {4}, pages = {237--240}, year = {1991}, url = {https://doi.org/10.1016/0020-0190(91)90195-N}, doi = {10.1016/0020-0190(91)90195-N}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/AltBMP91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MehlhornY91, author = {Kurt Mehlhorn and Chee{-}Keng Yap}, title = {Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves}, journal = {{SIAM} J. Comput.}, volume = {20}, number = {4}, pages = {603--621}, year = {1991}, url = {https://doi.org/10.1137/0220038}, doi = {10.1137/0220038}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/MehlhornY91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/MehlhornN90, author = {Kurt Mehlhorn and Stefan N{\"{a}}her}, title = {Dynamic Fractional Cascading}, journal = {Algorithmica}, volume = {5}, number = {2}, pages = {215--241}, year = {1990}, url = {https://doi.org/10.1007/BF01840386}, doi = {10.1007/BF01840386}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/MehlhornN90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChingMS90, author = {Yu{-}Tai Ching and Kurt Mehlhorn and Michiel H. M. Smid}, title = {Dynamic Deferred Data Structuring}, journal = {Inf. Process. Lett.}, volume = {35}, number = {1}, pages = {37--40}, year = {1990}, url = {https://doi.org/10.1016/0020-0190(90)90171-S}, doi = {10.1016/0020-0190(90)90171-S}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChingMS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MehlhornNU90, author = {Kurt Mehlhorn and Stefan N{\"{a}}her and Christian Uhrig}, title = {Hidden Line Elimination for Isooriented Rectangels}, journal = {Inf. Process. Lett.}, volume = {35}, number = {3}, pages = {137--143}, year = {1990}, url = {https://doi.org/10.1016/0020-0190(90)90062-3}, doi = {10.1016/0020-0190(90)90062-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MehlhornNU90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MehlhornN90, author = {Kurt Mehlhorn and Stefan N{\"{a}}her}, title = {Bounded Ordered Dictionaries in O(log log {N)} Time and O(n) Space}, journal = {Inf. Process. Lett.}, volume = {35}, number = {4}, pages = {183--189}, year = {1990}, url = {https://doi.org/10.1016/0020-0190(90)90022-P}, doi = {10.1016/0020-0190(90)90022-P}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/MehlhornN90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/AhujaMOT90, author = {Ravindra K. Ahuja and Kurt Mehlhorn and James B. Orlin and Robert Endre Tarjan}, title = {Faster Algorithms for the Shortest Path Problem}, journal = {J. {ACM}}, volume = {37}, number = {2}, pages = {213--223}, year = {1990}, url = {https://doi.org/10.1145/77600.77615}, doi = {10.1145/77600.77615}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/AhujaMOT90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MehlhornNR90, author = {Kurt Mehlhorn and Stefan N{\"{a}}her and Monika Rauch}, title = {On the Complexity of a Game Related to the Dictionary Problem}, journal = {{SIAM} J. Comput.}, volume = {19}, number = {5}, pages = {902--906}, year = {1990}, url = {https://doi.org/10.1137/0219062}, doi = {10.1137/0219062}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/MehlhornNR90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcad/MehlhornN90, author = {Kurt Mehlhorn and Stefan N{\"{a}}her}, title = {A faster compaction algorithm with automatic jog insertion}, journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.}, volume = {9}, number = {2}, pages = {158--166}, year = {1990}, url = {https://doi.org/10.1109/43.46782}, doi = {10.1109/43.46782}, timestamp = {Thu, 24 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcad/MehlhornN90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcad/MehlhornR90, author = {Kurt Mehlhorn and Wolfgang R{\"{u}}lling}, title = {Compaction on the torus {[VLSI} layout]}, journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.}, volume = {9}, number = {4}, pages = {389--397}, year = {1990}, url = {https://doi.org/10.1109/43.45870}, doi = {10.1109/43.45870}, timestamp = {Thu, 24 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcad/MehlhornR90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/FleischerMRWY90, author = {Rudolf Fleischer and Kurt Mehlhorn and G{\"{u}}nter Rote and Emo Welzl and Chee{-}Keng Yap}, editor = {Raimund Seidel}, title = {On Simultaneous Inner and Outer Approximation of Shapes}, booktitle = {Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990}, pages = {216--224}, publisher = {{ACM}}, year = {1990}, url = {https://doi.org/10.1145/98524.98572}, doi = {10.1145/98524.98572}, timestamp = {Mon, 14 Jun 2021 16:24:54 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/FleischerMRWY90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/AltFKMNSU90, author = {Helmut Alt and Rudolf Fleischer and Michael Kaufmann and Kurt Mehlhorn and Stefan N{\"{a}}her and Stefan Schirra and Christian Uhrig}, editor = {Raimund Seidel}, title = {Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures}, booktitle = {Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990}, pages = {281--289}, publisher = {{ACM}}, year = {1990}, url = {https://doi.org/10.1145/98524.98592}, doi = {10.1145/98524.98592}, timestamp = {Mon, 14 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/AltFKMNSU90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gi/NaherM90, author = {Stefan N{\"{a}}her and Kurt Mehlhorn}, editor = {Andreas Reuter}, title = {{LEDA} - {A} Library of Efficient Data Types and Algorithms}, booktitle = {{GI} - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, Stuttgart, 8.-12. Oktober 1990, Proceedings}, series = {Informatik-Fachberichte}, volume = {257}, pages = {35--39}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/978-3-642-76118-8\_3}, doi = {10.1007/978-3-642-76118-8\_3}, timestamp = {Tue, 23 May 2017 01:10:32 +0200}, biburl = {https://dblp.org/rec/conf/gi/NaherM90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/NaherM90, author = {Stefan N{\"{a}}her and Kurt Mehlhorn}, editor = {Mike Paterson}, title = {{LEDA:} {A} Library of Efficient Data Types and Algorithms}, booktitle = {Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {443}, pages = {1--5}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/BFb0032017}, doi = {10.1007/BFB0032017}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/NaherM90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CheriyanHM90, author = {Joseph Cheriyan and Torben Hagerup and Kurt Mehlhorn}, editor = {Mike Paterson}, title = {Can {A} Maximum Flow be Computed on o(nm) Time?}, booktitle = {Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {443}, pages = {235--248}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/BFb0032035}, doi = {10.1007/BFB0032035}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/CheriyanHM90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigal/KleinMM90, author = {Rolf Klein and Kurt Mehlhorn and Stefan Meiser}, editor = {Tetsuo Asano and Toshihide Ibaraki and Hiroshi Imai and Takao Nishizeki}, title = {On the Construction of Abstract Voronoi Diagrams, {II}}, booktitle = {Algorithms, International Symposium {SIGAL} '90, Tokyo, Japan, August 16-18, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {450}, pages = {138--154}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/3-540-52921-7\_63}, doi = {10.1007/3-540-52921-7\_63}, timestamp = {Fri, 17 Jul 2020 16:12:48 +0200}, biburl = {https://dblp.org/rec/conf/sigal/KleinMM90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/MehlhornMO90, author = {Kurt Mehlhorn and Stefan Meiser and Colm {\'{O}}'D{\'{u}}nlaing}, editor = {Christian Choffrut and Thomas Lengauer}, title = {On the Construction of Abstract Voronoi Diagrams}, booktitle = {{STACS} 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {415}, pages = {227--239}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/3-540-52282-4\_46}, doi = {10.1007/3-540-52282-4\_46}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/MehlhornMO90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/FleischerJM90, author = {Rudolf Fleischer and Hermann Jung and Kurt Mehlhorn}, editor = {Jan van Leeuwen and Nicola Santoro}, title = {A Time-Randomness Tradeoff for Communication Complexity}, booktitle = {Distributed Algorithms, 4th International Workshop, {WDAG} '90, Bari, Italy, September 24-26, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {486}, pages = {390--401}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/3-540-54099-7\_26}, doi = {10.1007/3-540-54099-7\_26}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/wdag/FleischerJM90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/el/leeuwen90/MehlhornT90, author = {Kurt Mehlhorn and Athanasios K. Tsakalidis}, editor = {Jan van Leeuwen}, title = {Data Structures}, booktitle = {Handbook of Theoretical Computer Science, Volume {A:} Algorithms and Complexity}, pages = {301--342}, publisher = {Elsevier and {MIT} Press}, year = {1990}, timestamp = {Sat, 03 Aug 2019 19:26:43 +0200}, biburl = {https://dblp.org/rec/books/el/leeuwen90/MehlhornT90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/wi/LoeckxMW89, author = {Jacques Loeckx and Kurt Mehlhorn and Reinhard Wilhelm}, title = {Foundations of Programming Languages}, publisher = {John Wiley}, year = {1989}, url = {http://www.mpi-sb.mpg.de/\%7Emehlhorn/ProgLangBooks.html}, isbn = {0-471-92139-4}, timestamp = {Thu, 31 Oct 2002 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/wi/LoeckxMW89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tc/FurerM89, author = {Martin F{\"{u}}rer and Kurt Mehlhorn}, title = {AT{\({^2}\)}-Optimal Galois Field Multiplier for {VLSI}}, journal = {{IEEE} Trans. Computers}, volume = {38}, number = {9}, pages = {1333--1336}, year = {1989}, url = {https://doi.org/10.1109/12.29475}, doi = {10.1109/12.29475}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tc/FurerM89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/MehlhornNR89, author = {Kurt Mehlhorn and Stefan N{\"{a}}her and Monika Rauch}, title = {On the Complexity of a Game Related to the Dictionary Problem}, booktitle = {30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989}, pages = {546--548}, publisher = {{IEEE} Computer Society}, year = {1989}, url = {https://doi.org/10.1109/SFCS.1989.63532}, doi = {10.1109/SFCS.1989.63532}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/MehlhornNR89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MehlhornP89, author = {Kurt Mehlhorn and Wolfgang J. Paul}, editor = {Giorgio Ausiello and Mariangiola Dezani{-}Ciancaglini and Simona Ronchi Della Rocca}, title = {Two Versus One Index Register and Modifiable Versus Non-modifiable Programs}, booktitle = {Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {372}, pages = {603--609}, publisher = {Springer}, year = {1989}, url = {https://doi.org/10.1007/BFb0035786}, doi = {10.1007/BFB0035786}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MehlhornP89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/MehlhornN89, author = {Kurt Mehlhorn and Stefan N{\"{a}}her}, editor = {Antoni Kreczmar and Grazyna Mirkowska}, title = {{LEDA:} {A} Library of Efficient Data Types and Algorithms}, booktitle = {Mathematical Foundations of Computer Science 1989, MFCS'89, Porabka-Kozubnik, Poland, August 28 - September 1, 1989, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {379}, pages = {88--106}, publisher = {Springer}, year = {1989}, url = {https://doi.org/10.1007/3-540-51486-4\_58}, doi = {10.1007/3-540-51486-4\_58}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/MehlhornN89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/compgeom/1989, editor = {Kurt Mehlhorn}, title = {Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbr{\"{u}}cken, Germany, June 5-7, 1989}, publisher = {{ACM}}, year = {1989}, url = {https://doi.org/10.1145/73833}, doi = {10.1145/73833}, isbn = {0-89791-318-3}, timestamp = {Mon, 14 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/1989.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/AltMWW88, author = {Helmut Alt and Kurt Mehlhorn and Hubert Wagener and Emo Welzl}, title = {Congruence, Similarity, and Symmetries of Geometric Objects}, journal = {Discret. Comput. Geom.}, volume = {3}, pages = {237--256}, year = {1988}, url = {https://doi.org/10.1007/BF02187910}, doi = {10.1007/BF02187910}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/AltMWW88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Mehlhorn88, author = {Kurt Mehlhorn}, title = {A Faster Approximation Algorithm for the Steiner Problem in Graphs}, journal = {Inf. Process. Lett.}, volume = {27}, number = {3}, pages = {125--128}, year = {1988}, url = {https://doi.org/10.1016/0020-0190(88)90066-X}, doi = {10.1016/0020-0190(88)90066-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Mehlhorn88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/JungM88, author = {Hermann Jung and Kurt Mehlhorn}, title = {Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees}, journal = {Inf. Process. Lett.}, volume = {27}, number = {5}, pages = {227--236}, year = {1988}, url = {https://doi.org/10.1016/0020-0190(88)90084-1}, doi = {10.1016/0020-0190(88)90084-1}, timestamp = {Fri, 22 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/JungM88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MehlhornNA88, author = {Kurt Mehlhorn and Stefan N{\"{a}}her and Helmut Alt}, title = {A Lower Bound on the Complexity of the Union-Split-Find Problem}, journal = {{SIAM} J. Comput.}, volume = {17}, number = {6}, pages = {1093--1102}, year = {1988}, url = {https://doi.org/10.1137/0217070}, doi = {10.1137/0217070}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/MehlhornNA88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/awoc/MehlhornR88, author = {Kurt Mehlhorn and Wolfgang R{\"{u}}lling}, editor = {John H. Reif}, title = {Compaction on the Torus}, booktitle = {{VLSI} Algorithms and Architectures, 3rd Aegean Workshop on Computing, {AWOC} 88, Corfu, Greece, June 28 - July 1, 1988, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {319}, pages = {212--225}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/BFb0040389}, doi = {10.1007/BFB0040389}, timestamp = {Tue, 14 May 2019 10:00:47 +0200}, biburl = {https://dblp.org/rec/conf/awoc/MehlhornR88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cga/GaoKMRSJ88, author = {Shaodi Gao and Michael Kaufmann and Kurt Mehlhorn and Wolfgang R{\"{u}}lling and Christoph Storb and Mark Jerrum}, editor = {Hartmut Noltemeier}, title = {On Continuous Homotopic One Layer Routing}, booktitle = {Computational Geometry and its Applications, CG'88, International Workshop on Computational Geometry, W{\"{u}}rzburg, Germany, March 24-25, 1988}, series = {Lecture Notes in Computer Science}, volume = {333}, pages = {55--70}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/3-540-50335-8\_24}, doi = {10.1007/3-540-50335-8\_24}, timestamp = {Fri, 17 Jul 2020 16:12:48 +0200}, biburl = {https://dblp.org/rec/conf/cga/GaoKMRSJ88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/GaoJKMR89, author = {Shaodi Gao and Mark Jerrum and Michael Kaufmann and Kurt Mehlhorn and Wolfgang R{\"{u}}lling}, editor = {Herbert Edelsbrunner}, title = {On Continuous Homotopic One Layer Routing}, booktitle = {Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988}, pages = {392--402}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/73393.73433}, doi = {10.1145/73393.73433}, timestamp = {Mon, 14 Jun 2021 16:25:17 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/GaoJKMR89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DietzfelbingerKMHRT88, author = {Martin Dietzfelbinger and Anna R. Karlin and Kurt Mehlhorn and Friedhelm Meyer auf der Heide and Hans Rohnert and Robert Endre Tarjan}, title = {Dynamic Perfect Hashing: Upper and Lower Bounds}, booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988}, pages = {524--531}, publisher = {{IEEE} Computer Society}, year = {1988}, url = {https://doi.org/10.1109/SFCS.1988.21968}, doi = {10.1109/SFCS.1988.21968}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DietzfelbingerKMHRT88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gi/MehlhornZ88, author = {Kurt Mehlhorn and Gerhard Zimmermann}, editor = {R{\"{u}}diger Valk}, title = {{SFB} 124: VLSI-Entwurfsmethoden und Parallelit{\"{a}}t}, booktitle = {{GI} - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, Hamburg, 17.-19. Oktober 1988, Proceedings}, series = {Informatik-Fachberichte}, volume = {188}, pages = {3--29}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/978-3-642-74135-7\_1}, doi = {10.1007/978-3-642-74135-7\_1}, timestamp = {Tue, 23 May 2017 01:10:32 +0200}, biburl = {https://dblp.org/rec/conf/gi/MehlhornZ88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MehlhornY88, author = {Kurt Mehlhorn and Chee{-}Keng Yap}, editor = {Timo Lepist{\"{o}} and Arto Salomaa}, title = {Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves}, booktitle = {Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {317}, pages = {410--423}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/3-540-19488-6\_131}, doi = {10.1007/3-540-19488-6\_131}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MehlhornY88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/DietzfelbingerMHR88, author = {Martin Dietzfelbinger and Kurt Mehlhorn and Friedhelm Meyer auf der Heide and Hans Rohnert}, editor = {Rolf G. Karlsson and Andrzej Lingas}, title = {Upper and Lower Bounds for the Dictionary Problem (Abstract)}, booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {318}, pages = {214--215}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/3-540-19487-8\_24}, doi = {10.1007/3-540-19487-8\_24}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/swat/DietzfelbingerMHR88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/MehlhornP87, author = {Kurt Mehlhorn and Franco P. Preparata}, title = {Area-Time Optimal Division for T=Omega((log n){\^{}}1+ epsilon)}, journal = {Inf. Comput.}, volume = {72}, number = {3}, pages = {270--282}, year = {1987}, url = {https://doi.org/10.1016/0890-5401(87)90034-4}, doi = {10.1016/0890-5401(87)90034-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/MehlhornP87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FriesMNT87, author = {Otfried Fries and Kurt Mehlhorn and Stefan N{\"{a}}her and Athanasios K. Tsakalidis}, title = {A log log n Data Structure for Three-Sided Range Queries}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {269--273}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90174-8}, doi = {10.1016/0020-0190(87)90174-8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FriesMNT87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AltHMP87, author = {Helmut Alt and Torben Hagerup and Kurt Mehlhorn and Franco P. Preparata}, title = {Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {5}, pages = {808--835}, year = {1987}, url = {https://doi.org/10.1137/0216053}, doi = {10.1137/0216053}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AltHMP87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/AltMWW87, author = {Helmut Alt and Kurt Mehlhorn and Hubert Wagener and Emo Welzl}, editor = {D. Soule}, title = {Congruence, Similarity, and Symmetries of Geometric Objects}, booktitle = {Proceedings of the Third Annual Symposium on Computational Geometry, Waterloo, Ontario, Canada, June 8-10, 1987}, pages = {308--315}, publisher = {{ACM}}, year = {1987}, url = {https://doi.org/10.1145/41958.41991}, doi = {10.1145/41958.41991}, timestamp = {Mon, 14 Jun 2021 16:25:05 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/AltMWW87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MehlhornNA87, author = {Kurt Mehlhorn and Stefan N{\"{a}}her and Helmut Alt}, editor = {Thomas Ottmann}, title = {A Lower Bound for the Complexity of the Union-Split-Find Problem}, booktitle = {Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {267}, pages = {479--488}, publisher = {Springer}, year = {1987}, url = {https://doi.org/10.1007/3-540-18088-5\_41}, doi = {10.1007/3-540-18088-5\_41}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MehlhornNA87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/paa/AltHMP87, author = {Helmut Alt and Torben Hagerup and Kurt Mehlhorn and Franco P. Preparata}, editor = {Andreas Alexander Albrecht and Hermann Jung and Kurt Mehlhorn}, title = {Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones}, booktitle = {Parallel Algorithms and Architectures, International Workshop, Suhl, GDR, May 25-30, 1987, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {269}, pages = {11--15}, publisher = {Springer}, year = {1987}, url = {https://doi.org/10.1007/3-540-18099-0\_24}, doi = {10.1007/3-540-18099-0\_24}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/conf/paa/AltHMP87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KaufmannM87, author = {Michael Kaufmann and Kurt Mehlhorn}, editor = {Franz{-}Josef Brandenburg and Guy Vidal{-}Naquet and Martin Wirsing}, title = {On Local Routing of Two-Terminal Nets}, booktitle = {{STACS} 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {247}, pages = {40--52}, publisher = {Springer}, year = {1987}, url = {https://doi.org/10.1007/BFb0039593}, doi = {10.1007/BFB0039593}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/KaufmannM87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/paa/1987, editor = {Andreas Alexander Albrecht and Hermann Jung and Kurt Mehlhorn}, title = {Parallel Algorithms and Architectures, International Workshop, Suhl, GDR, May 25-30, 1987, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {269}, publisher = {Springer}, year = {1987}, url = {https://doi.org/10.1007/3-540-18099-0}, doi = {10.1007/3-540-18099-0}, isbn = {3-540-18099-0}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/paa/1987.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/teu/LoeckxMW86, author = {Jacques Loeckx and Kurt Mehlhorn and Reinhard Wilhelm}, title = {Grundlagen der Programmiersprachen}, publisher = {Teubner}, year = {1986}, url = {http://www.mpi-sb.mpg.de/\%7Emehlhorn/ProgLangBooks.html}, isbn = {3-519-02254-0}, timestamp = {Thu, 31 Oct 2002 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/teu/LoeckxMW86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/BeckerM86, author = {Michael Becker and Kurt Mehlhorn}, title = {Algorithms for Routing in Planar Graphs}, journal = {Acta Informatica}, volume = {23}, number = {2}, pages = {163--176}, year = {1986}, url = {https://doi.org/10.1007/BF00289496}, doi = {10.1007/BF00289496}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/BeckerM86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/MehlhornPS86, author = {Kurt Mehlhorn and Franco P. Preparata and Majid Sarrafzadeh}, title = {Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs}, journal = {Algorithmica}, volume = {1}, number = {2}, pages = {213--221}, year = {1986}, url = {https://doi.org/10.1007/BF01840443}, doi = {10.1007/BF01840443}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/MehlhornPS86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MehlhornS86, author = {Kurt Mehlhorn and Bernd H. Schmidt}, title = {On BF-orderable graphs}, journal = {Discret. Appl. Math.}, volume = {15}, number = {2-3}, pages = {315--327}, year = {1986}, url = {https://doi.org/10.1016/0166-218X(86)90051-X}, doi = {10.1016/0166-218X(86)90051-X}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/MehlhornS86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/HoffmanMRT86, author = {Kurt Hoffman and Kurt Mehlhorn and Pierre Rosenstiehl and Robert Endre Tarjan}, title = {Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees}, journal = {Inf. Control.}, volume = {68}, number = {1-3}, pages = {170--184}, year = {1986}, url = {https://doi.org/10.1016/S0019-9958(86)80033-X}, doi = {10.1016/S0019-9958(86)80033-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/HoffmanMRT86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/insk/Mehlhorn86, author = {Kurt Mehlhorn}, title = {{\"{U}}ber Verdrahtungsalgorithmen}, journal = {Inform. Spektrum}, volume = {9}, number = {4}, pages = {227--234}, year = {1986}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/insk/Mehlhorn86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/MehlhornP86, author = {Kurt Mehlhorn and Franco P. Preparata}, title = {Routing through a rectangle}, journal = {J. {ACM}}, volume = {33}, number = {1}, pages = {60--85}, year = {1986}, url = {https://doi.org/10.1145/4904.4994}, doi = {10.1145/4904.4994}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/MehlhornP86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/KaufmannM86, author = {Michael Kaufmann and Kurt Mehlhorn}, title = {Routing Through a Generalized Switchbox}, journal = {J. Algorithms}, volume = {7}, number = {4}, pages = {510--531}, year = {1986}, url = {https://doi.org/10.1016/0196-6774(86)90016-7}, doi = {10.1016/0196-6774(86)90016-7}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/KaufmannM86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MehlhornT86, author = {Kurt Mehlhorn and Athanasios K. Tsakalidis}, title = {An Amortized Analysis of Insertions into AVL-Trees}, journal = {{SIAM} J. Comput.}, volume = {15}, number = {1}, pages = {22--33}, year = {1986}, url = {https://doi.org/10.1137/0215002}, doi = {10.1137/0215002}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/MehlhornT86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/awoc/FurerM86, author = {Martin F{\"{u}}rer and Kurt Mehlhorn}, editor = {Fillia Makedon and Kurt Mehlhorn and Theodore S. Papatheodorou and Paul G. Spirakis}, title = {AT\({}^{\mbox{2}}\)-Optimal Galois Field Multiplier for {VLSI}}, booktitle = {{VLSI} Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {227}, pages = {217--225}, publisher = {Springer}, year = {1986}, url = {https://doi.org/10.1007/3-540-16766-8\_19}, doi = {10.1007/3-540-16766-8\_19}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/awoc/FurerM86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/AltHMP86, author = {Helmut Alt and Torben Hagerup and Kurt Mehlhorn and Franco P. Preparata}, editor = {Jozef Gruska and Branislav Rovan and Juraj Wiedermann}, title = {Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones}, booktitle = {Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {233}, pages = {199--208}, publisher = {Springer}, year = {1986}, url = {https://doi.org/10.1007/BFb0016243}, doi = {10.1007/BFB0016243}, timestamp = {Sat, 30 Sep 2023 09:52:35 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/AltHMP86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/MehlhornP86, author = {Kurt Mehlhorn and Franco P. Preparata}, editor = {Burkhard Monien and Guy Vidal{-}Naquet}, title = {Area-time Optimal Division for T=Omega(log n)\({}^{\mbox{1+epsilon}}\)}, booktitle = {{STACS} 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {210}, pages = {341--352}, publisher = {Springer}, year = {1986}, url = {https://doi.org/10.1007/3-540-16078-7\_88}, doi = {10.1007/3-540-16078-7\_88}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/MehlhornP86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/awoc/1986, editor = {Fillia Makedon and Kurt Mehlhorn and Theodore S. Papatheodorou and Paul G. Spirakis}, title = {{VLSI} Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {227}, publisher = {Springer}, year = {1986}, url = {https://doi.org/10.1007/3-540-16766-8}, doi = {10.1007/3-540-16766-8}, isbn = {3-540-16766-8}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/awoc/1986.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/HertelM85, author = {Stefan Hertel and Kurt Mehlhorn}, title = {Fast Triangulation of the Plane with Respect to Simple Polygons}, journal = {Inf. Control.}, volume = {64}, number = {1-3}, pages = {52--76}, year = {1985}, url = {https://doi.org/10.1016/S0019-9958(85)80044-9}, doi = {10.1016/S0019-9958(85)80044-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/HertelM85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MannilaM85, author = {Heikki Mannila and Kurt Mehlhorn}, title = {A Fast Algorithm for Renaming a Set of Clauses as a Horn Set}, journal = {Inf. Process. Lett.}, volume = {21}, number = {5}, pages = {269--272}, year = {1985}, url = {https://doi.org/10.1016/0020-0190(85)90096-1}, doi = {10.1016/0020-0190(85)90096-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MannilaM85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AltM85, author = {Helmut Alt and Kurt Mehlhorn}, title = {Searching Semisorted Tables}, journal = {{SIAM} J. Comput.}, volume = {14}, number = {4}, pages = {840--848}, year = {1985}, url = {https://doi.org/10.1137/0214059}, doi = {10.1137/0214059}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AltM85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/FriesMN85, author = {Otfried Fries and Kurt Mehlhorn and Stefan N{\"{a}}her}, editor = {Joseph O'Rourke}, title = {Dynamization of geometric data structures}, booktitle = {Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, June 5-7, 1985}, pages = {168--176}, publisher = {{ACM}}, year = {1985}, url = {https://doi.org/10.1145/323233.323256}, doi = {10.1145/323233.323256}, timestamp = {Wed, 16 Jun 2021 12:03:34 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/FriesMN85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/HoffmanMRT85, author = {Kurt Hoffman and Kurt Mehlhorn and Pierre Rosenstiehl and Robert Endre Tarjan}, editor = {Joseph O'Rourke}, title = {Sorting Jordan sequences in linear time}, booktitle = {Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, June 5-7, 1985}, pages = {196--203}, publisher = {{ACM}}, year = {1985}, url = {https://doi.org/10.1145/323233.323259}, doi = {10.1145/323233.323259}, timestamp = {Wed, 16 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/HoffmanMRT85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/MehlhornS85, author = {Kurt Mehlhorn and Klaus Simon}, editor = {Lothar Budach}, title = {Intersecting two polyhedra one of which is convex}, booktitle = {Fundamentals of Computation Theory, {FCT} '85, Cottbus, GDR, September 9-13, 1985}, series = {Lecture Notes in Computer Science}, volume = {199}, pages = {534--542}, publisher = {Springer}, year = {1985}, url = {https://doi.org/10.1007/BFb0028837}, doi = {10.1007/BFB0028837}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/MehlhornS85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KaufmannM85, author = {Michael Kaufmann and Kurt Mehlhorn}, editor = {Wilfried Brauer}, title = {Routing Through a Generalized Switchbox}, booktitle = {Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {194}, pages = {328--337}, publisher = {Springer}, year = {1985}, url = {https://doi.org/10.1007/BFb0015758}, doi = {10.1007/BFB0015758}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KaufmannM85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MehlhornT85, author = {Kurt Mehlhorn and Athanasios K. Tsakalidis}, editor = {Wilfried Brauer}, title = {Dynamic Interpolation Search}, booktitle = {Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {194}, pages = {424--434}, publisher = {Springer}, year = {1985}, url = {https://doi.org/10.1007/BFb0015768}, doi = {10.1007/BFB0015768}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MehlhornT85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/stacs/1985, editor = {Kurt Mehlhorn}, title = {{STACS} 85, 2nd Symposium of Theoretical Aspects of Computer Science, Saarbr{\"{u}}cken, Germany, January 3-5, 1985, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {182}, publisher = {Springer}, year = {1985}, url = {https://doi.org/10.1007/BFb0023988}, doi = {10.1007/BFB0023988}, isbn = {3-540-13912-5}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/1985.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/sp/Mehlhorn84, author = {Kurt Mehlhorn}, title = {Data Structures and Algorithms 1: Sorting and Searching}, series = {{EATCS} Monographs on Theoretical Computer Science}, volume = {1}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/978-3-642-69672-5}, doi = {10.1007/978-3-642-69672-5}, isbn = {3-540-13302-X}, timestamp = {Fri, 17 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/sp/Mehlhorn84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/sp/Mehlhorn84a, author = {Kurt Mehlhorn}, title = {Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness}, series = {{EATCS} Monographs on Theoretical Computer Science}, volume = {2}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/978-3-642-69897-2}, doi = {10.1007/978-3-642-69897-2}, isbn = {3-540-13641-X}, timestamp = {Fri, 17 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/sp/Mehlhorn84a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/sp/Mehlhorn84b, author = {Kurt Mehlhorn}, title = {Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry}, series = {{EATCS} Monographs on Theoretical Computer Science}, volume = {3}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/978-3-642-69900-9}, doi = {10.1007/978-3-642-69900-9}, isbn = {3-540-13642-8}, timestamp = {Fri, 17 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/sp/Mehlhorn84b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/MehlhornV84, author = {Kurt Mehlhorn and Uzi Vishkin}, title = {Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories}, journal = {Acta Informatica}, volume = {21}, pages = {339--374}, year = {1984}, url = {https://doi.org/10.1007/BF00264615}, doi = {10.1007/BF00264615}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/MehlhornV84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/HertelMMN84, author = {Stefan Hertel and Martti M{\"{a}}ntyl{\"{a}} and Kurt Mehlhorn and J{\"{u}}rg Nievergelt}, title = {Space Sweep Solves Intersection of Convex Polyhedra}, journal = {Acta Informatica}, volume = {21}, pages = {501--519}, year = {1984}, url = {https://doi.org/10.1007/BF00271644}, doi = {10.1007/BF00271644}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/HertelMMN84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/integration/Mehlhorn84, author = {Kurt Mehlhorn}, title = {AT\({}^{\mbox{2}}\)-optimal {VLSI} integer division and integer square rooting}, journal = {Integr.}, volume = {2}, number = {2}, pages = {163--167}, year = {1984}, url = {https://doi.org/10.1016/0167-9260(84)90020-8}, doi = {10.1016/0167-9260(84)90020-8}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/integration/Mehlhorn84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AltMM84, author = {Helmut Alt and Kurt Mehlhorn and J. Ian Munro}, title = {Partial Match Retrieval in Implicit Data Structures}, journal = {Inf. Process. Lett.}, volume = {19}, number = {2}, pages = {61--65}, year = {1984}, url = {https://doi.org/10.1016/0020-0190(84)90098-X}, doi = {10.1016/0020-0190(84)90098-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AltMM84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Mehlhorn84, author = {Kurt Mehlhorn}, editor = {Bruno Courcelle}, title = {On Optimal VLSI-Circuits for the Basic Arithmetic Functions}, booktitle = {CAAP'84, 9th Colloquium on Trees in Algebra and Programming, Bordeaux, France, March 5-7, 1984, Proceedings}, pages = {23--30}, publisher = {Cambridge University Press}, year = {1984}, timestamp = {Wed, 30 Mar 2016 16:45:14 +0200}, biburl = {https://dblp.org/rec/conf/caap/Mehlhorn84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gi/Mehlhorn84, author = {Kurt Mehlhorn}, editor = {Hans{-}Dieter Ehrich}, title = {{\"{U}}ber Verdrahtungsalgorithmen}, booktitle = {Fachgespr{\"{a}}che auf der 14. GI-Jahrestagung, Braunschweig, 1.-2. Oktober 1984, Proceedings}, series = {Informatik-Fachberichte}, volume = {89}, pages = {79--89}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/978-3-642-70087-3\_8}, doi = {10.1007/978-3-642-70087-3\_8}, timestamp = {Tue, 23 May 2017 01:10:32 +0200}, biburl = {https://dblp.org/rec/conf/gi/Mehlhorn84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MehlhornP84, author = {Kurt Mehlhorn and Franco P. Preparata}, editor = {Jan Paredaens}, title = {Area-Time Optimal {VLSI} Integer Multiplier with Minimum Computation Time}, booktitle = {Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 16-20, 1984, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {172}, pages = {347--357}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-13345-3\_31}, doi = {10.1007/3-540-13345-3\_31}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MehlhornP84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/stacs/1984, editor = {Max Fontet and Kurt Mehlhorn}, title = {{STACS} 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {166}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-12920-0}, doi = {10.1007/3-540-12920-0}, isbn = {3-540-12920-0}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/1984.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BraunmuhlCMV83, author = {Burchard von Braunm{\"{u}}hl and Stephen A. Cook and Kurt Mehlhorn and Rutger Verbeek}, title = {The Recognition of Deterministic CFL's in Small Time and Space}, journal = {Inf. Control.}, volume = {56}, number = {1/2}, pages = {34--51}, year = {1983}, url = {https://doi.org/10.1016/S0019-9958(83)80049-7}, doi = {10.1016/S0019-9958(83)80049-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BraunmuhlCMV83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/MehlhornP83, author = {Kurt Mehlhorn and Franco P. Preparata}, title = {Area-Time Optimal {VLSI} Integer Multiplier with Minimum Computation Time}, journal = {Inf. Control.}, volume = {58}, number = {1-3}, pages = {137--156}, year = {1983}, url = {https://doi.org/10.1016/S0019-9958(83)80061-8}, doi = {10.1016/S0019-9958(83)80061-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/MehlhornP83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/HongMR83, author = {Jia{-}Wei Hong and Kurt Mehlhorn and Arnold L. Rosenberg}, title = {Cost Trade-offs in Graph Embeddings, with Applications}, journal = {J. {ACM}}, volume = {30}, number = {4}, pages = {709--728}, year = {1983}, url = {https://doi.org/10.1145/2157.322401}, doi = {10.1145/2157.322401}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/HongMR83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/HertelM83, author = {Stefan Hertel and Kurt Mehlhorn}, editor = {Marek Karpinski}, title = {Fast Triangulation of Simple Polygons}, booktitle = {Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983}, series = {Lecture Notes in Computer Science}, volume = {158}, pages = {207--218}, publisher = {Springer}, year = {1983}, url = {https://doi.org/10.1007/3-540-12689-9\_105}, doi = {10.1007/3-540-12689-9\_105}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/HertelM83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/MehlhornS83, author = {Kurt Mehlhorn and Bernd H. Schmidt}, editor = {Marek Karpinski}, title = {A Single Shortest Path Algorithm for Graphs with Separators}, booktitle = {Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983}, series = {Lecture Notes in Computer Science}, volume = {158}, pages = {302--309}, publisher = {Springer}, year = {1983}, url = {https://doi.org/10.1007/3-540-12689-9\_113}, doi = {10.1007/3-540-12689-9\_113}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fct/MehlhornS83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MehlhornV83, author = {Kurt Mehlhorn and Uzi Vishkin}, editor = {Manfred Nagl and J{\"{u}}rgen Perl}, title = {Granularity of Memory in Parallel Computation}, booktitle = {Proceedings of the {WG} '83, International Workshop on Graphtheoretic Concepts in Computer Science, June 16-18, 1983, Haus Ohrbeck, near Osnabr{\"{u}}ck, Germany}, pages = {231--240}, publisher = {Universit{\"{a}}tsverlag Rudolf Trauner, Linz}, year = {1983}, timestamp = {Thu, 12 Mar 2020 11:37:19 +0100}, biburl = {https://dblp.org/rec/conf/wg/MehlhornV83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/HuddlestonM82, author = {Scott Huddleston and Kurt Mehlhorn}, title = {A New Data Structure for Representing Sorted Lists}, journal = {Acta Informatica}, volume = {17}, pages = {157--184}, year = {1982}, url = {https://doi.org/10.1007/BF00288968}, doi = {10.1007/BF00288968}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/HuddlestonM82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/WoodEZM82, author = {Bernhard Eisenbarth and Nivio Ziviani and Gaston H. Gonnet and Kurt Mehlhorn and Derick Wood}, title = {The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees}, journal = {Inf. Control.}, volume = {55}, number = {1-3}, pages = {125--174}, year = {1982}, url = {https://doi.org/10.1016/S0019-9958(82)90534-4}, doi = {10.1016/S0019-9958(82)90534-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/WoodEZM82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BeckerDDHKKMNRW82, author = {Michael Becker and W. Degenhardt and J{\"{u}}rgen Doenhardt and Stefan Hertel and Gerd Kaninke and W. Kerber and Kurt Mehlhorn and Stefan N{\"{a}}her and Hans Rohnert and Thomas Winter}, title = {A Probabilistic Algorithm for Vertex Connectivity of Graphs}, journal = {Inf. Process. Lett.}, volume = {15}, number = {3}, pages = {135--136}, year = {1982}, url = {https://doi.org/10.1016/0020-0190(82)90046-1}, doi = {10.1016/0020-0190(82)90046-1}, timestamp = {Thu, 23 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/BeckerDDHKKMNRW82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Mehlhorn82, author = {Kurt Mehlhorn}, title = {A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions}, journal = {{SIAM} J. Comput.}, volume = {11}, number = {4}, pages = {748--760}, year = {1982}, url = {https://doi.org/10.1137/0211061}, doi = {10.1137/0211061}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Mehlhorn82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Mehlhorn82, author = {Kurt Mehlhorn}, title = {On the Program Size of Perfect and Universal Hash Functions}, booktitle = {23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982}, pages = {170--175}, publisher = {{IEEE} Computer Society}, year = {1982}, url = {https://doi.org/10.1109/SFCS.1982.80}, doi = {10.1109/SFCS.1982.80}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Mehlhorn82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MehlhornS82, author = {Kurt Mehlhorn and Erik Meineche Schmidt}, editor = {Harry R. Lewis and Barbara B. Simons and Walter A. Burkhard and Lawrence H. Landweber}, title = {Las Vegas Is better than Determinism in {VLSI} and Distributed Computing (Extended Abstract)}, booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing, May 5-7, 1982, San Francisco, California, {USA}}, pages = {330--337}, publisher = {{ACM}}, year = {1982}, url = {https://doi.org/10.1145/800070.802208}, doi = {10.1145/800070.802208}, timestamp = {Wed, 14 Nov 2018 10:51:38 +0100}, biburl = {https://dblp.org/rec/conf/stoc/MehlhornS82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MehlhornO81, author = {Kurt Mehlhorn and Mark H. Overmars}, title = {Optimal Dynamization of Decomposable Searching Problems}, journal = {Inf. Process. Lett.}, volume = {12}, number = {2}, pages = {93--98}, year = {1981}, url = {https://doi.org/10.1016/0020-0190(81)90010-7}, doi = {10.1016/0020-0190(81)90010-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MehlhornO81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Mehlhorn81, author = {Kurt Mehlhorn}, title = {Arbitrary Weight Changes in Dynamic Trees}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {15}, number = {3}, pages = {183--211}, year = {1981}, url = {https://doi.org/10.1051/ita/1981150301831}, doi = {10.1051/ITA/1981150301831}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Mehlhorn81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Mehlhorn81, author = {Kurt Mehlhorn}, title = {Lower Bounds on the Efficiency of Transforming Static Data sSructures into Dynamic Structures}, journal = {Math. Syst. Theory}, volume = {15}, number = {1}, pages = {1--16}, year = {1981}, url = {https://doi.org/10.1007/BF01786969}, doi = {10.1007/BF01786969}, timestamp = {Sun, 17 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/Mehlhorn81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/HongMR81, author = {Jia{-}Wei Hong and Kurt Mehlhorn and Arnold L. Rosenberg}, editor = {Shimon Even and Oded Kariv}, title = {Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)}, booktitle = {Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {115}, pages = {41--55}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10843-2\_4}, doi = {10.1007/3-540-10843-2\_4}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/HongMR81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/AltMM81, author = {Helmut Alt and Kurt Mehlhorn and J. Ian Munro}, editor = {Jozef Gruska and Michal Chytil}, title = {Partial Match Retrieval in Implicit Data Structures}, booktitle = {Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {118}, pages = {156--161}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10856-4\_81}, doi = {10.1007/3-540-10856-4\_81}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/AltMM81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcs/HuddlestonM81, author = {Scott Huddleston and Kurt Mehlhorn}, editor = {Peter Deussen}, title = {Robust Balancing in B-Trees}, booktitle = {Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, March 23-25, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {104}, pages = {234--244}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/BFb0017315}, doi = {10.1007/BFB0017315}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/tcs/HuddlestonM81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Mehlhorn81, author = {Kurt Mehlhorn}, editor = {J{\"{o}}rg R. M{\"{u}}hlbacher}, title = {Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures}, booktitle = {Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science {(WG} '81), Linz, Austria, June 15-17, 1981}, pages = {265--278}, publisher = {Hanser, Munich}, year = {1981}, timestamp = {Fri, 14 Oct 2016 13:17:23 +0200}, biburl = {https://dblp.org/rec/conf/wg/Mehlhorn81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eik/GuttlerMS80, author = {Reiner G{\"{u}}ttler and Kurt Mehlhorn and Wolfgang Schneider}, title = {Binary Search Trees: Average and Worst Case Behavior}, journal = {J. Inf. Process. Cybern.}, volume = {16}, number = {1-3}, pages = {41--61}, year = {1980}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eik/GuttlerMS80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/AltenkampM80, author = {Doris Altenkamp and Kurt Mehlhorn}, title = {Codes: Unequal Probabilities, Unequal Letter Cost}, journal = {J. {ACM}}, volume = {27}, number = {3}, pages = {412--427}, year = {1980}, url = {https://doi.org/10.1145/322203.322205}, doi = {10.1145/322203.322205}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/AltenkampM80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BlumM80, author = {Norbert Blum and Kurt Mehlhorn}, title = {On the Average Number of Rebalancing Operations in Weight-Balanced Trees}, journal = {Theor. Comput. Sci.}, volume = {11}, pages = {303--320}, year = {1980}, url = {https://doi.org/10.1016/0304-3975(80)90018-3}, doi = {10.1016/0304-3975(80)90018-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BlumM80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Mehlhorn80, author = {Kurt Mehlhorn}, title = {An efficient algorithm for constructing nearly optimal prefix codes}, journal = {{IEEE} Trans. Inf. Theory}, volume = {26}, number = {5}, pages = {513--517}, year = {1980}, url = {https://doi.org/10.1109/TIT.1980.1056250}, doi = {10.1109/TIT.1980.1056250}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/Mehlhorn80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Mehlhorn80, author = {Kurt Mehlhorn}, editor = {J. W. de Bakker and Jan van Leeuwen}, title = {Pebbling Moutain Ranges and its Application of DCFL-Recognition}, booktitle = {Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherlands, July 14-18, 1980, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {85}, pages = {422--435}, publisher = {Springer}, year = {1980}, url = {https://doi.org/10.1007/3-540-10003-2\_89}, doi = {10.1007/3-540-10003-2\_89}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Mehlhorn80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Mehlhorn80, author = {Kurt Mehlhorn}, editor = {Hartmut Noltemeier}, title = {A New Data Structure for Representing Sorted Lists}, booktitle = {Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop {WG} '80, Bad Honnef, Germany, June 15-18, 1980}, series = {Lecture Notes in Computer Science}, volume = {100}, pages = {90--112}, publisher = {Springer}, year = {1980}, url = {https://doi.org/10.1007/3-540-10291-4\_8}, doi = {10.1007/3-540-10291-4\_8}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/Mehlhorn80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/Mehlhorn79, author = {Kurt Mehlhorn}, title = {Some Remarks on Boolean Sums}, journal = {Acta Informatica}, volume = {12}, pages = {371--375}, year = {1979}, url = {https://doi.org/10.1007/BF00268321}, doi = {10.1007/BF00268321}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/Mehlhorn79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Mehlhorn79, author = {Kurt Mehlhorn}, title = {Parsing Macro Grammars Top Down}, journal = {Inf. Control.}, volume = {40}, number = {2}, pages = {123--143}, year = {1979}, url = {https://doi.org/10.1016/S0019-9958(79)90362-0}, doi = {10.1016/S0019-9958(79)90362-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Mehlhorn79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/AltM79, author = {Helmut Alt and Kurt Mehlhorn}, title = {Complexity arguments in algebraic language theory}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {13}, number = {3}, pages = {217--225}, year = {1979}, url = {https://doi.org/10.1051/ita/1979130302171}, doi = {10.1051/ITA/1979130302171}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/AltM79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Mehlhorn79, author = {Kurt Mehlhorn}, title = {Dynamic Binary Search}, journal = {{SIAM} J. Comput.}, volume = {8}, number = {2}, pages = {175--198}, year = {1979}, url = {https://doi.org/10.1137/0208014}, doi = {10.1137/0208014}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Mehlhorn79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gi/Mehlhorn79, author = {Kurt Mehlhorn}, editor = {Karl{-}Heinz B{\"{o}}hling and Peter Paul Spies}, title = {Konzepte der Komplexit{\"{a}}tstheorie illustriert am Beispiel des Sortierens}, booktitle = {{GI} - 9. Jahrestagung, Bonn, 1.-5. Oktober 1979, Proceedings}, series = {Informatik-Fachberichte}, volume = {19}, pages = {16--22}, publisher = {Springer}, year = {1979}, url = {https://doi.org/10.1007/978-3-642-67444-0\_2}, doi = {10.1007/978-3-642-67444-0\_2}, timestamp = {Tue, 23 May 2017 01:10:32 +0200}, biburl = {https://dblp.org/rec/conf/gi/Mehlhorn79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Mehlhorn79, author = {Kurt Mehlhorn}, editor = {Jir{\'{\i}} Becv{\'{a}}r}, title = {Searching, Sorting and Information Theory}, booktitle = {Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979}, series = {Lecture Notes in Computer Science}, volume = {74}, pages = {131--145}, publisher = {Springer}, year = {1979}, url = {https://doi.org/10.1007/3-540-09526-8\_10}, doi = {10.1007/3-540-09526-8\_10}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Mehlhorn79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Mehlhorn79a, author = {Kurt Mehlhorn}, editor = {Jir{\'{\i}} Becv{\'{a}}r}, title = {Some Remarks on Boolean Sums}, booktitle = {Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979}, series = {Lecture Notes in Computer Science}, volume = {74}, pages = {375--380}, publisher = {Springer}, year = {1979}, url = {https://doi.org/10.1007/3-540-09526-8\_36}, doi = {10.1007/3-540-09526-8\_36}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Mehlhorn79a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcs/BlumM79, author = {Norbert Blum and Kurt Mehlhorn}, editor = {Klaus Weihrauch}, title = {Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten B{\"{a}}umen}, booktitle = {Theoretical Computer Science, 4th GI-Conference, Aachen, Germany, March 26-28, 1979, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {67}, pages = {67--78}, publisher = {Springer}, year = {1979}, url = {https://doi.org/10.1007/3-540-09118-1\_9}, doi = {10.1007/3-540-09118-1\_9}, timestamp = {Fri, 17 Jul 2020 16:12:47 +0200}, biburl = {https://dblp.org/rec/conf/tcs/BlumM79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcs/Mehlhorn79, author = {Kurt Mehlhorn}, editor = {Klaus Weihrauch}, title = {Sorting Presorted Files}, booktitle = {Theoretical Computer Science, 4th GI-Conference, Aachen, Germany, March 26-28, 1979, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {67}, pages = {199--212}, publisher = {Springer}, year = {1979}, url = {https://doi.org/10.1007/3-540-09118-1\_22}, doi = {10.1007/3-540-09118-1\_22}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tcs/Mehlhorn79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/insk/Mehlhorn78, author = {Kurt Mehlhorn}, title = {Effiziente Algorithmen: Ein Beispiel}, journal = {Inform. Spektrum}, volume = {1}, number = {2}, pages = {81--89}, year = {1978}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/insk/Mehlhorn78.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/AltenkampM78, author = {Doris Altenkamp and Kurt Mehlhorn}, editor = {Giorgio Ausiello and Corrado B{\"{o}}hm}, title = {Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract)}, booktitle = {Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {62}, pages = {15--25}, publisher = {Springer}, year = {1978}, url = {https://doi.org/10.1007/3-540-08860-1\_2}, doi = {10.1007/3-540-08860-1\_2}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/AltenkampM78.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/teu/Mehlhorn77, author = {Kurt Mehlhorn}, title = {Effiziente Algorithmen}, publisher = {Teubner}, year = {1977}, isbn = {3-519-02343-1}, timestamp = {Thu, 31 Oct 2002 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/teu/Mehlhorn77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/DeussenM77, author = {Peter Deussen and Kurt Mehlhorn}, title = {Van Wijngaarden Grammars and Space Complexity Classs {EXSPACE}}, journal = {Acta Informatica}, volume = {8}, pages = {193--199}, year = {1977}, url = {https://doi.org/10.1007/BF00289249}, doi = {10.1007/BF00289249}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/DeussenM77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Mehlhorn77, author = {Kurt Mehlhorn}, title = {A Best Possible Bound for the Weighted Path Length of Binary Search Trees}, journal = {{SIAM} J. Comput.}, volume = {6}, number = {2}, pages = {235--239}, year = {1977}, url = {https://doi.org/10.1137/0206017}, doi = {10.1137/0206017}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Mehlhorn77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Mehlhorn77, author = {Kurt Mehlhorn}, editor = {Arto Salomaa and Magnus Steinby}, title = {Dynamic Binary Search}, booktitle = {Automata, Languages and Programming, Fourth Colloquium, University of Turku, Finland, July 18-22, 1977, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {52}, pages = {323--336}, publisher = {Springer}, year = {1977}, url = {https://doi.org/10.1007/3-540-08342-1\_25}, doi = {10.1007/3-540-08342-1\_25}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Mehlhorn77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/computing/MehlhornG76, author = {Kurt Mehlhorn and Zvi Galil}, title = {Monotone switching circuits and boolean matrix product}, journal = {Computing}, volume = {16}, number = {1-2}, pages = {99--111}, year = {1976}, url = {https://doi.org/10.1007/BF02241983}, doi = {10.1007/BF02241983}, timestamp = {Thu, 06 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/computing/MehlhornG76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eik/Mehlhorn76, author = {Kurt Mehlhorn}, title = {An Improved Lower Bound on the Formula Complexity of Context-free Recognition}, journal = {J. Inf. Process. Cybern.}, volume = {12}, number = {11/12}, pages = {523--524}, year = {1976}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eik/Mehlhorn76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Mehlhorn76, author = {Kurt Mehlhorn}, title = {Bracket-Languages are Recognizable in Logarithmic Space}, journal = {Inf. Process. Lett.}, volume = {5}, number = {6}, pages = {168--170}, year = {1976}, url = {https://doi.org/10.1016/0020-0190(76)90013-2}, doi = {10.1016/0020-0190(76)90013-2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Mehlhorn76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Mehlhorn76, author = {Kurt Mehlhorn}, title = {Polynomial and Abstract Subrecursive Classes}, journal = {J. Comput. Syst. Sci.}, volume = {12}, number = {2}, pages = {147--178}, year = {1976}, url = {https://doi.org/10.1016/S0022-0000(76)80035-9}, doi = {10.1016/S0022-0000(76)80035-9}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Mehlhorn76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gi/HeydthausenM76, author = {Manfred Heydthausen and Kurt Mehlhorn}, editor = {Erich J. Neuhold}, title = {Top Down Parsing of Macro Grammars}, booktitle = {{GI} - 6. Jahrestagung, Stuttgart, 29. September - 1. Oktober 1976, Proceedings}, series = {Informatik-Fachberichte}, volume = {5}, pages = {95--108}, publisher = {Springer}, year = {1976}, url = {https://doi.org/10.1007/978-3-642-95289-0\_8}, doi = {10.1007/978-3-642-95289-0\_8}, timestamp = {Tue, 23 May 2017 01:10:33 +0200}, biburl = {https://dblp.org/rec/conf/gi/HeydthausenM76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gi/GuttlerMSW76, author = {Reiner G{\"{u}}ttler and Kurt Mehlhorn and Wolfgang Schneider and Norbert Wernet}, editor = {Erich J. Neuhold}, title = {Binary Search Trees: Average and Worst Case Behavior}, booktitle = {{GI} - 6. Jahrestagung, Stuttgart, 29. September - 1. Oktober 1976, Proceedings}, series = {Informatik-Fachberichte}, volume = {5}, pages = {301--313}, publisher = {Springer}, year = {1976}, url = {https://doi.org/10.1007/978-3-642-95289-0\_22}, doi = {10.1007/978-3-642-95289-0\_22}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/gi/GuttlerMSW76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/AltM76, author = {Helmut Alt and Kurt Mehlhorn}, editor = {S. Michaelson and Robin Milner}, title = {Lower Bounds for the Space Complexity of Context-Free Recognition}, booktitle = {Third International Colloquium on Automata, Languages and Programming, University of Edinburgh, UK, July 20-23, 1976}, pages = {338--354}, publisher = {Edinburgh University Press}, year = {1976}, timestamp = {Mon, 08 Jul 2019 10:58:24 +0200}, biburl = {https://dblp.org/rec/conf/icalp/AltM76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/Mehlhorn75, author = {Kurt Mehlhorn}, title = {Nearly Optimal Binary Search Trees}, journal = {Acta Informatica}, volume = {5}, pages = {287--295}, year = {1975}, url = {https://doi.org/10.1007/BF00264563}, doi = {10.1007/BF00264563}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/Mehlhorn75.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/AltM75, author = {Helmut Alt and Kurt Mehlhorn}, title = {A language over a one symbol alphabet requiring only {O} (log log n) space}, journal = {{SIGACT} News}, volume = {7}, number = {4}, pages = {31--33}, year = {1975}, url = {https://doi.org/10.1145/990502.990506}, doi = {10.1145/990502.990506}, timestamp = {Wed, 04 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/AltM75.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/automata/Mehlhorn75, author = {Kurt Mehlhorn}, editor = {H. Barkhage}, title = {Best possible bounds for the weighted path length of optimum binary search trees}, booktitle = {Automata Theory and Formal Languages, 2nd {GI} Conference, Kaiserslautern, May 20-23, 1975}, series = {Lecture Notes in Computer Science}, volume = {33}, pages = {31--41}, publisher = {Springer}, year = {1975}, url = {https://doi.org/10.1007/3-540-07407-4\_4}, doi = {10.1007/3-540-07407-4\_4}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/automata/Mehlhorn75.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/MehlhornG75, author = {Kurt Mehlhorn and Zvi Galil}, editor = {Jir{\'{\i}} Becv{\'{a}}r}, title = {Monotone Switching Circuits and Boolean Matrix Product}, booktitle = {Mathematical Foundations of Computer Science 1975, 4th Symposium, Mari{\'{a}}nsk{\'{e}} L{\'{a}}zne, Czechoslovakia, September 1-5, 1975, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {32}, pages = {315--319}, publisher = {Springer}, year = {1975}, url = {https://doi.org/10.1007/3-540-07389-2\_214}, doi = {10.1007/3-540-07389-2\_214}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/MehlhornG75.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/us/Mehlhorn74, author = {Kurt Mehlhorn}, title = {Polynomial and Abstract Subrecursive Classes}, school = {Cornell University, {USA}}, year = {1974}, timestamp = {Mon, 04 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/us/Mehlhorn74.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Mehlhorn74, author = {Kurt Mehlhorn}, editor = {Jacques Loeckx}, title = {The "Almost All" Theory of Subrecursive Degrees is Decidable}, booktitle = {Automata, Languages and Programming, 2nd Colloquium, University of Saarbr{\"{u}}cken, Germany, July 29 - August 2, 1974, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {14}, pages = {317--325}, publisher = {Springer}, year = {1974}, url = {https://doi.org/10.1007/3-540-06841-4\_70}, doi = {10.1007/3-540-06841-4\_70}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Mehlhorn74.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Mehlhorn74, author = {Kurt Mehlhorn}, editor = {Robert L. Constable and Robert W. Ritchie and Jack W. Carlyle and Michael A. Harrison}, title = {Polynomial and Abstract Subrecursive Classes}, booktitle = {Proceedings of the 6th Annual {ACM} Symposium on Theory of Computing, April 30 - May 2, 1974, Seattle, Washington, {USA}}, pages = {96--109}, publisher = {{ACM}}, year = {1974}, url = {https://doi.org/10.1145/800119.803890}, doi = {10.1145/800119.803890}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Mehlhorn74.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Mehlhorn73, author = {Kurt Mehlhorn}, title = {On the Size of Sets of Computable Functions}, booktitle = {14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, October 15-17, 1973}, pages = {190--196}, publisher = {{IEEE} Computer Society}, year = {1973}, url = {https://doi.org/10.1109/SWAT.1973.23}, doi = {10.1109/SWAT.1973.23}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Mehlhorn73.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.