Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Michiel H. M. Smid
@article{DBLP:journals/dcg/BoseCHS24,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Darryl Hill and
Michiel Smid},
title = {On the Spanning and Routing Ratio of the Directed Theta-Four Graph},
journal = {Discret. Comput. Geom.},
volume = {71},
number = {3},
pages = {872--892},
year = {2024},
url = {https://doi.org/10.1007/s00454-023-00597-8},
doi = {10.1007/S00454-023-00597-8},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/BoseCHS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BandyapadhyayMR24,
author = {Sayan Bandyapadhyay and
Anil Maheshwari and
Sasanka Roy and
Michiel Smid and
Kasturi R. Varadarajan},
editor = {Venkatesan Guruswami},
title = {Geometric Covering via Extraction Theorem},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {7:1--7:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.7},
doi = {10.4230/LIPICS.ITCS.2024.7},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BandyapadhyayMR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BacicMS23,
author = {Joyce Bacic and
Saeed Mehrabi and
Michiel Smid},
title = {Shortest Beer Path Queries in Outerplanar Graphs},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1679--1705},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01045-4},
doi = {10.1007/S00453-022-01045-4},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BacicMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BonichonBCDHS23,
author = {Nicolas Bonichon and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Vincent Despr{\'{e}} and
Darryl Hill and
Michiel Smid},
title = {Improved Routing on the Delaunay Triangulation},
journal = {Discret. Comput. Geom.},
volume = {70},
number = {3},
pages = {495--549},
year = {2023},
url = {https://doi.org/10.1007/s00454-023-00499-9},
doi = {10.1007/S00454-023-00499-9},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/BonichonBCDHS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/SilveiraS23,
author = {Lu{\'{\i}}s Fernando Schultz Xavier da Silveira and
Michiel Smid},
title = {An instance-based algorithm for deciding the bias of a coin},
journal = {Discret. Math. Algorithms Appl.},
volume = {15},
number = {3},
pages = {2250097:1--2250097:10},
year = {2023},
url = {https://doi.org/10.1142/S1793830922500975},
doi = {10.1142/S1793830922500975},
timestamp = {Thu, 20 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/SilveiraS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AkitayaBBCMSS23,
author = {Hugo A. Akitaya and
Ahmad Biniaz and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Lu{\'{\i}}s Fernando Schultz Xavier da Silveira and
Michiel Smid},
title = {The Minimum Moving Spanning Tree Problem},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {1},
pages = {1--18},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00607},
doi = {10.7155/JGAA.00607},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AkitayaBBCMSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-14295,
author = {Ahmad Biniaz and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Babak Miraftab and
Saeed Odak and
Michiel Smid and
Shakhar Smorodinsky and
Yelena Yuditsky},
title = {On Separating Path and Tree Systems in Graphs},
journal = {CoRR},
volume = {abs/2312.14295},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.14295},
doi = {10.48550/ARXIV.2312.14295},
eprinttype = {arXiv},
eprint = {2312.14295},
timestamp = {Wed, 17 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-14295.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cgt/BiniazMS22,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel Smid},
title = {Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points},
journal = {Comput. Geom. Topol.},
volume = {1},
number = {1},
pages = {3:1--3:18},
year = {2022},
url = {https://www.cgt-journal.org/index.php/cgt/article/view/17},
timestamp = {Mon, 19 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cgt/BiniazMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/KaziS22,
author = {Abrar Kazi and
Michiel Smid},
title = {Closest-pair queries and minimum-weight queries are equivalent for
squares},
journal = {Comput. Geom.},
volume = {100},
pages = {101810},
year = {2022},
url = {https://doi.org/10.1016/j.comgeo.2021.101810},
doi = {10.1016/J.COMGEO.2021.101810},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/KaziS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BoseCKM0MS22,
author = {Prosenjit Bose and
Paz Carmi and
J. Mark Keil and
Anil Maheshwari and
Saeed Mehrabi and
Debajyoti Mondal and
Michiel Smid},
title = {Computing maximum independent set on outerstring graphs and their
relatives},
journal = {Comput. Geom.},
volume = {103},
pages = {101852},
year = {2022},
url = {https://doi.org/10.1016/j.comgeo.2021.101852},
doi = {10.1016/J.COMGEO.2021.101852},
timestamp = {Tue, 15 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BoseCKM0MS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiniazCCCMMS21,
author = {Ahmad Biniaz and
Sergio Cabello and
Paz Carmi and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Saeed Mehrabi and
Michiel Smid},
title = {On the Minimum Consistent Subset Problem},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2273--2302},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00825-8},
doi = {10.1007/S00453-021-00825-8},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiniazCCCMMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/JoretMRS21,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Bruce A. Reed and
Michiel Smid},
title = {Tight Bounds on the Clique Chromatic Number},
journal = {Electron. J. Comb.},
volume = {28},
number = {3},
year = {2021},
url = {https://doi.org/10.37236/9659},
doi = {10.37236/9659},
timestamp = {Mon, 27 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/JoretMRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Smid21,
author = {Michiel H. M. Smid},
title = {An improved construction for spanners of disks},
journal = {Comput. Geom.},
volume = {92},
pages = {101682},
year = {2021},
url = {https://doi.org/10.1016/j.comgeo.2020.101682},
doi = {10.1016/J.COMGEO.2020.101682},
timestamp = {Mon, 21 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/Smid21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChancharyMS21,
author = {Farah Chanchary and
Anil Maheshwari and
Michiel Smid},
title = {Window queries for intersecting objects, maximal points and approximations
using coresets},
journal = {Discret. Appl. Math.},
volume = {305},
pages = {295--310},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2021.03.009},
doi = {10.1016/J.DAM.2021.03.009},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ChancharyMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Abu-AffashCMMSS21,
author = {A. Karim Abu{-}Affash and
Paz Carmi and
Anil Maheshwari and
Pat Morin and
Michiel Smid and
Shakhar Smorodinsky},
title = {Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs},
journal = {Discret. Comput. Geom.},
volume = {66},
number = {4},
pages = {1401--1414},
year = {2021},
url = {https://doi.org/10.1007/s00454-021-00327-y},
doi = {10.1007/S00454-021-00327-Y},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Abu-AffashCMMSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BandyapadhyayMS21,
author = {Sayan Bandyapadhyay and
Anil Maheshwari and
Michiel Smid},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Exact and Approximation Algorithms for Many-To-Many Point Matching
in the Plane},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {44:1--44:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.44},
doi = {10.4230/LIPICS.ISAAC.2021.44},
timestamp = {Tue, 30 Nov 2021 14:09:45 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BandyapadhyayMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Bacic0S21,
author = {Joyce Bacic and
Saeed Mehrabi and
Michiel Smid},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Shortest Beer Path Queries in Outerplanar Graphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {62:1--62:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.62},
doi = {10.4230/LIPICS.ISAAC.2021.62},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Bacic0S21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AkitayaBBCMSS21,
author = {Hugo A. Akitaya and
Ahmad Biniaz and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Lu{\'{\i}}s Fernando Schultz Xavier da Silveira and
Michiel Smid},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {The Minimum Moving Spanning Tree Problem},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {15--28},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_2},
doi = {10.1007/978-3-030-83508-8\_2},
timestamp = {Fri, 06 Aug 2021 11:47:24 +0200},
biburl = {https://dblp.org/rec/conf/wads/AkitayaBBCMSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BiniazMS21,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel Smid},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {Euclidean Maximum Matchings in the Plane - Local to Global},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {186--199},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_14},
doi = {10.1007/978-3-030-83508-8\_14},
timestamp = {Thu, 05 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BiniazMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-07524,
author = {Sayan Bandyapadhyay and
Anil Maheshwari and
Michiel Smid},
title = {Exact and Approximation Algorithms for Many-To-Many Point Matching
in the Plane},
journal = {CoRR},
volume = {abs/2109.07524},
year = {2021},
url = {https://arxiv.org/abs/2109.07524},
eprinttype = {arXiv},
eprint = {2109.07524},
timestamp = {Wed, 22 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-07524.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-15693,
author = {Joyce Bacic and
Saeed Mehrabi and
Michiel Smid},
title = {Shortest Beer Path Queries in Outerplanar Graphs},
journal = {CoRR},
volume = {abs/2110.15693},
year = {2021},
url = {https://arxiv.org/abs/2110.15693},
eprinttype = {arXiv},
eprint = {2110.15693},
timestamp = {Tue, 02 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-15693.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-05780,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel Smid},
title = {Approximating bottleneck spanning trees on partitioned tuples of points},
journal = {CoRR},
volume = {abs/2111.05780},
year = {2021},
url = {https://arxiv.org/abs/2111.05780},
eprinttype = {arXiv},
eprint = {2111.05780},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-05780.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BoseCSS20,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Alina Shaikhet and
Michiel H. M. Smid},
title = {Optimal Art Gallery Localization is NP-hard},
journal = {Comput. Geom.},
volume = {88},
pages = {101607},
year = {2020},
url = {https://doi.org/10.1016/j.comgeo.2020.101607},
doi = {10.1016/J.COMGEO.2020.101607},
timestamp = {Wed, 22 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/BoseCSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GudmundssonS20,
author = {Joachim Gudmundsson and
Michiel H. M. Smid},
title = {Special issue on the 29th Canadian Conference on Computational Geometry,
Guest Editors' foreword},
journal = {Comput. Geom.},
volume = {88},
pages = {101608},
year = {2020},
url = {https://doi.org/10.1016/j.comgeo.2020.101608},
doi = {10.1016/J.COMGEO.2020.101608},
timestamp = {Wed, 22 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/GudmundssonS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CarufelGMSS20,
author = {Jean{-}Lou De Carufel and
Carsten Grimm and
Anil Maheshwari and
Stefan Schirra and
Michiel H. M. Smid},
title = {Minimizing the continuous diameter when augmenting a geometric tree
with a shortcut},
journal = {Comput. Geom.},
volume = {89},
pages = {101631},
year = {2020},
url = {https://doi.org/10.1016/j.comgeo.2020.101631},
doi = {10.1016/J.COMGEO.2020.101631},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/CarufelGMSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChancharyMS20,
author = {Farah Chanchary and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Querying relational event graphs using colored range searching data
structures},
journal = {Discret. Appl. Math.},
volume = {286},
pages = {51--61},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.03.006},
doi = {10.1016/J.DAM.2019.03.006},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ChancharyMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/BiniazKMS20,
author = {Ahmad Biniaz and
Evangelos Kranakis and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Plane and planarity thresholds for random geometric graphs},
journal = {Discret. Math. Algorithms Appl.},
volume = {12},
number = {1},
pages = {2050005:1--2050005:21},
year = {2020},
url = {https://doi.org/10.1142/S1793830920500056},
doi = {10.1142/S1793830920500056},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/BiniazKMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BiniazMS20,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel
graphs},
journal = {Inf. Process. Lett.},
volume = {153},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105869},
doi = {10.1016/J.IPL.2019.105869},
timestamp = {Fri, 15 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BiniazMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BiniazBCMMS20,
author = {Ahmad Biniaz and
Prosenjit Bose and
Paz Carmi and
Anil Maheshwari and
J. Ian Munro and
Michiel H. M. Smid},
title = {Faster algorithms for some optimization problems on collinear points},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {418--432},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a16},
doi = {10.20382/JOCG.V11I1A16},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BiniazBCMMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/SmidMM20,
author = {Michiel Smid and
Anil Maheshwari and
Wolfgang Mulzer},
title = {A simple randomized {\textdollar}O(n {\textbackslash}log n){\textdollar}-time
closest-pair algorithm in doubling metrics},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {507--524},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a20},
doi = {10.20382/JOCG.V11I1A20},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/SmidMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/MaheshwariMRS20,
author = {Anil Maheshwari and
Saeed Mehrabi and
Sasanka Roy and
Michiel Smid},
editor = {J. Mark Keil and
Debajyoti Mondal},
title = {Covering Points with Pairs of Concentric Disks},
booktitle = {Proceedings of the 32nd Canadian Conference on Computational Geometry,
{CCCG} 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon,
Saskatchewan, Canada},
pages = {33--38},
year = {2020},
timestamp = {Mon, 03 May 2021 21:50:39 +0200},
biburl = {https://dblp.org/rec/conf/cccg/MaheshwariMRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/KaziS20,
author = {Abrar Kazi and
Michiel Smid},
editor = {J. Mark Keil and
Debajyoti Mondal},
title = {Closest-Pair Queries and Minimum-Weight Queries are Equivalent for
Squares},
booktitle = {Proceedings of the 32nd Canadian Conference on Computational Geometry,
{CCCG} 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon,
Saskatchewan, Canada},
pages = {206--213},
year = {2020},
timestamp = {Mon, 03 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cccg/KaziS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-05883,
author = {Anil Maheshwari and
Wolfgang Mulzer and
Michiel H. M. Smid},
title = {A Simple Randomized O(n log n)-Time Closest-Pair Algorithm in Doubling
Metrics},
journal = {CoRR},
volume = {abs/2004.05883},
year = {2020},
url = {https://arxiv.org/abs/2004.05883},
eprinttype = {arXiv},
eprint = {2004.05883},
timestamp = {Tue, 14 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-05883.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-11353,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Bruce A. Reed and
Michiel H. M. Smid},
title = {Tight Bounds on The Clique Chromatic Number},
journal = {CoRR},
volume = {abs/2006.11353},
year = {2020},
url = {https://arxiv.org/abs/2006.11353},
eprinttype = {arXiv},
eprint = {2006.11353},
timestamp = {Wed, 24 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-11353.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-06463,
author = {Abrar Kazi and
Michiel Smid},
title = {Closest-Pair Queries and Minimum-Weight Queries are Equivalent for
Squares},
journal = {CoRR},
volume = {abs/2010.06463},
year = {2020},
url = {https://arxiv.org/abs/2010.06463},
eprinttype = {arXiv},
eprint = {2010.06463},
timestamp = {Tue, 20 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-06463.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-05502,
author = {Lu{\'{\i}}s Fernando Schultz Xavier da Silveira and
Michiel Smid},
title = {An Instance-Based Algorithm for Deciding the Bias of a Coin},
journal = {CoRR},
volume = {abs/2011.05502},
year = {2020},
url = {https://arxiv.org/abs/2011.05502},
eprinttype = {arXiv},
eprint = {2011.05502},
timestamp = {Thu, 12 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-05502.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiniazBCCEMS19,
author = {Ahmad Biniaz and
Prosenjit Bose and
Kimberly Crosbie and
Jean{-}Lou De Carufel and
David Eppstein and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Maximum Plane Trees in Multipartite Geometric Graphs},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1512--1534},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0482-x},
doi = {10.1007/S00453-018-0482-X},
timestamp = {Wed, 10 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiniazBCCEMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BiniazMS19,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Flip distance to some plane configurations},
journal = {Comput. Geom.},
volume = {81},
pages = {12--21},
year = {2019},
url = {https://doi.org/10.1016/j.comgeo.2019.01.008},
doi = {10.1016/J.COMGEO.2019.01.008},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/BiniazMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BaeS19,
author = {Sang Won Bae and
Michiel H. M. Smid},
title = {Closest-pair queries in fat rectangles},
journal = {Comput. Geom.},
volume = {83},
pages = {1--8},
year = {2019},
url = {https://doi.org/10.1016/j.comgeo.2019.05.003},
doi = {10.1016/J.COMGEO.2019.05.003},
timestamp = {Fri, 15 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BaeS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/BintMSN19,
author = {Gregory Bint and
Anil Maheshwari and
Michiel H. M. Smid and
Subhas C. Nandy},
title = {Partial Enclosure Range Searching},
journal = {Int. J. Comput. Geom. Appl.},
volume = {29},
number = {1},
pages = {73--93},
year = {2019},
url = {https://doi.org/10.1142/S0218195919500018},
doi = {10.1142/S0218195919500018},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/BintMSN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/CarmiCMS19,
author = {Paz Carmi and
Farah Chanchary and
Anil Maheshwari and
Michiel H. M. Smid},
title = {The Most Likely Object to be Seen Through a Window},
journal = {Int. J. Comput. Geom. Appl.},
volume = {29},
number = {4},
pages = {269--287},
year = {2019},
url = {https://doi.org/10.1142/S0218195919500092},
doi = {10.1142/S0218195919500092},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/CarmiCMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GrosseKSGS19,
author = {Ulrike Gro{\ss}e and
Christian Knauer and
Fabian Stehn and
Joachim Gudmundsson and
Michiel H. M. Smid},
title = {Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees},
journal = {Int. J. Found. Comput. Sci.},
volume = {30},
number = {2},
pages = {293--313},
year = {2019},
url = {https://doi.org/10.1142/S0129054119500060},
doi = {10.1142/S0129054119500060},
timestamp = {Thu, 04 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/GrosseKSGS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BanikDMS19,
author = {Aritra Banik and
Sandip Das and
Anil Maheshwari and
Michiel H. M. Smid},
title = {The discrete Voronoi game in a simple polygon},
journal = {Theor. Comput. Sci.},
volume = {793},
pages = {28--35},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.04.012},
doi = {10.1016/J.TCS.2019.04.012},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BanikDMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BoseCHS19,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Darryl Hill and
Michiel H. M. Smid},
editor = {Timothy M. Chan},
title = {On the Spanning and Routing Ratio of Theta-Four},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {2361--2370},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.144},
doi = {10.1137/1.9781611975482.144},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/BoseCHS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BiniazCCCM0S19,
author = {Ahmad Biniaz and
Sergio Cabello and
Paz Carmi and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Saeed Mehrabi and
Michiel H. M. Smid},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {On the Minimum Consistent Subset Problem},
booktitle = {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},
pages = {155--167},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_12},
doi = {10.1007/978-3-030-24766-9\_12},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/BiniazCCCM0S19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoseCKM0MS19,
author = {Prosenjit Bose and
Paz Carmi and
J. Mark Keil and
Anil Maheshwari and
Saeed Mehrabi and
Debajyoti Mondal and
Michiel H. M. Smid},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Computing Maximum Independent Set on Outerstring Graphs and Their
Relatives},
booktitle = {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},
pages = {211--224},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_16},
doi = {10.1007/978-3-030-24766-9\_16},
timestamp = {Wed, 31 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoseCKM0MS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ChanNS19,
author = {Timothy M. Chan and
Yakov Nekrich and
Michiel H. M. Smid},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles},
booktitle = {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},
pages = {283--295},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_21},
doi = {10.1007/978-3-030-24766-9\_21},
timestamp = {Wed, 31 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ChanNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-07024,
author = {Prosenjit Bose and
Paz Carmi and
J. Mark Keil and
Anil Maheshwari and
Saeed Mehrabi and
Debajyoti Mondal and
Michiel H. M. Smid},
title = {Computing Maximum Independent Set on Outerstring Graphs and Their
Relatives},
journal = {CoRR},
volume = {abs/1903.07024},
year = {2019},
url = {http://arxiv.org/abs/1903.07024},
eprinttype = {arXiv},
eprint = {1903.07024},
timestamp = {Mon, 01 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-07024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00791,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Flip Distance to some Plane Configurations},
journal = {CoRR},
volume = {abs/1905.00791},
year = {2019},
url = {http://arxiv.org/abs/1905.00791},
eprinttype = {arXiv},
eprint = {1905.00791},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-00791.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-02322,
author = {Timothy M. Chan and
Yakov Nekrich and
Michiel H. M. Smid},
title = {Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles},
journal = {CoRR},
volume = {abs/1905.02322},
year = {2019},
url = {http://arxiv.org/abs/1905.02322},
eprinttype = {arXiv},
eprint = {1905.02322},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-02322.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MaheshwariNPRS18,
author = {Anil Maheshwari and
Subhas C. Nandy and
Drimit Pattanayak and
Sasanka Roy and
Michiel H. M. Smid},
title = {Geometric Path Problems with Violations},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {448--471},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0263-3},
doi = {10.1007/S00453-016-0263-3},
timestamp = {Thu, 08 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MaheshwariNPRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoseHS18,
author = {Prosenjit Bose and
Darryl Hill and
Michiel H. M. Smid},
title = {Improved Spanning Ratio for Low Degree Plane Spanners},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {935--976},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0305-5},
doi = {10.1007/S00453-017-0305-5},
timestamp = {Thu, 15 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BoseHS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiniazBEMMS18,
author = {Ahmad Biniaz and
Prosenjit Bose and
David Eppstein and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
title = {Spanning Trees in Multipartite Geometric Graphs},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3177--3191},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0375-4},
doi = {10.1007/S00453-017-0375-4},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BiniazBEMMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AronovBDGILS18,
author = {Boris Aronov and
Prosenjit Bose and
Erik D. Demaine and
Joachim Gudmundsson and
John Iacono and
Stefan Langerman and
Michiel H. M. Smid},
title = {Data Structures for Halfplane Proximity Queries and Incremental Voronoi
Diagrams},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3316--3334},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0389-y},
doi = {10.1007/S00453-017-0389-Y},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AronovBDGILS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BiniazMS18,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Strong matching of points with geometric shapes},
journal = {Comput. Geom.},
volume = {68},
pages = {186--205},
year = {2018},
url = {https://doi.org/10.1016/j.comgeo.2017.06.009},
doi = {10.1016/J.COMGEO.2017.06.009},
timestamp = {Mon, 27 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BiniazMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BiniazBMS18,
author = {Ahmad Biniaz and
Prosenjit Bose and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Plane Bichromatic Trees of Low Degree},
journal = {Discret. Comput. Geom.},
volume = {59},
number = {4},
pages = {864--885},
year = {2018},
url = {https://doi.org/10.1007/s00454-017-9881-z},
doi = {10.1007/S00454-017-9881-Z},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BiniazBMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/ChancharyMS18,
author = {Farah Chanchary and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {B. S. Panda and
Partha P. Goswami},
title = {Window Queries for Problems on Intersecting Objects and Maximal Points},
booktitle = {Algorithms and Discrete Applied Mathematics - 4th International Conference,
{CALDAM} 2018, Guwahati, India, February 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10743},
pages = {199--213},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-74180-2\_17},
doi = {10.1007/978-3-319-74180-2\_17},
timestamp = {Wed, 09 Jun 2021 08:38:40 +0200},
biburl = {https://dblp.org/rec/conf/caldam/ChancharyMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BiniazMS18,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Stephane Durocher and
Shahin Kamali},
title = {Compatible 4-Holes in Point Sets},
booktitle = {Proceedings of the 30th Canadian Conference on Computational Geometry,
{CCCG} 2018, August 8-10, 2018, University of Manitoba, Winnipeg,
Manitoba, Canada},
pages = {346--352},
year = {2018},
url = {http://www.cs.umanitoba.ca/\%7Ecccg2018/papers/session7A-p4.pdf},
timestamp = {Thu, 12 Mar 2020 11:28:29 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BiniazMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Abu-AffashCMMSS18,
author = {A. Karim Abu{-}Affash and
Paz Carmi and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid and
Shakhar Smorodinsky},
editor = {Bettina Speckmann and
Csaba D. T{\'{o}}th},
title = {Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs},
booktitle = {34th International Symposium on Computational Geometry, SoCG 2018,
June 11-14, 2018, Budapest, Hungary},
series = {LIPIcs},
volume = {99},
pages = {2:1--2:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.2},
doi = {10.4230/LIPICS.SOCG.2018.2},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Abu-AffashCMMSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BiniazBCMMS18,
author = {Ahmad Biniaz and
Prosenjit Bose and
Paz Carmi and
Anil Maheshwari and
J. Ian Munro and
Michiel H. M. Smid},
editor = {Bettina Speckmann and
Csaba D. T{\'{o}}th},
title = {Faster Algorithms for some Optimization Problems on Collinear Points},
booktitle = {34th International Symposium on Computational Geometry, SoCG 2018,
June 11-14, 2018, Budapest, Hungary},
series = {LIPIcs},
volume = {99},
pages = {8:1--8:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.8},
doi = {10.4230/LIPICS.SOCG.2018.8},
timestamp = {Wed, 16 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BiniazBCMMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BonichonBCDHS18,
author = {Nicolas Bonichon and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Vincent Despr{\'{e}} and
Darryl Hill and
Michiel H. M. Smid},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Improved Routing on the Delaunay Triangulation},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {22:1--22:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.22},
doi = {10.4230/LIPICS.ESA.2018.22},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/BonichonBCDHS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BiniazMS18,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {David Eppstein},
title = {Flip Distance to some Plane Configurations},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {11:1--11:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.11},
doi = {10.4230/LIPICS.SWAT.2018.11},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/swat/BiniazMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/18/Smid18,
author = {Michiel H. M. Smid},
editor = {Teofilo F. Gonzalez},
title = {The Well-Separated Pair Decomposition and Its Applications},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 2: Contemporary and Emerging Applications},
publisher = {Chapman and Hall/CRC},
year = {2018},
timestamp = {Fri, 15 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/tf/18/Smid18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-09505,
author = {Ahmad Biniaz and
Prosenjit Bose and
Paz Carmi and
Anil Maheshwari and
J. Ian Munro and
Michiel H. M. Smid},
title = {Faster Algorithms for some Optimization Problems on Collinear Points},
journal = {CoRR},
volume = {abs/1802.09505},
year = {2018},
url = {http://arxiv.org/abs/1802.09505},
eprinttype = {arXiv},
eprint = {1802.09505},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-09505.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-01298,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Darryl Hill and
Michiel H. M. Smid},
title = {On the Spanning and Routing Ratio of Theta-Four},
journal = {CoRR},
volume = {abs/1808.01298},
year = {2018},
url = {http://arxiv.org/abs/1808.01298},
eprinttype = {arXiv},
eprint = {1808.01298},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-01298.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-10531,
author = {Sang Won Bae and
Michiel H. M. Smid},
title = {Closest-Pair Queries in Fat Rectangles},
journal = {CoRR},
volume = {abs/1809.10531},
year = {2018},
url = {http://arxiv.org/abs/1809.10531},
eprinttype = {arXiv},
eprint = {1809.10531},
timestamp = {Fri, 15 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-10531.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-10737,
author = {Ahmad Biniaz and
Evangelos Kranakis and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Plane and Planarity Thresholds for Random Geometric Graphs},
journal = {CoRR},
volume = {abs/1809.10737},
year = {2018},
url = {http://arxiv.org/abs/1809.10737},
eprinttype = {arXiv},
eprint = {1809.10737},
timestamp = {Fri, 05 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-10737.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-09232,
author = {Ahmad Biniaz and
Sergio Cabello and
Anil Maheshwari and
Paz Carmi and
Saeed Mehrabi and
Jean{-}Lou De Carufel and
Michiel H. M. Smid},
title = {On the Minimum Consistent Subset Problem},
journal = {CoRR},
volume = {abs/1810.09232},
year = {2018},
url = {http://arxiv.org/abs/1810.09232},
eprinttype = {arXiv},
eprint = {1810.09232},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-09232.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BiniazLMS17,
author = {Ahmad Biniaz and
Paul Liu and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Approximation algorithms for the unit disk cover problem in 2D and
3D},
journal = {Comput. Geom.},
volume = {60},
pages = {8--18},
year = {2017},
url = {https://doi.org/10.1016/j.comgeo.2016.04.002},
doi = {10.1016/J.COMGEO.2016.04.002},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BiniazLMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BiniazMNS17,
author = {Ahmad Biniaz and
Anil Maheshwari and
Subhas C. Nandy and
Michiel H. M. Smid},
title = {An optimal algorithm for plane matchings in multipartite geometric
graphs},
journal = {Comput. Geom.},
volume = {63},
pages = {1--9},
year = {2017},
url = {https://doi.org/10.1016/j.comgeo.2017.02.004},
doi = {10.1016/J.COMGEO.2017.02.004},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/BiniazMNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BoseCSS17,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Alina Shaikhet and
Michiel H. M. Smid},
title = {Essential Constraints of Edge-Constrained Proximity Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {389--415},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00422},
doi = {10.7155/JGAA.00422},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BoseCSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BiniazBDMS17,
author = {Ahmad Biniaz and
Prosenjit Bose and
Ingo van Duijn and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {527--546},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00427},
doi = {10.7155/JGAA.00427},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BiniazBDMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BiniazBCGMS17,
author = {Ahmad Biniaz and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Cyril Gavoille and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Towards plane spanners of degree 3},
journal = {J. Comput. Geom.},
volume = {8},
number = {1},
pages = {11--31},
year = {2017},
url = {https://doi.org/10.20382/jocg.v8i1a2},
doi = {10.20382/JOCG.V8I1A2},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BiniazBCGMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/ChancharyMS17,
author = {Farah Chanchary and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Daya Ram Gaur and
N. S. Narayanaswamy},
title = {Querying Relational Event Graphs Using Colored Range Searching Data
Structures},
booktitle = {Algorithms and Discrete Applied Mathematics - Third International
Conference, {CALDAM} 2017, Sancoale, Goa, India, February 16-18, 2017,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10156},
pages = {83--95},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53007-9\_8},
doi = {10.1007/978-3-319-53007-9\_8},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/caldam/ChancharyMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BiniazBCCEMS17,
author = {Ahmad Biniaz and
Prosenjit Bose and
Kimberly Crosbie and
Jean{-}Lou De Carufel and
David Eppstein and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Maximum Plane Trees in Multipartite Geometric Graphs},
booktitle = {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},
pages = {193--204},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_17},
doi = {10.1007/978-3-319-62127-2\_17},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BiniazBCCEMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/CarufelGSS17,
author = {Jean{-}Lou De Carufel and
Carsten Grimm and
Stefan Schirra and
Michiel H. M. Smid},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut},
booktitle = {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},
pages = {301--312},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_26},
doi = {10.1007/978-3-319-62127-2\_26},
timestamp = {Fri, 21 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/CarufelGSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cccg/2017,
editor = {Joachim Gudmundsson and
Michiel H. M. Smid},
title = {Proceedings of the 29th Canadian Conference on Computational Geometry,
{CCCG} 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario,
Canada},
year = {2017},
url = {http://2017.cccg.ca/proceedings/CCCG2017.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoseCSS17,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Alina Shaikhet and
Michiel H. M. Smid},
title = {Art Gallery Localization},
journal = {CoRR},
volume = {abs/1706.06938},
year = {2017},
url = {http://arxiv.org/abs/1706.06938},
eprinttype = {arXiv},
eprint = {1706.06938},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoseCSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoseCSS17a,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Alina Shaikhet and
Michiel H. M. Smid},
title = {Optimal Art Gallery Localization is NP-hard},
journal = {CoRR},
volume = {abs/1706.08016},
year = {2017},
url = {http://arxiv.org/abs/1706.08016},
eprinttype = {arXiv},
eprint = {1706.08016},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoseCSS17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiniazMS17,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Compatible 4-Holes in Point Sets},
journal = {CoRR},
volume = {abs/1706.08105},
year = {2017},
url = {http://arxiv.org/abs/1706.08105},
eprinttype = {arXiv},
eprint = {1706.08105},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiniazMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BanikCMS16,
author = {Aritra Banik and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Discrete Voronoi games and {\unicode{1013}}-nets, in two and three
dimensions},
journal = {Comput. Geom.},
volume = {55},
pages = {41--58},
year = {2016},
url = {https://doi.org/10.1016/j.comgeo.2016.02.002},
doi = {10.1016/J.COMGEO.2016.02.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BanikCMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BiniazBMS16,
author = {Ahmad Biniaz and
Prosenjit Bose and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings
in a simple polygon},
journal = {Comput. Geom.},
volume = {57},
pages = {27--39},
year = {2016},
url = {https://doi.org/10.1016/j.comgeo.2016.05.004},
doi = {10.1016/J.COMGEO.2016.05.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BiniazBMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BoseCSS16,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Alina Shaikhet and
Michiel H. M. Smid},
title = {Probing convex polygons with a wedge},
journal = {Comput. Geom.},
volume = {58},
pages = {34--59},
year = {2016},
url = {https://doi.org/10.1016/j.comgeo.2016.06.001},
doi = {10.1016/J.COMGEO.2016.06.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BoseCSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/KnauerS16,
author = {Christian Knauer and
Michiel H. M. Smid},
title = {Guest Editors' Foreword},
journal = {Int. J. Comput. Geom. Appl.},
volume = {26},
number = {3-4},
pages = {0--134},
year = {2016},
url = {https://doi.org/10.1142/S0218195916020015},
doi = {10.1142/S0218195916020015},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/KnauerS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/SmidBCDCHML16,
author = {Michiel H. M. Smid and
Prosenjit Bose and
Paz Carmi and
Mirela Damian and
Jean{-}Lou De Carufel and
Darryl Hill and
Anil Maheshwari and
Yuyang Liu},
title = {On the stretch factor of convex polyhedra whose vertices are (almost)
on a sphere},
journal = {J. Comput. Geom.},
volume = {7},
number = {1},
pages = {444--472},
year = {2016},
url = {https://doi.org/10.20382/jocg.v7i1a19},
doi = {10.20382/JOCG.V7I1A19},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/SmidBCDCHML16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BiniazAMSBC16,
author = {Ahmad Biniaz and
Mahdi Amani and
Anil Maheshwari and
Michiel H. M. Smid and
Prosenjit Bose and
Jean{-}Lou De Carufel},
title = {A plane 1.88-spanner for points in convex position},
journal = {J. Comput. Geom.},
volume = {7},
number = {1},
pages = {520--539},
year = {2016},
url = {https://doi.org/10.20382/jocg.v7i1a21},
doi = {10.20382/JOCG.V7I1A21},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BiniazAMSBC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BiniazBDMS16,
author = {Ahmad Biniaz and
Prosenjit Bose and
Ingo van Duijn and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Thomas C. Shermer},
title = {A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph
Problem for Points on a Circle},
booktitle = {Proceedings of the 28th Canadian Conference on Computational Geometry,
{CCCG} 2016, August 3-5, 2016, Simon Fraser University, Vancouver,
British Columbia, Canada},
pages = {140--146},
publisher = {Simon Fraser University, Vancouver, British Columbia, Canada},
year = {2016},
timestamp = {Thu, 12 Mar 2020 11:28:28 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BiniazBDMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BiniazBCGMS16,
author = {Ahmad Biniaz and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Cyril Gavoille and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Seok{-}Hee Hong},
title = {Towards Plane Spanners of Degree 3},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {19:1--19:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.19},
doi = {10.4230/LIPICS.ISAAC.2016.19},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BiniazBCGMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BoseCSS16,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Alina Shaikhet and
Michiel H. M. Smid},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {Essential Constraints of Edge-Constrained Proximity Graphs},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {55--67},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_5},
doi = {10.1007/978-3-319-44543-4\_5},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BoseCSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BiniazBMS16,
author = {Ahmad Biniaz and
Prosenjit Bose and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {Plane Bichromatic Trees of Low Degree},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {68--80},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_6},
doi = {10.1007/978-3-319-44543-4\_6},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/BiniazBMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BoseHS16,
author = {Prosenjit Bose and
Darryl Hill and
Michiel H. M. Smid},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {Improved Spanning Ratio for Low Degree Plane Spanners},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {249--262},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_19},
doi = {10.1007/978-3-662-49529-2\_19},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/BoseHS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AmaniBBCMS16,
author = {Mahdi Amani and
Ahmad Biniaz and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Rasmus Pagh},
title = {A Plane 1.88-Spanner for Points in Convex Position},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {25:1--25:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.25},
doi = {10.4230/LIPICS.SWAT.2016.25},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/AmaniBBCMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CarufelMS16,
author = {Jean{-}Lou De Carufel and
Carsten Grimm and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Rasmus Pagh},
title = {Minimizing the Continuous Diameter when Augmenting Paths and Cycles
with Shortcuts},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {27:1--27:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.27},
doi = {10.4230/LIPICS.SWAT.2016.27},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CarufelMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/GudmundssonNS16,
author = {Joachim Gudmundsson and
Giri Narasimhan and
Michiel H. M. Smid},
title = {Applications of Geometric Spanner Networks},
booktitle = {Encyclopedia of Algorithms},
pages = {86--90},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_15},
doi = {10.1007/978-1-4939-2864-4\_15},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/GudmundssonNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/GudmundssonNS16a,
author = {Joachim Gudmundsson and
Giri Narasimhan and
Michiel H. M. Smid},
title = {Geometric Spanners},
booktitle = {Encyclopedia of Algorithms},
pages = {846--852},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_167},
doi = {10.1007/978-1-4939-2864-4\_167},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/GudmundssonNS16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/GudmundssonNS16b,
author = {Joachim Gudmundsson and
Giri Narasimhan and
Michiel H. M. Smid},
title = {Planar Geometric Spanners},
booktitle = {Encyclopedia of Algorithms},
pages = {1570--1574},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_294},
doi = {10.1007/978-1-4939-2864-4\_294},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/GudmundssonNS16b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiniazBCGMS16,
author = {Ahmad Biniaz and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Cyril Gavoille and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Towards Plane Spanners of Degree 3},
journal = {CoRR},
volume = {abs/1606.08824},
year = {2016},
url = {http://arxiv.org/abs/1606.08824},
eprinttype = {arXiv},
eprint = {1606.08824},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiniazBCGMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoseCSS16,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Alina Shaikhet and
Michiel H. M. Smid},
title = {Essential Constraints of Edge-Constrained Proximity Graphs},
journal = {CoRR},
volume = {abs/1607.01294},
year = {2016},
url = {http://arxiv.org/abs/1607.01294},
eprinttype = {arXiv},
eprint = {1607.01294},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoseCSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GrosseGKSS16,
author = {Ulrike Gro{\ss}e and
Joachim Gudmundsson and
Christian Knauer and
Michiel H. M. Smid and
Fabian Stehn},
title = {Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees},
journal = {CoRR},
volume = {abs/1607.05547},
year = {2016},
url = {http://arxiv.org/abs/1607.05547},
eprinttype = {arXiv},
eprint = {1607.05547},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GrosseGKSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiniazBEMMS16,
author = {Ahmad Biniaz and
Prosenjit Bose and
David Eppstein and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
title = {Spanning Trees in Multipartite Geometric Graphs},
journal = {CoRR},
volume = {abs/1611.01661},
year = {2016},
url = {http://arxiv.org/abs/1611.01661},
eprinttype = {arXiv},
eprint = {1611.01661},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiniazBEMMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CarufelGSS16,
author = {Jean{-}Lou De Carufel and
Carsten Grimm and
Stefan Schirra and
Michiel H. M. Smid},
title = {Minimizing the Continuous Diameter when Augmenting a Tree with a Shortcut},
journal = {CoRR},
volume = {abs/1612.01370},
year = {2016},
url = {http://arxiv.org/abs/1612.01370},
eprinttype = {arXiv},
eprint = {1612.01370},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CarufelGSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BiniazMS15,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {On full Steiner trees in unit disk graphs},
journal = {Comput. Geom.},
volume = {48},
number = {6},
pages = {453--458},
year = {2015},
url = {https://doi.org/10.1016/j.comgeo.2015.02.004},
doi = {10.1016/J.COMGEO.2015.02.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BiniazMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GudmundssonS15,
author = {Joachim Gudmundsson and
Michiel H. M. Smid},
title = {Fast algorithms for approximate Fr{\'{e}}chet matching queries
in geometric trees},
journal = {Comput. Geom.},
volume = {48},
number = {6},
pages = {479--494},
year = {2015},
url = {https://doi.org/10.1016/j.comgeo.2015.02.003},
doi = {10.1016/J.COMGEO.2015.02.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/GudmundssonS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BiniazMS15a,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Higher-order triangular-distance Delaunay graphs: Graph-theoretical
properties},
journal = {Comput. Geom.},
volume = {48},
number = {9},
pages = {646--660},
year = {2015},
url = {https://doi.org/10.1016/j.comgeo.2015.07.003},
doi = {10.1016/J.COMGEO.2015.07.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BiniazMS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Abu-AffashBCMS15,
author = {A. Karim Abu{-}Affash and
Ahmad Biniaz and
Paz Carmi and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Approximating the bottleneck plane perfect matching of a point set},
journal = {Comput. Geom.},
volume = {48},
number = {9},
pages = {718--731},
year = {2015},
url = {https://doi.org/10.1016/j.comgeo.2015.06.005},
doi = {10.1016/J.COMGEO.2015.06.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Abu-AffashBCMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/DujmovicMS15,
author = {Vida Dujmovic and
Pat Morin and
Michiel H. M. Smid},
title = {Average Stretch Factor: How Low Does It Go?},
journal = {Discret. Comput. Geom.},
volume = {53},
number = {2},
pages = {296--326},
year = {2015},
url = {https://doi.org/10.1007/s00454-015-9663-4},
doi = {10.1007/S00454-015-9663-4},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/DujmovicMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BiniazBMS15,
author = {Ahmad Biniaz and
Prosenjit Bose and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Packing Plane Perfect Matchings into a Point Set},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {17},
number = {2},
pages = {119--142},
year = {2015},
url = {https://doi.org/10.46298/dmtcs.2132},
doi = {10.46298/DMTCS.2132},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/BiniazBMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BiniazMS15,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {On the hardness of full Steiner tree problems},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {118--127},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.013},
doi = {10.1016/J.JDA.2015.05.013},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BiniazMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BoseCGMS15,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Carsten Grimm and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Optimal Data Structures for Farthest-Point Queries in Cactus Networks},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {11--41},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00345},
doi = {10.7155/JGAA.00345},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BoseCGMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiniazMS15,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Matchings in higher-order Gabriel graphs},
journal = {Theor. Comput. Sci.},
volume = {596},
pages = {67--78},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.06.040},
doi = {10.1016/J.TCS.2015.06.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BiniazMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/BiniazKMS15,
author = {Ahmad Biniaz and
Evangelos Kranakis and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Prosenjit Bose and
Leszek Antoni Gasieniec and
Kay R{\"{o}}mer and
Roger Wattenhofer},
title = {Plane and Planarity Thresholds for Random Geometric Graphs},
booktitle = {Algorithms for Sensor Systems - 11th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, {ALGOSENSORS} 2015,
Patras, Greece, September 17-18, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9536},
pages = {1--12},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-28472-9\_1},
doi = {10.1007/978-3-319-28472-9\_1},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/algosensors/BiniazKMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/BiniazMS15,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Sumit Ganguly and
Ramesh Krishnamurti},
title = {Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical
Properties},
booktitle = {Algorithms and Discrete Applied Mathematics - First International
Conference, {CALDAM} 2015, Kanpur, India, February 8-10, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8959},
pages = {89--100},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-14974-5\_9},
doi = {10.1007/978-3-319-14974-5\_9},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/caldam/BiniazMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BiniazMSL15,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid and
Paul Liu},
title = {A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem},
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/12.pdf},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BiniazMSL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GrosseGKSS15,
author = {Ulrike Gro{\ss}e and
Joachim Gudmundsson and
Christian Knauer and
Michiel H. M. Smid and
Fabian Stehn},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Fast Algorithms for Diameter-Optimally Augmenting Paths},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {678--688},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_55},
doi = {10.1007/978-3-662-47672-7\_55},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GrosseGKSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ttcs/BiniazBMS15,
author = {Ahmad Biniaz and
Prosenjit Bose and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Mohammad Taghi Hajiaghayi and
Mohammad Reza Mousavi},
title = {Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings
in a Simple Polygon},
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 = {56--71},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-28678-5\_5},
doi = {10.1007/978-3-319-28678-5\_5},
timestamp = {Sat, 11 Jul 2020 10:44:59 +0200},
biburl = {https://dblp.org/rec/conf/ttcs/BiniazBMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BiniazMNS15,
author = {Ahmad Biniaz and
Anil Maheshwari and
Subhas C. Nandy and
Michiel H. M. Smid},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {An Optimal Algorithm for Plane Matchings in Multipartite Geometric
Graphs},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {66--78},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_6},
doi = {10.1007/978-3-319-21840-3\_6},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BiniazMNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiniazBMS15,
author = {Ahmad Biniaz and
Prosenjit Bose and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Packing Plane Perfect Matchings into a Point Set},
journal = {CoRR},
volume = {abs/1501.03686},
year = {2015},
url = {http://arxiv.org/abs/1501.03686},
eprinttype = {arXiv},
eprint = {1501.03686},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiniazBMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BanikCMS15,
author = {Aritra Banik and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Discrete Voronoi Games and {\(\epsilon\)}-Nets, in Two and Three Dimensions},
journal = {CoRR},
volume = {abs/1501.04843},
year = {2015},
url = {http://arxiv.org/abs/1501.04843},
eprinttype = {arXiv},
eprint = {1501.04843},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BanikCMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiniazMS15,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Strong Matching of Points with Geometric Shapes},
journal = {CoRR},
volume = {abs/1503.04871},
year = {2015},
url = {http://arxiv.org/abs/1503.04871},
eprinttype = {arXiv},
eprint = {1503.04871},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiniazMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoseCSS15,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Alina Shaikhet and
Michiel H. M. Smid},
title = {Probing Convex Polygons with a Wedge},
journal = {CoRR},
volume = {abs/1506.02572},
year = {2015},
url = {http://arxiv.org/abs/1506.02572},
eprinttype = {arXiv},
eprint = {1506.02572},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoseCSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoseHS15,
author = {Prosenjit Bose and
Darryl Hill and
Michiel H. M. Smid},
title = {Improved Spanning Ratio for Low Degree Plane Spanners},
journal = {CoRR},
volume = {abs/1506.09061},
year = {2015},
url = {http://arxiv.org/abs/1506.09061},
eprinttype = {arXiv},
eprint = {1506.09061},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoseHS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoseCDCHMLS15,
author = {Prosenjit Bose and
Paz Carmi and
Mirela Damian and
Jean{-}Lou De Carufel and
Darryl Hill and
Anil Maheshwari and
Yuyang Liu and
Michiel H. M. Smid},
title = {On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost)
on a Sphere},
journal = {CoRR},
volume = {abs/1507.06856},
year = {2015},
url = {http://arxiv.org/abs/1507.06856},
eprinttype = {arXiv},
eprint = {1507.06856},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoseCDCHMLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CarufelGMS15,
author = {Jean{-}Lou De Carufel and
Carsten Grimm and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Minimizing the Continuous Diameter when Augmenting Paths and Cycles
with Shortcuts},
journal = {CoRR},
volume = {abs/1512.02257},
year = {2015},
url = {http://arxiv.org/abs/1512.02257},
eprinttype = {arXiv},
eprint = {1512.02257},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CarufelGMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiniazBMS15a,
author = {Ahmad Biniaz and
Prosenjit Bose and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Plane Bichromatic Trees of Low Degree},
journal = {CoRR},
volume = {abs/1512.02730},
year = {2015},
url = {http://arxiv.org/abs/1512.02730},
eprinttype = {arXiv},
eprint = {1512.02730},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiniazBMS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GuptaJKS14,
author = {Prosenjit Gupta and
Ravi Janardan and
Yokesh Kumar and
Michiel H. M. Smid},
title = {Data structures for range-aggregate extent queries},
journal = {Comput. Geom.},
volume = {47},
number = {2},
pages = {329--347},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2009.08.001},
doi = {10.1016/J.COMGEO.2009.08.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/GuptaJKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BiniazMS14,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {An optimal algorithm for the Euclidean bottleneck full Steiner tree
problem},
journal = {Comput. Geom.},
volume = {47},
number = {3},
pages = {377--380},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2013.10.001},
doi = {10.1016/J.COMGEO.2013.10.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BiniazMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CarufelGMOS14,
author = {Jean{-}Lou De Carufel and
Carsten Grimm and
Anil Maheshwari and
Megan Owen and
Michiel H. M. Smid},
title = {A note on the unsolvability of the weighted region shortest path problem},
journal = {Comput. Geom.},
volume = {47},
number = {7},
pages = {724--727},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2014.02.004},
doi = {10.1016/J.COMGEO.2014.02.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CarufelGMOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BabuBMS14,
author = {Jasine Babu and
Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Fixed-orientation equilateral triangle matching of point sets},
journal = {Theor. Comput. Sci.},
volume = {555},
pages = {55--70},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.11.031},
doi = {10.1016/J.TCS.2013.11.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BabuBMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/DasMNS14,
author = {Sandip Das and
Anil Maheshwari and
Ayan Nandy and
Michiel H. M. Smid},
editor = {Qianping Gu and
Pavol Hell and
Boting Yang},
title = {A Facility Coloring Problem in 1-D},
booktitle = {Algorithmic Aspects in Information and Management - 10th International
Conference, {AAIM} 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8546},
pages = {88--99},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07956-1\_9},
doi = {10.1007/978-3-319-07956-1\_9},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/aaim/DasMNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BanikCMS14,
author = {Aritra Banik and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Voronoi Games and Epsilon Nets},
booktitle = {Proceedings of the 26th Canadian Conference on Computational Geometry,
{CCCG} 2014, Halifax, Nova Scotia, Canada, 2014},
publisher = {Carleton University, Ottawa, Canada},
year = {2014},
url = {http://www.cccg.ca/proceedings/2014/papers/paper21.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BanikCMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BiniazMS14,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Approximating Full Steiner Tree in a Unit Disk Graph},
booktitle = {Proceedings of the 26th Canadian Conference on Computational Geometry,
{CCCG} 2014, Halifax, Nova Scotia, Canada, 2014},
publisher = {Carleton University, Ottawa, Canada},
year = {2014},
url = {http://www.cccg.ca/proceedings/2014/papers/paper17.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BiniazMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BiniazMS14a,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Bottleneck Bichromatic Plane Matching of Points},
booktitle = {Proceedings of the 26th Canadian Conference on Computational Geometry,
{CCCG} 2014, Halifax, Nova Scotia, Canada, 2014},
publisher = {Carleton University, Ottawa, Canada},
year = {2014},
url = {http://www.cccg.ca/proceedings/2014/papers/paper63.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BiniazMS14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BosePS14,
author = {Prosenjit Bose and
Simon Pratt and
Michiel H. M. Smid},
title = {The Convex Hull of Points on a Sphere is a Spanner},
booktitle = {Proceedings of the 26th Canadian Conference on Computational Geometry,
{CCCG} 2014, Halifax, Nova Scotia, Canada, 2014},
publisher = {Carleton University, Ottawa, Canada},
year = {2014},
url = {http://www.cccg.ca/proceedings/2014/papers/paper36.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BosePS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiniazMS14,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical
Properties},
journal = {CoRR},
volume = {abs/1409.5466},
year = {2014},
url = {http://arxiv.org/abs/1409.5466},
eprinttype = {arXiv},
eprint = {1409.5466},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiniazMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiniazMS14a,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Matching in Gabriel Graphs},
journal = {CoRR},
volume = {abs/1410.0540},
year = {2014},
url = {http://arxiv.org/abs/1410.0540},
eprinttype = {arXiv},
eprint = {1410.0540},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiniazMS14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoseCGMS14,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Carsten Grimm and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Optimal Data Structures for Farthest-Point Queries in Cactus Networks},
journal = {CoRR},
volume = {abs/1411.1879},
year = {2014},
url = {http://arxiv.org/abs/1411.1879},
eprinttype = {arXiv},
eprint = {1411.1879},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoseCGMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/DeMNS13,
author = {Minati De and
Anil Maheshwari and
Subhas C. Nandy and
Michiel H. M. Smid},
title = {An in-place min-max priority search tree},
journal = {Comput. Geom.},
volume = {46},
number = {3},
pages = {310--327},
year = {2013},
url = {https://doi.org/10.1016/j.comgeo.2012.09.007},
doi = {10.1016/J.COMGEO.2012.09.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/DeMNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AbamCFS13,
author = {Mohammad Ali Abam and
Paz Carmi and
Mohammad Farshi and
Michiel H. M. Smid},
title = {On the power of the semi-separated pair decomposition},
journal = {Comput. Geom.},
volume = {46},
number = {6},
pages = {631--639},
year = {2013},
url = {https://doi.org/10.1016/j.comgeo.2013.02.003},
doi = {10.1016/J.COMGEO.2013.02.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AbamCFS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BoseS13,
author = {Prosenjit Bose and
Michiel H. M. Smid},
title = {On plane geometric spanners: {A} survey and open problems},
journal = {Comput. Geom.},
volume = {46},
number = {7},
pages = {818--830},
year = {2013},
url = {https://doi.org/10.1016/j.comgeo.2013.04.002},
doi = {10.1016/J.COMGEO.2013.04.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BoseS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BoseDCDGMSS13,
author = {Prosenjit Bose and
Kai Dannies and
Jean{-}Lou De Carufel and
Christoph Doell and
Carsten Grimm and
Anil Maheshwari and
Stefan Schirra and
Michiel H. M. Smid},
title = {Network Farthest-Point Diagrams},
journal = {J. Comput. Geom.},
volume = {4},
number = {1},
pages = {182--211},
year = {2013},
url = {https://doi.org/10.20382/jocg.v4i1a8},
doi = {10.20382/JOCG.V4I1A8},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BoseDCDGMSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoseDMS13,
author = {Prosenjit Bose and
Vida Dujmovic and
Pat Morin and
Michiel H. M. Smid},
title = {Robust Geometric Spanners},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {4},
pages = {1720--1736},
year = {2013},
url = {https://doi.org/10.1137/120874473},
doi = {10.1137/120874473},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BoseDMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/BrassKSS13,
author = {Peter Brass and
Christian Knauer and
Chan{-}Su Shin and
Michiel H. M. Smid and
Ivo Vigan},
editor = {Anthony Wirth},
title = {Range-Aggregate Queries for Geometric Extent Problems},
booktitle = {Nineteenth Computing: The Australasian Theory Symposium, {CATS} 2013,
Adelaide, Australia, February 2013},
series = {{CRPIT}},
volume = {141},
pages = {3--10},
publisher = {Australian Computer Society},
year = {2013},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV141Brass.html},
timestamp = {Mon, 08 Feb 2021 13:26:47 +0100},
biburl = {https://dblp.org/rec/conf/cats/BrassKSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BarbaBBS13,
author = {Luis Barba and
Alexis Beingessner and
Prosenjit Bose and
Michiel H. M. Smid},
title = {Computing Covers of Plane Forests},
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\_18.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BarbaBBS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BoseCGMS13,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Carsten Grimm and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Optimal Data Structures for Farthest-Point Queries in Cactus Networks},
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\_23.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BoseCGMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BanikDMS13,
author = {Aritra Banik and
Sandip Das and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Ding{-}Zhu Du and
Guochuan Zhang},
title = {The Discrete Voronoi Game in a Simple Polygon},
booktitle = {Computing and Combinatorics, 19th International Conference, {COCOON}
2013, Hangzhou, China, June 21-23, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7936},
pages = {197--207},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38768-5\_19},
doi = {10.1007/978-3-642-38768-5\_19},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BanikDMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BoseDMS13,
author = {Prosenjit Bose and
Vida Dujmovic and
Pat Morin and
Michiel H. M. Smid},
editor = {Guilherme Dias da Fonseca and
Thomas Lewiner and
Luis Mariano Pe{\~{n}}aranda and
Timothy M. Chan and
Rolf Klein},
title = {Robust geometric spanners},
booktitle = {Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro,
Brazil, June 17-20, 2013},
pages = {449--458},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2462356.2462381},
doi = {10.1145/2462356.2462381},
timestamp = {Mon, 14 Jun 2021 16:24:55 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BoseDMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GudmundssonS13,
author = {Joachim Gudmundsson and
Michiel H. M. Smid},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Fr{\'{e}}chet Queries in Geometric Trees},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {565--576},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_48},
doi = {10.1007/978-3-642-40450-4\_48},
timestamp = {Mon, 03 Jan 2022 22:19:39 +0100},
biburl = {https://dblp.org/rec/conf/esa/GudmundssonS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BabuBMS13,
author = {Jasine Babu and
Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Subir Kumar Ghosh and
Takeshi Tokuyama},
title = {Fixed-Orientation Equilateral Triangle Matching of Point Sets},
booktitle = {{WALCOM:} Algorithms and Computation, 7th International Workshop,
{WALCOM} 2013, Kharagpur, India, February 14-16, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7748},
pages = {17--28},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36065-7\_4},
doi = {10.1007/978-3-642-36065-7\_4},
timestamp = {Sat, 30 Sep 2023 09:58:46 +0200},
biburl = {https://dblp.org/rec/conf/walcom/BabuBMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-1909,
author = {Prosenjit Bose and
Kai Dannies and
Jean{-}Lou De Carufel and
Christoph Doell and
Carsten Grimm and
Anil Maheshwari and
Stefan Schirra and
Michiel H. M. Smid},
title = {Network Farthest-Point Diagrams},
journal = {CoRR},
volume = {abs/1304.1909},
year = {2013},
url = {http://arxiv.org/abs/1304.1909},
eprinttype = {arXiv},
eprint = {1304.1909},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-1909.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-0172,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree
Problem},
journal = {CoRR},
volume = {abs/1305.0172},
year = {2013},
url = {http://arxiv.org/abs/1305.0172},
eprinttype = {arXiv},
eprint = {1305.0172},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-0172.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-4170,
author = {Vida Dujmovic and
Pat Morin and
Michiel H. M. Smid},
title = {Average Stretch Factor: How Low Does It Go?},
journal = {CoRR},
volume = {abs/1305.4170},
year = {2013},
url = {http://arxiv.org/abs/1305.4170},
eprinttype = {arXiv},
eprint = {1305.4170},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-4170.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-5209,
author = {Jean{-}Lou De Carufel and
Carsten Grimm and
Anil Maheshwari and
Megan Owen and
Michiel H. M. Smid},
title = {A Note on the Unsolvability of the Weighted Region Shortest Path Problem},
journal = {CoRR},
volume = {abs/1305.5209},
year = {2013},
url = {http://arxiv.org/abs/1305.5209},
eprinttype = {arXiv},
eprint = {1305.5209},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-5209.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeingessnerS13,
author = {Alexis Beingessner and
Michiel H. M. Smid},
title = {Computing the Coverage of an Opaque Forest},
journal = {CoRR},
volume = {abs/1311.4854},
year = {2013},
url = {http://arxiv.org/abs/1311.4854},
eprinttype = {arXiv},
eprint = {1311.4854},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BeingessnerS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BarbaBBS13,
author = {Luis Barba and
Alexis Beingessner and
Prosenjit Bose and
Michiel H. M. Smid},
title = {Computing Covers of Plane Forests},
journal = {CoRR},
volume = {abs/1311.4860},
year = {2013},
url = {http://arxiv.org/abs/1311.4860},
eprinttype = {arXiv},
eprint = {1311.4860},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BarbaBBS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiniazMS13,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Approximating the Bottleneck Plane Perfect Matching of a Point Set},
journal = {CoRR},
volume = {abs/1311.5197},
year = {2013},
url = {http://arxiv.org/abs/1311.5197},
eprinttype = {arXiv},
eprint = {1311.5197},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiniazMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/BoseDDOSSW12,
author = {Prosenjit Bose and
Mirela Damian and
Karim Dou{\"{\i}}eb and
Joseph O'Rourke and
Ben Seamone and
Michiel H. M. Smid and
Stefanie Wuhrer},
title = {{\(\pi\)}/2-Angle Yao Graphs are Spanners},
journal = {Int. J. Comput. Geom. Appl.},
volume = {22},
number = {1},
pages = {61--82},
year = {2012},
url = {https://doi.org/10.1142/S0218195912600047},
doi = {10.1142/S0218195912600047},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/BoseDDOSSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/ChengKLS12,
author = {Siu{-}Wing Cheng and
Christian Knauer and
Stefan Langerman and
Michiel H. M. Smid},
title = {Approximating the average stretch factor of geometric graphs},
journal = {J. Comput. Geom.},
volume = {3},
number = {1},
pages = {132--153},
year = {2012},
url = {https://doi.org/10.20382/jocg.v3i1a7},
doi = {10.20382/JOCG.V3I1A7},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/ChengKLS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/CarmiS12,
author = {Paz Carmi and
Michiel H. M. Smid},
title = {An optimal algorithm for computing angle-constrained spanners},
journal = {J. Comput. Geom.},
volume = {3},
number = {1},
pages = {196--221},
year = {2012},
url = {https://doi.org/10.20382/jocg.v3i1a10},
doi = {10.20382/JOCG.V3I1A10},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/CarmiS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BintMS12,
author = {Gregory Bint and
Anil Maheshwari and
Michiel H. M. Smid},
title = {xy-Monotone Path Existence Queries in a Rectilinear Environment},
booktitle = {Proceedings of the 24th Canadian Conference on Computational Geometry,
{CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10,
2012},
pages = {35--40},
year = {2012},
url = {http://2012.cccg.ca/papers/paper44.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BintMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BeingessnerS12,
author = {Alexis Beingessner and
Michiel H. M. Smid},
title = {Computing the Coverage of an Opaque Forest},
booktitle = {Proceedings of the 24th Canadian Conference on Computational Geometry,
{CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10,
2012},
pages = {95--100},
year = {2012},
url = {http://2012.cccg.ca/papers/paper53.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BeingessnerS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BoseCGMS12,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Carsten Grimm and
Anil Maheshwari and
Michiel H. M. Smid},
title = {On Farthest-Point Information in Networks},
booktitle = {Proceedings of the 24th Canadian Conference on Computational Geometry,
{CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10,
2012},
pages = {199--204},
year = {2012},
url = {http://2012.cccg.ca/papers/paper22.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BoseCGMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/DavoodiSW12,
author = {Pooya Davoodi and
Michiel H. M. Smid and
Freek van Walderveen},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {Two-Dimensional Range Diameter Queries},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {219--230},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_19},
doi = {10.1007/978-3-642-29344-3\_19},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/DavoodiSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-4679,
author = {Prosenjit Bose and
Vida Dujmovic and
Pat Morin and
Michiel H. M. Smid},
title = {Robust Geometric Spanners},
journal = {CoRR},
volume = {abs/1204.4679},
year = {2012},
url = {http://arxiv.org/abs/1204.4679},
eprinttype = {arXiv},
eprint = {1204.4679},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-4679.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-2734,
author = {Jasine Babu and
Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Fixed-Orientation Equilateral Triangle Matching of Point Sets},
journal = {CoRR},
volume = {abs/1211.2734},
year = {2012},
url = {http://arxiv.org/abs/1211.2734},
eprinttype = {arXiv},
eprint = {1211.2734},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-2734.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GudmundssonMS11,
author = {Joachim Gudmundsson and
Pat Morin and
Michiel H. M. Smid},
title = {Algorithms for Marketing-Mix Optimization},
journal = {Algorithmica},
volume = {60},
number = {4},
pages = {1004--1016},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9393-1},
doi = {10.1007/S00453-010-9393-1},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GudmundssonMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AbamBFGS11,
author = {Mohammad Ali Abam and
Mark de Berg and
Mohammad Farshi and
Joachim Gudmundsson and
Michiel H. M. Smid},
title = {Geometric Spanners for Weighted Point Sets},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {207--225},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9465-2},
doi = {10.1007/S00453-010-9465-2},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AbamBFGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BoseCCSX11,
author = {Prosenjit Bose and
Paz Carmi and
Mathieu Couture and
Michiel H. M. Smid and
Daming Xu},
title = {On a family of strong geometric spanners that admit local routing
strategies},
journal = {Comput. Geom.},
volume = {44},
number = {6-7},
pages = {319--328},
year = {2011},
url = {https://doi.org/10.1016/j.comgeo.2011.01.002},
doi = {10.1016/J.COMGEO.2011.01.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BoseCCSX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaheshwariSZ11,
author = {Anil Maheshwari and
Michiel H. M. Smid and
Norbert Zeh},
title = {Low-interference networks in metric spaces of bounded doubling dimension},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1120--1123},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.013},
doi = {10.1016/J.IPL.2011.09.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MaheshwariSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DeMNS11,
author = {Minati De and
Anil Maheshwari and
Subhas C. Nandy and
Michiel H. M. Smid},
title = {An In-Place Priority Search Tree},
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/paper41.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/DeMNS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DouiebEMS11,
author = {Karim Dou{\"{\i}}eb and
Matthew Eastman and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Approximation Algorithms for a Triangle Enclosure Problem},
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/paper75.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/DouiebEMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoseCFMS10,
author = {Prosenjit Bose and
Paz Carmi and
Mohammad Farshi and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Computing the Greedy Spanner in Near-Quadratic Time},
journal = {Algorithmica},
volume = {58},
number = {3},
pages = {711--729},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9293-4},
doi = {10.1007/S00453-009-9293-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BoseCFMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/AhnFKSW10,
author = {Hee{-}Kap Ahn and
Mohammad Farshi and
Christian Knauer and
Michiel H. M. Smid and
Yajun Wang},
title = {Dilation-Optimal Edge Deletion in Polygonal Cycles},
journal = {Int. J. Comput. Geom. Appl.},
volume = {20},
number = {1},
pages = {69--87},
year = {2010},
url = {https://doi.org/10.1142/S0218195910003207},
doi = {10.1142/S0218195910003207},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/AhnFKSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoseCLMMS10,
author = {Prosenjit Bose and
S{\'{e}}bastien Collette and
Stefan Langerman and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
title = {Sigma-local graphs},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {15--23},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2008.10.002},
doi = {10.1016/J.JDA.2008.10.002},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BoseCLMMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BoseCCS10,
author = {Prosenjit Bose and
Paz Carmi and
S{\'{e}}bastien Collette and
Michiel H. M. Smid},
title = {On the Stretch Factor of Convex Delaunay Graphs},
journal = {J. Comput. Geom.},
volume = {1},
number = {1},
pages = {41--56},
year = {2010},
url = {https://doi.org/10.20382/jocg.v1i1a4},
doi = {10.20382/JOCG.V1I1A4},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BoseCCS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/NekrichS10,
author = {Yakov Nekrich and
Michiel H. M. Smid},
title = {Approximating range-aggregate queries using coresets},
booktitle = {Proceedings of the 22nd Annual Canadian Conference on Computational
Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010},
pages = {253--256},
year = {2010},
url = {http://cccg.ca/proceedings/2010/paper67.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/NekrichS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChengKLS10,
author = {Siu{-}Wing Cheng and
Christian Knauer and
Stefan Langerman and
Michiel H. M. Smid},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {Approximating the Average Stretch Factor of Geometric Graphs},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6506},
pages = {37--48},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17517-6\_6},
doi = {10.1007/978-3-642-17517-6\_6},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChengKLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CarmiS10,
author = {Paz Carmi and
Michiel H. M. Smid},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {An Optimal Algorithm for Computing Angle-Constrained Spanners},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6506},
pages = {316--327},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17517-6\_29},
doi = {10.1007/978-3-642-17517-6\_29},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/CarmiS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BoseDDOSSW10,
author = {Prosenjit Bose and
Mirela Damian and
Karim Dou{\"{\i}}eb and
Joseph O'Rourke and
Ben Seamone and
Michiel H. M. Smid and
Stefanie Wuhrer},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {\emph{pi}/2-Angle Yao Graphs Are Spanners},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6507},
pages = {446--457},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17514-5\_38},
doi = {10.1007/978-3-642-17514-5\_38},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BoseDDOSSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BoseCSX10,
author = {Prosenjit Bose and
Paz Carmi and
Michiel H. M. Smid and
Daming Xu},
editor = {Alejandro L{\'{o}}pez{-}Ortiz},
title = {Communication-Efficient Construction of the Plane Localized Delaunay
Graph},
booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6034},
pages = {282--293},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12200-2\_26},
doi = {10.1007/978-3-642-12200-2\_26},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BoseCSX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseCJMMS10,
author = {Prosenjit Bose and
Paz Carmi and
Dana Jansens and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
editor = {Haim Kaplan},
title = {Improved Methods For Generating Quasi-gray Codes},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {224--235},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_22},
doi = {10.1007/978-3-642-13731-0\_22},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoseCJMMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-2913,
author = {Prosenjit Bose and
Mirela Damian and
Karim Dou{\"{\i}}eb and
Joseph O'Rourke and
Ben Seamone and
Michiel H. M. Smid and
Stefanie Wuhrer},
title = {Pi/2-Angle Yao Graphs are Spanners},
journal = {CoRR},
volume = {abs/1001.2913},
year = {2010},
url = {http://arxiv.org/abs/1001.2913},
eprinttype = {arXiv},
eprint = {1001.2913},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-2913.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-0905,
author = {Dana Jansens and
Prosenjit Bose and
Paz Carmi and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
title = {Improved Methods For Generating Quasi-Gray Codes},
journal = {CoRR},
volume = {abs/1010.0905},
year = {2010},
url = {http://arxiv.org/abs/1010.0905},
eprinttype = {arXiv},
eprint = {1010.0905},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-0905.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoseMSW09,
author = {Prosenjit Bose and
Pat Morin and
Michiel H. M. Smid and
Stefanie Wuhrer},
title = {Clamshell Casting},
journal = {Algorithmica},
volume = {55},
number = {4},
pages = {666--702},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9160-0},
doi = {10.1007/S00453-007-9160-0},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoseMSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BoseCCMSZ09,
author = {Prosenjit Bose and
Paz Carmi and
Mathieu Couture and
Anil Maheshwari and
Michiel H. M. Smid and
Norbert Zeh},
title = {Geometric spanners with small chromatic number},
journal = {Comput. Geom.},
volume = {42},
number = {2},
pages = {134--146},
year = {2009},
url = {https://doi.org/10.1016/j.comgeo.2008.04.003},
doi = {10.1016/J.COMGEO.2008.04.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BoseCCMSZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AsanoBCMSSW09,
author = {Tetsuo Asano and
Prosenjit Bose and
Paz Carmi and
Anil Maheshwari and
Chang Shu and
Michiel H. M. Smid and
Stefanie Wuhrer},
title = {A linear-space algorithm for distance preserving graph embedding},
journal = {Comput. Geom.},
volume = {42},
number = {4},
pages = {289--304},
year = {2009},
url = {https://doi.org/10.1016/j.comgeo.2008.06.004},
doi = {10.1016/J.COMGEO.2008.06.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AsanoBCMSSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BoseMSW09,
author = {Prosenjit Bose and
Pat Morin and
Michiel H. M. Smid and
Stefanie Wuhrer},
title = {Rotationally monotone polygons},
journal = {Comput. Geom.},
volume = {42},
number = {5},
pages = {471--483},
year = {2009},
url = {https://doi.org/10.1016/j.comgeo.2007.02.004},
doi = {10.1016/J.COMGEO.2007.02.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BoseMSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/KleinKNS09,
author = {Rolf Klein and
Christian Knauer and
Giri Narasimhan and
Michiel H. M. Smid},
title = {On the dilation spectrum of paths, cycles, and trees},
journal = {Comput. Geom.},
volume = {42},
number = {9},
pages = {923--933},
year = {2009},
url = {https://doi.org/10.1016/j.comgeo.2009.03.004},
doi = {10.1016/J.COMGEO.2009.03.004},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/KleinKNS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/BoseSX09,
author = {Prosenjit Bose and
Michiel H. M. Smid and
Daming Xu},
title = {Delaunay and diamond Triangulations contain Spanners of Bounded Degree},
journal = {Int. J. Comput. Geom. Appl.},
volume = {19},
number = {2},
pages = {119--140},
year = {2009},
url = {https://doi.org/10.1142/S0218195909002861},
doi = {10.1142/S0218195909002861},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/BoseSX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/GuptaJS09,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
title = {Efficient Non-Intersection Queries on Aggregated Geometric Data},
journal = {Int. J. Comput. Geom. Appl.},
volume = {19},
number = {6},
pages = {479--506},
year = {2009},
url = {https://doi.org/10.1142/S0218195909003088},
doi = {10.1142/S0218195909003088},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/GuptaJS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GudmundssonS09,
author = {Joachim Gudmundsson and
Michiel H. M. Smid},
title = {On Spanners of Geometric Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {20},
number = {1},
pages = {135--149},
year = {2009},
url = {https://doi.org/10.1142/S0129054109006486},
doi = {10.1142/S0129054109006486},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/GudmundssonS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MorigRST09,
author = {Marc M{\"{o}}rig and
Dieter Rautenbach and
Michiel H. M. Smid and
Jan Tusch},
title = {An Omega(nlogn) lower bound for computing the sum of even-ranked elements},
journal = {Inf. Process. Lett.},
volume = {109},
number = {16},
pages = {955--956},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.05.004},
doi = {10.1016/J.IPL.2009.05.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MorigRST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AtanassovBCMMPSW09,
author = {Rossen Atanassov and
Prosenjit Bose and
Mathieu Couture and
Anil Maheshwari and
Pat Morin and
Michel Paquette and
Michiel H. M. Smid and
Stefanie Wuhrer},
title = {Algorithms for optimal outlier removal},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {239--248},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.12.002},
doi = {10.1016/J.JDA.2008.12.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AtanassovBCMMPSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoseCCMMS09,
author = {Prosenjit Bose and
Paz Carmi and
Mathieu Couture and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
title = {Spanners of Complete k-Partite Geometric Graphs},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {5},
pages = {1803--1820},
year = {2009},
url = {https://doi.org/10.1137/070707130},
doi = {10.1137/070707130},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BoseCCMMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Smid09,
author = {Michiel H. M. Smid},
editor = {Susanne Albers and
Helmut Alt and
Stefan N{\"{a}}her},
title = {The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension},
booktitle = {Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion
of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5760},
pages = {275--289},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03456-5\_19},
doi = {10.1007/978-3-642-03456-5\_19},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Smid09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AbamBFGS09,
author = {Mohammad Ali Abam and
Mark de Berg and
Mohammad Farshi and
Joachim Gudmundsson and
Michiel H. M. Smid},
editor = {Amos Fiat and
Peter Sanders},
title = {Geometric Spanners for Weighted Point Sets},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {190--202},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_17},
doi = {10.1007/978-3-642-04128-0\_17},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/AbamBFGS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AbamCFS09,
author = {Mohammad Ali Abam and
Paz Carmi and
Mohammad Farshi and
Michiel H. M. Smid},
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 = {On the Power of the Semi-Separated Pair Decomposition},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {1--12},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_1},
doi = {10.1007/978-3-642-03367-4\_1},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/AbamCFS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2009P9451,
editor = {Gautam Das and
Joachim Gudmundsson and
Rolf Klein and
Christian Knauer and
Michiel H. M. Smid},
title = {Geometric Networks, Metric Space Embeddings and Spatial Data Mining,
01.11. - 06.11.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09451},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/portals/09451/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2009P9451.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DasGKKS09,
author = {Gautam Das and
Joachim Gudmundsson and
Rolf Klein and
Christian Knauer and
Michiel H. M. Smid},
editor = {Gautam Das and
Joachim Gudmundsson and
Rolf Klein and
Christian Knauer and
Michiel H. M. Smid},
title = {09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings
and Spatial Data Mining},
booktitle = {Geometric Networks, Metric Space Embeddings and Spatial Data Mining,
01.11. - 06.11.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09451},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2438/},
timestamp = {Thu, 10 Jun 2021 13:02:07 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DasGKKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-0930,
author = {Marc M{\"{o}}rig and
Michiel H. M. Smid and
Jan Tusch},
title = {An Omega(n log n) lower bound for computing the sum of even-ranked
elements},
journal = {CoRR},
volume = {abs/0901.0930},
year = {2009},
url = {http://arxiv.org/abs/0901.0930},
eprinttype = {arXiv},
eprint = {0901.0930},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-0930.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0903-0308,
author = {Joachim Gudmundsson and
Pat Morin and
Michiel H. M. Smid},
title = {Algorithms for Marketing-Mix Optimization},
journal = {CoRR},
volume = {abs/0903.0308},
year = {2009},
url = {http://arxiv.org/abs/0903.0308},
eprinttype = {arXiv},
eprint = {0903.0308},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0903-0308.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AronovBCGHSV08,
author = {Boris Aronov and
Mark de Berg and
Otfried Cheong and
Joachim Gudmundsson and
Herman J. Haverkort and
Michiel H. M. Smid and
Antoine Vigneron},
title = {Sparse geometric graphs with small dilation},
journal = {Comput. Geom.},
volume = {40},
number = {3},
pages = {207--219},
year = {2008},
url = {https://doi.org/10.1016/j.comgeo.2007.07.004},
doi = {10.1016/J.COMGEO.2007.07.004},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/AronovBCGHSV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/MaheshwariSZ08,
author = {Anil Maheshwari and
Michiel H. M. Smid and
Norbert Zeh},
title = {I/O-efficient algorithms for computing planar geometric spanners},
journal = {Comput. Geom.},
volume = {40},
number = {3},
pages = {252--271},
year = {2008},
url = {https://doi.org/10.1016/j.comgeo.2007.07.007},
doi = {10.1016/J.COMGEO.2007.07.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/MaheshwariSZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoseGKMMMST08,
author = {Prosenjit Bose and
Hua Guo and
Evangelos Kranakis and
Anil Maheshwari and
Pat Morin and
Jason Morrison and
Michiel H. M. Smid and
Yihui Tang},
title = {On the false-positive rate of Bloom filters},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {210--213},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.018},
doi = {10.1016/J.IPL.2008.05.018},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BoseGKMMMST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GudmundssonLNS08,
author = {Joachim Gudmundsson and
Christos Levcopoulos and
Giri Narasimhan and
Michiel H. M. Smid},
title = {Approximate distance oracles for geometric spanners},
journal = {{ACM} Trans. Algorithms},
volume = {4},
number = {1},
pages = {10:1--10:34},
year = {2008},
url = {https://doi.org/10.1145/1328911.1328921},
doi = {10.1145/1328911.1328921},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/GudmundssonLNS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/JanardanGKS08,
author = {Ravi Janardan and
Prosenjit Gupta and
Yokesh Kumar and
Michiel H. M. Smid},
title = {Data Structures for Range-Aggregate Extent Queries},
booktitle = {Proceedings of the 20th Annual Canadian Conference on Computational
Geometry, Montr{\'{e}}al, Canada, August 13-15, 2008},
year = {2008},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/JanardanGKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BoseCCS08,
author = {Prosenjit Bose and
Paz Carmi and
S{\'{e}}bastien Collette and
Michiel H. M. Smid},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {On the Stretch Factor of Convex Delaunay Graphs},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {656--667},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_58},
doi = {10.1007/978-3-540-92182-0\_58},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BoseCCS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BoseCCMMS08,
author = {Prosenjit Bose and
Paz Carmi and
Mathieu Couture and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {Spanners of Complete k -Partite Geometric Graphs},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {170--181},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_15},
doi = {10.1007/978-3-540-78773-0\_15},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BoseCCMMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseCFMS08,
author = {Prosenjit Bose and
Paz Carmi and
Mohammad Farshi and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Joachim Gudmundsson},
title = {Computing the Greedy Spanner in Near-Quadratic Time},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {390--401},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_35},
doi = {10.1007/978-3-540-69903-3\_35},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoseCFMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/GudmundssonNS08,
author = {Joachim Gudmundsson and
Giri Narasimhan and
Michiel H. M. Smid},
editor = {Ming{-}Yang Kao},
title = {Applications of Geometric Spanner Networks},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_15},
doi = {10.1007/978-0-387-30162-4\_15},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/GudmundssonNS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/GudmundssonNS08a,
author = {Joachim Gudmundsson and
Giri Narasimhan and
Michiel H. M. Smid},
editor = {Ming{-}Yang Kao},
title = {Geometric Spanners},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_167},
doi = {10.1007/978-0-387-30162-4\_167},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/GudmundssonNS08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/GudmundssonNS08b,
author = {Joachim Gudmundsson and
Giri Narasimhan and
Michiel H. M. Smid},
editor = {Ming{-}Yang Kao},
title = {Planar Geometric Spanners},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_294},
doi = {10.1007/978-0-387-30162-4\_294},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/GudmundssonNS08b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0804-1041,
author = {Prosenjit Bose and
Paz Carmi and
S{\'{e}}bastien Collette and
Michiel H. M. Smid},
title = {On the Stretch Factor of Convex Delaunay Graphs},
journal = {CoRR},
volume = {abs/0804.1041},
year = {2008},
url = {http://arxiv.org/abs/0804.1041},
eprinttype = {arXiv},
eprint = {0804.1041},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0804-1041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-2956,
author = {Prosenjit Bose and
Paz Carmi and
Michiel H. M. Smid and
Daming Xu},
title = {Communication-Efficient Construction of the Plane Localized Delaunay
Graph},
journal = {CoRR},
volume = {abs/0809.2956},
year = {2008},
url = {http://arxiv.org/abs/0809.2956},
eprinttype = {arXiv},
eprint = {0809.2956},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-2956.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0017763,
author = {Giri Narasimhan and
Michiel H. M. Smid},
title = {Geometric spanner networks},
publisher = {Cambridge University Press},
year = {2007},
timestamp = {Mon, 21 Mar 2011 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/daglib/0017763.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GudmundssonNS07,
author = {Joachim Gudmundsson and
Giri Narasimhan and
Michiel H. M. Smid},
title = {Distance-preserving approximations of polygonal paths},
journal = {Comput. Geom.},
volume = {36},
number = {3},
pages = {183--196},
year = {2007},
url = {https://doi.org/10.1016/j.comgeo.2006.05.002},
doi = {10.1016/J.COMGEO.2006.05.002},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/GudmundssonNS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BoseMMMSV07,
author = {Prosenjit Bose and
Anil Maheshwari and
Pat Morin and
Jason Morrison and
Michiel H. M. Smid and
Jan Vahrenhold},
title = {Space-efficient geometric divide-and-conquer algorithms},
journal = {Comput. Geom.},
volume = {37},
number = {3},
pages = {209--227},
year = {2007},
url = {https://doi.org/10.1016/j.comgeo.2006.03.006},
doi = {10.1016/J.COMGEO.2006.03.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BoseMMMSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AsanoBCMSSW07,
author = {Tetsuo Asano and
Prosenjit Bose and
Paz Carmi and
Anil Maheshwari and
Chang Shu and
Michiel H. M. Smid and
Stefanie Wuhrer},
editor = {Prosenjit Bose},
title = {Linear-Space Algorithms for Distance Preserving Embedding},
booktitle = {Proceedings of the 19th Annual Canadian Conference on Computational
Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa,
Canada},
pages = {185--188},
publisher = {Carleton University, Ottawa, Canada},
year = {2007},
url = {http://cccg.ca/proceedings/2007/08a3.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/AsanoBCMSSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AhnFKSW07,
author = {Hee{-}Kap Ahn and
Mohammad Farshi and
Christian Knauer and
Michiel H. M. Smid and
Yajun Wang},
editor = {Takeshi Tokuyama},
title = {Dilation-Optimal Edge Deletion in Polygonal Cycles},
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 = {88--99},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_10},
doi = {10.1007/978-3-540-77120-3\_10},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AhnFKSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoseCCSX07,
author = {Prosenjit Bose and
Paz Carmi and
Mathieu Couture and
Michiel H. M. Smid and
Daming Xu},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Norbert Zeh},
title = {On a Family of Strong Geometric Spanners That Admit Local Routing
Strategies},
booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS}
2007, Halifax, Canada, August 15-17, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4619},
pages = {300--311},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7\_27},
doi = {10.1007/978-3-540-73951-7\_27},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoseCCSX07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoseLS07,
author = {Prosenjit Bose and
Aaron Lee and
Michiel H. M. Smid},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Norbert Zeh},
title = {On Generalized Diamond Spanners},
booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS}
2007, Halifax, Canada, August 15-17, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4619},
pages = {325--336},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7\_29},
doi = {10.1007/978-3-540-73951-7\_29},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoseLS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BoseCCMSZ07,
author = {Prosenjit Bose and
Paz Carmi and
Mathieu Couture and
Anil Maheshwari and
Michiel H. M. Smid and
Norbert Zeh},
editor = {Christos Kaklamanis and
Martin Skutella},
title = {Geometric Spanners with Small Chromatic Number},
booktitle = {Approximation and Online Algorithms, 5th International Workshop, {WAOA}
2007, Eilat, Israel, October 11-12, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4927},
pages = {75--88},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77918-6\_7},
doi = {10.1007/978-3-540-77918-6\_7},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BoseCCMSZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2006P6481,
editor = {Joachim Gudmundsson and
Rolf Klein and
Giri Narasimhan and
Michiel H. M. Smid and
Alexander Wolff},
title = {Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006},
series = {Dagstuhl Seminar Proceedings},
volume = {06481},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/portals/06481/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2006P6481.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/Smid07,
author = {Michiel H. M. Smid},
editor = {Teofilo F. Gonzalez},
title = {The Well-Separated Pair Decomposition and Its Applications},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman and Hall/CRC},
year = {2007},
url = {https://doi.org/10.1201/9781420010749.ch53},
doi = {10.1201/9781420010749.CH53},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/Smid07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0711-0114,
author = {Prosenjit Bose and
Paz Carmi and
Mathieu Couture and
Anil Maheshwari and
Michiel H. M. Smid and
Norbert Zeh},
title = {Geometric Spanners With Small Chromatic Number},
journal = {CoRR},
volume = {abs/0711.0114},
year = {2007},
url = {http://arxiv.org/abs/0711.0114},
eprinttype = {arXiv},
eprint = {0711.0114},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0711-0114.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0712-0554,
author = {Prosenjit Bose and
Paz Carmi and
Mathieu Couture and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
title = {Spanners of Complete {\textdollar}k{\textdollar}-Partite Geometric
Graphs},
journal = {CoRR},
volume = {abs/0712.0554},
year = {2007},
url = {http://arxiv.org/abs/0712.0554},
eprinttype = {arXiv},
eprint = {0712.0554},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0712-0554.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0702080,
author = {Boris Aronov and
Mark de Berg and
Otfried Cheong and
Joachim Gudmundsson and
Herman J. Haverkort and
Michiel H. M. Smid and
Antoine Vigneron},
title = {Sparse geometric graphs with small dilation},
journal = {CoRR},
volume = {abs/cs/0702080},
year = {2007},
url = {http://arxiv.org/abs/cs/0702080},
eprinttype = {arXiv},
eprint = {cs/0702080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0702080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0702117,
author = {Prosenjit Bose and
Paz Carmi and
Mathieu Couture and
Michiel H. M. Smid and
Daming Xu},
title = {On a family of strong geometric spanners that admit local routing
strategies},
journal = {CoRR},
volume = {abs/cs/0702117},
year = {2007},
url = {http://arxiv.org/abs/cs/0702117},
eprinttype = {arXiv},
eprint = {cs/0702117},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0702117.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MaheshwariS06,
author = {Anil Maheshwari and
Michiel H. M. Smid},
title = {A Dynamic Dictionary for Priced Information with Application},
journal = {Algorithmica},
volume = {44},
number = {2},
pages = {151--165},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1204-8},
doi = {10.1007/S00453-005-1204-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MaheshwariS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/IlinkinJSJCS06,
author = {Ivaylo Ilinkin and
Ravi Janardan and
Michiel H. M. Smid and
Eric Johnson and
Paul Castillo and
J{\"{o}}rg Schwerdt},
title = {Heuristics for estimating contact area of supports in layered manufacturing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1210589},
doi = {10.1145/1187436.1210589},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/IlinkinJSJCS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/Smid06,
author = {Michiel H. M. Smid},
editor = {Joachim Gudmundsson and
C. Barry Jay},
title = {Geometric spanners with few edges and degree five},
booktitle = {Theory of Computing 2006, Proceedings of the Twelfth Computing: The
Australasian Theory Symposium {(CATS2006).} Hobart, Tasmania, Australia,
16-19 January 2006, Proceedings},
series = {{CRPIT}},
volume = {51},
pages = {7--9},
publisher = {Australian Computer Society},
year = {2006},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV51Smid.html},
timestamp = {Mon, 08 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cats/Smid06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BoseMSW06,
author = {Prosenjit Bose and
Pat Morin and
Michiel H. M. Smid and
Stefanie Wuhrer},
title = {Rotationally Monotone Polygons},
booktitle = {Proceedings of the 18th Annual Canadian Conference on Computational
Geometry, {CCCG} 2006, August 14-16, 2006, Queen's University, Ontario,
Canada},
year = {2006},
url = {http://www.cs.queensu.ca/cccg/papers/cccg27.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/BoseMSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BoseSX06,
author = {Prosenjit Bose and
Michiel H. M. Smid and
Daming Xu},
editor = {Tetsuo Asano},
title = {Diamond Triangulations Contain Spanners of Bounded Degree},
booktitle = {Algorithms and Computation, 17th International Symposium, {ISAAC}
2006, Kolkata, India, December 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4288},
pages = {173--182},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11940128\_19},
doi = {10.1007/11940128\_19},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BoseSX06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/AronovBDGILS06,
author = {Boris Aronov and
Prosenjit Bose and
Erik D. Demaine and
Joachim Gudmundsson and
John Iacono and
Stefan Langerman and
Michiel H. M. Smid},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {Data Structures for Halfplane Proximity Queries and Incremental Voronoi
Diagrams},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {80--92},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_12},
doi = {10.1007/11682462\_12},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/AronovBDGILS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lcn/BradfordPSW06,
author = {Phillip G. Bradford and
Irina Perevalova and
Michiel H. M. Smid and
Charles B. Ward},
title = {Indicator Random Variables in Traffic Analysis and the Birthday Problem},
booktitle = {{LCN} 2006, The 31st Annual {IEEE} Conference on Local Computer Networks,
Tampa, Florida, USA, 14-16 November 2006},
pages = {1016--1023},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/LCN.2006.322217},
doi = {10.1109/LCN.2006.322217},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lcn/BradfordPSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GudmundssonS06,
author = {Joachim Gudmundsson and
Michiel H. M. Smid},
editor = {Lars Arge and
Rusins Freivalds},
title = {On Spanners of Geometric Graphs},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {388--399},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_36},
doi = {10.1007/11785293\_36},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GudmundssonS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/GudmundssonKNSW06,
author = {Joachim Gudmundsson and
Rolf Klein and
Giri Narasimhan and
Michiel H. M. Smid and
Alexander Wolff},
editor = {Joachim Gudmundsson and
Rolf Klein and
Giri Narasimhan and
Michiel H. M. Smid and
Alexander Wolff},
title = {06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings},
booktitle = {Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006},
series = {Dagstuhl Seminar Proceedings},
volume = {06481},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2006},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/1029},
timestamp = {Thu, 10 Jun 2021 13:02:05 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/GudmundssonKNSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoseGS05,
author = {Prosenjit Bose and
Joachim Gudmundsson and
Michiel H. M. Smid},
title = {Constructing Plane Spanners of Bounded Degree and Low Weight},
journal = {Algorithmica},
volume = {42},
number = {3-4},
pages = {249--264},
year = {2005},
url = {https://doi.org/10.1007/s00453-005-1168-8},
doi = {10.1007/S00453-005-1168-8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoseGS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/ChenSX05,
author = {Danny Z. Chen and
Michiel H. M. Smid and
Bin Xu},
title = {Geometric Algorithms for Density-based Data Clustering},
journal = {Int. J. Comput. Geom. Appl.},
volume = {15},
number = {3},
pages = {239--260},
year = {2005},
url = {https://doi.org/10.1142/S0218195905001683},
doi = {10.1142/S0218195905001683},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/ChenSX05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/KrizancMS05,
author = {Danny Krizanc and
Pat Morin and
Michiel H. M. Smid},
title = {Range Mode and Range Median Queries on Lists and Trees},
journal = {Nord. J. Comput.},
volume = {12},
number = {1},
pages = {1--17},
year = {2005},
timestamp = {Wed, 03 May 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/KrizancMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/GuptaJS05,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
editor = {Lusheng Wang},
title = {Efficient Non-intersection Queries on Aggregated Geometric Data},
booktitle = {Computing and Combinatorics, 11th Annual International Conference,
{COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3595},
pages = {544--553},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11533719\_55},
doi = {10.1007/11533719\_55},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/GuptaJS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KleinKNS05,
author = {Rolf Klein and
Christian Knauer and
Giri Narasimhan and
Michiel H. M. Smid},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {Exact and Approximation Algorithms for Computing the Dilation Spectrum
of Paths, Trees, and Cycles},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {849--858},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_85},
doi = {10.1007/11602613\_85},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KleinKNS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GudmundssonNS05,
author = {Joachim Gudmundsson and
Giri Narasimhan and
Michiel H. M. Smid},
editor = {Volker Diekert and
Bruno Durand},
title = {Fast Pruning of Geometric Spanners},
booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3404},
pages = {508--520},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_42},
doi = {10.1007/978-3-540-31856-9\_42},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GudmundssonNS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs67,
editor = {Ravi Janardan and
Michiel H. M. Smid and
Debasis Dutta},
title = {Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing,
Proceedings of a {DIMACS} Workshop, Piscataway, New Jersey, USA, October
7-9, 2003},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {67},
publisher = {{DIMACS/AMS}},
year = {2005},
url = {https://doi.org/10.1090/dimacs/067},
doi = {10.1090/DIMACS/067},
isbn = {0-8218-3628-5},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/dimacs67.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0512091,
author = {Boris Aronov and
Prosenjit Bose and
Erik D. Demaine and
Joachim Gudmundsson and
John Iacono and
Stefan Langerman and
Michiel H. M. Smid},
title = {Data Structures for Halfplane Proximity Queries and Incremental Voronoi
Diagrams},
journal = {CoRR},
volume = {abs/cs/0512091},
year = {2005},
url = {http://arxiv.org/abs/cs/0512091},
eprinttype = {arXiv},
eprint = {cs/0512091},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0512091.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BoseMNSZ04,
author = {Prosenjit Bose and
Anil Maheshwari and
Giri Narasimhan and
Michiel H. M. Smid and
Norbert Zeh},
title = {Approximating geometric bottleneck shortest paths},
journal = {Comput. Geom.},
volume = {29},
number = {3},
pages = {233--249},
year = {2004},
url = {https://doi.org/10.1016/j.comgeo.2004.04.003},
doi = {10.1016/J.COMGEO.2004.04.003},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/BoseMNSZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SmidRWL04,
author = {Michiel H. M. Smid and
Rahul Ray and
Ulrich Wendt and
Katharina Lange},
title = {Computing large planar regions in terrains, with an application to
fracture surfaces},
journal = {Discret. Appl. Math.},
volume = {139},
number = {1-3},
pages = {253--264},
year = {2004},
url = {https://doi.org/10.1016/j.dam.2002.11.004},
doi = {10.1016/J.DAM.2002.11.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SmidRWL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BoseSW04,
author = {Prosenjit Bose and
Michiel H. M. Smid and
David R. Wood},
title = {Light edges in degree-constrained graphs},
journal = {Discret. Math.},
volume = {282},
number = {1-3},
pages = {35--41},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2003.12.003},
doi = {10.1016/J.DISC.2003.12.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BoseSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/IlinkinJSJCS04,
author = {Ivaylo Ilinkin and
Ravi Janardan and
Michiel H. M. Smid and
Eric Johnson and
Paul Castillo and
J{\"{o}}rg Schwerdt},
title = {Approximating contact-area of supports in layered manufacturing},
booktitle = {Proceedings of the 16th Canadian Conference on Computational Geometry,
CCCG'04, Concordia University, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada, August 9-11, 2004},
pages = {91--94},
year = {2004},
url = {http://www.cccg.ca/proceedings/2004/21.pdf},
timestamp = {Fri, 26 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/IlinkinJSJCS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/GuptaJS04,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
editor = {Dinesh P. Mehta and
Sartaj Sahni},
title = {Computational Geometry},
booktitle = {Handbook of Data Structures and Applications},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {https://doi.org/10.1201/9781420035179.ch64},
doi = {10.1201/9781420035179.CH64},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/reference/crc/GuptaJS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cad/HonJSS03,
author = {Man Chung Hon and
Ravi Janardan and
J{\"{o}}rg Schwerdt and
Michiel H. M. Smid},
title = {Minimizing the total projection of a set of vectors, with applications
to layered manufacturing},
journal = {Comput. Aided Des.},
volume = {35},
number = {1},
pages = {57--68},
year = {2003},
url = {https://doi.org/10.1016/S0010-4485(01)00175-0},
doi = {10.1016/S0010-4485(01)00175-0},
timestamp = {Thu, 13 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cad/HonJSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cad/SchwerdtSJJ03,
author = {J{\"{o}}rg Schwerdt and
Michiel H. M. Smid and
Ravi Janardan and
Eric Johnson},
title = {Protecting critical facets in layered manufacturing: implementation
and experimental results},
journal = {Comput. Aided Des.},
volume = {35},
number = {7},
pages = {647--657},
year = {2003},
url = {https://doi.org/10.1016/S0010-4485(02)00090-8},
doi = {10.1016/S0010-4485(02)00090-8},
timestamp = {Thu, 13 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cad/SchwerdtSJJ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/JanardanS03,
author = {Ravi Janardan and
Michiel H. M. Smid},
editor = {Ravi Janardan and
Michiel H. M. Smid and
Debasis Dutta},
title = {Geometric Algorithms for Layered Manufacturing},
booktitle = {Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing,
Proceedings of a {DIMACS} Workshop, Piscataway, New Jersey, USA, October
7-9, 2003},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {67},
pages = {189--220},
publisher = {{DIMACS/AMS}},
year = {2003},
url = {https://doi.org/10.1090/dimacs/067/07},
doi = {10.1090/DIMACS/067/07},
timestamp = {Mon, 22 May 2023 16:07:34 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/JanardanS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GudmundssonNS03,
author = {Joachim Gudmundsson and
Giri Narasimhan and
Michiel H. M. Smid},
editor = {Paritosh K. Pandya and
Jaikumar Radhakrishnan},
title = {Distance-Preserving Approximations of Polygonal Paths},
booktitle = {{FST} {TCS} 2003: Foundations of Software Technology and Theoretical
Computer Science, 23rd Conference, Mumbai, India, December 15-17,
2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2914},
pages = {217--228},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24597-1\_19},
doi = {10.1007/978-3-540-24597-1\_19},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GudmundssonNS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MaheshwariS03,
author = {Anil Maheshwari and
Michiel H. M. Smid},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {A Dynamic Dictionary for Priced Information with Application},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {16--25},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_4},
doi = {10.1007/978-3-540-24587-2\_4},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/MaheshwariS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KrizancMS03,
author = {Danny Krizanc and
Pat Morin and
Michiel H. M. Smid},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {Range Mode and Range Median Queries on Lists and Trees},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {517--526},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_53},
doi = {10.1007/978-3-540-24587-2\_53},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KrizancMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BoseMNSZ03,
author = {Prosenjit Bose and
Anil Maheshwari and
Giri Narasimhan and
Michiel H. M. Smid and
Norbert Zeh},
editor = {Helmut Alt and
Michel Habib},
title = {Approximating Geometric Bottleneck Shortest Paths},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {38--49},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_5},
doi = {10.1007/3-540-36494-3\_5},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BoseMNSZ03.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/corr/cs-DS-0307034,
author = {Danny Krizanc and
Pat Morin and
Michiel H. M. Smid},
title = {Range Mode and Range Median Queries on Lists and Trees},
journal = {CoRR},
volume = {cs.DS/0307034},
year = {2003},
url = {http://arxiv.org/abs/cs/0307034},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0307034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LevcopoulosNS02,
author = {Christos Levcopoulos and
Giri Narasimhan and
Michiel H. M. Smid},
title = {Improved Algorithms for Constructing Fault-Tolerant Spanners},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {144--156},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0075-x},
doi = {10.1007/S00453-001-0075-X},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LevcopoulosNS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/IlinkinJMJ02,
author = {Ivaylo Ilinkin and
Ravi Janardan and
Jayanth Majhi and
J{\"{o}}rg Schwerdt and
Michiel H. M. Smid and
Ram D. Sriram},
title = {A decomposition-based approach to layered manufacturing},
journal = {Comput. Geom.},
volume = {23},
number = {2},
pages = {117--151},
year = {2002},
url = {https://doi.org/10.1016/S0925-7721(01)00059-1},
doi = {10.1016/S0925-7721(01)00059-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/IlinkinJMJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/SmidS02,
author = {Michiel H. M. Smid and
Vanam Srilakshmi},
title = {Computing the Smallest T-Shaped Polygon Containing k Points},
journal = {Int. J. Comput. Math.},
volume = {79},
number = {2},
pages = {143--156},
year = {2002},
url = {https://doi.org/10.1080/00207160211923},
doi = {10.1080/00207160211923},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/SmidS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/SchwerdtSHJ02,
author = {J{\"{o}}rg Schwerdt and
Michiel H. M. Smid and
Man Chung Hon and
Ravi Janardan},
title = {Computing an Optimal Hatching Direction in Layered Manufacturing},
journal = {Int. J. Comput. Math.},
volume = {79},
number = {10},
pages = {1067--1081},
year = {2002},
url = {https://doi.org/10.1080/00207160212705},
doi = {10.1080/00207160212705},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/SchwerdtSHJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/NarasimhanS02,
author = {Giri Narasimhan and
Michiel H. M. Smid},
title = {Approximation Algorithms for the Bottleneck Stretch Factor Problem},
journal = {Nord. J. Comput.},
volume = {9},
number = {1},
pages = {13--31},
year = {2002},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/NarasimhanS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BoseSW02,
author = {Prosenjit Bose and
Michiel H. M. Smid and
David R. Wood},
title = {Light edges in degree-constrained graphs},
booktitle = {Proceedings of the 14th Canadian Conference on Computational Geometry,
University of Lethbridge, Alberta, Canada, August 12-14, 2002},
pages = {142--145},
year = {2002},
url = {http://www.cs.uleth.ca/\%7Ewismath/cccg/papers/35.ps},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/BoseSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/IlinkinJS02,
author = {Ivaylo Ilinkin and
Ravi Janardan and
Michiel H. M. Smid},
editor = {Oscar H. Ibarra and
Louxin Zhang},
title = {Terrain Polygon Decomposition, with Application to Layered Manufacturing},
booktitle = {Computing and Combinatorics, 8th Annual International Conference,
{COCOON} 2002, Singapore, August 15-17, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2387},
pages = {381--390},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45655-4\_41},
doi = {10.1007/3-540-45655-4\_41},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/IlinkinJS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AgarwalHRSSW02,
author = {Pankaj K. Agarwal and
Torben Hagerup and
Rahul Ray and
Micha Sharir and
Michiel H. M. Smid and
Emo Welzl},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {Translating a Planar Object to Maximize Point Containment},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {42--53},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_8},
doi = {10.1007/3-540-45749-6\_8},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/AgarwalHRSSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BoseGS02,
author = {Prosenjit Bose and
Joachim Gudmundsson and
Michiel H. M. Smid},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {Constructing Plane Spanners of Bounded Degree and Low Weight},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {234--246},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_24},
doi = {10.1007/3-540-45749-6\_24},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BoseGS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChenSX02,
author = {Danny Z. Chen and
Michiel H. M. Smid and
Bin Xu},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {Geometric Algorithms for Density-Based Data Clustering},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {284--296},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_28},
doi = {10.1007/3-540-45749-6\_28},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChenSX02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GudmundssonLNS02,
author = {Joachim Gudmundsson and
Christos Levcopoulos and
Giri Narasimhan and
Michiel H. M. Smid},
editor = {Prosenjit Bose and
Pat Morin},
title = {Approximate Distance Oracles Revisited},
booktitle = {Algorithms and Computation, 13th International Symposium, {ISAAC}
2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2518},
pages = {357--368},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36136-7\_32},
doi = {10.1007/3-540-36136-7\_32},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GudmundssonLNS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GudmundssonLNS02,
author = {Joachim Gudmundsson and
Christos Levcopoulos and
Giri Narasimhan and
Michiel H. M. Smid},
editor = {David Eppstein},
title = {Approximate distance oracles for geometric graphs},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {828--837},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545489},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GudmundssonLNS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenDS01,
author = {Danny Z. Chen and
Gautam Das and
Michiel H. M. Smid},
title = {Lower bounds for computing geometric spanners and approximate shortest
paths},
journal = {Discret. Appl. Math.},
volume = {110},
number = {2-3},
pages = {151--167},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00280-8},
doi = {10.1016/S0166-218X(00)00280-8},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChenDS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccS/HonJSS01,
author = {Man Chung Hon and
Ravi Janardan and
J{\"{o}}rg Schwerdt and
Michiel H. M. Smid},
editor = {Vassil N. Alexandrov and
Jack J. Dongarra and
Benjoe A. Juliano and
Ren{\'{e}} S. Renner and
Chih Jeng Kenneth Tan},
title = {Computing Optimal Hatching Directions in Layered Manufacturing},
booktitle = {Computational Science - {ICCS} 2001, International Conference, San
Francisco, CA, USA, May 28-30, 2001. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {2073},
pages = {683--692},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45545-0\_79},
doi = {10.1007/3-540-45545-0\_79},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/iccS/HonJSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/NarasimhanS01,
author = {Giri Narasimhan and
Michiel H. M. Smid},
editor = {Afonso Ferreira and
Horst Reichel},
title = {Approximation Algorithms for the Bottleneck Stretch Factor Problem},
booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
Science, Dresden, Germany, February 15-17, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2010},
pages = {502--513},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_44},
doi = {10.1007/3-540-44693-1\_44},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/NarasimhanS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/MaheshwariSZ01,
author = {Anil Maheshwari and
Michiel H. M. Smid and
Norbert Zeh},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {I/O-Efficient Shortest Path Queries in Geometric Spanners},
booktitle = {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},
pages = {287--299},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_27},
doi = {10.1007/3-540-44634-6\_27},
timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
biburl = {https://dblp.org/rec/conf/wads/MaheshwariSZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/IlinkinJMSSS01,
author = {Ivaylo Ilinkin and
Ravi Janardan and
Jayanth Majhi and
J{\"{o}}rg Schwerdt and
Michiel H. M. Smid and
Ram D. Sriram},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {A Decomposition-Based Approach to Layered Manufacturing},
booktitle = {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},
pages = {389--400},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_36},
doi = {10.1007/3-540-44634-6\_36},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/IlinkinJMSSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/LangeRSW01,
author = {Katharina Lange and
Rahul Ray and
Michiel H. M. Smid and
Ulrich Wendt},
editor = {S{\'{e}}bastien Fourey and
Gabor T. Herman and
T. Yung Kong},
title = {Computing large planar regions in terrains},
booktitle = {8th International Workshop on Combinatorial Image Analysis, {IWCIA}
2001, Philadelphia, PA, USA, August 23-24, 2001},
series = {Electronic Notes in Theoretical Computer Science},
volume = {46},
pages = {133--145},
publisher = {Elsevier},
year = {2001},
url = {https://doi.org/10.1016/S1571-0661(04)80982-4},
doi = {10.1016/S1571-0661(04)80982-4},
timestamp = {Wed, 30 Nov 2022 11:29:59 +0100},
biburl = {https://dblp.org/rec/journals/entcs/LangeRSW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/SchwerdtSJJM00,
author = {J{\"{o}}rg Schwerdt and
Michiel H. M. Smid and
Ravi Janardan and
Eric Johnson and
Jayanth Majhi},
title = {Protecting critical facets in layered manufacturing},
journal = {Comput. Geom.},
volume = {16},
number = {3},
pages = {187--210},
year = {2000},
url = {https://doi.org/10.1016/S0925-7721(00)00008-0},
doi = {10.1016/S0925-7721(00)00008-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/SchwerdtSJJM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DasS00,
author = {Gautam Das and
Michiel H. M. Smid},
title = {A lower bound for approximating the geometric minimum weight matching},
journal = {Inf. Process. Lett.},
volume = {74},
number = {5-6},
pages = {253--255},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(00)00062-4},
doi = {10.1016/S0020-0190(00)00062-4},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DasS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NarasimhanS00,
author = {Giri Narasimhan and
Michiel H. M. Smid},
title = {Approximating the Stretch Factor of Euclidean Graphs},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {3},
pages = {978--989},
year = {2000},
url = {https://doi.org/10.1137/S0097539799361671},
doi = {10.1137/S0097539799361671},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/NarasimhanS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/00/Smid00,
author = {Michiel H. M. Smid},
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jorge Urrutia},
title = {Closest-Point Problems in Computational Geometry},
booktitle = {Handbook of Computational Geometry},
pages = {877--935},
publisher = {North Holland / Elsevier},
year = {2000},
url = {https://doi.org/10.1016/b978-044482537-7/50021-8},
doi = {10.1016/B978-044482537-7/50021-8},
timestamp = {Fri, 15 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/el/00/Smid00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/MajhiJSG99,
author = {Jayanth Majhi and
Ravi Janardan and
Michiel H. M. Smid and
Prosenjit Gupta},
title = {On some geometric optimization problems in layered manufacturing},
journal = {Comput. Geom.},
volume = {12},
number = {3-4},
pages = {219--239},
year = {1999},
url = {https://doi.org/10.1016/S0925-7721(99)00002-4},
doi = {10.1016/S0925-7721(99)00002-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/MajhiJSG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/MajhiJSSG99,
author = {Jayanth Majhi and
Ravi Janardan and
J{\"{o}}rg Schwerdt and
Michiel H. M. Smid and
Prosenjit Gupta},
title = {Minimizing support structures and trapped area in two-dimensional
layered manufacturing},
journal = {Comput. Geom.},
volume = {12},
number = {3-4},
pages = {241--267},
year = {1999},
url = {https://doi.org/10.1016/S0925-7721(99)00003-6},
doi = {10.1016/S0925-7721(99)00003-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/MajhiJSSG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AryaMS99,
author = {Sunil Arya and
David M. Mount and
Michiel H. M. Smid},
title = {Dynamic algorithms for geometric spanners of small diameter: Randomized
solutions},
journal = {Comput. Geom.},
volume = {13},
number = {2},
pages = {91--107},
year = {1999},
url = {https://doi.org/10.1016/S0925-7721(99)00014-0},
doi = {10.1016/S0925-7721(99)00014-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AryaMS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/SmidJ99,
author = {Michiel H. M. Smid and
Ravi Janardan},
title = {On the width and roundness of a set of points in the plane},
journal = {Int. J. Comput. Geom. Appl.},
volume = {9},
number = {1},
pages = {97--108},
year = {1999},
url = {https://doi.org/10.1142/S021819599900008X},
doi = {10.1142/S021819599900008X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/SmidJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuptaJS99,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
title = {Efficient Algorithms for Counting and Reporting Pairwise Intersections
Between Convex Polygons},
journal = {Inf. Process. Lett.},
volume = {69},
number = {1},
pages = {7--13},
year = {1999},
url = {https://doi.org/10.1016/S0020-0190(98)00187-2},
doi = {10.1016/S0020-0190(98)00187-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuptaJS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SchwerdtSMJ99,
author = {J{\"{o}}rg Schwerdt and
Michiel H. M. Smid and
Jayanth Majhi and
Ravi Janardan},
title = {Computing the Width of a Three-Dimensional Point Set: An Experimental
Study},
journal = {{ACM} J. Exp. Algorithmics},
volume = {4},
pages = {8},
year = {1999},
url = {https://doi.org/10.1145/347792.347816},
doi = {10.1145/347792.347816},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SchwerdtSMJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/SchwerdtSJJM99,
author = {J{\"{o}}rg Schwerdt and
Michiel H. M. Smid and
Ravi Janardan and
Eric Johnson and
Jayanth Majhi},
editor = {C. Pandu Rangan and
Venkatesh Raman and
Ramaswamy Ramanujam},
title = {Protecting Facets in Layered Manufacturing},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
19th Conference, Chennai, India, December 13-15, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1738},
pages = {291--303},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46691-6\_23},
doi = {10.1007/3-540-46691-6\_23},
timestamp = {Tue, 12 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/SchwerdtSJJM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GolinRSS98,
author = {Mordecai J. Golin and
Rajeev Raman and
Christian Schwarz and
Michiel H. M. Smid},
title = {Randomized Data Structures for the Dynamic Closest-Pair Problem},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1036--1072},
year = {1998},
url = {https://doi.org/10.1137/S0097539794277718},
doi = {10.1137/S0097539794277718},
timestamp = {Sat, 20 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GolinRSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/MajhiJSS98,
author = {Jayanth Majhi and
Ravi Janardan and
Michiel H. M. Smid and
J{\"{o}}rg Schwerdt},
editor = {Ravi Janardan},
title = {Multi-Criteria Geometric Optimization Problems in Layered Manufacturing},
booktitle = {Proceedings of the Fourteenth Annual Symposium on Computational Geometry,
Minneapolis, Minnesota, USA, June 7-10, 1998},
pages = {19--28},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276884.276887},
doi = {10.1145/276884.276887},
timestamp = {Mon, 14 Jun 2021 16:25:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/MajhiJSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LevcopoulosNS98,
author = {Christos Levcopoulos and
Giri Narasimhan and
Michiel H. M. Smid},
editor = {Jeffrey Scott Vitter},
title = {Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {186--195},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276734},
doi = {10.1145/276698.276734},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LevcopoulosNS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/SchwerdtSMJ98,
author = {J{\"{o}}rg Schwerdt and
Michiel H. M. Smid and
Jayanth Majhi and
Ravi Janardan},
editor = {Kurt Mehlhorn},
title = {Computing the Width of a Three-Dimensional Point Set: An Experimental
Study},
booktitle = {Algorithm Engineering, 2nd International Workshop, {WAE} '92, Saarbr{\"{u}}cken,
Germany, August 20-22, 1998, Proceedings},
pages = {62--73},
publisher = {Max-Planck-Institut f{\"{u}}r Informatik},
year = {1998},
timestamp = {Mon, 10 May 2021 14:22:35 +0200},
biburl = {https://dblp.org/rec/conf/wae/SchwerdtSMJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AryaS97,
author = {Sunil Arya and
Michiel H. M. Smid},
title = {Efficient Construction of a Bounded-Degree Spanner with Low Weight},
journal = {Algorithmica},
volume = {17},
number = {1},
pages = {33--54},
year = {1997},
url = {https://doi.org/10.1007/BF02523237},
doi = {10.1007/BF02523237},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AryaS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DasKS97,
author = {Gautam Das and
Sanjiv Kapoor and
Michiel H. M. Smid},
title = {On the Complexity of Approximating Euclidean Traveling Salesman Tours
and Minimum Spanning Trees},
journal = {Algorithmica},
volume = {19},
number = {4},
pages = {447--460},
year = {1997},
url = {https://doi.org/10.1007/PL00009183},
doi = {10.1007/PL00009183},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DasKS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/GuptaJSD97,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid and
Bhaskar DasGupta},
title = {The Rectangle Enclosure and Point-Dominance Problems Revisited},
journal = {Int. J. Comput. Geom. Appl.},
volume = {7},
number = {5},
pages = {437--455},
year = {1997},
url = {https://doi.org/10.1142/S0218195997000260},
doi = {10.1142/S0218195997000260},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/GuptaJSD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/FollertSSST97,
author = {Frank Follert and
Elmar Sch{\"{o}}mer and
J{\"{u}}rgen Sellen and
Michiel H. M. Smid and
Christian Thiel},
title = {Computing a Largest Empty Anchored Cylinder, and Related Problems},
journal = {Int. J. Comput. Geom. Appl.},
volume = {7},
number = {6},
pages = {563--580},
year = {1997},
url = {https://doi.org/10.1142/S0218195997000351},
doi = {10.1142/S0218195997000351},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/FollertSSST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuptaJS97,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
title = {A Technique for Adding Range Restrictions to Generalized Searching
Problems},
journal = {Inf. Process. Lett.},
volume = {64},
number = {5},
pages = {263--269},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00183-X},
doi = {10.1016/S0020-0190(97)00183-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuptaJS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BradfordFS97,
author = {Phillip G. Bradford and
Rudolf Fleischer and
Michiel H. M. Smid},
title = {More Efficient Parallel Totally Monotone Matrix Searching},
journal = {J. Algorithms},
volume = {23},
number = {2},
pages = {386--400},
year = {1997},
url = {https://doi.org/10.1006/jagm.1996.0824},
doi = {10.1006/JAGM.1996.0824},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BradfordFS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/SchwerdtSS97,
author = {J{\"{o}}rg Schwerdt and
Michiel H. M. Smid and
Stefan Schirra},
editor = {Jean{-}Daniel Boissonnat},
title = {Computing the Minimum Diameter for Moving Points: An Exact Implementation
Using Parametric Search},
booktitle = {Proceedings of the Thirteenth Annual Symposium on Computational Geometry,
Nice, France, June 4-6, 1997},
pages = {466--468},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/262839.263087},
doi = {10.1145/262839.263087},
timestamp = {Mon, 14 Jun 2021 16:25:04 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/SchwerdtSS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/MajhiJSG97,
author = {Jayanth Majhi and
Ravi Janardan and
Michiel H. M. Smid and
Prosenjit Gupta},
editor = {Frank K. H. A. Dehne and
Andrew Rau{-}Chaplin and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {On Some Geometric Optimization Problems in Layered Manufacturing},
booktitle = {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},
pages = {136--149},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63307-3\_54},
doi = {10.1007/3-540-63307-3\_54},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/MajhiJSG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GuptaJS96,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
title = {Algorithms for Generalized Halfspace Range Searching and Other Intersection
Searching Problems},
journal = {Comput. Geom.},
volume = {6},
pages = {1--19},
year = {1996},
url = {https://doi.org/10.1016/0925-7721(95)00012-7},
doi = {10.1016/0925-7721(95)00012-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/GuptaJS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GuptaJS96a,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
title = {Fast Algorithms for Collision and Proximity Problems Involving Moving
Geometric Objects},
journal = {Comput. Geom.},
volume = {6},
pages = {371--391},
year = {1996},
url = {https://doi.org/10.1016/0925-7721(95)00028-3},
doi = {10.1016/0925-7721(95)00028-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/GuptaJS96a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KapoorS96,
author = {Sanjiv Kapoor and
Michiel H. M. Smid},
title = {New Techniques for Exact and Approximate Dynamic Closest-Point Problems},
journal = {{SIAM} J. Comput.},
volume = {25},
number = {4},
pages = {775--796},
year = {1996},
url = {https://doi.org/10.1137/S0097539793259458},
doi = {10.1137/S0097539793259458},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KapoorS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/GuptaJS96,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
editor = {Frank Fiala and
Evangelos Kranakis and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Efficient Algorithms for Counting and Reporting Pairwise Intersections
Between Convex Polygons},
booktitle = {Proceedings of the 8th Canadian Conference on Computational Geometry,
Carleton University, Ottawa, Canada, August 12-15, 1996},
pages = {8--13},
publisher = {Carleton University Press},
year = {1996},
url = {http://www.cccg.ca/proceedings/1996/cccg1996\_0002.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/GuptaJS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/ChenDS96,
author = {Danny Z. Chen and
Gautam Das and
Michiel H. M. Smid},
editor = {Frank Fiala and
Evangelos Kranakis and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Lower Bounds for Computing Geometric Spanners and Approximate Shortest
Paths},
booktitle = {Proceedings of the 8th Canadian Conference on Computational Geometry,
Carleton University, Ottawa, Canada, August 12-15, 1996},
pages = {155--160},
publisher = {Carleton University Press},
year = {1996},
url = {http://www.cccg.ca/proceedings/1996/cccg1996\_0027.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/ChenDS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ArikatiCCDSZ96,
author = {Srinivasa Rao Arikati and
Danny Z. Chen and
L. Paul Chew and
Gautam Das and
Michiel H. M. Smid and
Christos D. Zaroliagis},
editor = {Josep D{\'{\i}}az and
Maria J. Serna},
title = {Planar Spanners and Approximate Shortest Path Queries among Obstacles
in the Plane},
booktitle = {Algorithms - {ESA} '96, Fourth Annual European Symposium, Barcelona,
Spain, September 25-27, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1136},
pages = {514--528},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61680-2\_79},
doi = {10.1007/3-540-61680-2\_79},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/ArikatiCCDSZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DasKS96,
author = {Gautam Das and
Sanjiv Kapoor and
Michiel H. M. Smid},
editor = {Vijay Chandru and
V. Vinay},
title = {On the Complexity of Approximating Euclidean Traveling Salesman Tours
and Minimum Spanning Trees},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1180},
pages = {64--75},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-62034-6\_38},
doi = {10.1007/3-540-62034-6\_38},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/DasKS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LenhofS95,
author = {Hans{-}Peter Lenhof and
Michiel H. M. Smid},
title = {Maintaining the Visibility Map of Spheres While Moving the Viewpoint
on a Circle at Infinity},
journal = {Algorithmica},
volume = {13},
number = {3},
pages = {301--312},
year = {1995},
url = {https://doi.org/10.1007/BF01190509},
doi = {10.1007/BF01190509},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LenhofS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GuptaJS95,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
title = {Algorithms for Generalized Halfspace Range Searching and Other Intersection
Searching Problems},
journal = {Comput. Geom.},
volume = {5},
pages = {321--340},
year = {1995},
url = {https://doi.org/10.1016/0925-7721(94)00019-0},
doi = {10.1016/0925-7721(94)00019-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/GuptaJS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Smid95,
author = {Michiel H. M. Smid},
title = {Dynamic Rectangular Point Location, with an Application to the Closest
Pair Problem},
journal = {Inf. Comput.},
volume = {116},
number = {1},
pages = {1--9},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1001},
doi = {10.1006/INCO.1995.1001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Smid95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/LenhofS95,
author = {Hans{-}Peter Lenhof and
Michiel H. M. Smid},
title = {Sequential and parallel algorithms for the k closest pairs problem},
journal = {Int. J. Comput. Geom. Appl.},
volume = {5},
number = {3},
pages = {273--288},
year = {1995},
url = {https://doi.org/10.1142/S0218195995000167},
doi = {10.1142/S0218195995000167},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/LenhofS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GuptaJS95,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
title = {Further Results on Generalized Intersection Searching Problems: Counting,
Reporting, and Dynamization},
journal = {J. Algorithms},
volume = {19},
number = {2},
pages = {282--317},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1038},
doi = {10.1006/JAGM.1995.1038},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GuptaJS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/DattaLSS95,
author = {Amitava Datta and
Hans{-}Peter Lenhof and
Christian Schwarz and
Michiel H. M. Smid},
title = {Static and Dynamic Algorithms for \emph{k}-Point Clustering Problems},
journal = {J. Algorithms},
volume = {19},
number = {3},
pages = {474--503},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1048},
doi = {10.1006/JAGM.1995.1048},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/DattaLSS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/GolinRSS95,
author = {Mordecai J. Golin and
Rajeev Raman and
Christian Schwarz and
Michiel H. M. Smid},
title = {Simple Randomized Algorithms for Closest Pair Problems},
journal = {Nord. J. Comput.},
volume = {2},
number = {1},
pages = {3--27},
year = {1995},
timestamp = {Sat, 20 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/GolinRSS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GuptaJSD95,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid and
Bhaskar DasGupta},
editor = {Jack Snoeyink},
title = {The Rectangle Enclosure and Point-Dominance Problems Revisited},
booktitle = {Proceedings of the Eleventh Annual Symposium on Computational Geometry,
Vancouver, B.C., Canada, June 5-12, 1995},
pages = {162--171},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/220279.220297},
doi = {10.1145/220279.220297},
timestamp = {Mon, 14 Jun 2021 16:25:05 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GuptaJSD95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FollertSSST95,
author = {Frank Follert and
Elmar Sch{\"{o}}mer and
J{\"{u}}rgen Sellen and
Michiel H. M. Smid and
Christian Thiel},
editor = {P. S. Thiagarajan},
title = {Computing a Largest Empty Anchored Cylinder, and Related Problems},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
15th Conference, Bangalore, India, December 18-20, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1026},
pages = {428--442},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60692-0\_65},
doi = {10.1007/3-540-60692-0\_65},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/FollertSSST95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AryaDMSS95,
author = {Sunil Arya and
Gautam Das and
David M. Mount and
Jeffrey S. Salowe and
Michiel H. M. Smid},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Euclidean spanners: short, thin, and lanky},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {489--498},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225191},
doi = {10.1145/225058.225191},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AryaDMSS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SchwarzSS94,
author = {Christian Schwarz and
Michiel H. M. Smid and
Jack Snoeyink},
title = {An Optimal Algorithm for the On-Line Closest-Pair Problem},
journal = {Algorithmica},
volume = {12},
number = {1},
pages = {18--29},
year = {1994},
url = {https://doi.org/10.1007/BF01377181},
doi = {10.1007/BF01377181},
timestamp = {Sat, 20 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/SchwarzSS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/LenhofS94,
author = {Hans{-}Peter Lenhof and
Michiel H. M. Smid},
title = {Using Persistent Data Structures for Adding Range Restrictions to
Searching Problems},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {28},
number = {1},
pages = {25--49},
year = {1994},
url = {https://doi.org/10.1051/ita/1994280100251},
doi = {10.1051/ITA/1994280100251},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/LenhofS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/KapoorS94,
author = {Sanjiv Kapoor and
Michiel H. M. Smid},
editor = {Kurt Mehlhorn},
title = {New Techniques for Exact and Approximate Dynamic Closest-Point Problems},
booktitle = {Proceedings of the Tenth Annual Symposium on Computational Geometry,
Stony Brook, New York, USA, June 6-8, 1994},
pages = {165--174},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/177424.177621},
doi = {10.1145/177424.177621},
timestamp = {Mon, 14 Jun 2021 16:25:06 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/KapoorS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GuptaJS94,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
editor = {Kurt Mehlhorn},
title = {Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented
Objects},
booktitle = {Proceedings of the Tenth Annual Symposium on Computational Geometry,
Stony Brook, New York, USA, June 6-8, 1994},
pages = {369--378},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/177424.178096},
doi = {10.1145/177424.178096},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GuptaJS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/LenhofS94,
author = {Hans{-}Peter Lenhof and
Michiel H. M. Smid},
editor = {Kurt Mehlhorn},
title = {An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm},
booktitle = {Proceedings of the Tenth Annual Symposium on Computational Geometry,
Stony Brook, New York, USA, June 6-8, 1994},
pages = {387},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/177424.178099},
doi = {10.1145/177424.178099},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/LenhofS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AryaS94,
author = {Sunil Arya and
Michiel H. M. Smid},
editor = {Jan van Leeuwen},
title = {Efficient Construction of a Bounded Degree Spanner with Low Weight},
booktitle = {Algorithms - {ESA} '94, Second Annual European Symposium, Utrecht,
The Netherlands, September 26-28, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {855},
pages = {48--59},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/BFb0049396},
doi = {10.1007/BFB0049396},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/AryaS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GuptaJS94,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
editor = {Jan van Leeuwen},
title = {Fast Algorithms for Collision and Proximity Problems Involving Moving
Geometric Objects},
booktitle = {Algorithms - {ESA} '94, Second Annual European Symposium, Utrecht,
The Netherlands, September 26-28, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {855},
pages = {278--289},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/BFb0049415},
doi = {10.1007/BFB0049415},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GuptaJS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AryaMS94,
author = {Sunil Arya and
David M. Mount and
Michiel H. M. Smid},
title = {Randomized and deterministic algorithms for geometric spanners of
small diameter},
booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe,
New Mexico, USA, 20-22 November 1994},
pages = {703--712},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SFCS.1994.365722},
doi = {10.1109/SFCS.1994.365722},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AryaMS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GuptaJS94,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {On Intersection Searching Problems Involving Curved Objects},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {183--194},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_17},
doi = {10.1007/3-540-58218-5\_17},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/GuptaJS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/LenhofS93,
author = {Hans{-}Peter Lenhof and
Michiel H. M. Smid},
title = {An optimal construction method for generalized convex layers},
journal = {Int. J. Comput. Geom. Appl.},
volume = {3},
number = {3},
pages = {245--267},
year = {1993},
url = {https://doi.org/10.1142/S0218195993000166},
doi = {10.1142/S0218195993000166},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/LenhofS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/GolinRSS93,
author = {Mordecai J. Golin and
Rajeev Raman and
Christian Schwarz and
Michiel H. M. Smid},
title = {Simple Randomized Algorithms for Closest Pair Problems},
booktitle = {Proceedings of the 5th Canadian Conference on Computational Geometry,
Waterloo, Ontario, Canada, August 1993},
pages = {246--251},
publisher = {University of Waterloo},
year = {1993},
timestamp = {Wed, 19 May 2021 16:29:07 +0200},
biburl = {https://dblp.org/rec/conf/cccg/GolinRSS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GolinRSS93,
author = {Mordecai J. Golin and
Rajeev Raman and
Christian Schwarz and
Michiel H. M. Smid},
editor = {Vijaya Ramachandran},
title = {Randomized Data Structures for the Dynamic Closest-Pair Problem},
booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 25-27 January 1993, Austin, Texas, {USA}},
pages = {301--310},
publisher = {{ACM/SIAM}},
year = {1993},
url = {http://dl.acm.org/citation.cfm?id=313559.313784},
timestamp = {Thu, 05 Jul 2018 07:29:11 +0200},
biburl = {https://dblp.org/rec/conf/soda/GolinRSS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DattaLSS93,
author = {Amitava Datta and
Hans{-}Peter Lenhof and
Christian Schwarz and
Michiel H. M. Smid},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Static and Dynamic Algorithms for k-Point Clustering Problems},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {265--276},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_254},
doi = {10.1007/3-540-57155-8\_254},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/DattaLSS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/GuptaJS93,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Further Results on Generalized Intersection Searching Problems: Counting,
Reporting, and Dynamization},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {361--372},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_262},
doi = {10.1007/3-540-57155-8\_262},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/GuptaJS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Smid92,
author = {Michiel H. M. Smid},
title = {Maintaining the Minimal Distance of a Point Set in Polylogarithmic
Time},
journal = {Discret. Comput. Geom.},
volume = {7},
pages = {415--431},
year = {1992},
url = {https://doi.org/10.1007/BF02187852},
doi = {10.1007/BF02187852},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Smid92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/SchwarzSS92,
author = {Christian Schwarz and
Michiel H. M. Smid and
Jack Snoeyink},
editor = {David Avis},
title = {An Optimal Algorithm for the On-Line Closest-Pair Problem},
booktitle = {Proceedings of the Eighth Annual Symposium on Computational Geometry,
Berlin, Germany, June 10-12, 1992},
pages = {330--336},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/142675.142742},
doi = {10.1145/142675.142742},
timestamp = {Mon, 14 Jun 2021 16:24:47 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/SchwarzSS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LenhofS92,
author = {Hans{-}Peter Lenhof and
Michiel H. M. Smid},
title = {Enumerating the k Closest Pairs Optimally},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {380--386},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267752},
doi = {10.1109/SFCS.1992.267752},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LenhofS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SchwarzS92,
author = {Christian Schwarz and
Michiel H. M. Smid},
editor = {Greg N. Frederickson},
title = {An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem},
booktitle = {Proceedings of the Third Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 27-29 January 1992, Orlando, Florida, {USA}},
pages = {280--285},
publisher = {{ACM/SIAM}},
year = {1992},
url = {http://dl.acm.org/citation.cfm?id=139404.139464},
timestamp = {Thu, 05 Jul 2018 07:29:02 +0200},
biburl = {https://dblp.org/rec/conf/soda/SchwarzS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LenhofS92,
author = {Hans{-}Peter Lenhof and
Michiel H. M. Smid},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Maintaining the Visibility Map of Spheres while Moving the Viewpoint
on a Circle at Infinity},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {388--398},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_35},
doi = {10.1007/3-540-55706-7\_35},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/LenhofS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isa/LenhofS91,
author = {Hans{-}Peter Lenhof and
Michiel H. M. Smid},
editor = {Wen{-}Lian Hsu and
Richard C. T. Lee},
title = {An Optimal Construction Method for Generalized Convex Layers},
booktitle = {{ISA} '91 Algorithms, 2nd International Symposium on Algorithms, Taipei,
Republic of China, December 16-18, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {557},
pages = {349--363},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54945-5\_79},
doi = {10.1007/3-540-54945-5\_79},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/isa/LenhofS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isa/Smid91,
author = {Michiel H. M. Smid},
editor = {Wen{-}Lian Hsu and
Richard C. T. Lee},
title = {Rectangular Point Location and the Dynamic Closest Pair Problem},
booktitle = {{ISA} '91 Algorithms, 2nd International Symposium on Algorithms, Taipei,
Republic of China, December 16-18, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {557},
pages = {364--374},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54945-5\_80},
doi = {10.1007/3-540-54945-5\_80},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isa/Smid91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Smid91,
author = {Michiel H. M. Smid},
editor = {Alok Aggarwal},
title = {Maintaining the Minimal Distance of a Point Set in Polylogarithmic
Time},
booktitle = {Proceedings of the Second Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1991, San Francisco, California, {USA}},
pages = {1--6},
publisher = {{ACM/SIAM}},
year = {1991},
url = {http://dl.acm.org/citation.cfm?id=127787.127796},
timestamp = {Thu, 05 Jul 2018 07:28:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/Smid91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/OvermarsSBK89,
author = {Mark H. Overmars and
Michiel H. M. Smid and
Mark de Berg and
Marc J. van Kreveld},
title = {Maintaining Range Trees in Secondary Memory. Part {I:} Partitions},
journal = {Acta Informatica},
volume = {27},
number = {5},
pages = {423--452},
year = {1990},
url = {https://doi.org/10.1007/BF00289018},
doi = {10.1007/BF00289018},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/OvermarsSBK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/SmidO89,
author = {Michiel H. M. Smid and
Mark H. Overmars},
title = {Maintaining Range Trees in Secondary Memory. Part {II:} Lower Bounds},
journal = {Acta Informatica},
volume = {27},
number = {5},
pages = {453--480},
year = {1990},
url = {https://doi.org/10.1007/BF00289019},
doi = {10.1007/BF00289019},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/SmidO89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChingMS90,
author = {Yu{-}Tai Ching and
Kurt Mehlhorn and
Michiel H. M. Smid},
title = {Dynamic Deferred Data Structuring},
journal = {Inf. Process. Lett.},
volume = {35},
number = {1},
pages = {37--40},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90171-S},
doi = {10.1016/0020-0190(90)90171-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChingMS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:books/daglib/0093525,
author = {Michiel H. M. Smid},
title = {Dynamic data structures on multiple storage media},
school = {University Amsterdam},
year = {1989},
timestamp = {Thu, 24 Mar 2011 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/daglib/0093525.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eik/SmidTBO89,
author = {Michiel H. M. Smid and
Leen Torenvliet and
Peter van Emde Boas and
Mark H. Overmars},
title = {Two Models for the Reconstruction Problem for Dynamic Data Structures},
journal = {J. Inf. Process. Cybern.},
volume = {25},
number = {4},
pages = {131--155},
year = {1989},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eik/SmidTBO89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/SmidOB89,
author = {Michiel H. M. Smid and
Mark H. Overmars and
Leen Torenvliet and
Peter van Emde Boas},
title = {Maintaining Multiple Representations of Dynamic Data Structures},
journal = {Inf. Comput.},
volume = {83},
number = {2},
pages = {206--233},
year = {1989},
url = {https://doi.org/10.1016/0890-5401(89)90058-8},
doi = {10.1016/0890-5401(89)90058-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/SmidOB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip/SmidOTB89,
author = {Michiel H. M. Smid and
Mark H. Overmars and
Leen Torenvliet and
Peter van Emde Boas},
editor = {Gerhard X. Ritter},
title = {Multiple Representations of Dynamic Data Structures},
booktitle = {Information Processing 89, Proceedings of the {IFIP} 11th World Computer
Congress, San Francisco, USA, August 28 - September 1, 1989},
pages = {437--442},
publisher = {North-Holland/IFIP},
year = {1989},
timestamp = {Wed, 02 Feb 2022 21:17:54 +0100},
biburl = {https://dblp.org/rec/conf/ifip/SmidOTB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/OvermarsS88,
author = {Mark H. Overmars and
Michiel H. M. Smid},
editor = {Robert Cori and
Martin Wirsing},
title = {Maintaining Range Trees in Secondary Memory (Extended Abstract)},
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 = {38--51},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/BFb0035830},
doi = {10.1007/BFB0035830},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/OvermarsS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Smid87,
author = {Michiel H. M. Smid},
title = {Duadic codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {33},
number = {3},
pages = {432},
year = {1987},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Smid87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 01:20 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:
