Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jörg-Rüdiger Sack
@article{DBLP:journals/comgeo/AhnMS22,
author = {Hee{-}Kap Ahn and
Tamara Mtsentlintze and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {{CGTA} Awards},
journal = {Comput. Geom.},
volume = {107},
pages = {101896},
year = {2022},
url = {https://doi.org/10.1016/j.comgeo.2022.101896},
doi = {10.1016/J.COMGEO.2022.101896},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/AhnMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BauernoppelMS22,
author = {Frank Bauern{\"{o}}ppel and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {An {\(\Omega\)}(\emph{n}\({}^{\mbox{\emph{d}}}\)) lower bound on the
number of cell crossings for weighted shortest paths in \emph{d}-dimensional
polyhedral structures},
journal = {Comput. Geom.},
volume = {107},
pages = {101897},
year = {2022},
url = {https://doi.org/10.1016/j.comgeo.2022.101897},
doi = {10.1016/J.COMGEO.2022.101897},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/BauernoppelMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KleinKLSS22,
author = {Rolf Klein and
David K{\"{u}}bel and
Elmar Langetepe and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Barbara Schwarzwald},
title = {A new model and algorithms in firefighting theory},
journal = {Discret. Appl. Math.},
volume = {319},
pages = {296--309},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2021.12.005},
doi = {10.1016/J.DAM.2021.12.005},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KleinKLSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fgcs/CroftSS22,
author = {William L. Croft and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Wei Shi},
title = {Differentially private facial obfuscation via generative adversarial
networks},
journal = {Future Gener. Comput. Syst.},
volume = {129},
pages = {358--379},
year = {2022},
url = {https://doi.org/10.1016/j.future.2021.11.032},
doi = {10.1016/J.FUTURE.2021.11.032},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fgcs/CroftSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaheshwariNS22,
author = {Anil Maheshwari and
Arash Nouri and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Shortest paths among transient obstacles},
journal = {J. Comb. Optim.},
volume = {43},
number = {5},
pages = {1036--1074},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00604-1},
doi = {10.1007/S10878-020-00604-1},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MaheshwariNS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcst/CroftSS22,
author = {William L. Croft and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Wei Shi},
title = {Differential Privacy via a Truncated and Normalized Laplace Mechanism},
journal = {J. Comput. Sci. Technol.},
volume = {37},
number = {2},
pages = {369--388},
year = {2022},
url = {https://doi.org/10.1007/s11390-020-0193-z},
doi = {10.1007/S11390-020-0193-Z},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcst/CroftSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joi/CroftS22,
author = {William L. Croft and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Predicting the citation count and CiteScore of journals one year in
advance},
journal = {J. Informetrics},
volume = {16},
number = {4},
pages = {101349},
year = {2022},
url = {https://doi.org/10.1016/j.joi.2022.101349},
doi = {10.1016/J.JOI.2022.101349},
timestamp = {Tue, 03 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/joi/CroftS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-12908,
author = {William L. Croft and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Predicting the Citation Count and CiteScore of Journals One Year in
Advance},
journal = {CoRR},
volume = {abs/2210.12908},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.12908},
doi = {10.48550/ARXIV.2210.12908},
eprinttype = {arXiv},
eprint = {2210.12908},
timestamp = {Fri, 28 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-12908.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FriggstadSS21,
author = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Special Issue on Algorithms and Data Structures {(WADS} 2019)},
journal = {Algorithmica},
volume = {83},
number = {3},
pages = {775},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00804-z},
doi = {10.1007/S00453-021-00804-Z},
timestamp = {Thu, 18 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FriggstadSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apin/NahariGBS21,
author = {Mohammad Khodizadeh Nahari and
Nasser Ghadiri and
Ahmad Baraani{-}Dastjerdi and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {A novel similarity measure for spatial entity resolution based on
data granularity model: Managing inconsistencies in place descriptions},
journal = {Appl. Intell.},
volume = {51},
number = {8},
pages = {6104--6123},
year = {2021},
url = {https://doi.org/10.1007/s10489-020-01959-y},
doi = {10.1007/S10489-020-01959-Y},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apin/NahariGBS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppna/CroftSS21,
author = {William L. Croft and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Wei Shi},
title = {Obfuscation of images via differential privacy: From facial images
to general images},
journal = {Peer-to-Peer Netw. Appl.},
volume = {14},
number = {3},
pages = {1705--1733},
year = {2021},
url = {https://doi.org/10.1007/s12083-021-01091-9},
doi = {10.1007/S12083-021-01091-9},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ppna/CroftSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-11072,
author = {William L. Croft and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Wei Shi},
title = {Obfuscation of Images via Differential Privacy: From Facial Images
to General Images},
journal = {CoRR},
volume = {abs/2102.11072},
year = {2021},
url = {https://arxiv.org/abs/2102.11072},
eprinttype = {arXiv},
eprint = {2102.11072},
timestamp = {Fri, 11 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-11072.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/EllenS20,
author = {Faith Ellen and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Preface},
journal = {Comput. Geom.},
volume = {89},
pages = {101632},
year = {2020},
url = {https://doi.org/10.1016/j.comgeo.2020.101632},
doi = {10.1016/J.COMGEO.2020.101632},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/EllenS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/FriggstadSS20,
author = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Preface},
journal = {Comput. Geom.},
volume = {91},
pages = {101671},
year = {2020},
url = {https://doi.org/10.1016/j.comgeo.2020.101671},
doi = {10.1016/J.COMGEO.2020.101671},
timestamp = {Thu, 23 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/FriggstadSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tdp/CroftSS20,
author = {William Lee Croft and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Wei Shi},
title = {The Impact of Range Constraints on Utility in the Design of Differentially
Private Mechanisms},
journal = {Trans. Data Priv.},
volume = {13},
number = {3},
pages = {171--200},
year = {2020},
url = {http://www.tdp.cat/issues16/abs.a378a19.php},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tdp/CroftSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/KleinKLSS20,
author = {Rolf Klein and
David K{\"{u}}bel and
Elmar Langetepe and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Barbara Schwarzwald},
editor = {Manoj Changat and
Sandip Das},
title = {A New Model in Firefighting Theory},
booktitle = {Algorithms and Discrete Applied Mathematics - 6th International Conference,
{CALDAM} 2020, Hyderabad, India, February 13-15, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12016},
pages = {371--383},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-39219-2\_30},
doi = {10.1007/978-3-030-39219-2\_30},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/caldam/KleinKLSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BauernoppelMS20,
author = {Frank Bauern{\"{o}}ppel and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {An {\textdollar}{\textbackslash}varOmega (n{\^{}}3){\textdollar} Lower
Bound on the Number of Cell Crossings for Weighted Shortest Paths
in 3-Dimensional Polyhedral Structures},
booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12118},
pages = {235--246},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61792-9\_19},
doi = {10.1007/978-3-030-61792-9\_19},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/BauernoppelMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GheibiMS19,
author = {Amin Gheibi and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Weighted minimum backward Fr{\'{e}}chet distance},
journal = {Theor. Comput. Sci.},
volume = {783},
pages = {9--21},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.03.015},
doi = {10.1016/J.TCS.2019.03.015},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GheibiMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cdmake/CroftS019,
author = {William L. Croft and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Wei Shi},
editor = {Andreas Holzinger and
Peter Kieseberg and
A Min Tjoa and
Edgar R. Weippl},
title = {Differentially Private Obfuscation of Facial Images},
booktitle = {Machine Learning and Knowledge Extraction - Third {IFIP} {TC} 5, {TC}
12, {WG} 8.4, {WG} 8.9, {WG} 12.9 International Cross-Domain Conference,
{CD-MAKE} 2019, Canterbury, UK, August 26-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11713},
pages = {229--249},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-29726-8\_15},
doi = {10.1007/978-3-030-29726-8\_15},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cdmake/CroftS019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2019,
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Algorithms and Data Structures - 16th International Symposium, {WADS}
2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11646},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9},
doi = {10.1007/978-3-030-24766-9},
isbn = {978-3-030-24765-2},
timestamp = {Wed, 31 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-00602,
author = {William Lee Croft and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Wei Shi},
title = {Differential Privacy Via a Truncated and Normalized Laplace Mechanism},
journal = {CoRR},
volume = {abs/1911.00602},
year = {2019},
url = {http://arxiv.org/abs/1911.00602},
eprinttype = {arXiv},
eprint = {1911.00602},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-00602.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-10341,
author = {Rolf Klein and
David K{\"{u}}bel and
Elmar Langetepe and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Barbara Schwarzwald},
title = {A New Model in Firefighting Theory},
journal = {CoRR},
volume = {abs/1911.10341},
year = {2019},
url = {http://arxiv.org/abs/1911.10341},
eprinttype = {arXiv},
eprint = {1911.10341},
timestamp = {Tue, 03 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-10341.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GheibiMSS18,
author = {Amin Gheibi and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Christian Scheffer},
title = {Path Refinement in Weighted Regions},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3766--3802},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0414-9},
doi = {10.1007/S00453-018-0414-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GheibiMSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Sack18,
author = {J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Editor's note},
journal = {Comput. Geom.},
volume = {69},
pages = {1},
year = {2018},
url = {https://doi.org/10.1016/j.comgeo.2017.11.002},
doi = {10.1016/J.COMGEO.2017.11.002},
timestamp = {Wed, 20 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Sack18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/MaheshwariSS18,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Christian Scheffer},
title = {Approximating the integral Fr{\'{e}}chet distance},
journal = {Comput. Geom.},
volume = {70-71},
pages = {13--30},
year = {2018},
url = {https://doi.org/10.1016/j.comgeo.2018.01.001},
doi = {10.1016/J.COMGEO.2018.01.001},
timestamp = {Mon, 29 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/MaheshwariSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/MaheshwariNS18,
author = {Anil Maheshwari and
Arash Nouri and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Stephane Durocher and
Shahin Kamali},
title = {Time-Dependent Shortest Path Queries Among Growing Discs},
booktitle = {Proceedings of the 30th Canadian Conference on Computational Geometry,
{CCCG} 2018, August 8-10, 2018, University of Manitoba, Winnipeg,
Manitoba, Canada},
pages = {288--295},
year = {2018},
url = {http://www.cs.umanitoba.ca/\%7Ecccg2018/papers/session6A-p2.pdf},
timestamp = {Thu, 12 Mar 2020 11:28:29 +0100},
biburl = {https://dblp.org/rec/conf/cccg/MaheshwariNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/MaheshwariNS18,
author = {Anil Maheshwari and
Arash Nouri and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Donghyun Kim and
R. N. Uma and
Alexander Zelikovsky},
title = {Rectilinear Shortest Paths Among Transient Obstacles},
booktitle = {Combinatorial Optimization and Applications - 12th International Conference,
{COCOA} 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11346},
pages = {19--34},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04651-4\_2},
doi = {10.1007/978-3-030-04651-4\_2},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/MaheshwariNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-01181,
author = {Arash Nouri and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Query Shortest Paths Amidst Growing Discs},
journal = {CoRR},
volume = {abs/1804.01181},
year = {2018},
url = {http://arxiv.org/abs/1804.01181},
eprinttype = {arXiv},
eprint = {1804.01181},
timestamp = {Tue, 28 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-01181.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-01984,
author = {Anil Maheshwari and
Arash Nouri and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Time-Dependent Shortest Path Queries Among Growing Discs},
journal = {CoRR},
volume = {abs/1808.01984},
year = {2018},
url = {http://arxiv.org/abs/1808.01984},
eprinttype = {arXiv},
eprint = {1808.01984},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-01984.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-08898,
author = {Anil Maheshwari and
Arash Nouri and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Rectilinear Shortest Paths Among Transient Obstacles},
journal = {CoRR},
volume = {abs/1809.08898},
year = {2018},
url = {http://arxiv.org/abs/1809.08898},
eprinttype = {arXiv},
eprint = {1809.08898},
timestamp = {Fri, 05 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-08898.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgs/CroftSSC17,
author = {William Lee Croft and
Wei Shi and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jean{-}Pierre Corriveau},
title = {Comparison of approaches of geographic partitioning for data anonymization},
journal = {J. Geogr. Syst.},
volume = {19},
number = {3},
pages = {221--248},
year = {2017},
url = {https://doi.org/10.1007/s10109-017-0251-4},
doi = {10.1007/S10109-017-0251-4},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgs/CroftSSC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlbs/NussbaumOS17,
author = {Doron Nussbaum and
Masoud T. Omran and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Maintaining anonymity using -privacy},
journal = {J. Locat. Based Serv.},
volume = {11},
number = {1},
pages = {1--28},
year = {2017},
url = {https://doi.org/10.1080/17489725.2017.1363419},
doi = {10.1080/17489725.2017.1363419},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jlbs/NussbaumOS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2017,
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2},
doi = {10.1007/978-3-319-62127-2},
isbn = {978-3-319-62126-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gis/CroftSSC16,
author = {William Lee Croft and
Wei Shi and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jean{-}Pierre Corriveau},
title = {Location-based anonymization: comparison and evaluation of the Voronoi-based
aggregation system},
journal = {Int. J. Geogr. Inf. Sci.},
volume = {30},
number = {11},
pages = {2253--2275},
year = {2016},
url = {https://doi.org/10.1080/13658816.2016.1172314},
doi = {10.1080/13658816.2016.1172314},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gis/CroftSSC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MaheshwariSS16,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Christian Scheffer},
editor = {Rasmus Pagh},
title = {Approximating the Integral Fr{\'{e}}chet Distance},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {26:1--26:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.26},
doi = {10.4230/LIPICS.SWAT.2016.26},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/swat/MaheshwariSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/GheibiMS15,
author = {Amin Gheibi and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Weighted Minimum Backward Frechet Distance},
booktitle = {Proceedings of the 27th Canadian Conference on Computational Geometry,
{CCCG} 2015, Kingston, Ontario, Canada, August 10-12, 2015},
publisher = {Queen's University, Ontario, Canada},
year = {2015},
url = {http://research.cs.queensu.ca/cccg2015/CCCG15-papers/17.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/GheibiMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ttcs/GheibiMS15,
author = {Amin Gheibi and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Mohammad Taghi Hajiaghayi and
Mohammad Reza Mousavi},
title = {Minimizing Walking Length in Map Matching},
booktitle = {Topics in Theoretical Computer Science - The First {IFIP} {WG} 1.8
International Conference, {TTCS} 2015, Tehran, Iran, August 26-28,
2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9541},
pages = {105--120},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-28678-5\_8},
doi = {10.1007/978-3-319-28678-5\_8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ttcs/GheibiMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2015,
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3},
doi = {10.1007/978-3-319-21840-3},
isbn = {978-3-319-21839-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CroftSSC15,
author = {William Lee Croft and
Wei Shi and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jean{-}Pierre Corriveau},
title = {Geographic Partitioning Techniques for the Anonymization of Health
Care Data},
journal = {CoRR},
volume = {abs/1505.06786},
year = {2015},
url = {http://arxiv.org/abs/1505.06786},
eprinttype = {arXiv},
eprint = {1505.06786},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CroftSSC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CroftSSC15a,
author = {William Lee Croft and
Wei Shi and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jean{-}Pierre Corriveau},
title = {A Novel Geographic Partitioning System for Anonymizing Health Care
Data},
journal = {CoRR},
volume = {abs/1505.06939},
year = {2015},
url = {http://arxiv.org/abs/1505.06939},
eprinttype = {arXiv},
eprint = {1505.06939},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CroftSSC15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MaheshwariSS15,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Christian Scheffer},
title = {Approximating the Integral Fr{\'{e}}chet Distance},
journal = {CoRR},
volume = {abs/1512.03359},
year = {2015},
url = {http://arxiv.org/abs/1512.03359},
eprinttype = {arXiv},
eprint = {1512.03359},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MaheshwariSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MaheshwariSSZ14,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Kaveh Shahbaz and
Hamid Zarrabi{-}Zadeh},
title = {Improved Algorithms for Partial Curve Matching},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {641--657},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9758-3},
doi = {10.1007/S00453-013-9758-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MaheshwariSSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GhodsiMBSZ14,
author = {Mohammad Ghodsi and
Anil Maheshwari and
Mostafa Nouri Baygi and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Hamid Zarrabi{-}Zadeh},
title = {{\(\alpha\)}-Visibility},
journal = {Comput. Geom.},
volume = {47},
number = {3},
pages = {435--446},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2013.10.004},
doi = {10.1016/J.COMGEO.2013.10.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/GhodsiMBSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CarufelGMSS14,
author = {Jean{-}Lou De Carufel and
Amin Gheibi and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Christian Scheffer},
title = {Similarity of polygonal curves in the presence of outliers},
journal = {Comput. Geom.},
volume = {47},
number = {5},
pages = {625--641},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2014.01.002},
doi = {10.1016/J.COMGEO.2014.01.002},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/CarufelGMSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/OmranS14,
author = {Masoud T. Omran and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Zhipeng Cai and
Alex Zelikovsky and
Anu G. Bourgeois},
title = {Improved Approximation for Time-Dependent Shortest Paths},
booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON}
2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8591},
pages = {453--464},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08783-2\_39},
doi = {10.1007/978-3-319-08783-2\_39},
timestamp = {Thu, 20 Aug 2020 15:36:49 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/OmranS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/GheibiMSS14,
author = {Amin Gheibi and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Christian Scheffer},
editor = {Yan Huang and
Markus Schneider and
Michael Gertz and
John Krumm and
Jagan Sankaranarayanan},
title = {Minimum backward fr{\'{e}}chet distance},
booktitle = {Proceedings of the 22nd {ACM} {SIGSPATIAL} International Conference
on Advances in Geographic Information Systems, Dallas/Fort Worth,
TX, USA, November 4-7, 2014},
pages = {381--388},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2666310.2666418},
doi = {10.1145/2666310.2666418},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gis/GheibiMSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AleksandrovDMS13,
author = {Lyudmil Aleksandrov and
Hristo N. Djidjev and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {An Approximation Algorithm for Computing Shortest Paths in Weighted
3-d Domains},
journal = {Discret. Comput. Geom.},
volume = {50},
number = {1},
pages = {124--184},
year = {2013},
url = {https://doi.org/10.1007/s00454-013-9486-0},
doi = {10.1007/S00454-013-9486-0},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/AleksandrovDMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/OmranSZ13,
author = {Masoud T. Omran and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Hamid Zarrabi{-}Zadeh},
title = {Finding paths with minimum shared edges},
journal = {J. Comb. Optim.},
volume = {26},
number = {4},
pages = {709--722},
year = {2013},
url = {https://doi.org/10.1007/s10878-012-9462-2},
doi = {10.1007/S10878-012-9462-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/OmranSZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/GheibiMS13,
author = {Amin Gheibi and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Weighted Region Problem in Arrangement of Lines},
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\_62.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/GheibiMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2013,
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {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},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6},
doi = {10.1007/978-3-642-40104-6},
isbn = {978-3-642-40103-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/DuckhamDSS13,
author = {Matt Duckham and
Stefan Dulman and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Monika Sester},
title = {Geosensor Networks: Bridging Algorithms and Applications (Dagstuhl
Seminar 13492)},
journal = {Dagstuhl Reports},
volume = {3},
number = {12},
pages = {17--42},
year = {2013},
url = {https://doi.org/10.4230/DagRep.3.12.17},
doi = {10.4230/DAGREP.3.12.17},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/DuckhamDSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DehneOS12,
author = {Frank Dehne and
Masoud T. Omran and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Shortest Paths in Time-Dependent {FIFO} Networks},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {416--435},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9461-6},
doi = {10.1007/S00453-010-9461-6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DehneOS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NussbaumPSUZ12,
author = {Doron Nussbaum and
Shuye Pu and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Takeaki Uno and
Hamid Zarrabi{-}Zadeh},
title = {Finding Maximum Edge Bicliques in Convex Bipartite Graphs},
journal = {Algorithmica},
volume = {64},
number = {2},
pages = {311--325},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9486-x},
doi = {10.1007/S00453-010-9486-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NussbaumPSUZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/MehlhornS12,
author = {Kurt Mehlhorn and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {CGTA-Awards 2011},
journal = {Comput. Geom.},
volume = {45},
number = {4},
pages = {139},
year = {2012},
url = {https://doi.org/10.1016/j.comgeo.2011.11.005},
doi = {10.1016/J.COMGEO.2011.11.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/MehlhornS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/NussbaumOS12,
author = {Doron Nussbaum and
Masoud T. Omran and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Mohamed H. Ali and
Farnoush Banaei Kashani and
Erik G. Hoel},
title = {Techniques to protect privacy against inference attacks in location
based services},
booktitle = {Proceedings of the 3rd {ACM} {SIGSPATIAL} International Workshop on
GeoStreaming, IWGS@SIGSPATIAL 2012, Redondo Beach, California, USA,
November 6, 2012},
pages = {58--67},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2442968.2442976},
doi = {10.1145/2442968.2442976},
timestamp = {Tue, 26 Nov 2019 08:52:06 +0100},
biburl = {https://dblp.org/rec/conf/gis/NussbaumOS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GhodsiMNSZ12,
author = {Mohammad Ghodsi and
Anil Maheshwari and
Mostafa Nouri and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Hamid Zarrabi{-}Zadeh},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {{\(\alpha\)}-Visibility},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {1--12},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_1},
doi = {10.1007/978-3-642-31155-0\_1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GhodsiMNSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-4559,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Kaveh Shahbaz},
title = {Visiting All Sites with Your Dog},
journal = {CoRR},
volume = {abs/1211.4559},
year = {2012},
url = {http://arxiv.org/abs/1211.4559},
eprinttype = {arXiv},
eprint = {1211.4559},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-4559.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-1617,
author = {Jean{-}Lou De Carufel and
Amin Gheibi and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Christian Scheffer},
title = {Similarity of Polygonal Curves in the Presence of Outliers},
journal = {CoRR},
volume = {abs/1212.1617},
year = {2012},
url = {http://arxiv.org/abs/1212.1617},
eprinttype = {arXiv},
eprint = {1212.1617},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-1617.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/MaheshwariSSZ11,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Kaveh Shahbaz and
Hamid Zarrabi{-}Zadeh},
title = {Fr{\'{e}}chet distance with speed limits},
journal = {Comput. Geom.},
volume = {44},
number = {2},
pages = {110--120},
year = {2011},
url = {https://doi.org/10.1016/j.comgeo.2010.09.008},
doi = {10.1016/J.COMGEO.2010.09.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/MaheshwariSSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/josis/Sack11,
author = {J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Editorial},
journal = {J. Spatial Inf. Sci.},
volume = {3},
number = {1},
pages = {1--2},
year = {2011},
url = {https://doi.org/10.5311/JOSIS.2011.3.1},
doi = {10.5311/JOSIS.2011.3.1},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/josis/Sack11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/DuckhamNSS11,
author = {Matt Duckham and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Efficient, Decentralized Computation of the Topology of Spatial Regions},
journal = {{IEEE} Trans. Computers},
volume = {60},
number = {8},
pages = {1100--1113},
year = {2011},
url = {https://doi.org/10.1109/TC.2010.177},
doi = {10.1109/TC.2010.177},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/DuckhamNSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/MaheshwariSSZ11,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Kaveh Shahbaz and
Hamid Zarrabi{-}Zadeh},
title = {Staying Close to a Curve},
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/paper97.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/MaheshwariSSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/OmranSZ11,
author = {Masoud T. Omran and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Hamid Zarrabi{-}Zadeh},
editor = {Bin Fu and
Ding{-}Zhu Du},
title = {Finding Paths with Minimum Shared Edges},
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 = {567--578},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22685-4\_49},
doi = {10.1007/978-3-642-22685-4\_49},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/OmranSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MaheshwariSSZ11,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Kaveh Shahbaz and
Hamid Zarrabi{-}Zadeh},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Improved Algorithms for Partial Curve Matching},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {518--529},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_44},
doi = {10.1007/978-3-642-23719-5\_44},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/MaheshwariSSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2011,
editor = {Frank Dehne and
John Iacono and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Algorithms and Data Structures - 12th International Symposium, {WADS}
2011, New York, NY, USA, August 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6844},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22300-6},
doi = {10.1007/978-3-642-22300-6},
isbn = {978-3-642-22299-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-3165,
author = {Lyudmil Aleksandrov and
Hristo N. Djidjev and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {An Approximation Algorithm for Computing Shortest Paths in Weighted
3-d Domains},
journal = {CoRR},
volume = {abs/1102.3165},
year = {2011},
url = {http://arxiv.org/abs/1102.3165},
eprinttype = {arXiv},
eprint = {1102.3165},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-3165.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/MehlhornS10,
author = {Kurt Mehlhorn and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Editorial},
journal = {Comput. Geom.},
volume = {43},
number = {6-7},
pages = {555},
year = {2010},
url = {https://doi.org/10.1016/j.comgeo.2010.03.001},
doi = {10.1016/J.COMGEO.2010.03.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/MehlhornS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AleksandrovDGMNS10,
author = {Lyudmil Aleksandrov and
Hristo N. Djidjev and
Hua Guo and
Anil Maheshwari and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral
Surfaces},
journal = {Discret. Comput. Geom.},
volume = {44},
number = {4},
pages = {762--801},
year = {2010},
url = {https://doi.org/10.1007/s00454-009-9204-0},
doi = {10.1007/S00454-009-9204-0},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/AleksandrovDGMNS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/MaheshwariSSZ10,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Kaveh Shahbaz and
Hamid Zarrabi{-}Zadeh},
title = {Speed-constrained geodesic fr{\'{e}}chet distance inside a simple
polygon},
booktitle = {Proceedings of the 22nd Annual Canadian Conference on Computational
Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010},
pages = {179--182},
year = {2010},
url = {http://cccg.ca/proceedings/2010/paper48.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/MaheshwariSSZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/NussbaumPSUZ10,
author = {Doron Nussbaum and
Shuye Pu and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Takeaki Uno and
Hamid Zarrabi{-}Zadeh},
editor = {My T. Thai and
Sartaj Sahni},
title = {Finding Maximum Edge Bicliques in Convex Bipartite Graphs},
booktitle = {Computing and Combinatorics, 16th Annual International Conference,
{COCOON} 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6196},
pages = {140--149},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14031-0\_17},
doi = {10.1007/978-3-642-14031-0\_17},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/NussbaumPSUZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2010P10491,
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Bettina Speckmann and
E. Emiel van Loon and
Robert Weibel},
title = {Representation, Analysis and Visualization of Moving Objects, 05.12.
- 10.12.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10491},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/portals/10491/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2010P10491.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BergSSDBSK10,
author = {Mark de Berg and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Bettina Speckmann and
Anne Driemel and
Maike Buchin and
Monika Sester and
Marc J. van Kreveld},
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Bettina Speckmann and
E. Emiel van Loon and
Robert Weibel},
title = {10491 Results of the break-out group: Aggregation},
booktitle = {Representation, Analysis and Visualization of Moving Objects, 05.12.
- 10.12.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10491},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2011/2987/},
timestamp = {Thu, 10 Jun 2021 13:02:09 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BergSSDBSK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/LoonSBBBKGM10,
author = {Emiel van Loon and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Kevin Buchin and
Maike Buchin and
Mark de Berg and
Marc J. van Kreveld and
Joachim Gudmundsson and
David M. Mountain},
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Bettina Speckmann and
E. Emiel van Loon and
Robert Weibel},
title = {10491 Results of the break-out group: Gulls Data},
booktitle = {Representation, Analysis and Visualization of Moving Objects, 05.12.
- 10.12.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10491},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2011/2991/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/LoonSBBBKGM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/SackSLW10,
author = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Bettina Speckmann and
E. Emiel van Loon and
Robert Weibel},
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Bettina Speckmann and
E. Emiel van Loon and
Robert Weibel},
title = {10491 Abstracts Collection - Representation, Analysis and Visualization
of Moving Objects},
booktitle = {Representation, Analysis and Visualization of Moving Objects, 05.12.
- 10.12.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10491},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2011/3087/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/SackSLW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/SackSLW10a,
author = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Bettina Speckmann and
Emiel van Loon and
Robert Weibel},
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Bettina Speckmann and
E. Emiel van Loon and
Robert Weibel},
title = {10491 Summary - Representation, Analysis and Visualization of Moving
Objects},
booktitle = {Representation, Analysis and Visualization of Moving Objects, 05.12.
- 10.12.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10491},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2011/3086/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/SackSLW10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/MehlhornSZ09,
author = {Kurt Mehlhorn and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Joseph Zaks},
title = {Note on the paper "K-vertex guarding simple polygons" [Computational
Geometry 42 {(4)} (May 2009) 352-361]},
journal = {Comput. Geom.},
volume = {42},
number = {6-7},
pages = {722},
year = {2009},
url = {https://doi.org/10.1016/j.comgeo.2009.03.001},
doi = {10.1016/J.COMGEO.2009.03.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/MehlhornSZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/geoinformatica/BergerKNSY09,
author = {Florian Berger and
Rolf Klein and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jiehua Yi},
title = {A meeting scheduling problem respecting time and space},
journal = {GeoInformatica},
volume = {13},
number = {4},
pages = {453--481},
year = {2009},
url = {https://doi.org/10.1007/s10707-008-0053-4},
doi = {10.1007/S10707-008-0053-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/geoinformatica/BergerKNSY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/MaheshwariSS09,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Kaveh Shahbaz},
title = {Computing Fr{\'{e}}chet Distance with Speed Limits},
booktitle = {Proceedings of the 21st Annual Canadian Conference on Computational
Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009},
pages = {107--110},
year = {2009},
url = {http://cccg.ca/proceedings/2009/cccg09\_28.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/MaheshwariSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/DehneOS09,
author = {Frank K. H. A. Dehne and
Masoud T. Omran and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Shashi Shekhar and
Glenn Geers and
Betsy George and
Sangho Kim},
title = {Shortest paths in time-dependent {FIFO} networks using edge load forecasts},
booktitle = {Proceedings of the Second International Workshop on Computational
Transportation Science, {IWCTS} 2009, November 3, 2009, Seattle, Washington,
USA, Proceedings},
pages = {1--6},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1645373.1645374},
doi = {10.1145/1645373.1645374},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gis/DehneOS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2009,
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 = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4},
doi = {10.1007/978-3-642-03367-4},
isbn = {978-3-642-03366-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DehneS08,
author = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Introduction to Special Issue},
journal = {Algorithmica},
volume = {50},
number = {2},
pages = {173--174},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9038-1},
doi = {10.1007/S00453-007-9038-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DehneS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/BergerKNSY08,
author = {Florian Berger and
Rolf Klein and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jiehua Yi},
editor = {Rudolf Fleischer and
Jinhui Xu},
title = {A Meeting Scheduling Problem Respecting Time and Space},
booktitle = {Algorithmic Aspects in Information and Management, 4th International
Conference, {AAIM} 2008, Shanghai, China, June 23-25, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5034},
pages = {50--59},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68880-8\_7},
doi = {10.1007/978-3-540-68880-8\_7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/BergerKNSY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/GuoMS08,
author = {Hua Guo and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Rudolf Fleischer and
Jinhui Xu},
title = {Shortest Path Queries in Polygonal Domains},
booktitle = {Algorithmic Aspects in Information and Management, 4th International
Conference, {AAIM} 2008, Shanghai, China, June 23-25, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5034},
pages = {200--211},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68880-8\_20},
doi = {10.1007/978-3-540-68880-8\_20},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/GuoMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2008P8451,
editor = {Wolfgang Bitterlich and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Monika Sester and
Robert Weibel},
title = {Representation, Analysis and Visualization of Moving Objects, 02.11.
- 07.11.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08451},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/portals/08451/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2008P8451.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BitterlichSSW08,
author = {Wolfgang Bitterlich and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Monika Sester and
Robert Weibel},
editor = {Wolfgang Bitterlich and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Monika Sester and
Robert Weibel},
title = {08451 Abstracts Collection - Representation, Analysis and Visualization
of Moving Objects},
booktitle = {Representation, Analysis and Visualization of Moving Objects, 02.11.
- 07.11.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08451},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2009/1877/},
timestamp = {Thu, 10 Jun 2021 13:02:10 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BitterlichSSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BitterlichSSW08a,
author = {Wolfgang Bitterlich and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Monika Sester and
Robert Weibel},
editor = {Wolfgang Bitterlich and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Monika Sester and
Robert Weibel},
title = {08451 Summary Report - Representation, Analysis and Visualization
of Moving Objects},
booktitle = {Representation, Analysis and Visualization of Moving Objects, 02.11.
- 07.11.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08451},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2009/1875/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BitterlichSSW08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlbertANSS07,
author = {Michael H. Albert and
Mike D. Atkinson and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {On the longest increasing subsequence of a circular list},
journal = {Inf. Process. Lett.},
volume = {101},
number = {2},
pages = {55--59},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2006.08.003},
doi = {10.1016/J.IPL.2006.08.003},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlbertANSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurossc/LuNS07,
author = {Kaiyuan Lu and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Gerd Kortuem and
Joe Finney and
Rodger Lea and
Vasughi Sundramoorthy},
title = {GlobeCon - {A} Scalable Framework for Context Aware Computing},
booktitle = {Smart Sensing and Context, Second European Conference, EuroSSC 2007,
Kendal, England, UK, October 23-25, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4793},
pages = {190--206},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75696-5\_12},
doi = {10.1007/978-3-540-75696-5\_12},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/eurossc/LuNS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccsa/GuoMNS07,
author = {Hua Guo and
Anil Maheshwari and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Osvaldo Gervasi and
Marina L. Gavrilova},
title = {Shortest Path Queries Between Geometric Objects on Surfaces},
booktitle = {Computational Science and Its Applications - {ICCSA} 2007, International
Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4705},
pages = {82--95},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74472-6\_7},
doi = {10.1007/978-3-540-74472-6\_7},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/iccsa/GuoMNS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MaheshwariNSY07,
author = {Anil Maheshwari and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jiehua Yi},
editor = {Takeshi Tokuyama},
title = {An \emph{O} {(} \emph{n} \({}^{\mbox{2}}\)log \emph{n} {)} Time Algorithm
for Computing Shortest Paths Amidst Growing Discs in the Plane},
booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
2007, Sendai, Japan, December 17-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {668--680},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_58},
doi = {10.1007/978-3-540-77120-3\_58},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/MaheshwariNSY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2007,
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Norbert Zeh},
title = {Algorithms and Data Structures, 10th International Workshop, {WADS}
2007, Halifax, Canada, August 15-17, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4619},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7},
doi = {10.1007/978-3-540-73951-7},
isbn = {978-3-540-73948-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/2007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colcom/KleinNSY06,
author = {Rolf Klein and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jiehua Yi},
editor = {Enrico Blanzieri and
Tao Zhang},
title = {How to Fit In Another Meeting},
booktitle = {2nd International {ICST} Conference on Collaborative Computing: Networking,
Applications and Worksharing, CollaborateCom 2006, Atlanta, GA, USA,
November 17-20, 2006},
publisher = {{IEEE} Computer Society / {ICST}},
year = {2006},
url = {https://doi.org/10.1109/COLCOM.2006.361845},
doi = {10.1109/COLCOM.2006.361845},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colcom/KleinNSY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AleksandrovDGMNS06,
author = {Lyudmil Aleksandrov and
Hristo N. Djidjev and
Hua Guo and
Anil Maheshwari and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Rastislav Kralovic and
Pawel Urzyczyn},
title = {Approximate Shortest Path Queries on Weighted Polyhedral Surfaces},
booktitle = {Mathematical Foundations of Computer Science 2006, 31st International
Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
August 28-September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4162},
pages = {98--109},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11821069\_9},
doi = {10.1007/11821069\_9},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AleksandrovDGMNS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2006P6101,
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Monika Sester and
Peter van Oosterom and
Michael F. Worboys},
title = {Spatial Data: mining, processing and communicating, 05.03. - 10.03.2006},
series = {Dagstuhl Seminar Proceedings},
volume = {06101},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2006},
url = {http://drops.dagstuhl.de/portals/06101/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2006P6101.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/SackSWO06,
author = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Monika Sester and
Michael F. Worboys and
Peter van Oosterom},
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Monika Sester and
Peter van Oosterom and
Michael F. Worboys},
title = {06101 Report -- Spatial Data: mining, processing and communicating},
booktitle = {Spatial Data: mining, processing and communicating, 05.03. - 10.03.2006},
series = {Dagstuhl Seminar Proceedings},
volume = {06101},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2006},
url = {http://drops.dagstuhl.de/opus/volltexte/2006/590},
timestamp = {Thu, 10 Jun 2021 13:02:09 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/SackSWO06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/SackSWO06a,
author = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Monika Sester and
Michael F. Worboys and
Peter van Oosterom},
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Monika Sester and
Peter van Oosterom and
Michael F. Worboys},
title = {06101 Abstracts Collection -- Spatial Data: mining, processing and
communicating},
booktitle = {Spatial Data: mining, processing and communicating, 05.03. - 10.03.2006},
series = {Dagstuhl Seminar Proceedings},
volume = {06101},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2006},
url = {http://drops.dagstuhl.de/opus/volltexte/2006/591},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/SackSWO06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AleksandrovMS05,
author = {Lyudmil Aleksandrov and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Determining approximate shortest paths on weighted polyhedral surfaces},
journal = {J. {ACM}},
volume = {52},
number = {1},
pages = {25--53},
year = {2005},
url = {https://doi.org/10.1145/1044731.1044733},
doi = {10.1145/1044731.1044733},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AleksandrovMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/parco/NussbaumSY05,
author = {Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Hua Ye},
editor = {Gerhard R. Joubert and
Wolfgang E. Nagel and
Frans J. Peters and
Oscar G. Plata and
P. Tirado and
Emilio L. Zapata},
title = {Concurrent Parallel Shortest Path Computation},
booktitle = {Parallel Computing: Current {\&} Future Issues of High-End Computing,
Proceedings of the International Conference ParCo 2005, 13-16 September
2005, Department of Computer Architecture, University of Malaga, Spain},
series = {John von Neumann Institute for Computing Series},
volume = {33},
pages = {277--284},
publisher = {Central Institute for Applied Mathematics, J{\"{u}}lich, Germany},
year = {2005},
timestamp = {Sat, 16 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/parco/NussbaumSY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2005,
editor = {Frank K. H. A. Dehne and
Alejandro L{\'{o}}pez{-}Ortiz and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Algorithms and Data Structures, 9th International Workshop, {WADS}
2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3608},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11534273},
doi = {10.1007/11534273},
isbn = {3-540-28101-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/giscience/FrankelNS04,
author = {Andras Frankel and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Max J. Egenhofer and
Christian Freksa and
Harvey J. Miller},
title = {Floating-Point Filter for the Line Intersection Algorithm},
booktitle = {Geographic Information Science, Third International Conference, GIScience
2004, Adelphi, MD, USA, October 20-23, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3234},
pages = {94--105},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30231-5\_7},
doi = {10.1007/978-3-540-30231-5\_7},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/giscience/FrankelNS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pc/LanthierNS03,
author = {Mark Lanthier and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Parallel implementation of geometric shortest path algorithms},
journal = {Parallel Comput.},
volume = {29},
number = {10},
pages = {1445--1479},
year = {2003},
url = {https://doi.org/10.1016/j.parco.2003.05.004},
doi = {10.1016/J.PARCO.2003.05.004},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pc/LanthierNS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/AleksandrovMS03,
author = {Lyudmil Aleksandrov and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Andrzej Lingas and
Bengt J. Nilsson},
title = {An Improved Approximation Algorithm for Computing Geometric Shortest
Paths},
booktitle = {Fundamentals of Computation Theory, 14th International Symposium,
{FCT} 2003, Malm{\"{o}}, Sweden, August 12-15, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2751},
pages = {246--257},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45077-1\_23},
doi = {10.1007/978-3-540-45077-1\_23},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/AleksandrovMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2003,
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Michiel H. M. Smid},
title = {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},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/b11837},
doi = {10.1007/B11837},
isbn = {3-540-40545-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LanthierMS01,
author = {Mark Lanthier and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Approximating Shortest Paths on Weighted Polyhedral Surfaces},
journal = {Algorithmica},
volume = {30},
number = {4},
pages = {527--562},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0027-5},
doi = {10.1007/S00453-001-0027-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LanthierMS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KranakisKMSU01,
author = {Evangelos Kranakis and
Danny Krizanc and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jorge Urrutia},
title = {Ray shooting from convex ranges},
journal = {Discret. Appl. Math.},
volume = {108},
number = {3},
pages = {259--267},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00180-3},
doi = {10.1016/S0166-218X(00)00180-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KranakisKMSU01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2001,
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6},
doi = {10.1007/3-540-44634-6},
isbn = {3-540-42423-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/2001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/MehlhornS00,
author = {Kurt Mehlhorn and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Editorial},
journal = {Comput. Geom.},
volume = {17},
number = {1-2},
pages = {1--2},
year = {2000},
url = {https://doi.org/10.1016/S0925-7721(00)00018-3},
doi = {10.1016/S0925-7721(00)00018-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/MehlhornS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/AleksandrovDS00,
author = {Lyudmil Aleksandrov and
Hristo N. Djidjev and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {An O(n log n) Algorithm for Finding a Shortest Central Link Segment},
journal = {Int. J. Comput. Geom. Appl.},
volume = {10},
number = {2},
pages = {157--188},
year = {2000},
url = {https://doi.org/10.1142/S0218195900000103},
doi = {10.1142/S0218195900000103},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/AleksandrovDS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AleksandrovMS00,
author = {Lyudmil Aleksandrov and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Approximation algorithms for geometric shortest path problems},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {286--295},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335339},
doi = {10.1145/335305.335339},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AleksandrovMS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/00/MaheshwariSD00,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Hristo N. Djidjev},
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jorge Urrutia},
title = {Link Distance Problems},
booktitle = {Handbook of Computational Geometry},
pages = {519--558},
publisher = {North Holland / Elsevier},
year = {2000},
url = {https://doi.org/10.1016/b978-044482537-7/50013-9},
doi = {10.1016/B978-044482537-7/50013-9},
timestamp = {Fri, 28 Jun 2019 09:10:30 +0200},
biburl = {https://dblp.org/rec/books/el/00/MaheshwariSD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/el/00/SU2000,
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jorge Urrutia},
title = {Handbook of Computational Geometry},
publisher = {North Holland / Elsevier},
year = {2000},
url = {https://doi.org/10.1016/b978-0-444-82537-7.x5000-1},
doi = {10.1016/B978-0-444-82537-7.X5000-1},
isbn = {978-0-444-82537-7},
timestamp = {Fri, 28 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/el/00/SU2000.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/MehlhornSU99,
author = {Kurt Mehlhorn and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jorge Urrutia},
title = {Editorial},
journal = {Comput. Geom.},
volume = {12},
number = {3-4},
pages = {153--154},
year = {1999},
url = {https://doi.org/10.1016/S0925-7721(99)00010-3},
doi = {10.1016/S0925-7721(99)00010-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/MehlhornSU99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fgcs/HeckerRSW99,
author = {C. Hecker and
David Roytenberg and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Z. Wang},
title = {System development for parallel cellular automata and its applications},
journal = {Future Gener. Comput. Syst.},
volume = {16},
number = {2-3},
pages = {235--247},
year = {1999},
url = {https://doi.org/10.1016/S0167-739X(99)00049-7},
doi = {10.1016/S0167-739X(99)00049-7},
timestamp = {Wed, 19 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fgcs/HeckerRSW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtkinsonS99,
author = {M. D. Atkinson and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Pop-Stacks in Parallel},
journal = {Inf. Process. Lett.},
volume = {70},
number = {2},
pages = {63--67},
year = {1999},
url = {https://doi.org/10.1016/S0020-0190(99)00049-6},
doi = {10.1016/S0020-0190(99)00049-6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtkinsonS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/MaheshwariS99,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation
Problems},
journal = {Parallel Process. Lett.},
volume = {9},
number = {1},
pages = {31--42},
year = {1999},
url = {https://doi.org/10.1142/S0129626499000062},
doi = {10.1142/S0129626499000062},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ppl/MaheshwariS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LanthierMS99,
author = {Mark Lanthier and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Jir{\'{\i}} Wiedermann and
Peter van Emde Boas and
Mogens Nielsen},
title = {Shortest Anisotropic Paths on Terrains},
booktitle = {Automata, Languages and Programming, 26th International Colloquium,
ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1644},
pages = {524--533},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48523-6\_49},
doi = {10.1007/3-540-48523-6\_49},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/LanthierMS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/1999,
editor = {Frank K. H. A. Dehne and
Arvind Gupta and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Algorithms and Data Structures, 6th International Workshop, {WADS}
'99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1663},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48447-7},
doi = {10.1007/3-540-48447-7},
isbn = {3-540-66279-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/1999.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/GhodsiS98,
author = {Mohammad Ghodsi and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {A coarse grained parallel solution to terrain simplification},
booktitle = {Proceedings of the 10th Canadian Conference on Computational Geometry,
McGill University, Montr{\'{e}}al, Qu{\'{e}}bec, Canada,
August 10-12, 1998},
year = {1998},
url = {http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-ghodsi-coarse.ps.gz},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/GhodsiS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AleksandrovLMS98,
author = {Lyudmil Aleksandrov and
Mark Lanthier and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {An epsilon-Approximation for Weighted Shortest Paths on Polyhedral
Surfaces},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {11--22},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054351},
doi = {10.1007/BFB0054351},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AleksandrovLMS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KranakisKMNSU97,
author = {Evangelos Kranakis and
Danny Krizanc and
Anil Maheshwari and
Marc Noy and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jorge Urrutia},
title = {Stage-graph Representations},
journal = {Discret. Appl. Math.},
volume = {75},
number = {1},
pages = {71--80},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(96)00080-7},
doi = {10.1016/S0166-218X(96)00080-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KranakisKMNSU97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BauernoppelKKMSU97,
author = {Frank Bauern{\"{o}}ppel and
Evangelos Kranakis and
Danny Krizanc and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jorge Urrutia},
title = {Planar Stage Graphs: Characterizations and Applications},
journal = {Theor. Comput. Sci.},
volume = {175},
number = {2},
pages = {239--255},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00201-0},
doi = {10.1016/S0304-3975(96)00201-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BauernoppelKKMSU97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/LanthierMS97,
author = {Mark Lanthier and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Jean{-}Daniel Boissonnat},
title = {Approximating Weighted Shortest Paths on Polyhedral Surfaces},
booktitle = {Proceedings of the Thirteenth Annual Symposium on Computational Geometry,
Nice, France, June 4-6, 1997},
pages = {274--283},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/262839.262984},
doi = {10.1145/262839.262984},
timestamp = {Mon, 14 Jun 2021 16:25:04 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/LanthierMS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/LanthierMS97a,
author = {Mark Lanthier and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Jean{-}Daniel Boissonnat},
title = {Approximating Weighted Shortest Paths on Polyhedral Surfaces},
booktitle = {Proceedings of the Thirteenth Annual Symposium on Computational Geometry,
Nice, France, June 4-6, 1997},
pages = {485--486},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/262839.263101},
doi = {10.1145/262839.263101},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/LanthierMS97a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/MaheshwariMS97,
author = {Anil Maheshwari and
Pat Morin and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Progressive TINs: Algorithms and Applications},
booktitle = {{GIS} '97. Proceedings of the 5th International Workshop on Advances
in Geographic Information Systems, November 13-14, 1997, Las Vegas,
Nevada, {USA}},
pages = {24--29},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/267825.267834},
doi = {10.1145/267825.267834},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gis/MaheshwariMS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/HutchinsonMSV97,
author = {David A. Hutchinson and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Radu Velicescu},
editor = {Giuseppe F. Italiano and
Salvatore Orlando},
title = {Early Experiences in Implementing the Buffer Tree},
booktitle = {Workshop on Algorithm Engineering, {WAE} '97, Venezia, Italy, September
11-13, 1997. Proceedings},
pages = {92--103},
publisher = {Universit{\`{a}} Ca' Foscari di Venezia},
year = {1997},
timestamp = {Mon, 10 May 2021 14:20:29 +0200},
biburl = {https://dblp.org/rec/conf/wae/HutchinsonMSV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/1997,
editor = {Frank K. H. A. Dehne and
Andrew Rau{-}Chaplin and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Algorithms and Data Structures, 5th International Workshop, {WADS}
'97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1272},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63307-3},
doi = {10.1007/3-540-63307-3},
isbn = {3-540-63307-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/1997.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/DattaMS96,
author = {Amitava Datta and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Optimal Parallel Algorithms for Direct Dominance Problems},
journal = {Nord. J. Comput.},
volume = {3},
number = {1},
pages = {72--88},
year = {1996},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/DattaMS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/HutchinsonLMNRS96,
author = {David A. Hutchinson and
Mark Lanthier and
Anil Maheshwari and
Doron Nussbaum and
David Roytenberg and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Robert Laurini and
Patrick Bergougnoux and
Kia Makki and
Niki Pissinou},
title = {Parallel Neighbourhood Modelling},
booktitle = {{GIS} '96, Proceedings of the fourth {ACM} workshop on Advances on
Advances in Geographic Information Systems, November 15-16, 1996,
Rockville, Maryland, {USA}},
pages = {25--34},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/258319.258328},
doi = {10.1145/258319.258328},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gis/HutchinsonLMNRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/HutchinsonKLMNRS96,
author = {David A. Hutchinson and
L. K{\"{u}}ttner and
Mark Lanthier and
Anil Maheshwari and
Doron Nussbaum and
David Roytenberg and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Guy E. Blelloch},
title = {Parallel Neighborhood Modeling},
booktitle = {Proceedings of the 8th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '96, Padua, Italy, June 24-26, 1996},
pages = {204--207},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237502.237556},
doi = {10.1145/237502.237556},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/HutchinsonKLMNRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cccg/1996,
editor = {Frank Fiala and
Evangelos Kranakis and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Proceedings of the 8th Canadian Conference on Computational Geometry,
Carleton University, Ottawa, Canada, August 12-15, 1996},
publisher = {Carleton University Press},
year = {1996},
url = {https://cccg.ca/proceedings/1996/},
isbn = {0-88629-307-3},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cccg/1996.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LingasMS95,
author = {Andrzej Lingas and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Optimal Parallel Algorithms for Rectilinear Link-Distance Problems},
journal = {Algorithmica},
volume = {14},
number = {3},
pages = {261--289},
year = {1995},
url = {https://doi.org/10.1007/BF01206332},
doi = {10.1007/BF01206332},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LingasMS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/paapp/DehneSVF95,
author = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Natana Valiveti and
Boris Flach},
title = {Analog Parallel Algorithms for Computational Geometry},
journal = {Parallel Algorithms Appl.},
volume = {5},
number = {1-2},
pages = {1--14},
year = {1995},
url = {https://doi.org/10.1080/10637199508915472},
doi = {10.1080/10637199508915472},
timestamp = {Thu, 07 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/paapp/DehneSVF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/HuangMNS95,
author = {Jian Huang and
Anil Maheshwari and
Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {A note on approximations of rectilinear polygons},
booktitle = {Proceedings of the 7th Canadian Conference on Computational Geometry,
Quebec City, Quebec, Canada, August 1995},
pages = {43--48},
publisher = {Carleton University, Ottawa, Canada},
year = {1995},
url = {http://www.cccg.ca/proceedings/1995/cccg1995\_0007.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/HuangMNS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BauernoppelKKMNSU95,
author = {Frank Bauern{\"{o}}ppel and
Evangelos Kranakis and
Danny Krizanc and
Anil Maheshwari and
Marc Noy and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jorge Urrutia},
editor = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Ferenc G{\'{e}}cseg},
title = {Optimal Shooting: Characterizations and Applications},
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 = {220--231},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60084-1\_76},
doi = {10.1007/3-540-60084-1\_76},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BauernoppelKKMNSU95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/1995,
editor = {Selim G. Akl and
Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Algorithms and Data Structures, 4th International Workshop, {WADS}
'95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {955},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60220-8},
doi = {10.1007/3-540-60220-8},
isbn = {3-540-60220-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/1995.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EpsteinKKMNS94,
author = {Peter Epstein and
J. Kavanagh and
A. Knight and
J. May and
T. Nguyen and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {A Workbench for Computational Geometry},
journal = {Algorithmica},
volume = {11},
number = {4},
pages = {404--428},
year = {1994},
url = {https://doi.org/10.1007/BF01187021},
doi = {10.1007/BF01187021},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EpsteinKKMNS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtkinsonS94,
author = {M. D. Atkinson and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Uniform Generation of Forests of Restricted Height},
journal = {Inf. Process. Lett.},
volume = {50},
number = {6},
pages = {323--327},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00054-9},
doi = {10.1016/0020-0190(94)00054-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtkinsonS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/AtkinsonS94,
author = {M. D. Atkinson and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Uniform Generation of Binary Trees in Parallel},
journal = {J. Parallel Distributed Comput.},
volume = {23},
number = {1},
pages = {101--103},
year = {1994},
url = {https://doi.org/10.1006/jpdc.1994.1123},
doi = {10.1006/JPDC.1994.1123},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/AtkinsonS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tomacs/EpsteinS94,
author = {Peter Epstein and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Generating Triangulations at Random},
journal = {{ACM} Trans. Model. Comput. Simul.},
volume = {4},
number = {3},
pages = {267--278},
year = {1994},
url = {https://doi.org/10.1145/189443.189446},
doi = {10.1145/189443.189446},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tomacs/EpsteinS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/NussbaumS93,
author = {Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Disassembling two-dimensional composite parts via translations},
journal = {Int. J. Comput. Geom. Appl.},
volume = {3},
number = {1},
pages = {71--84},
year = {1993},
url = {https://doi.org/10.1142/S0218195993000051},
doi = {10.1142/S0218195993000051},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/NussbaumS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DattaMS93,
author = {Amitava Datta and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Thomas Lengauer},
title = {Optimal {CREW-PRAM} Algorithms for Direct Dominance Problems},
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 = {109--120},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57273-2\_48},
doi = {10.1007/3-540-57273-2\_48},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/DattaMS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/LingasMS93,
author = {Andrzej Lingas and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Parallel Algorithms for Rectilinear Link Distance Problems},
booktitle = {The Seventh International Parallel Processing Symposium, Proceedings,
Newport Beach, California, USA, April 13-16, 1993},
pages = {65--72},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/IPPS.1993.262857},
doi = {10.1109/IPPS.1993.262857},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/LingasMS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/1993,
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8},
doi = {10.1007/3-540-57155-8},
isbn = {3-540-57155-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/1993.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/DjidjevLS92,
author = {Hristo N. Djidjev and
Andrzej Lingas and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {An O(n log n) Algorithm for Computing the Link Center of a Simple
Polygon},
journal = {Discret. Comput. Geom.},
volume = {8},
pages = {131--152},
year = {1992},
url = {https://doi.org/10.1007/BF02293040},
doi = {10.1007/BF02293040},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/DjidjevLS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/DickersonDS92,
author = {Matthew Dickerson and
Robert L. (Scot) Drysdale III and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Simple algorithms for enumerating interpoint distances and finding
{\textdollar}k{\textdollar} nearest neighbors},
journal = {Int. J. Comput. Geom. Appl.},
volume = {2},
number = {3},
pages = {221--239},
year = {1992},
url = {https://doi.org/10.1142/S0218195992000147},
doi = {10.1142/S0218195992000147},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/DickersonDS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtkinsonS92,
author = {M. D. Atkinson and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Generating Binary Trees at Random},
journal = {Inf. Process. Lett.},
volume = {41},
number = {1},
pages = {21--23},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90075-7},
doi = {10.1016/0020-0190(92)90075-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtkinsonS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DehneHSS91,
author = {Frank K. H. A. Dehne and
Anne{-}Lise Hassenklover and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Computational Geometry Algorithms for the Systolic Screen},
journal = {Algorithmica},
volume = {6},
number = {5},
pages = {734--761},
year = {1991},
url = {https://doi.org/10.1007/BF01759069},
doi = {10.1007/BF01759069},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DehneHSS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/1991,
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Algorithms and Data Structures, 2nd Workshop {WADS} '91, Ottawa, Canada,
August 14-16, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {519},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/BFb0028243},
doi = {10.1007/BFB0028243},
isbn = {3-540-54343-0},
timestamp = {Fri, 17 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/1991.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/StrothotteS90,
author = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Thomas Strothotte},
title = {A Characterization of Heaps and Its Applications},
journal = {Inf. Comput.},
volume = {86},
number = {1},
pages = {69--86},
year = {1990},
url = {https://doi.org/10.1016/0890-5401(90)90026-E},
doi = {10.1016/0890-5401(90)90026-E},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/StrothotteS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/SackS90,
author = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Subhash Suri},
title = {An Optimal Algorithm for Detecting Weak Visibility of a Polygon},
journal = {{IEEE} Trans. Computers},
volume = {39},
number = {10},
pages = {1213--1219},
year = {1990},
url = {https://doi.org/10.1109/12.59852},
doi = {10.1109/12.59852},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/SackS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/KnightMMNS90,
author = {A. Knight and
J. May and
Jeff McAffer and
T. Nguyen and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Raimund Seidel},
title = {A Computational geometry Workbench},
booktitle = {Proceedings of the Sixth Annual Symposium on Computational Geometry,
Berkeley, CA, USA, June 6-8, 1990},
pages = {370},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/98524.98602},
doi = {10.1145/98524.98602},
timestamp = {Mon, 14 Jun 2021 16:24:54 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/KnightMMNS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pc/DehneHS89,
author = {Frank K. H. A. Dehne and
Anne{-}Lise Hassenklover and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Computing the configuration space for a robot on a mesh-of-processors},
journal = {Parallel Comput.},
volume = {12},
number = {2},
pages = {221--231},
year = {1989},
url = {https://doi.org/10.1016/0167-8191(89)90055-0},
doi = {10.1016/0167-8191(89)90055-0},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pc/DehneHS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LevcopoulosLS89,
author = {Christos Levcopoulos and
Andrzej Lingas and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation
Problems},
journal = {Theor. Comput. Sci.},
volume = {66},
number = {2},
pages = {181--203},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90134-5},
doi = {10.1016/0304-3975(89)90134-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LevcopoulosLS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpp/DehneHS89,
author = {Frank K. H. A. Dehne and
Anne{-}Lise Hassenklover and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Computing the Configuration Space for a Robot on a Mesh-of-Processors},
booktitle = {Proceedings of the International Conference on Parallel Processing,
{ICPP} '89, The Pennsylvania State University, University Park, PA,
USA, August 1989. Volume 3: Algorithms and Applications},
pages = {40--47},
publisher = {Pennsylvania State University Press},
year = {1989},
timestamp = {Mon, 15 Jun 2015 19:00:07 +0200},
biburl = {https://dblp.org/rec/conf/icpp/DehneHS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/oa/NussbaumS89,
author = {Doron Nussbaum and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Hristo N. Djidjev},
title = {Disassembling Two-Dimensional Composite Parts via Translations},
booktitle = {Optimal Algorithms, International Symposium, Varna, Bulgaria, May
29 - June 2, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {401},
pages = {153--167},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51859-2\_14},
doi = {10.1007/3-540-51859-2\_14},
timestamp = {Wed, 14 Jul 2021 17:16:13 +0200},
biburl = {https://dblp.org/rec/conf/oa/NussbaumS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DjidjevLS89,
author = {Hristo N. Djidjev and
Andrzej Lingas and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Burkhard Monien and
Robert Cori},
title = {An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon},
booktitle = {{STACS} 89, 6th Annual Symposium on Theoretical Aspects of Computer
Science, Paderborn, FRG, February 16-18, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {349},
pages = {96--107},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/BFb0028976},
doi = {10.1007/BFB0028976},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DjidjevLS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/1989,
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Algorithms and Data Structures, Workshop {WADS} '89, Ottawa, Canada,
August 17-19, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {382},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51542-9},
doi = {10.1007/3-540-51542-9},
isbn = {3-540-51542-9},
timestamp = {Fri, 17 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/1989.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/LenhartPSSSSTWY88,
author = {William J. Lenhart and
Richard Pollack and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Raimund Seidel and
Micha Sharir and
Subhash Suri and
Godfried T. Toussaint and
Sue Whitesides and
Chee{-}Keng Yap},
title = {Computing the Link Center of a Simple Polygon},
journal = {Discret. Comput. Geom.},
volume = {3},
pages = {281--293},
year = {1988},
url = {https://doi.org/10.1007/BF02187913},
doi = {10.1007/BF02187913},
timestamp = {Tue, 20 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/LenhartPSSSSTWY88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/vc/DeanLS88,
author = {James A. Dean and
Andrzej Lingas and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Recognizing polygons, or how to spy},
journal = {Vis. Comput.},
volume = {3},
number = {6},
pages = {344--355},
year = {1988},
url = {https://doi.org/10.1007/BF01901192},
doi = {10.1007/BF01901192},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/vc/DeanLS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/parcella/DehneS88,
author = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Gottfried Wolf and
Tam{\'{a}}s Legendi and
Udo Schendel},
title = {A survey of paralle computational geometry algorithms},
booktitle = {Parcella '88, Fourth International Workshop on Parallel Processing
by Cellular Automata and Arrays, Berlin, GDR, October 17-21, 1988,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {342},
pages = {73--88},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-50647-0\_104},
doi = {10.1007/3-540-50647-0\_104},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/parcella/DehneS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SackS88,
author = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Subhash Suri},
editor = {Robert Cori and
Martin Wirsing},
title = {An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary
Version)},
booktitle = {{STACS} 88, 5th Annual Symposium on Theoretical Aspects of Computer
Science, Bordeaux, France, February 11-13, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {294},
pages = {312--321},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/BFb0035855},
doi = {10.1007/BFB0035855},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SackS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DehneSS88,
author = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ivan Stojmenovic},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points
on a Mesh of Processors},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {154--162},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_18},
doi = {10.1007/3-540-19487-8\_18},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/DehneSS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/NurmiS88,
author = {Otto Nurmi and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Jan van Leeuwen},
title = {Separating a Polyhedron by One Translation from a Set of Obstacles
(Extended Abstract)},
booktitle = {Graph-Theoretic Concepts in Computer Science, 14th International Workshop,
{WG} '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {344},
pages = {202--212},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-50728-0\_44},
doi = {10.1007/3-540-50728-0\_44},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/NurmiS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/HashamS87,
author = {A. Hasham and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Bounds for Min-Max Heaps},
journal = {{BIT}},
volume = {27},
number = {3},
pages = {315--323},
year = {1987},
url = {https://doi.org/10.1007/BF01933726},
doi = {10.1007/BF01933726},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/HashamS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LingasLS87,
author = {Andrzej Lingas and
Christos Levcopoulos and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Algorithms for Minimum Length Partitions of Polygons},
journal = {{BIT}},
volume = {27},
number = {4},
pages = {474--479},
year = {1987},
url = {https://doi.org/10.1007/BF01937272},
doi = {10.1007/BF01937272},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/LingasLS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/robotica/SackT87,
author = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Godfried T. Toussaint},
title = {Separability of pairs of polygons through single translations},
journal = {Robotica},
volume = {5},
number = {1},
pages = {55--63},
year = {1987},
url = {https://doi.org/10.1017/S0263574700009644},
doi = {10.1017/S0263574700009644},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/robotica/SackT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/vc/DehneS87,
author = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Translation separability of sets of polygons},
journal = {Vis. Comput.},
volume = {3},
number = {4},
pages = {227--235},
year = {1987},
url = {https://doi.org/10.1007/BF01952829},
doi = {10.1007/BF01952829},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/vc/DehneS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/LenhartPSSSSTWY87,
author = {William J. Lenhart and
Richard Pollack and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Raimund Seidel and
Micha Sharir and
Subhash Suri and
Godfried T. Toussaint and
Sue Whitesides and
Chee{-}Keng Yap},
editor = {D. Soule},
title = {Computing the Link Center of a Simple Polygon},
booktitle = {Proceedings of the Third Annual Symposium on Computational Geometry,
Waterloo, Ontario, Canada, June 8-10, 1987},
pages = {1--10},
publisher = {{ACM}},
year = {1987},
url = {https://doi.org/10.1145/41958.41959},
doi = {10.1145/41958.41959},
timestamp = {Tue, 20 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/LenhartPSSSSTWY87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LevcopoulosLS87,
author = {Christos Levcopoulos and
Andrzej Lingas and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Thomas Ottmann},
title = {Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations
(Extended Abstract)},
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 = {376--385},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-18088-5\_32},
doi = {10.1007/3-540-18088-5\_32},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/LevcopoulosLS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/parle/DehneSS87,
author = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
editor = {J. W. de Bakker and
A. J. Nijman and
Philip C. Treleaven},
title = {Computing on a Systolic Screen: Hulls, Contours and Applications},
booktitle = {PARLE, Parallel Architectures and Languages Europe, Volume {I:} Parallel
Architectures, Eindhoven, The Netherlands, June 15-19, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {258},
pages = {121--133},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-17943-7\_124},
doi = {10.1007/3-540-17943-7\_124},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/parle/DehneSS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/AtkinsonSSS86,
author = {M. D. Atkinson and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Thomas Strothotte},
title = {Min-Max Heaps and Generalized Priority Queues},
journal = {Commun. {ACM}},
volume = {29},
number = {10},
pages = {996--1000},
year = {1986},
url = {https://doi.org/10.1145/6617.6621},
doi = {10.1145/6617.6621},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/AtkinsonSSS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DehneS86,
author = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Gottfried Tinhofer and
Gunther Schmidt},
title = {Seperability of Sets of Polygons},
booktitle = {Graphtheoretic Concepts in Computer Science, International Workshop,
{WG} '86, Bernried, Germany, June 17-19, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {246},
pages = {237--251},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-17218-1\_62},
doi = {10.1007/3-540-17218-1\_62},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/DehneS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/SackS85,
author = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Thomas Strothotte},
title = {An Algorithm for Merging Heaps},
journal = {Acta Informatica},
volume = {22},
number = {2},
pages = {171--186},
year = {1985},
url = {https://doi.org/10.1007/BF00264229},
doi = {10.1007/BF00264229},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/SackS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SackT85,
author = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Godfried T. Toussaint},
editor = {Kurt Mehlhorn},
title = {Translating Polygons in the Plane},
booktitle = {{STACS} 85, 2nd Symposium of Theoretical Aspects of Computer Science,
Saarbr{\"{u}}cken, Germany, January 3-5, 1985, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {182},
pages = {310--321},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/BFb0024019},
doi = {10.1007/BFB0024019},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SackT85.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 2023-09-27 22:51 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:
