Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Günter Rote
@article{DBLP:journals/corr/abs-2402-15787,
author = {G{\"{u}}nter Rote and
Moritz R{\"{u}}ber and
Morteza Saghafian},
title = {Grid Peeling of Parabolas},
journal = {CoRR},
volume = {abs/2402.15787},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.15787},
doi = {10.48550/ARXIV.2402.15787},
eprinttype = {arXiv},
eprint = {2402.15787},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-15787.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/NooijerTWMMLR23,
author = {Phoebe de Nooijer and
Soeren Terziadis and
Alexandra Weinberger and
Zuzana Mas{\'{a}}rov{\'{a}} and
Tamara Mchedlidze and
Maarten L{\"{o}}ffler and
G{\"{u}}nter Rote},
editor = {Michael A. Bekos and
Markus Chimani},
title = {Removing Popular Faces in Curve Arrangements},
booktitle = {Graph Drawing and Network Visualization - 31st International Symposium,
{GD} 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023,
Revised Selected Papers, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {14466},
pages = {18--33},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49275-4\_2},
doi = {10.1007/978-3-031-49275-4\_2},
timestamp = {Sat, 10 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/NooijerTWMMLR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KlemzR22,
author = {Boris Klemz and
G{\"{u}}nter Rote},
title = {Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum
Chain Covers in Convex Bipartite Graphs},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {1064--1080},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00904-w},
doi = {10.1007/S00453-021-00904-W},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KlemzR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AckermanKR22,
author = {Eyal Ackerman and
Bal{\'{a}}zs Keszegh and
G{\"{u}}nter Rote},
title = {An Almost Optimal Bound on the Number of Intersections of Two Simple
Polygons},
journal = {Discret. Comput. Geom.},
volume = {68},
number = {4},
pages = {1049--1077},
year = {2022},
url = {https://doi.org/10.1007/s00454-022-00438-0},
doi = {10.1007/S00454-022-00438-0},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AckermanKR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-12175,
author = {Phoebe de Nooijer and
Soeren Nickel and
Alexandra Weinberger and
Zuzana Mas{\'{a}}rov{\'{a}} and
Tamara Mchedlidze and
Maarten L{\"{o}}ffler and
G{\"{u}}nter Rote},
title = {Removing Popular Faces in Curve Arrangements},
journal = {CoRR},
volume = {abs/2202.12175},
year = {2022},
url = {https://arxiv.org/abs/2202.12175},
eprinttype = {arXiv},
eprint = {2202.12175},
timestamp = {Wed, 02 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-12175.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/DujmovicFGMR21,
author = {Vida Dujmovic and
Fabrizio Frati and
Daniel Gon{\c{c}}alves and
Pat Morin and
G{\"{u}}nter Rote},
title = {Every Collinear Set in a Planar Graph is Free},
journal = {Discret. Comput. Geom.},
volume = {65},
number = {4},
pages = {999--1027},
year = {2021},
url = {https://doi.org/10.1007/s00454-019-00167-x},
doi = {10.1007/S00454-019-00167-X},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/DujmovicFGMR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AbrahamsenGLR20,
author = {Mikkel Abrahamsen and
Panos Giannopoulos and
Maarten L{\"{o}}ffler and
G{\"{u}}nter Rote},
title = {Geometric Multicut: Shortest Fences for Separating Groups of Objects
in the Plane},
journal = {Discret. Comput. Geom.},
volume = {64},
number = {3},
pages = {575--607},
year = {2020},
url = {https://doi.org/10.1007/s00454-020-00232-w},
doi = {10.1007/S00454-020-00232-W},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AbrahamsenGLR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/em/LabbeRZ20,
author = {Jean{-}Philippe Labb{\'{e}} and
G{\"{u}}nter Rote and
G{\"{u}}nter M. Ziegler},
title = {Area Difference Bounds for Dissections of a Square into an Odd Number
of Triangles},
journal = {Exp. Math.},
volume = {29},
number = {3},
pages = {253--275},
year = {2020},
url = {https://doi.org/10.1080/10586458.2018.1459961},
doi = {10.1080/10586458.2018.1459961},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/em/LabbeRZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AckermanKR20,
author = {Eyal Ackerman and
Bal{\'{a}}zs Keszegh and
G{\"{u}}nter Rote},
editor = {Sergio Cabello and
Danny Z. Chen},
title = {An Almost Optimal Bound on the Number of Intersections of Two Simple
Polygons},
booktitle = {36th International Symposium on Computational Geometry, SoCG 2020,
June 23-26, 2020, Z{\"{u}}rich, Switzerland},
series = {LIPIcs},
volume = {164},
pages = {1:1--1:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2020.1},
doi = {10.4230/LIPICS.SOCG.2020.1},
timestamp = {Wed, 16 Jun 2021 12:02:54 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AckermanKR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-05680,
author = {Eyal Ackerman and
Bal{\'{a}}zs Keszegh and
G{\"{u}}nter Rote},
title = {An almost optimal bound on the number of intersections of two simple
polygons},
journal = {CoRR},
volume = {abs/2002.05680},
year = {2020},
url = {https://arxiv.org/abs/2002.05680},
eprinttype = {arXiv},
eprint = {2002.05680},
timestamp = {Fri, 14 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-05680.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/BasteJMPR19,
author = {Julien Baste and
Lars Jaffke and
Tom{\'{a}}s Masar{\'{\i}}k and
Geevarghese Philip and
G{\"{u}}nter Rote},
title = {{FPT} Algorithms for Diverse Collections of Hitting Sets},
journal = {Algorithms},
volume = {12},
number = {12},
pages = {254},
year = {2019},
url = {https://doi.org/10.3390/a12120254},
doi = {10.3390/A12120254},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/BasteJMPR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AichholzerHKPRR19,
author = {Oswin Aichholzer and
Thomas Hackl and
Matias Korman and
Alexander Pilz and
Andr{\'{e}} van Renssen and
Marcel Roeloffzen and
G{\"{u}}nter Rote and
Birgit Vogtenhuber},
title = {Packing plane spanning graphs with short edges in complete geometric
graphs},
journal = {Comput. Geom.},
volume = {82},
pages = {1--15},
year = {2019},
url = {https://doi.org/10.1016/j.comgeo.2019.04.001},
doi = {10.1016/J.COMGEO.2019.04.001},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/AichholzerHKPRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BlagojevicRSZ19,
author = {Pavle V. M. Blagojevic and
G{\"{u}}nter Rote and
Johanna K. Steinmeyer and
G{\"{u}}nter M. Ziegler},
title = {Convex Equipartitions of Colored Point Sets},
journal = {Discret. Comput. Geom.},
volume = {61},
number = {2},
pages = {355--363},
year = {2019},
url = {https://doi.org/10.1007/s00454-017-9959-7},
doi = {10.1007/S00454-017-9959-7},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BlagojevicRSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/Ebbers-BaumannK19,
author = {Annette Ebbers{-}Baumann and
Rolf Klein and
Christian Knauer and
G{\"{u}}nter Rote},
title = {The geometric dilation of three points},
journal = {J. Comput. Geom.},
volume = {10},
number = {1},
pages = {532--549},
year = {2019},
url = {https://doi.org/10.20382/jocg.v10i1a18},
doi = {10.20382/JOCG.V10I1A18},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/Ebbers-BaumannK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KlemzR19,
author = {Boris Klemz and
G{\"{u}}nter Rote},
title = {Ordered Level Planarity and Its Relationship to Geodesic Planarity,
Bi-Monotonicity, and Variations of Level Planarity},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {4},
pages = {53:1--53:25},
year = {2019},
url = {https://doi.org/10.1145/3359587},
doi = {10.1145/3359587},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/KlemzR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AbrahamsenGLR19,
author = {Mikkel Abrahamsen and
Panos Giannopoulos and
Maarten L{\"{o}}ffler and
G{\"{u}}nter Rote},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Geometric Multicut},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {9:1--9:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.9},
doi = {10.4230/LIPICS.ICALP.2019.9},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AbrahamsenGLR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Rote19,
author = {G{\"{u}}nter Rote},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Isotonic Regression by Dynamic Programming},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {1:1--1:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.1},
doi = {10.4230/OASICS.SOSA.2019.1},
timestamp = {Tue, 15 Feb 2022 09:40:03 +0100},
biburl = {https://dblp.org/rec/conf/soda/Rote19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FelsnerR19,
author = {Stefan Felsner and
G{\"{u}}nter Rote},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {On Primal-Dual Circle Representations},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {8:1--8:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.8},
doi = {10.4230/OASICS.SOSA.2019.8},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/FelsnerR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Rote19a,
author = {G{\"{u}}nter Rote},
editor = {Timothy M. Chan},
title = {The Maximum Number of Minimal Dominating Sets in a Tree},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1201--1214},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.73},
doi = {10.1137/1.9781611975482.73},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/Rote19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DujmovicFGMR19,
author = {Vida Dujmovic and
Fabrizio Frati and
Daniel Gon{\c{c}}alves and
Pat Morin and
G{\"{u}}nter Rote},
editor = {Timothy M. Chan},
title = {Every Collinear Set in a Planar Graph Is Free},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1521--1538},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.92},
doi = {10.1137/1.9781611975482.92},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DujmovicFGMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-04045,
author = {Mikkel Abrahamsen and
Panos Giannopoulos and
Maarten L{\"{o}}ffler and
G{\"{u}}nter Rote},
title = {Geometric Multicut},
journal = {CoRR},
volume = {abs/1902.04045},
year = {2019},
url = {http://arxiv.org/abs/1902.04045},
eprinttype = {arXiv},
eprint = {1902.04045},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-04045.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-04517,
author = {G{\"{u}}nter Rote},
title = {Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal
Results},
journal = {CoRR},
volume = {abs/1903.04517},
year = {2019},
url = {http://arxiv.org/abs/1903.04517},
eprinttype = {arXiv},
eprint = {1903.04517},
timestamp = {Sun, 31 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-04517.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-11203,
author = {G{\"{u}}nter Rote},
title = {The Largest Quadrilateral in a Convex Polygon},
journal = {CoRR},
volume = {abs/1905.11203},
year = {2019},
url = {http://arxiv.org/abs/1905.11203},
eprinttype = {arXiv},
eprint = {1905.11203},
timestamp = {Mon, 03 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-11203.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-05032,
author = {Julien Baste and
Lars Jaffke and
Tom{\'{a}}s Masar{\'{\i}}k and
Geevarghese Philip and
G{\"{u}}nter Rote},
title = {{FPT} Algorithms for Diverse Collections of Hitting Sets},
journal = {CoRR},
volume = {abs/1911.05032},
year = {2019},
url = {http://arxiv.org/abs/1911.05032},
eprinttype = {arXiv},
eprint = {1911.05032},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-05032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AsinowskiR18,
author = {Andrei Asinowski and
G{\"{u}}nter Rote},
title = {Point sets with many non-crossing perfect matchings},
journal = {Comput. Geom.},
volume = {68},
pages = {7--33},
year = {2018},
url = {https://doi.org/10.1016/j.comgeo.2017.05.006},
doi = {10.1016/J.COMGEO.2017.05.006},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AsinowskiR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HajnalIRS18,
author = {P{\'{e}}ter Hajnal and
Alexander Igamberdiev and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
title = {Saturated simple and 2-simple topological graphs with few edges},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {117--138},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00460},
doi = {10.7155/JGAA.00460},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HajnalIRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AngeliniLBDKRR18,
author = {Patrizio Angelini and
Giordano Da Lozzo and
Giuseppe Di Battista and
Valentino Di Donato and
Philipp Kindermann and
G{\"{u}}nter Rote and
Ignaz Rutter},
title = {Windrose Planarity: Embedding Graphs with Direction-Constrained Edges},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {4},
pages = {54:1--54:24},
year = {2018},
url = {https://doi.org/10.1145/3239561},
doi = {10.1145/3239561},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/AngeliniLBDKRR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HerterR18,
author = {Felix Herter and
G{\"{u}}nter Rote},
title = {Loopless Gray code enumeration and the Tower of Bucharest},
journal = {Theor. Comput. Sci.},
volume = {748},
pages = {40--54},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.11.017},
doi = {10.1016/J.TCS.2017.11.017},
timestamp = {Tue, 27 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HerterR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AgarwalKKMRSX18,
author = {Pankaj K. Agarwal and
Haim Kaplan and
Geva Kipper and
Wolfgang Mulzer and
G{\"{u}}nter Rote and
Micha Sharir and
Allen Xiao},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Approximate Minimum-Weight Matching with Outliers Under Translation},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {26:1--26:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.26},
doi = {10.4230/LIPICS.ISAAC.2018.26},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/AgarwalKKMRSX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-10466,
author = {Pankaj K. Agarwal and
Haim Kaplan and
Geva Kipper and
Wolfgang Mulzer and
G{\"{u}}nter Rote and
Micha Sharir and
Allen Xiao},
title = {Approximate Minimum-Weight Matching with Outliers under Translation},
journal = {CoRR},
volume = {abs/1810.10466},
year = {2018},
url = {http://arxiv.org/abs/1810.10466},
eprinttype = {arXiv},
eprint = {1810.10466},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-10466.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/GerbnerKPRW17,
author = {D{\'{a}}niel Gerbner and
Bal{\'{a}}zs Keszegh and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
G{\"{u}}nter Rote and
G{\'{a}}bor Wiener},
title = {Search for the end of a path in the d-dimensional grid and in other
graphs},
journal = {Ars Math. Contemp.},
volume = {12},
number = {2},
pages = {301--314},
year = {2017},
url = {https://doi.org/10.26493/1855-3974.788.89a},
doi = {10.26493/1855-3974.788.89A},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arsmc/GerbnerKPRW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KlemzR17,
author = {Boris Klemz and
G{\"{u}}nter Rote},
editor = {Fabrizio Frati and
Kwan{-}Liu Ma},
title = {Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity},
booktitle = {Graph Drawing and Network Visualization - 25th International Symposium,
{GD} 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10692},
pages = {440--453},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-73915-1\_34},
doi = {10.1007/978-3-319-73915-1\_34},
timestamp = {Sun, 13 Nov 2022 09:57:25 +0100},
biburl = {https://dblp.org/rec/conf/gd/KlemzR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AichholzerHKPRR17,
author = {Oswin Aichholzer and
Thomas Hackl and
Matias Korman and
Alexander Pilz and
G{\"{u}}nter Rote and
Andr{\'{e}} van Renssen and
Marcel Roeloffzen and
Birgit Vogtenhuber},
title = {Packing Short Plane Spanning Graphs in Complete Geometric Graphs},
journal = {CoRR},
volume = {abs/1703.05863},
year = {2017},
url = {http://arxiv.org/abs/1703.05863},
eprinttype = {arXiv},
eprint = {1703.05863},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AichholzerHKPRR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-07428,
author = {Boris Klemz and
G{\"{u}}nter Rote},
title = {Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity},
journal = {CoRR},
volume = {abs/1708.07428},
year = {2017},
url = {http://arxiv.org/abs/1708.07428},
eprinttype = {arXiv},
eprint = {1708.07428},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-07428.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-04496,
author = {Boris Klemz and
G{\"{u}}nter Rote},
title = {Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum
Chain Covers in Convex Bipartite Graphs},
journal = {CoRR},
volume = {abs/1711.04496},
year = {2017},
url = {http://arxiv.org/abs/1711.04496},
eprinttype = {arXiv},
eprint = {1711.04496},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-04496.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/BarequetRS16,
author = {Gill Barequet and
G{\"{u}}nter Rote and
Mira Shalah},
title = {\emph{{\(\lambda\)}} {\textgreater} 4: an improved lower bound on
the growth constant of polyominoes},
journal = {Commun. {ACM}},
volume = {59},
number = {7},
pages = {88--95},
year = {2016},
url = {https://doi.org/10.1145/2851485},
doi = {10.1145/2851485},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/BarequetRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/JaumeR16,
author = {Rafel Jaume and
G{\"{u}}nter Rote},
title = {Recursively-regular subdivisions and applications},
journal = {J. Comput. Geom.},
volume = {7},
number = {1},
pages = {185--220},
year = {2016},
url = {https://doi.org/10.20382/jocg.v7i1a10},
doi = {10.20382/JOCG.V7I1A10},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/JaumeR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/PolishchukAEKMR16,
author = {Valentin Polishchuk and
Esther M. Arkin and
Alon Efrat and
Christian Knauer and
Joseph S. B. Mitchell and
G{\"{u}}nter Rote and
Lena Schlipf and
Topi Talvitie},
title = {Shortest path to a segment and quickest visibility queries},
journal = {J. Comput. Geom.},
volume = {7},
number = {2},
pages = {77--100},
year = {2016},
url = {https://doi.org/10.20382/jocg.v7i2a5},
doi = {10.20382/JOCG.V7I2A5},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/PolishchukAEKMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/KimR16,
author = {Heuna Kim and
G{\"{u}}nter Rote},
editor = {S{\'{a}}ndor P. Fekete and
Anna Lubiw},
title = {Congruence Testing of Point Sets in 4-Space},
booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
June 14-18, 2016, Boston, MA, {USA}},
series = {LIPIcs},
volume = {51},
pages = {48:1--48:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.48},
doi = {10.4230/LIPICS.SOCG.2016.48},
timestamp = {Wed, 16 Jun 2021 12:03:34 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/KimR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MiltzowNORTU16,
author = {Tillmann Miltzow and
Lothar Narins and
Yoshio Okamoto and
G{\"{u}}nter Rote and
Antonis Thomas and
Takeaki Uno},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Approximation and Hardness of Token Swapping},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {66:1--66:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.66},
doi = {10.4230/LIPICS.ESA.2016.66},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/MiltzowNORTU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/HerterR16,
author = {Felix Herter and
G{\"{u}}nter Rote},
editor = {Erik D. Demaine and
Fabrizio Grandoni},
title = {Loopless Gray Code Enumeration and the Tower of Bucharest},
booktitle = {8th International Conference on Fun with Algorithms, {FUN} 2016, June
8-10, 2016, La Maddalena, Italy},
series = {LIPIcs},
volume = {49},
pages = {19:1--19:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FUN.2016.19},
doi = {10.4230/LIPICS.FUN.2016.19},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fun/HerterR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AichholzerHKPRR16,
author = {Oswin Aichholzer and
Thomas Hackl and
Matias Korman and
Alexander Pilz and
G{\"{u}}nter Rote and
Andr{\'{e}} van Renssen and
Marcel Roeloffzen and
Birgit Vogtenhuber},
editor = {Seok{-}Hee Hong},
title = {Packing Short Plane Spanning Trees in Complete Geometric Graphs},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {9:1--9:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.9},
doi = {10.4230/LIPICS.ISAAC.2016.9},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AichholzerHKPRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AngeliniLBDKRR16,
author = {Patrizio Angelini and
Giordano Da Lozzo and
Giuseppe Di Battista and
Valentino Di Donato and
Philipp Kindermann and
G{\"{u}}nter Rote and
Ignaz Rutter},
editor = {Robert Krauthgamer},
title = {Windrose Planarity: Embedding Graphs with Direction-Constrained Edges},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {985--996},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch70},
doi = {10.1137/1.9781611974331.CH70},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/AngeliniLBDKRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MiltzowNORTU16,
author = {Tillmann Miltzow and
Lothar Narins and
Yoshio Okamoto and
G{\"{u}}nter Rote and
Antonis Thomas and
Takeaki Uno},
title = {Tight Exact and Approximate Algorithmic Results on Token Swapping},
journal = {CoRR},
volume = {abs/1602.05150},
year = {2016},
url = {http://arxiv.org/abs/1602.05150},
eprinttype = {arXiv},
eprint = {1602.05150},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MiltzowNORTU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KimR16,
author = {Heuna Kim and
G{\"{u}}nter Rote},
title = {Congruence Testing of Point Sets in 4 Dimensions},
journal = {CoRR},
volume = {abs/1603.07269},
year = {2016},
url = {http://arxiv.org/abs/1603.07269},
eprinttype = {arXiv},
eprint = {1603.07269},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KimR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HerterR16,
author = {Felix Herter and
G{\"{u}}nter Rote},
title = {Loopless Gray Code Enumeration and the Tower of Bucharest},
journal = {CoRR},
volume = {abs/1604.06707},
year = {2016},
url = {http://arxiv.org/abs/1604.06707},
eprinttype = {arXiv},
eprint = {1604.06707},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HerterR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AichholzerAADJR15,
author = {Oswin Aichholzer and
Wolfgang Aigner and
Franz Aurenhammer and
Katerina Cech Dobi{\'{a}}sov{\'{a}} and
Bert J{\"{u}}ttler and
G{\"{u}}nter Rote},
title = {Triangulations with Circular Arcs},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {43--65},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00346},
doi = {10.7155/JGAA.00346},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AichholzerAADJR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/AsinowskiMR15,
author = {Andrei Asinowski and
Tillmann Miltzow and
G{\"{u}}nter Rote},
title = {Quasi-parallel segments and characterization of unique bichromatic
matchings},
journal = {J. Comput. Geom.},
volume = {6},
number = {1},
pages = {185--219},
year = {2015},
url = {https://doi.org/10.20382/jocg.v6i1a8},
doi = {10.20382/JOCG.V6I1A8},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/AsinowskiMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ArkinEKMPRST15,
author = {Esther M. Arkin and
Alon Efrat and
Christian Knauer and
Joseph S. B. Mitchell and
Valentin Polishchuk and
G{\"{u}}nter Rote and
Lena Schlipf and
Topi Talvitie},
editor = {Lars Arge and
J{\'{a}}nos Pach},
title = {Shortest Path to a Segment and Quickest Visibility Queries},
booktitle = {31st International Symposium on Computational Geometry, SoCG 2015,
June 22-25, 2015, Eindhoven, The Netherlands},
series = {LIPIcs},
volume = {34},
pages = {658--673},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.SOCG.2015.658},
doi = {10.4230/LIPICS.SOCG.2015.658},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ArkinEKMPRST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BarequetRS15,
author = {Gill Barequet and
G{\"{u}}nter Rote and
Mira Shalah},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {{\(\lambda\)} {\textgreater} 4},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {83--94},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_8},
doi = {10.1007/978-3-662-48350-3\_8},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/BarequetRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/macis/Rote15,
author = {G{\"{u}}nter Rote},
editor = {Ilias S. Kotsireas and
Siegfried M. Rump and
Chee K. Yap},
title = {Congruence Testing of Point Sets in Three and Four Dimensions - Results
and Techniques},
booktitle = {Mathematical Aspects of Computer and Information Sciences - 6th International
Conference, {MACIS} 2015, Berlin, Germany, November 11-13, 2015, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9582},
pages = {50--59},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-32859-1\_4},
doi = {10.1007/978-3-319-32859-1\_4},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/macis/Rote15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HajnalIR015,
author = {P{\'{e}}ter Hajnal and
Alexander Igamberdiev and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
editor = {Ernst W. Mayr},
title = {Saturated Simple and 2-simple Topological Graphs with Few Edges},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {391--405},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_28},
doi = {10.1007/978-3-662-53174-7\_28},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/HajnalIR015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AsinowskiR15,
author = {Andrei Asinowski and
G{\"{u}}nter Rote},
title = {Point sets with many non-crossing matchings},
journal = {CoRR},
volume = {abs/1502.04925},
year = {2015},
url = {http://arxiv.org/abs/1502.04925},
eprinttype = {arXiv},
eprint = {1502.04925},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AsinowskiR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HajnalIR015,
author = {P{\'{e}}ter Hajnal and
Alexander Igamberdiev and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
title = {Saturated simple and 2-simple topological graphs with few edges},
journal = {CoRR},
volume = {abs/1503.01386},
year = {2015},
url = {http://arxiv.org/abs/1503.01386},
eprinttype = {arXiv},
eprint = {1503.01386},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HajnalIR015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AngeliniLBDKRR15,
author = {Patrizio Angelini and
Giordano Da Lozzo and
Giuseppe Di Battista and
Valentino Di Donato and
Philipp Kindermann and
G{\"{u}}nter Rote and
Ignaz Rutter},
title = {Windrose Planarity: Embedding Graphs with Direction-Constrained Edges},
journal = {CoRR},
volume = {abs/1510.02659},
year = {2015},
url = {http://arxiv.org/abs/1510.02659},
eprinttype = {arXiv},
eprint = {1510.02659},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AngeliniLBDKRR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AsanoBBKMRS14,
author = {Tetsuo Asano and
Kevin Buchin and
Maike Buchin and
Matias Korman and
Wolfgang Mulzer and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
title = {Reprint of: Memory-constrained algorithms for simple polygons},
journal = {Comput. Geom.},
volume = {47},
number = {3},
pages = {469--479},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2013.11.004},
doi = {10.1016/J.COMGEO.2013.11.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AsanoBBKMRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GeissKPR14,
author = {Darius Gei{\ss} and
Rolf Klein and
Rainer Penninger and
G{\"{u}}nter Rote},
title = {Reprint of: Optimally solving a transportation problem using Voronoi
diagrams},
journal = {Comput. Geom.},
volume = {47},
number = {3},
pages = {499--506},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2013.11.003},
doi = {10.1016/J.COMGEO.2013.11.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/GeissKPR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AichholzerHHPRSV14,
author = {Oswin Aichholzer and
Thomas Hackl and
Michael Hoffmann and
Alexander Pilz and
G{\"{u}}nter Rote and
Bettina Speckmann and
Birgit Vogtenhuber},
title = {Plane Graphs with Parity Constraints},
journal = {Graphs Comb.},
volume = {30},
number = {1},
pages = {47--69},
year = {2014},
url = {https://doi.org/10.1007/s00373-012-1247-y},
doi = {10.1007/S00373-012-1247-Y},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AichholzerHHPRSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GerbnerMPPR14,
author = {D{\'{a}}niel Gerbner and
Viola M{\'{e}}sz{\'{a}}ros and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
Alexey Pokrovskiy and
G{\"{u}}nter Rote},
title = {Advantage in the discrete Voronoi game},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {439--457},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00331},
doi = {10.7155/JGAA.00331},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GerbnerMPPR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AichholzerHKR14,
author = {Oswin Aichholzer and
Michael Hoffmann and
Marc J. van Kreveld and
G{\"{u}}nter Rote},
title = {Graph Drawings with Relative Edge Length Specifications},
booktitle = {Proceedings of the 26th Canadian Conference on Computational Geometry,
{CCCG} 2014, Halifax, Nova Scotia, Canada, 2014},
publisher = {Carleton University, Ottawa, Canada},
year = {2014},
url = {http://www.cccg.ca/proceedings/2014/papers/paper27.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/AichholzerHKR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/HoffmannKKR14,
author = {Michael Hoffmann and
Marc J. van Kreveld and
Vincent Kusters and
G{\"{u}}nter Rote},
title = {Quality Ratios of Measures for Graph Drawing Styles},
booktitle = {Proceedings of the 26th Canadian Conference on Computational Geometry,
{CCCG} 2014, Halifax, Nova Scotia, Canada, 2014},
publisher = {Carleton University, Ottawa, Canada},
year = {2014},
url = {http://www.cccg.ca/proceedings/2014/papers/paper05.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/HoffmannKKR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GiannopoulosKRW13,
author = {Panos Giannopoulos and
Christian Knauer and
G{\"{u}}nter Rote and
Daniel Werner},
title = {Fixed-parameter tractability and lower bounds for stabbing problems},
journal = {Comput. Geom.},
volume = {46},
number = {7},
pages = {839--860},
year = {2013},
url = {https://doi.org/10.1016/j.comgeo.2011.06.005},
doi = {10.1016/J.COMGEO.2011.06.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/GiannopoulosKRW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AsanoBBKMRS13,
author = {Tetsuo Asano and
Kevin Buchin and
Maike Buchin and
Matias Korman and
Wolfgang Mulzer and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
title = {Memory-constrained algorithms for simple polygons},
journal = {Comput. Geom.},
volume = {46},
number = {8},
pages = {959--969},
year = {2013},
url = {https://doi.org/10.1016/j.comgeo.2013.04.005},
doi = {10.1016/J.COMGEO.2013.04.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AsanoBBKMRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GeissKPR13,
author = {Darius Gei{\ss} and
Rolf Klein and
Rainer Penninger and
G{\"{u}}nter Rote},
title = {Optimally solving a transportation problem using Voronoi diagrams},
journal = {Comput. Geom.},
volume = {46},
number = {8},
pages = {1009--1016},
year = {2013},
url = {https://doi.org/10.1016/j.comgeo.2013.05.005},
doi = {10.1016/J.COMGEO.2013.05.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/GeissKPR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/EdelsbrunnerFR13,
author = {Herbert Edelsbrunner and
Brittany Terese Fasy and
G{\"{u}}nter Rote},
title = {Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient
Modes in Higher Dimensions},
journal = {Discret. Comput. Geom.},
volume = {49},
number = {4},
pages = {797--822},
year = {2013},
url = {https://doi.org/10.1007/s00454-013-9517-x},
doi = {10.1007/S00454-013-9517-X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/EdelsbrunnerFR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AichholzerHORRSS13,
author = {Oswin Aichholzer and
Thomas Hackl and
David Orden and
Pedro Ramos and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz and
Bettina Speckmann},
title = {Flip Graphs of Bounded Degree Triangulations},
journal = {Graphs Comb.},
volume = {29},
number = {6},
pages = {1577--1593},
year = {2013},
url = {https://doi.org/10.1007/s00373-012-1229-0},
doi = {10.1007/S00373-012-1229-0},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AichholzerHORRSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jwscg/AtariahGR13,
author = {Dror Atariah and
Sunayana Ghosh and
G{\"{u}}nter Rote},
title = {On the Parameterization and the Geometry of the Configuration Space
of a Single Planar Robot},
journal = {J. {WSCG}},
volume = {21},
number = {1},
pages = {11--20},
year = {2013},
url = {http://wscg.zcu.cz/jwscg/J\_WSCG\_2013/!\_2013\_J\_WSCG-1.pdf},
timestamp = {Tue, 07 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jwscg/AtariahGR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/HoffmannKRSS13,
author = {Michael Hoffmann and
Vincent Kusters and
G{\"{u}}nter Rote and
Maria Saumell and
Rodrigo I. Silveira},
title = {Convex hull alignment through translation},
booktitle = {Proceedings of the 25th Canadian Conference on Computational Geometry,
{CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
publisher = {Carleton University, Ottawa, Canada},
year = {2013},
url = {http://cccg.ca/proceedings/2013/papers/paper\_67.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/HoffmannKRSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AsinowskiCCCHHKLLMRU13,
author = {Andrei Asinowski and
Jean Cardinal and
Nathann Cohen and
S{\'{e}}bastien Collette and
Thomas Hackl and
Michael Hoffmann and
Kolja B. Knauer and
Stefan Langerman and
Michal Lason and
Piotr Micek and
G{\"{u}}nter Rote and
Torsten Ueckerdt},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless
Rectangles},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {73--84},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_7},
doi = {10.1007/978-3-642-40104-6\_7},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/AsinowskiCCCHHKLLMRU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-2426,
author = {Andrei Asinowski and
Jean Cardinal and
Nathann Cohen and
S{\'{e}}bastien Collette and
Thomas Hackl and
Michael Hoffmann and
Kolja B. Knauer and
Stefan Langerman and
Michal Lason and
Piotr Micek and
G{\"{u}}nter Rote and
Torsten Ueckerdt},
title = {Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless
Rectangles},
journal = {CoRR},
volume = {abs/1302.2426},
year = {2013},
url = {http://arxiv.org/abs/1302.2426},
eprinttype = {arXiv},
eprint = {1302.2426},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-2426.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-4400,
author = {Andrei Asinowski and
Tillmann Miltzow and
G{\"{u}}nter Rote},
title = {Quasi-Parallel Segments and Characterization of Unique Bichromatic
Matchings},
journal = {CoRR},
volume = {abs/1302.4400},
year = {2013},
url = {http://arxiv.org/abs/1302.4400},
eprinttype = {arXiv},
eprint = {1302.4400},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-4400.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-0523,
author = {D{\'{a}}niel Gerbner and
Viola M{\'{e}}sz{\'{a}}ros and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
Alexey Pokrovskiy and
G{\"{u}}nter Rote},
title = {Advantage in the discrete Voronoi game},
journal = {CoRR},
volume = {abs/1303.0523},
year = {2013},
url = {http://arxiv.org/abs/1303.0523},
eprinttype = {arXiv},
eprint = {1303.0523},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-0523.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JaumeR13,
author = {Rafel Jaume and
G{\"{u}}nter Rote},
title = {The finest regular coarsening and recursively-regular subdivisions},
journal = {CoRR},
volume = {abs/1310.4372},
year = {2013},
url = {http://arxiv.org/abs/1310.4372},
eprinttype = {arXiv},
eprint = {1310.4372},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JaumeR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AichholzerRSV12,
author = {Oswin Aichholzer and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz and
Birgit Vogtenhuber},
title = {Pointed drawings of planar graphs},
journal = {Comput. Geom.},
volume = {45},
number = {9},
pages = {482--494},
year = {2012},
url = {https://doi.org/10.1016/j.comgeo.2010.08.001},
doi = {10.1016/J.COMGEO.2010.08.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AichholzerRSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/DumitrescuRT12,
author = {Adrian Dumitrescu and
G{\"{u}}nter Rote and
Csaba D. T{\'{o}}th},
editor = {Joachim Gudmundsson and
Juli{\'{a}}n Mestre and
Taso Viglas},
title = {Monotone Paths in Planar Convex Subdivisions},
booktitle = {Computing and Combinatorics - 18th Annual International Conference,
{COCOON} 2012, Sydney, Australia, August 20-22, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7434},
pages = {240--251},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32241-9\_21},
doi = {10.1007/978-3-642-32241-9\_21},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/DumitrescuRT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EdelsbrunnerFR12,
author = {Herbert Edelsbrunner and
Brittany Terese Fasy and
G{\"{u}}nter Rote},
editor = {Tamal K. Dey and
Sue Whitesides},
title = {Add isotropic Gaussian kernels at own risk: more and more resilient
modes in higher dimensions},
booktitle = {Proceedings of the 28th {ACM} Symposium on Computational Geometry,
Chapel Hill, NC, USA, June 17-20, 2012},
pages = {91--100},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2261250.2261265},
doi = {10.1145/2261250.2261265},
timestamp = {Mon, 14 Jun 2021 16:50:55 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EdelsbrunnerFR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AtariahR12,
author = {Dror Atariah and
G{\"{u}}nter Rote},
editor = {Tamal K. Dey and
Sue Whitesides},
title = {Configuration space visualization},
booktitle = {Proceedings of the 28th {ACM} Symposium on Computational Geometry,
Chapel Hill, NC, USA, June 17-20, 2012},
pages = {415--416},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2261250.2261313},
doi = {10.1145/2261250.2261313},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AtariahR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/DemaineFRSSZ11,
author = {Erik D. Demaine and
S{\'{a}}ndor P. Fekete and
G{\"{u}}nter Rote and
Nils Schweer and
Daria Schymura and
Mariano Zelke},
title = {Integer point sets minimizing average pairwise L\({}_{\mbox{1}}\)
distance: What is the optimal shape of a town?},
journal = {Comput. Geom.},
volume = {44},
number = {2},
pages = {82--94},
year = {2011},
url = {https://doi.org/10.1016/j.comgeo.2010.09.004},
doi = {10.1016/J.COMGEO.2010.09.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/DemaineFRSSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/MorRS11,
author = {Ares Rib{\'{o}} Mor and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
title = {Small Grid Embeddings of 3-Polytopes},
journal = {Discret. Comput. Geom.},
volume = {45},
number = {1},
pages = {65--87},
year = {2011},
url = {https://doi.org/10.1007/s00454-010-9301-0},
doi = {10.1007/S00454-010-9301-0},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/MorRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AronovCGR11,
author = {Boris Aronov and
Otfried Cheong and
Xavier Goaoc and
G{\"{u}}nter Rote},
title = {Lines Pinning Lines},
journal = {Discret. Comput. Geom.},
volume = {45},
number = {2},
pages = {230--260},
year = {2011},
url = {https://doi.org/10.1007/s00454-010-9288-6},
doi = {10.1007/S00454-010-9288-6},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/AronovCGR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/AsanoMRW11,
author = {Tetsuo Asano and
Wolfgang Mulzer and
G{\"{u}}nter Rote and
Yajun Wang},
title = {Constant-Work-Space Algorithms for Geometric Problems},
journal = {J. Comput. Geom.},
volume = {2},
number = {1},
pages = {46--68},
year = {2011},
url = {https://doi.org/10.20382/jocg.v2i1a4},
doi = {10.20382/JOCG.V2I1A4},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/AsanoMRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CabelloGKMR11,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
D{\'{a}}niel Marx and
G{\"{u}}nter Rote},
title = {Geometric clustering: Fixed-parameter tractability and lower bounds
with respect to the dimension},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {4},
pages = {43:1--43:27},
year = {2011},
url = {https://doi.org/10.1145/2000807.2000811},
doi = {10.1145/2000807.2000811},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CabelloGKMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AbelDDMRU11,
author = {Zachary Abel and
Erik D. Demaine and
Martin L. Demaine and
Hiroaki Matsui and
G{\"{u}}nter Rote and
Ryuhei Uehara},
title = {Common Developments of Several Different Orthogonal Boxes},
booktitle = {Proceedings of the 23rd Annual Canadian Conference on Computational
Geometry, Toronto, Ontario, Canada, August 10-12, 2011},
year = {2011},
url = {http://www.cccg.ca/proceedings/2011/papers/paper49.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/AbelDDMRU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AichholzerADDDHLRSSW11,
author = {Oswin Aichholzer and
Greg Aloupis and
Erik D. Demaine and
Martin L. Demaine and
Vida Dujmovic and
Ferran Hurtado and
Anna Lubiw and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz and
Diane L. Souvaine and
Andrew Winslow},
title = {Convexifying Polygons Without Losing Visibilities},
booktitle = {Proceedings of the 23rd Annual Canadian Conference on Computational
Geometry, Toronto, Ontario, Canada, August 10-12, 2011},
year = {2011},
url = {http://www.cccg.ca/proceedings/2011/papers/paper70.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/AichholzerADDDHLRSSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AsinowskiBBR11,
author = {Andrei Asinowski and
Gill Barequet and
Ronnie Barequet and
G{\"{u}}nter Rote},
editor = {Bin Fu and
Ding{-}Zhu Du},
title = {Proper n-Cell Polycubes in n - 3 Dimensions},
booktitle = {Computing and Combinatorics - 17th Annual International Conference,
{COCOON} 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6842},
pages = {180--191},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22685-4\_16},
doi = {10.1007/978-3-642-22685-4\_16},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/AsinowskiBBR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Rote11,
author = {G{\"{u}}nter Rote},
editor = {Marc J. van Kreveld and
Bettina Speckmann},
title = {Realizing Planar Graphs as Convex Polytopes},
booktitle = {Graph Drawing - 19th International Symposium, {GD} 2011, Eindhoven,
The Netherlands, September 21-23, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7034},
pages = {238--241},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25878-7\_23},
doi = {10.1007/978-3-642-25878-7\_23},
timestamp = {Sun, 13 Nov 2022 09:57:29 +0100},
biburl = {https://dblp.org/rec/conf/gd/Rote11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AichholzerAADJR11,
author = {Oswin Aichholzer and
Wolfgang Aigner and
Franz Aurenhammer and
Katerina Cech Dobi{\'{a}}sov{\'{a}} and
Bert J{\"{u}}ttler and
G{\"{u}}nter Rote},
editor = {Marc J. van Kreveld and
Bettina Speckmann},
title = {Triangulations with Circular Arcs},
booktitle = {Graph Drawing - 19th International Symposium, {GD} 2011, Eindhoven,
The Netherlands, September 21-23, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7034},
pages = {296--307},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25878-7\_29},
doi = {10.1007/978-3-642-25878-7\_29},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AichholzerAADJR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RoteZ11,
author = {G{\"{u}}nter Rote and
Uri Zwick},
editor = {Dana Randall},
title = {Collapse},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {603--613},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.47},
doi = {10.1137/1.9781611973082.47},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/RoteZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-5904,
author = {Tetsuo Asano and
Kevin Buchin and
Maike Buchin and
Matias Korman and
Wolfgang Mulzer and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
title = {Memory-Constrained Algorithms for Simple Polygons},
journal = {CoRR},
volume = {abs/1112.5904},
year = {2011},
url = {http://arxiv.org/abs/1112.5904},
eprinttype = {arXiv},
eprint = {1112.5904},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-5904.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BarequetBR10,
author = {Ronnie Barequet and
Gill Barequet and
G{\"{u}}nter Rote},
title = {Formulae and growth rates of high-dimensional polycubes},
journal = {Comb.},
volume = {30},
number = {3},
pages = {257--275},
year = {2010},
url = {https://doi.org/10.1007/s00493-010-2448-8},
doi = {10.1007/S00493-010-2448-8},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BarequetBR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/ConnellyDDFLMRR10,
author = {Robert Connelly and
Erik D. Demaine and
Martin L. Demaine and
S{\'{a}}ndor P. Fekete and
Stefan Langerman and
Joseph S. B. Mitchell and
Ares Rib{\'{o}} and
G{\"{u}}nter Rote},
title = {Locked and Unlocked Chains of Planar Shapes},
journal = {Discret. Comput. Geom.},
volume = {44},
number = {2},
pages = {439--462},
year = {2010},
url = {https://doi.org/10.1007/s00454-010-9262-3},
doi = {10.1007/S00454-010-9262-3},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/ConnellyDDFLMRR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BuchinCGLLRSSW10,
author = {Kevin Buchin and
Sergio Cabello and
Joachim Gudmundsson and
Maarten L{\"{o}}ffler and
Jun Luo and
G{\"{u}}nter Rote and
Rodrigo I. Silveira and
Bettina Speckmann and
Thomas Wolle},
title = {Finding the Most Relevant Fragments in Networks},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {307--336},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00209},
doi = {10.7155/JGAA.00209},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BuchinCGLLRSSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AckermanBKR10,
author = {Eyal Ackerman and
Kevin Buchin and
Christian Knauer and
G{\"{u}}nter Rote},
title = {Acyclic Orientation of Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {367--384},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00211},
doi = {10.7155/JGAA.00211},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AckermanBKR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/ClarksonR10,
author = {Kenneth L. Clarkson and
G{\"{u}}nter Rote},
title = {Welcome from the Editors-in-Chief},
journal = {J. Comput. Geom.},
volume = {1},
number = {1},
pages = {1--2},
year = {2010},
url = {https://doi.org/10.20382/jocg.v1i1a1},
doi = {10.20382/JOCG.V1I1A1},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/ClarksonR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CabelloR10,
author = {Sergio Cabello and
G{\"{u}}nter Rote},
title = {Obnoxious Centers in Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {4},
pages = {1713--1730},
year = {2010},
url = {https://doi.org/10.1137/09077638X},
doi = {10.1137/09077638X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CabelloR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-5628,
author = {Erik D. Demaine and
S{\'{a}}ndor P. Fekete and
G{\"{u}}nter Rote and
Nils Schweer and
Daria Schymura and
Mariano Zelke},
title = {Integer Point Sets Minimizing Average Pairwise L1-Distance: What is
the Optimal Shape of a Town?},
journal = {CoRR},
volume = {abs/1009.5628},
year = {2010},
url = {http://arxiv.org/abs/1009.5628},
eprinttype = {arXiv},
eprint = {1009.5628},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-5628.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cgf/AichholzerAKPRSV09,
author = {Oswin Aichholzer and
Franz Aurenhammer and
B. Kornberger and
Simon Plantinga and
G{\"{u}}nter Rote and
Astrid Sturm and
Gert Vegter},
title = {Recovering Structure from \emph{r}-Sampled Objects},
journal = {Comput. Graph. Forum},
volume = {28},
number = {5},
pages = {1349--1360},
year = {2009},
url = {https://doi.org/10.1111/j.1467-8659.2009.01512.x},
doi = {10.1111/J.1467-8659.2009.01512.X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cgf/AichholzerAKPRSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/DimitrovKKR09,
author = {Darko Dimitrov and
Christian Knauer and
Klaus Kriegel and
G{\"{u}}nter Rote},
title = {Bounds on the quality of the {PCA} bounding boxes},
journal = {Comput. Geom.},
volume = {42},
number = {8},
pages = {772--789},
year = {2009},
url = {https://doi.org/10.1016/j.comgeo.2008.02.007},
doi = {10.1016/J.COMGEO.2008.02.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/DimitrovKKR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BarequetBR09,
author = {Ronnie Barequet and
Gill Barequet and
G{\"{u}}nter Rote},
title = {Formulae and Growth Rates of High-Dimensional Polycubes},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {459--463},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.076},
doi = {10.1016/J.ENDM.2009.07.076},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BarequetBR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AichholzerHORRSS09,
author = {Oswin Aichholzer and
Thomas Hackl and
David Orden and
Pedro Ramos and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz and
Bettina Speckmann},
title = {Flip Graphs of Bounded-Degree Triangulations},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {509--513},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.084},
doi = {10.1016/J.ENDM.2009.07.084},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AichholzerHORRSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AltBKRT09,
author = {Helmut Alt and
Hans L. Bodlaender and
Marc J. van Kreveld and
G{\"{u}}nter Rote and
Gerard Tel},
title = {Wooden Geometric Puzzles: Design and Hardness Proofs},
journal = {Theory Comput. Syst.},
volume = {44},
number = {2},
pages = {160--174},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9104-3},
doi = {10.1007/S00224-008-9104-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AltBKRT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/agile/BuchinCGLLRSSW09,
author = {Kevin Buchin and
Sergio Cabello and
Joachim Gudmundsson and
Maarten L{\"{o}}ffler and
Jun Luo and
G{\"{u}}nter Rote and
Rodrigo I. Silveira and
Bettina Speckmann and
Thomas Wolle},
editor = {Monika Sester and
Lars Bernard and
Volker Paelke},
title = {Detecting Hotspots in Geographic Networks},
booktitle = {Advances in GIScience, Proceedings of the 12th {AGILE} Conference,
Hannover, Germany, 2-5 June 2009},
series = {Lecture Notes in Geoinformation and Cartography},
pages = {217--231},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00318-9\_11},
doi = {10.1007/978-3-642-00318-9\_11},
timestamp = {Tue, 04 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/agile/BuchinCGLLRSSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AsanoR09,
author = {Tetsuo Asano and
G{\"{u}}nter Rote},
title = {Constant-Working-Space Algorithms for Geometric Problems},
booktitle = {Proceedings of the 21st Annual Canadian Conference on Computational
Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009},
pages = {87--90},
year = {2009},
url = {http://cccg.ca/proceedings/2009/cccg09\_23.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/AsanoR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DemaineFRSSZ09,
author = {Erik D. Demaine and
S{\'{a}}ndor P. Fekete and
G{\"{u}}nter Rote and
Nils Schweer and
Daria Schymura and
Mariano Zelke},
title = {Integer Point Sets Minimizing Average Pairwise l\({}_{\mbox{1}}\)
Distance: What is the Optimal Shape of a Town?},
booktitle = {Proceedings of the 21st Annual Canadian Conference on Computational
Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009},
pages = {145--148},
year = {2009},
url = {http://cccg.ca/proceedings/2009/cccg09\_38.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/DemaineFRSSZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GiannopoulosKR09,
author = {Panos Giannopoulos and
Christian Knauer and
G{\"{u}}nter Rote},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {The Parameterized Complexity of Some Geometric Problems in Unbounded
Dimension},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {198--209},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_16},
doi = {10.1007/978-3-642-11269-0\_16},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GiannopoulosKR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AichholzerHHPRSV09,
author = {Oswin Aichholzer and
Thomas Hackl and
Michael Hoffmann and
Alexander Pilz and
G{\"{u}}nter Rote and
Bettina Speckmann and
Birgit Vogtenhuber},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {Plane Graphs with Parity Constraints},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {13--24},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_2},
doi = {10.1007/978-3-642-03367-4\_2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/AichholzerHHPRSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/RoteS09,
author = {G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {Resolving Loads with Positive Interior Stresses},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {530--541},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_46},
doi = {10.1007/978-3-642-03367-4\_46},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/RoteS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Rote09,
author = {G{\"{u}}nter Rote},
editor = {Pankaj Kumar Agarwal and
Helmut Alt and
Monique Teillaud},
title = {Two Applications of Point Matching},
booktitle = {Computational Geometry, 08.03. - 13.03.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09111},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2009/2029/},
timestamp = {Thu, 10 Jun 2021 13:02:09 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Rote09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-3469,
author = {Panos Giannopoulos and
Christian Knauer and
G{\"{u}}nter Rote and
Daniel Werner},
title = {The parameterized complexity of some geometric problems in unbounded
dimension},
journal = {CoRR},
volume = {abs/0906.3469},
year = {2009},
url = {http://arxiv.org/abs/0906.3469},
eprinttype = {arXiv},
eprint = {0906.3469},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0906-3469.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-3896,
author = {Panos Giannopoulos and
Christian Knauer and
G{\"{u}}nter Rote and
Daniel Werner},
title = {Fixed-parameter tractability and lower bounds for stabbing problems},
journal = {CoRR},
volume = {abs/0906.3896},
year = {2009},
url = {http://arxiv.org/abs/0906.3896},
eprinttype = {arXiv},
eprint = {0906.3896},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0906-3896.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0908-0488,
author = {Ares Rib{\'{o}} Mor and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
title = {Small grid embeddings of 3-polytopes},
journal = {CoRR},
volume = {abs/0908.0488},
year = {2009},
url = {http://arxiv.org/abs/0908.0488},
eprinttype = {arXiv},
eprint = {0908.0488},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0908-0488.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CabelloGKR08,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
G{\"{u}}nter Rote},
title = {Matching point sets with respect to the Earth Mover's Distance},
journal = {Comput. Geom.},
volume = {39},
number = {2},
pages = {118--133},
year = {2008},
url = {https://doi.org/10.1016/j.comgeo.2006.10.001},
doi = {10.1016/J.COMGEO.2006.10.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CabelloGKR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/DrysdaleRS08,
author = {Robert L. Scot Drysdale and
G{\"{u}}nter Rote and
Astrid Sturm},
title = {Approximation of an open polygonal curve with a minimum number of
circular arcs and biarcs},
journal = {Comput. Geom.},
volume = {41},
number = {1-2},
pages = {31--47},
year = {2008},
url = {https://doi.org/10.1016/j.comgeo.2007.10.009},
doi = {10.1016/J.COMGEO.2007.10.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/DrysdaleRS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AckermanBKPR08,
author = {Eyal Ackerman and
Kevin Buchin and
Christian Knauer and
Rom Pinchasi and
G{\"{u}}nter Rote},
title = {There Are Not Too Many Magic Configurations},
journal = {Discret. Comput. Geom.},
volume = {39},
number = {1-3},
pages = {3--16},
year = {2008},
url = {https://doi.org/10.1007/s00454-007-9023-0},
doi = {10.1007/S00454-007-9023-0},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AckermanBKPR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MulzerR08,
author = {Wolfgang Mulzer and
G{\"{u}}nter Rote},
title = {Minimum-weight triangulation is NP-hard},
journal = {J. {ACM}},
volume = {55},
number = {2},
pages = {11:1--11:29},
year = {2008},
url = {https://doi.org/10.1145/1346330.1346336},
doi = {10.1145/1346330.1346336},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MulzerR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/El-KhechenIFR08,
author = {Dania El{-}Khechen and
John Iacono and
Thomas Fevens and
G{\"{u}}nter Rote},
title = {Partitioning a Polygon into Two Mirror Congruent Pieces},
booktitle = {Proceedings of the 20th Annual Canadian Conference on Computational
Geometry, Montr{\'{e}}al, Canada, August 13-15, 2008},
year = {2008},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/El-KhechenIFR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CabelloGKR08,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
G{\"{u}}nter Rote},
editor = {Shang{-}Hua Teng},
title = {Geometric clustering: fixed-parameter tractability and lower bounds
with respect to the dimension},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {836--843},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347174},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CabelloGKR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/DumitrescuEGKR07,
author = {Adrian Dumitrescu and
Annette Ebbers{-}Baumann and
Ansgar Gr{\"{u}}ne and
Rolf Klein and
G{\"{u}}nter Rote},
title = {On the geometric dilation of closed curves, graphs, and point sets},
journal = {Comput. Geom.},
volume = {36},
number = {1},
pages = {16--38},
year = {2007},
url = {https://doi.org/10.1016/j.comgeo.2005.07.004},
doi = {10.1016/J.COMGEO.2005.07.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/DumitrescuEGKR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Rote07,
author = {G{\"{u}}nter Rote},
title = {Computing the Fr{\'{e}}chet distance between piecewise smooth
curves},
journal = {Comput. Geom.},
volume = {37},
number = {3},
pages = {162--174},
year = {2007},
url = {https://doi.org/10.1016/j.comgeo.2005.01.004},
doi = {10.1016/J.COMGEO.2005.01.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Rote07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CabelloDR07,
author = {Sergio Cabello and
Erik D. Demaine and
G{\"{u}}nter Rote},
title = {Planar Embeddings of Graphs with Specified Edge Lengths},
journal = {J. Graph Algorithms Appl.},
volume = {11},
number = {1},
pages = {259--276},
year = {2007},
url = {https://doi.org/10.7155/jgaa.00145},
doi = {10.7155/JGAA.00145},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CabelloDR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AichholzerRSV07,
author = {Oswin Aichholzer and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz and
Birgit Vogtenhuber},
editor = {Prosenjit Bose},
title = {Pointed Drawings of Planar Graphs},
booktitle = {Proceedings of the 19th Annual Canadian Conference on Computational
Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa,
Canada},
pages = {237--240},
publisher = {Carleton University, Ottawa, Canada},
year = {2007},
url = {http://cccg.ca/proceedings/2007/09b5.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/AichholzerRSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/MorRS07,
author = {Ares Rib{\'{o}} Mor and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
editor = {Jeff Erickson},
title = {Embedding 3-polytopes on a small grid},
booktitle = {Proceedings of the 23rd {ACM} Symposium on Computational Geometry,
Gyeongju, South Korea, June 6-8, 2007},
pages = {112--118},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1247069.1247086},
doi = {10.1145/1247069.1247086},
timestamp = {Mon, 14 Jun 2021 16:25:02 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/MorRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AckermanBKPR07,
author = {Eyal Ackerman and
Kevin Buchin and
Christian Knauer and
Rom Pinchasi and
G{\"{u}}nter Rote},
editor = {Jeff Erickson},
title = {There are not too many magic configurations},
booktitle = {Proceedings of the 23rd {ACM} Symposium on Computational Geometry,
Gyeongju, South Korea, June 6-8, 2007},
pages = {142--149},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1247069.1247098},
doi = {10.1145/1247069.1247098},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AckermanBKPR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/DimitrovKKR07,
author = {Darko Dimitrov and
Christian Knauer and
Klaus Kriegel and
G{\"{u}}nter Rote},
editor = {Jeff Erickson},
title = {New upper bounds on the quality of the {PCA} bounding boxes in r\({}^{\mbox{2}}\)
and r\({}^{\mbox{3}}\)},
booktitle = {Proceedings of the 23rd {ACM} Symposium on Computational Geometry,
Gyeongju, South Korea, June 6-8, 2007},
pages = {275--283},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1247069.1247119},
doi = {10.1145/1247069.1247119},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/DimitrovKKR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/AltBKRT07,
author = {Helmut Alt and
Hans L. Bodlaender and
Marc J. van Kreveld and
G{\"{u}}nter Rote and
Gerard Tel},
editor = {Pierluigi Crescenzi and
Giuseppe Prencipe and
Geppino Pucci},
title = {Wooden Geometric Puzzles: Design and Hardness Proofs},
booktitle = {Fun with Algorithms, 4th International Conference, {FUN} 2007, Castiglioncello,
Italy, June 3-5, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4475},
pages = {16--29},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72914-3\_4},
doi = {10.1007/978-3-540-72914-3\_4},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/AltBKRT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CabelloR07,
author = {Sergio Cabello and
G{\"{u}}nter Rote},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Obnoxious centers in graphs},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {98--107},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283395},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/CabelloR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RoteZ07,
author = {G{\"{u}}nter Rote and
Martin Zachariasen},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Matrix scaling by network flow},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {848--854},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283474},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/RoteZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/RoteS06,
author = {G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
title = {Threshold arrangements and the knapsack problem},
journal = {Appl. Math. Lett.},
volume = {19},
number = {1},
pages = {108--112},
year = {2006},
url = {https://doi.org/10.1016/j.aml.2005.03.010},
doi = {10.1016/J.AML.2005.03.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/RoteS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/MulzerR06,
author = {Wolfgang Mulzer and
G{\"{u}}nter Rote},
editor = {Nina Amenta and
Otfried Cheong},
title = {Minimum weight triangulation is NP-hard},
booktitle = {Proceedings of the 22nd {ACM} Symposium on Computational Geometry,
Sedona, Arizona, USA, June 5-7, 2006},
pages = {1--10},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1137856.1137859},
doi = {10.1145/1137856.1137859},
timestamp = {Mon, 14 Jun 2021 16:25:13 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/MulzerR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ConnellyDDFLMRR06,
author = {Robert Connelly and
Erik D. Demaine and
Martin L. Demaine and
S{\'{a}}ndor P. Fekete and
Stefan Langerman and
Joseph S. B. Mitchell and
Ares Rib{\'{o}} and
G{\"{u}}nter Rote},
editor = {Nina Amenta and
Otfried Cheong},
title = {Locked and unlocked chains of planar shapes},
booktitle = {Proceedings of the 22nd {ACM} Symposium on Computational Geometry,
Sedona, Arizona, USA, June 5-7, 2006},
pages = {61--70},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1137856.1137868},
doi = {10.1145/1137856.1137868},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ConnellyDDFLMRR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AckermanBKR06,
author = {Eyal Ackerman and
Kevin Buchin and
Christian Knauer and
G{\"{u}}nter Rote},
editor = {Lars Arge and
Rusins Freivalds},
title = {Acyclic Orientation of Drawings},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {268--279},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_26},
doi = {10.1007/11785293\_26},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AckermanBKR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0601002,
author = {Wolfgang Mulzer and
G{\"{u}}nter Rote},
title = {Minimum-weight triangulation is NP-hard},
journal = {CoRR},
volume = {abs/cs/0601002},
year = {2006},
url = {http://arxiv.org/abs/cs/0601002},
eprinttype = {arXiv},
eprint = {cs/0601002},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0601002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0604022,
author = {Robert Connelly and
Erik D. Demaine and
Martin L. Demaine and
S{\'{a}}ndor P. Fekete and
Stefan Langerman and
Joseph S. B. Mitchell and
Ares Rib{\'{o}} and
G{\"{u}}nter Rote},
title = {Locked and Unlocked Chains of Planar Shapes},
journal = {CoRR},
volume = {abs/cs/0604022},
year = {2006},
url = {http://arxiv.org/abs/cs/0604022},
eprinttype = {arXiv},
eprint = {cs/0604022},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0604022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/ChiangLLR05,
author = {Yi{-}Jen Chiang and
Tobias Lenz and
Xiang Lu and
G{\"{u}}nter Rote},
title = {Simple and optimal output-sensitive construction of contour trees
using monotone paths},
journal = {Comput. Geom.},
volume = {30},
number = {2},
pages = {165--195},
year = {2005},
url = {https://doi.org/10.1016/j.comgeo.2004.05.002},
doi = {10.1016/J.COMGEO.2004.05.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/ChiangLLR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/HaasORSSSSSW05,
author = {Ruth Haas and
David Orden and
G{\"{u}}nter Rote and
Francisco Santos and
Brigitte Servatius and
Herman Servatius and
Diane L. Souvaine and
Ileana Streinu and
Walter Whiteley},
title = {Planar minimally rigid graphs and pseudo-triangulations},
journal = {Comput. Geom.},
volume = {31},
number = {1-2},
pages = {31--61},
year = {2005},
url = {https://doi.org/10.1016/j.comgeo.2004.07.003},
doi = {10.1016/J.COMGEO.2004.07.003},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/HaasORSSSSSW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CabelloGKR05,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
G{\"{u}}nter Rote},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Matching Point Sets with Respect to the Earth Mover's Distance},
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 = {520--531},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_47},
doi = {10.1007/11561071\_47},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/CabelloGKR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Rote05,
author = {G{\"{u}}nter Rote},
title = {Strictly convex drawings of planar graphs},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {728--734},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070535},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/Rote05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DumitrescuEGKR05,
author = {Adrian Dumitrescu and
Annette Ebbers{-}Baumann and
Ansgar Gr{\"{u}}ne and
Rolf Klein and
G{\"{u}}nter Rote},
editor = {Frank K. H. A. Dehne and
Alejandro L{\'{o}}pez{-}Ortiz and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {On Geometric Dilation and Halving Chords},
booktitle = {Algorithms and Data Structures, 9th International Workshop, {WADS}
2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3608},
pages = {244--255},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11534273\_22},
doi = {10.1007/11534273\_22},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/DumitrescuEGKR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/2005,
editor = {Joseph S. B. Mitchell and
G{\"{u}}nter Rote},
title = {Proceedings of the 21st {ACM} Symposium on Computational Geometry,
Pisa, Italy, June 6-8, 2005},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1064092},
doi = {10.1145/1064092},
isbn = {1-58113-991-8},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ewcg/DumitrescuGR05,
author = {Adrian Dumitrescu and
Ansgar Gr{\"{u}}ne and
G{\"{u}}nter Rote},
title = {Improved lower bound on the geometric dilation of point sets},
booktitle = {(Informal) Proceedings of the 21st European Workshop on Computational
Geometry, Eindhoven, The Netherlands, March 9-11, 2005},
pages = {37--40},
publisher = {Technische Universiteit Eindhoven},
year = {2005},
url = {http://www.win.tue.nl/EWCG2005/Proceedings/10.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ewcg/DumitrescuGR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ewcg/CabelloGKR05,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
G{\"{u}}nter Rote},
title = {Matching point sets with respect to the Earth mover's distance},
booktitle = {(Informal) Proceedings of the 21st European Workshop on Computational
Geometry, Eindhoven, The Netherlands, March 9-11, 2005},
pages = {57--60},
publisher = {Technische Universiteit Eindhoven},
year = {2005},
url = {http://www.win.tue.nl/EWCG2005/Proceedings/15.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ewcg/CabelloGKR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ewcg/RoteS05,
author = {G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
title = {A pointed Delaunay pseudo-triangulation of a simple polygon},
booktitle = {(Informal) Proceedings of the 21st European Workshop on Computational
Geometry, Eindhoven, The Netherlands, March 9-11, 2005},
pages = {77--80},
publisher = {Technische Universiteit Eindhoven},
year = {2005},
url = {http://www.win.tue.nl/EWCG2005/Proceedings/20.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ewcg/RoteS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0507030,
author = {Imre B{\'{a}}r{\'{a}}ny and
G{\"{u}}nter Rote},
title = {Strictly convex drawings of planar graphs},
journal = {CoRR},
volume = {abs/cs/0507030},
year = {2005},
url = {http://arxiv.org/abs/cs/0507030},
eprinttype = {arXiv},
eprint = {cs/0507030},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0507030.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EfratHKKRW03,
author = {Alon Efrat and
Frank Hoffmann and
Christian Knauer and
Klaus Kriegel and
G{\"{u}}nter Rote and
Carola Wenk},
title = {Covering with Ellipses},
journal = {Algorithmica},
volume = {38},
number = {1},
pages = {145--160},
year = {2004},
url = {https://doi.org/10.1007/s00453-003-1047-0},
doi = {10.1007/S00453-003-1047-0},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EfratHKKRW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/OrdenRSSSW04,
author = {David Orden and
G{\"{u}}nter Rote and
Francisco Santos and
Brigitte Servatius and
Herman Servatius and
Walter Whiteley},
title = {Non-Crossing Frameworks with Non-Crossing Reciprocals},
journal = {Discret. Comput. Geom.},
volume = {32},
number = {4},
pages = {567--600},
year = {2004},
url = {https://doi.org/10.1007/s00454-004-1139-x},
doi = {10.1007/S00454-004-1139-X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/OrdenRSSSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DumitrescuR04,
author = {Adrian Dumitrescu and
G{\"{u}}nter Rote},
title = {On the Fr{\'{e}}chet distance of a set of curves},
booktitle = {Proceedings of the 16th Canadian Conference on Computational Geometry,
CCCG'04, Concordia University, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada, August 9-11, 2004},
pages = {162--165},
year = {2004},
url = {http://www.cccg.ca/proceedings/2004/39.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/DumitrescuR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/ConnellyDR03,
author = {Robert Connelly and
Erik D. Demaine and
G{\"{u}}nter Rote},
title = {Straightening Polygonal Arcs and Convexifying Polygonal Cycles},
journal = {Discret. Comput. Geom.},
volume = {30},
number = {2},
pages = {205--239},
year = {2003},
url = {https://doi.org/10.1007/s00454-003-0006-7},
doi = {10.1007/S00454-003-0006-7},
timestamp = {Fri, 24 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/ConnellyDR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AltERW03,
author = {Helmut Alt and
Alon Efrat and
G{\"{u}}nter Rote and
Carola Wenk},
title = {Matching planar maps},
journal = {J. Algorithms},
volume = {49},
number = {2},
pages = {262--283},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(03)00085-3},
doi = {10.1016/S0196-6774(03)00085-3},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/AltERW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/RoteWWX03,
author = {G{\"{u}}nter Rote and
Cao An Wang and
Lusheng Wang and
Yin{-}Feng Xu},
editor = {Tandy J. Warnow and
Binhai Zhu},
title = {On Constrained Minimum Pseudotriangulations},
booktitle = {Computing and Combinatorics, 9th Annual International Conference,
{COCOON} 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2697},
pages = {445--454},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45071-8\_45},
doi = {10.1007/3-540-45071-8\_45},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/RoteWWX03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/HaasORSSSSSW03,
author = {Ruth Haas and
David Orden and
G{\"{u}}nter Rote and
Francisco Santos and
Brigitte Servatius and
Herman Servatius and
Diane L. Souvaine and
Ileana Streinu and
Walter Whiteley},
editor = {Steven Fortune},
title = {Planar minimally rigid graphs and pseudo-triangulations},
booktitle = {Proceedings of the 19th {ACM} Symposium on Computational Geometry,
San Diego, CA, USA, June 8-10, 2003},
pages = {154--163},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/777792.777817},
doi = {10.1145/777792.777817},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/HaasORSSSSSW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltKRW03,
author = {Helmut Alt and
Christian Knauer and
G{\"{u}}nter Rote and
Sue Whitesides},
editor = {Steven Fortune},
title = {The complexity of (un)folding},
booktitle = {Proceedings of the 19th {ACM} Symposium on Computational Geometry,
San Diego, CA, USA, June 8-10, 2003},
pages = {164--170},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/777792.777818},
doi = {10.1145/777792.777818},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltKRW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AmentaCR03,
author = {Nina Amenta and
Sunghee Choi and
G{\"{u}}nter Rote},
editor = {Steven Fortune},
title = {Incremental constructions con {BRIO}},
booktitle = {Proceedings of the 19th {ACM} Symposium on Computational Geometry,
San Diego, CA, USA, June 8-10, 2003},
pages = {211--219},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/777792.777824},
doi = {10.1145/777792.777824},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AmentaCR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/WenkAEPR03,
author = {Carola Wenk and
Helmut Alt and
Alon Efrat and
Lingeshwaran Palaniappan and
G{\"{u}}nter Rote},
editor = {Steven Fortune},
title = {Finding a curve in a map},
booktitle = {Proceedings of the 19th {ACM} Symposium on Computational Geometry,
San Diego, CA, USA, June 8-10, 2003},
pages = {384--385},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/777792.777855},
doi = {10.1145/777792.777855},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/WenkAEPR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/CabelloDR03,
author = {Sergio Cabello and
Erik D. Demaine and
G{\"{u}}nter Rote},
editor = {Giuseppe Liotta},
title = {Planar Embeddings of Graphs with Specified Edge Lengths},
booktitle = {Graph Drawing, 11th International Symposium, {GD} 2003, Perugia, Italy,
September 21-24, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2912},
pages = {283--294},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24595-7\_26},
doi = {10.1007/978-3-540-24595-7\_26},
timestamp = {Sun, 13 Nov 2022 09:57:34 +0100},
biburl = {https://dblp.org/rec/conf/gd/CabelloDR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AltERW03,
author = {Helmut Alt and
Alon Efrat and
G{\"{u}}nter Rote and
Carola Wenk},
title = {Matching planar maps},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {589--598},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644207},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AltERW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Rote03,
author = {G{\"{u}}nter Rote},
title = {Pursuit-evasion with imprecise target location},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {747--753},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644231},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Rote03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AichholzerRSS03,
author = {Oswin Aichholzer and
G{\"{u}}nter Rote and
Bettina Speckmann and
Ileana Streinu},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Michiel H. M. Smid},
title = {The Zigzag Path of a Pseudo-Triangulation},
booktitle = {Algorithms and Data Structures, 8th International Workshop, {WADS}
2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2748},
pages = {377--388},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45078-8\_33},
doi = {10.1007/978-3-540-45078-8\_33},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/AichholzerRSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Rote02,
author = {G{\"{u}}nter Rote},
title = {Crossing the Bridge at Night},
journal = {Bull. {EATCS}},
volume = {78},
pages = {241},
year = {2002},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/Rote02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Rote02,
author = {G{\"{u}}nter Rote},
editor = {Ferran Hurtado and
Vera Sacrist{\'{a}}n and
Chandrajit Bajaj and
Subhash Suri},
title = {Pseudotriangulations, polytopes, and how to expand linkages},
booktitle = {Proceedings of the 18th Annual Symposium on Computational Geometry,
Barcelona, Spain, June 5-7, 2002},
pages = {133--134},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/513400.513442},
doi = {10.1145/513400.513442},
timestamp = {Mon, 14 Jun 2021 16:25:21 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Rote02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/ElsaesserMRS02,
author = {Robert Els{\"{a}}sser and
Burkhard Monien and
G{\"{u}}nter Rote and
Stefan Schamberger},
title = {Toward Optimal Diffusion Matrices},
booktitle = {16th International Parallel and Distributed Processing Symposium {(IPDPS}
2002), 15-19 April 2002, Fort Lauderdale, FL, USA, CD-ROM/Abstracts
Proceedings},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/IPDPS.2002.1015569},
doi = {10.1109/IPDPS.2002.1015569},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/ElsaesserMRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EfratHKKRW02,
author = {Alon Efrat and
Frank Hoffmann and
Christian Knauer and
Klaus Kriegel and
G{\"{u}}nter Rote and
Carola Wenk},
editor = {David Eppstein},
title = {Covering shapes by ellipses},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {453--454},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381545441.},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EfratHKKRW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AichholzerAIKLR01,
author = {Oswin Aichholzer and
Franz Aurenhammer and
Christian Icking and
Rolf Klein and
Elmar Langetepe and
G{\"{u}}nter Rote},
title = {Generalized self-approaching curves},
journal = {Discret. Appl. Math.},
volume = {109},
number = {1-2},
pages = {3--24},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00233-X},
doi = {10.1016/S0166-218X(00)00233-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AichholzerAIKLR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BrassRS01,
author = {Peter Bra{\ss} and
G{\"{u}}nter Rote and
Konrad J. Swanepoel},
title = {Triangles of Extremal Area or Perimeter in a Finite Planar Point Set},
journal = {Discret. Comput. Geom.},
volume = {26},
number = {1},
pages = {51--58},
year = {2001},
url = {https://doi.org/10.1007/s00454-001-0010-6},
doi = {10.1007/S00454-001-0010-6},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BrassRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BurkardDLR01,
author = {Rainer E. Burkard and
Helidon Dollani and
Yixun Lin and
G{\"{u}}nter Rote},
title = {The Obnoxious Center Problem on a Tree},
journal = {{SIAM} J. Discret. Math.},
volume = {14},
number = {4},
pages = {498--509},
year = {2001},
url = {https://doi.org/10.1137/S0895480198340967},
doi = {10.1137/S0895480198340967},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BurkardDLR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ac/Rote01,
author = {G{\"{u}}nter Rote},
editor = {Helmut Alt},
title = {Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic
and Combinatorial Approaches},
booktitle = {Computational Discrete Mathematics, Advanced Lectures},
series = {Lecture Notes in Computer Science},
volume = {2122},
pages = {119--135},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45506-X\_9},
doi = {10.1007/3-540-45506-X\_9},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/ac/Rote01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/calc/EisenbrandR01,
author = {Friedrich Eisenbrand and
G{\"{u}}nter Rote},
editor = {Joseph H. Silverman},
title = {Fast Reduction of Ternary Quadratic Forms},
booktitle = {Cryptography and Lattices, International Conference, CaLC 2001, Providence,
RI, USA, March 29-30, 2001, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2146},
pages = {32--44},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44670-2\_4},
doi = {10.1007/3-540-44670-2\_4},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/calc/EisenbrandR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/RandallRSS01,
author = {Dana Randall and
G{\"{u}}nter Rote and
Francisco Santos and
Jack Snoeyink},
title = {Counting triangulations and pseudo-triangulations of wheels},
booktitle = {Proceedings of the 13th Canadian Conference on Computational Geometry,
University of Waterloo, Ontario, Canada, August 13-15, 2001},
pages = {149--152},
year = {2001},
url = {http://www.cccg.ca/proceedings/2001/snoeyink-79991.ps.gz},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/RandallRSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/EisenbrandR01,
author = {Friedrich Eisenbrand and
G{\"{u}}nter Rote},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Fast 2-Variable Integer Programming},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {78--89},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_7},
doi = {10.1007/3-540-45535-3\_7},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/ipco/EisenbrandR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BaranyRSZ00,
author = {Imre B{\'{a}}r{\'{a}}ny and
G{\"{u}}nter Rote and
William L. Steiger and
Cun{-}Hui Zhang},
title = {A Central Limit Theorem for Convex Chains in the Square},
journal = {Discret. Comput. Geom.},
volume = {23},
number = {1},
pages = {35--50},
year = {2000},
url = {https://doi.org/10.1007/PL00009490},
doi = {10.1007/PL00009490},
timestamp = {Tue, 03 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/BaranyRSZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FleinerKR00,
author = {Tam{\'{a}}s Fleiner and
Volker Kaibel and
G{\"{u}}nter Rote},
title = {Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes},
journal = {Eur. J. Comb.},
volume = {21},
number = {1},
pages = {121--130},
year = {2000},
url = {https://doi.org/10.1006/eujc.1999.0326},
doi = {10.1006/EUJC.1999.0326},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FleinerKR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ConnellyDR00,
author = {Robert Connelly and
Erik D. Demaine and
G{\"{u}}nter Rote},
title = {Straighting Polygonal Arcs and Convexifying Polygonal Cycles},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {432--442},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892131},
doi = {10.1109/SFCS.2000.892131},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ConnellyDR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ewcg/ConnellyDR00,
author = {Robert Connelly and
Erik D. Demaine and
G{\"{u}}nter Rote},
title = {Every Polygon Can Be Untangled},
booktitle = {EuroCG},
pages = {62--65},
year = {2000},
timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ewcg/ConnellyDR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/RoteW98,
author = {G{\"{u}}nter Rote and
Gerhard J. Woeginger},
title = {Minimizing the Number of Tardy Jobs on a Single Machine with Batch
Setup Times},
journal = {Acta Cybern.},
volume = {13},
number = {4},
pages = {423--430},
year = {1998},
url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3502},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaC/RoteW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AltFRW98,
author = {Helmut Alt and
Ulrich Fuchs and
G{\"{u}}nter Rote and
Gerald Weber},
title = {Matching Convex Shapes with Respect to the Symmetric Difference},
journal = {Algorithmica},
volume = {21},
number = {1},
pages = {89--103},
year = {1998},
url = {https://doi.org/10.1007/PL00009210},
doi = {10.1007/PL00009210},
timestamp = {Sun, 12 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AltFRW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/SchwarzkopfFRW98,
author = {Otfried Schwarzkopf and
Ulrich Fuchs and
G{\"{u}}nter Rote and
Emo Welzl},
title = {Approximation of convex figures by pairs of rectangles},
journal = {Comput. Geom.},
volume = {10},
number = {2},
pages = {77--87},
year = {1998},
url = {https://doi.org/10.1016/S0925-7721(96)00019-3},
doi = {10.1016/S0925-7721(96)00019-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/SchwarzkopfFRW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AichholzerARX98,
author = {Oswin Aichholzer and
Franz Aurenhammer and
G{\"{u}}nter Rote and
Yin{-}Feng Xu},
title = {Constant-Level Greedy Triangulations Approximate the {MWT} Well},
journal = {J. Comb. Optim.},
volume = {2},
number = {4},
pages = {361--369},
year = {1998},
url = {https://doi.org/10.1023/A:1009776619164},
doi = {10.1023/A:1009776619164},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AichholzerARX98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BoseEFHLMRRSWZ98,
author = {Prosenjit Bose and
Hazel Everett and
S{\'{a}}ndor P. Fekete and
Michael E. Houle and
Anna Lubiw and
Henk Meijer and
Kathleen Romanik and
G{\"{u}}nter Rote and
Thomas C. Shermer and
Sue Whitesides and
Christian Zelle},
title = {A Visibility Representation for Graphs in Three Dimensions},
journal = {J. Graph Algorithms Appl.},
volume = {2},
number = {3},
pages = {1--16},
year = {1998},
url = {https://doi.org/10.7155/jgaa.00006},
doi = {10.7155/JGAA.00006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BoseEFHLMRRSWZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BurkardCRW98,
author = {Rainer E. Burkard and
Eranda {\c{C}}ela and
G{\"{u}}nter Rote and
Gerhard J. Woeginger},
title = {The quadratic assignment problem with a monotone anti-Monge and a
symmetric Toeplitz matrix: Easy and hard cases},
journal = {Math. Program.},
volume = {82},
pages = {125--158},
year = {1998},
url = {https://doi.org/10.1007/BF01585868},
doi = {10.1007/BF01585868},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BurkardCRW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GolinR98,
author = {Mordecai J. Golin and
G{\"{u}}nter Rote},
title = {A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free
Codes with Unequal Letter Costs},
journal = {{IEEE} Trans. Inf. Theory},
volume = {44},
number = {5},
pages = {1770--1781},
year = {1998},
url = {https://doi.org/10.1109/18.705558},
doi = {10.1109/18.705558},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GolinR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AichholzerAIKLR98,
author = {Oswin Aichholzer and
Franz Aurenhammer and
Christian Icking and
Rolf Klein and
Elmar Langetepe and
G{\"{u}}nter Rote},
editor = {Kyung{-}Yong Chwa and
Oscar H. Ibarra},
title = {Generalized Self-Approaching Curves},
booktitle = {Algorithms and Computation, 9th International Symposium, {ISAAC} '98,
Taejon, Korea, December 14-16, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1533},
pages = {317--326},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49381-6\_34},
doi = {10.1007/3-540-49381-6\_34},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AichholzerAIKLR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/HagauerR97,
author = {Johann Hagauer and
G{\"{u}}nter Rote},
title = {Three-clustering of Points in the Plane},
journal = {Comput. Geom.},
volume = {8},
pages = {87--95},
year = {1997},
url = {https://doi.org/10.1016/S0925-7721(96)00022-3},
doi = {10.1016/S0925-7721(96)00022-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/HagauerR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/AichholzerAR97,
author = {Oswin Aichholzer and
Helmut Alt and
G{\"{u}}nter Rote},
title = {Matching Shapes with a Reference Point},
journal = {Int. J. Comput. Geom. Appl.},
volume = {7},
number = {4},
pages = {349--363},
year = {1997},
url = {https://doi.org/10.1142/S0218195997000211},
doi = {10.1142/S0218195997000211},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/AichholzerAR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rote97,
author = {G{\"{u}}nter Rote},
title = {Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m},
journal = {Theor. Comput. Sci.},
volume = {172},
number = {1-2},
pages = {303--308},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00185-5},
doi = {10.1016/S0304-3975(96)00185-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rote97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/GriggsR97,
author = {Jerrold R. Griggs and
G{\"{u}}nter Rote},
editor = {Ronald L. Graham and
Jan Kratochv{\'{\i}}l and
Jaroslav Nesetril and
Fred S. Roberts},
title = {On the distribution of sums of vectors in general position},
booktitle = {Contemporary Trends in Discrete Mathematics: From {DIMACS} and {DIMATIA}
to the Future, Proceedings of a {DIMACS} Workshop, Stir{\'{\i}}n
Castle, Czech Republic, May 19-25, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {49},
pages = {139--142},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/049/08},
doi = {10.1090/DIMACS/049/08},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/GriggsR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AichholzerACKRTX96,
author = {Oswin Aichholzer and
Franz Aurenhammer and
Siu{-}Wing Cheng and
Naoki Katoh and
G{\"{u}}nter Rote and
Michael Taschwer and
Yin{-}Feng Xu},
title = {Triangulations Intersect Nicely},
journal = {Discret. Comput. Geom.},
volume = {16},
number = {4},
pages = {339--359},
year = {1996},
url = {https://doi.org/10.1007/BF02712872},
doi = {10.1007/BF02712872},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AichholzerACKRTX96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AltFRW96,
author = {Helmut Alt and
Ulrich Fuchs and
G{\"{u}}nter Rote and
Gerald Weber},
editor = {Josep D{\'{\i}}az and
Maria J. Serna},
title = {Matching Convex Shapes with Respect to the Symmetric Difference},
booktitle = {Algorithms - {ESA} '96, Fourth Annual European Symposium, Barcelona,
Spain, September 25-27, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1136},
pages = {320--333},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61680-2\_65},
doi = {10.1007/3-540-61680-2\_65},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/AltFRW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BurkardCRW96,
author = {Rainer E. Burkard and
Eranda {\c{C}}ela and
G{\"{u}}nter Rote and
Gerhard J. Woeginger},
editor = {William H. Cunningham and
S. Thomas McCormick and
Maurice Queyranne},
title = {The Quadratic Assignment Problem with a Monotone Anti-Monge and a
Symmetric Toeplitz Matrix: Easy and Hard Cases},
booktitle = {Integer Programming and Combinatorial Optimization, 5th International
{IPCO} Conference, Vancouver, British Columbia, Canada, June 3-5,
1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1084},
pages = {204--218},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61310-2\_16},
doi = {10.1007/3-540-61310-2\_16},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BurkardCRW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BurkardFR95,
author = {Rainer E. Burkard and
Bernd Fruhwirth and
G{\"{u}}nter Rote},
title = {Vehicle routing in an automated warehouse: Analysis and optimization},
journal = {Ann. Oper. Res.},
volume = {57},
number = {1},
pages = {29--44},
year = {1995},
url = {https://doi.org/10.1007/BF02099689},
doi = {10.1007/BF02099689},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BurkardFR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MitchellRSW95,
author = {Joseph S. B. Mitchell and
G{\"{u}}nter Rote and
Gopalakrishnan Sundaram and
Gerhard J. Woeginger},
title = {Counting Convex Polygons in Planar Point Sets},
journal = {Inf. Process. Lett.},
volume = {56},
number = {1},
pages = {45--49},
year = {1995},
url = {https://doi.org/10.1016/0020-0190(95)00130-5},
doi = {10.1016/0020-0190(95)00130-5},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MitchellRSW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AichholzerATR95,
author = {Oswin Aichholzer and
Franz Aurenhammer and
Michael Taschwer and
G{\"{u}}nter Rote},
editor = {Jack Snoeyink},
title = {Triangulations Intersect Nicely},
booktitle = {Proceedings of the Eleventh Annual Symposium on Computational Geometry,
Vancouver, B.C., Canada, June 5-12, 1995},
pages = {220--229},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/220279.220303},
doi = {10.1145/220279.220303},
timestamp = {Mon, 14 Jun 2021 16:25:05 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AichholzerATR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GolinR95,
author = {Mordecai J. Golin and
G{\"{u}}nter Rote},
editor = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Ferenc G{\'{e}}cseg},
title = {A Dynamic Programming Algorithm for Constructing Optimal Refix-Free
Codes for Unequal Letter Costs},
booktitle = {Automata, Languages and Programming, 22nd International Colloquium,
ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {944},
pages = {256--267},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60084-1\_79},
doi = {10.1007/3-540-60084-1\_79},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GolinR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DeinekoDR94,
author = {Vladimir G. Deineko and
Ren{\'{e}} van Dal and
G{\"{u}}nter Rote},
title = {The Convex-Hull-and-Line Traveling Salesman Problem: {A} Solvable
Case},
journal = {Inf. Process. Lett.},
volume = {51},
number = {3},
pages = {141--148},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00071-9},
doi = {10.1016/0020-0190(94)00071-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DeinekoDR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltAR94,
author = {Helmut Alt and
Oswin Aichholzer and
G{\"{u}}nter Rote},
editor = {Kurt Mehlhorn},
title = {Matching Shapes with a Reference Point},
booktitle = {Proceedings of the Tenth Annual Symposium on Computational Geometry,
Stony Brook, New York, USA, June 6-8, 1994},
pages = {85--92},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/177424.177555},
doi = {10.1145/177424.177555},
timestamp = {Mon, 14 Jun 2021 16:25:06 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltAR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IckingRWY93,
author = {Christian Icking and
G{\"{u}}nter Rote and
Emo Welzl and
Chee{-}Keng Yap},
title = {Shortest Paths for Line Segments},
journal = {Algorithmica},
volume = {10},
number = {2-4},
pages = {182--200},
year = {1993},
url = {https://doi.org/10.1007/BF01891839},
doi = {10.1007/BF01891839},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/IckingRWY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/EfratRS93,
author = {Alon Efrat and
G{\"{u}}nter Rote and
Micha Sharir},
title = {On the Union of Fat Wedges and Separating a Collection of Segments
By a Line},
journal = {Comput. Geom.},
volume = {3},
pages = {277--288},
year = {1993},
url = {https://doi.org/10.1016/0925-7721(93)90018-2},
doi = {10.1016/0925-7721(93)90018-2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/EfratRS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/RoteV93,
author = {G{\"{u}}nter Rote and
Andreas Vogel},
title = {A heuristic for decomposing traffic matrices in {TDMA} satellite communication},
journal = {{ZOR} Methods Model. Oper. Res.},
volume = {38},
number = {3},
pages = {281--307},
year = {1993},
url = {https://doi.org/10.1007/BF01416610},
doi = {10.1007/BF01416610},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/RoteV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/EfratRS93,
author = {Alon Efrat and
G{\"{u}}nter Rote and
Micha Sharir},
title = {On the Union of Fat Wedges and Separating a Collection of Segments
By a Line},
booktitle = {Proceedings of the 5th Canadian Conference on Computational Geometry,
Waterloo, Ontario, Canada, August 1993},
pages = {115--120},
publisher = {University of Waterloo},
year = {1993},
timestamp = {Wed, 19 May 2021 16:29:07 +0200},
biburl = {https://dblp.org/rec/conf/cccg/EfratRS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/RoteSS93,
author = {G{\"{u}}nter Rote and
Christian Schwarz and
Jack Snoeyink},
title = {Maintaining the Approximate Width of a Set of Points in the Plane},
booktitle = {Proceedings of the 5th Canadian Conference on Computational Geometry,
Waterloo, Ontario, Canada, August 1993},
pages = {258--263},
publisher = {University of Waterloo},
year = {1993},
timestamp = {Sat, 20 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/RoteSS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HagauerR93,
author = {Johann Hagauer and
G{\"{u}}nter Rote},
editor = {Thomas Lengauer},
title = {Three-Clustering of Points in the Plane},
booktitle = {Algorithms - {ESA} '93, First Annual European Symposium, Bad Honnef,
Germany, September 30 - October 2, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {726},
pages = {192--199},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57273-2\_55},
doi = {10.1007/3-540-57273-2\_55},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/HagauerR93.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/MitchellRW92,
author = {Joseph S. B. Mitchell and
G{\"{u}}nter Rote and
Gerhard J. Woeginger},
title = {Minimum-Link Paths Among Obstacles in the Plan},
journal = {Algorithmica},
volume = {8},
number = {5{\&}6},
pages = {431--459},
year = {1992},
url = {https://doi.org/10.1007/BF01758855},
doi = {10.1007/BF01758855},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MitchellRW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Rote92,
author = {G{\"{u}}nter Rote},
title = {The convergence rate of the sandwich algorithm for approximating convex
functions},
journal = {Computing},
volume = {48},
number = {3-4},
pages = {337--361},
year = {1992},
url = {https://doi.org/10.1007/BF02238642},
doi = {10.1007/BF02238642},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Rote92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/EppsteinORW92,
author = {David Eppstein and
Mark H. Overmars and
G{\"{u}}nter Rote and
Gerhard J. Woeginger},
title = {Finding Minimum Area k-gons},
journal = {Discret. Comput. Geom.},
volume = {7},
pages = {45--58},
year = {1992},
url = {https://doi.org/10.1007/BF02187823},
doi = {10.1007/BF02187823},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/EppsteinORW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RoteW92,
author = {G{\"{u}}nter Rote and
Gerhard J. Woeginger},
title = {Counting Convex k-Gons in Planar Point Sets},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {191--194},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90178-X},
doi = {10.1016/0020-0190(92)90178-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RoteW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Rote92,
author = {G{\"{u}}nter Rote},
title = {The n-line traveling salesman problem},
journal = {Networks},
volume = {22},
number = {1},
pages = {91--108},
year = {1992},
url = {https://doi.org/10.1002/net.3230220106},
doi = {10.1002/NET.3230220106},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Rote92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Rote92,
author = {G{\"{u}}nter Rote},
editor = {David Avis},
title = {Degenerate Convex Hulls in High Dimensions without Extra Storage},
booktitle = {Proceedings of the Eighth Annual Symposium on Computational Geometry,
Berlin, Germany, June 10-12, 1992},
pages = {26--32},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/142675.142685},
doi = {10.1145/142675.142685},
timestamp = {Mon, 14 Jun 2021 16:24:47 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Rote92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Rote92,
author = {G{\"{u}}nter Rote},
editor = {Werner Kuich},
title = {A New Metric Between Polygons and How to Compute it},
booktitle = {Automata, Languages and Programming, 19th International Colloquium,
ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {623},
pages = {404--415},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55719-9\_92},
doi = {10.1007/3-540-55719-9\_92},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Rote92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rote91,
author = {G{\"{u}}nter Rote},
title = {Computing the Minimum Hausdorff Distance Between Two Point Sets on
a Line Under Translation},
journal = {Inf. Process. Lett.},
volume = {38},
number = {3},
pages = {123--127},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90233-8},
doi = {10.1016/0020-0190(91)90233-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rote91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RoteWZW91,
author = {G{\"{u}}nter Rote and
Gerhard J. Woeginger and
Binhai Zhu and
Zhengyan Wang},
title = {Counting k-Subsets and Convex k-gons in the Plane},
journal = {Inf. Process. Lett.},
volume = {38},
number = {3},
pages = {149--151},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90237-C},
doi = {10.1016/0020-0190(91)90237-C},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RoteWZW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/CapoyleasRW91,
author = {Vasilis Capoyleas and
G{\"{u}}nter Rote and
Gerhard J. Woeginger},
title = {Geometric Clusterings},
journal = {J. Algorithms},
volume = {12},
number = {2},
pages = {341--356},
year = {1991},
url = {https://doi.org/10.1016/0196-6774(91)90007-L},
doi = {10.1016/0196-6774(91)90007-L},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/CapoyleasRW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/BurkardRYY90,
author = {Rainer E. Burkard and
G{\"{u}}nter Rote and
En{-}Yu Yao and
Zhongliang Yu},
title = {Shortest polygonal paths in space},
journal = {Computing},
volume = {45},
number = {1},
pages = {51--68},
year = {1990},
url = {https://doi.org/10.1007/BF02250584},
doi = {10.1007/BF02250584},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/BurkardRYY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/MitchellRW90,
author = {Joseph S. B. Mitchell and
G{\"{u}}nter Rote and
Gerhard J. Woeginger},
editor = {Raimund Seidel},
title = {Minimum-Link Paths Among Obstacles in the Plane},
booktitle = {Proceedings of the Sixth Annual Symposium on Computational Geometry,
Berkeley, CA, USA, June 6-8, 1990},
pages = {63--72},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/98524.98537},
doi = {10.1145/98524.98537},
timestamp = {Mon, 14 Jun 2021 16:24:54 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/MitchellRW90.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 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/FleischerMRWY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/HilfingerLR90,
author = {Paul N. Hilfinger and
Eugene L. Lawler and
G{\"{u}}nter Rote},
editor = {Peter Gritzmann and
Bernd Sturmfels},
title = {Flattening a Rooted Tree},
booktitle = {Applied Geometry And Discrete Mathematics, Proceedings of a {DIMACS}
Workshop, Providence, Rhode Island, USA, September 18, 1990},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {4},
pages = {335--340},
publisher = {{DIMACS/AMS}},
year = {1990},
url = {https://doi.org/10.1090/dimacs/004/26},
doi = {10.1090/DIMACS/004/26},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/HilfingerLR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SchwarzkopfFRW90,
author = {Otfried Schwarzkopf and
Ulrich Fuchs and
G{\"{u}}nter Rote and
Emo Welzl},
editor = {Christian Choffrut and
Thomas Lengauer},
title = {Approximation of Convex Figures by Pairs of Rectangles},
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 = {240--249},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52282-4\_47},
doi = {10.1007/3-540-52282-4\_47},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SchwarzkopfFRW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/PollackSR89,
author = {Richard Pollack and
Micha Sharir and
G{\"{u}}nter Rote},
title = {Computing the Geodesic Center of a Simple Polygon},
journal = {Discret. Comput. Geom.},
volume = {4},
pages = {611--626},
year = {1989},
url = {https://doi.org/10.1007/BF02187751},
doi = {10.1007/BF02187751},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/PollackSR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EdelsbrunnerRW89,
author = {Herbert Edelsbrunner and
G{\"{u}}nter Rote and
Emo Welzl},
title = {Testing the Necklace Condition for Shortest Tours and Optimal Factors
in the Plane},
journal = {Theor. Comput. Sci.},
volume = {66},
number = {2},
pages = {157--180},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90133-3},
doi = {10.1016/0304-3975(89)90133-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EdelsbrunnerRW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/RoteV87,
author = {G{\"{u}}nter Rote and
Milan Vlach},
title = {Book review},
journal = {Z. Oper. Research},
volume = {31},
number = {1},
year = {1987},
url = {https://doi.org/10.1007/BF01258609},
doi = {10.1007/BF01258609},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/RoteV87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EdelsbrunnerRW87,
author = {Herbert Edelsbrunner and
G{\"{u}}nter Rote and
Emo Welzl},
editor = {Thomas Ottmann},
title = {Testing the Necklace Condition for Shortest Tours and Optimal Factors
in the Plane},
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 = {364--375},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-18088-5\_31},
doi = {10.1007/3-540-18088-5\_31},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EdelsbrunnerRW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/awoc/Rote86,
author = {G{\"{u}}nter Rote},
editor = {Fillia Makedon and
Kurt Mehlhorn and
Theodore S. Papatheodorou and
Paul G. Spirakis},
title = {On the Connection Between Hexagonal and Unidirectional Rectangular
Systolic Arrays},
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 = {70--83},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-16766-8\_7},
doi = {10.1007/3-540-16766-8\_7},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/awoc/Rote86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Rote85,
author = {G{\"{u}}nter Rote},
title = {A systolic array algorithm for the algebraic path problem (shortest
paths; Matrix inversion)},
journal = {Computing},
volume = {34},
number = {3},
pages = {191--219},
year = {1985},
url = {https://doi.org/10.1007/BF02253318},
doi = {10.1007/BF02253318},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Rote85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-11 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
