default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichiel H. M. Smid
Michiel Smid
Person information
- affiliation: Carleton University, Ottawa, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j143]Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill
, Michiel Smid:
On the Spanning and Routing Ratio of the Directed Theta-Four Graph. Discret. Comput. Geom. 71(3): 872-892 (2024)- [c131]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. GD 2024: 36:1-36:17 - [c130]Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan:
Geometric Covering via Extraction Theorem. ITCS 2024: 7:1-7:20 - [c129]Prosenjit Bose, Darryl Hill, Michiel Smid, Tyler Tuttle:
On the Spanning and Routing Ratios of the Yao-Four Graph. ISAAC 2024: 15:1-15:17 - [i61]Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid:
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults. CoRR abs/2405.18134 (2024) - [i60]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. CoRR abs/2405.20424 (2024) - [i59]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. CoRR abs/2410.05580 (2024) - 2023
- [j142]Joyce Bacic, Saeed Mehrabi, Michiel Smid:
Shortest Beer Path Queries in Outerplanar Graphs. Algorithmica 85(6): 1679-1705 (2023) - [j141]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid:
Improved Routing on the Delaunay Triangulation. Discret. Comput. Geom. 70(3): 495-549 (2023) - [j140]Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
An instance-based algorithm for deciding the bias of a coin. Discret. Math. Algorithms Appl. 15(3): 2250097:1-2250097:10 (2023) - [j139]Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
The Minimum Moving Spanning Tree Problem. J. Graph Algorithms Appl. 27(1): 1-18 (2023) - [i58]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky:
On Separating Path and Tree Systems in Graphs. CoRR abs/2312.14295 (2023) - 2022
- [j138]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points. Comput. Geom. Topol. 1(1): 3:1-3:18 (2022) - [j137]Abrar Kazi, Michiel Smid:
Closest-pair queries and minimum-weight queries are equivalent for squares. Comput. Geom. 100: 101810 (2022) - [j136]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel Smid:
Computing maximum independent set on outerstring graphs and their relatives. Comput. Geom. 103: 101852 (2022) - 2021
- [j135]Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid:
On the Minimum Consistent Subset Problem. Algorithmica 83(7): 2273-2302 (2021) - [j134]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid:
Tight Bounds on the Clique Chromatic Number. Electron. J. Comb. 28(3) (2021) - [j133]Michiel H. M. Smid:
An improved construction for spanners of disks. Comput. Geom. 92: 101682 (2021) - [j132]Farah Chanchary, Anil Maheshwari, Michiel Smid:
Window queries for intersecting objects, maximal points and approximations using coresets. Discret. Appl. Math. 305: 295-310 (2021) - [j131]A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky:
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Discret. Comput. Geom. 66(4): 1401-1414 (2021) - [c128]Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid:
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. ISAAC 2021: 44:1-44:14 - [c127]Joyce Bacic, Saeed Mehrabi, Michiel Smid:
Shortest Beer Path Queries in Outerplanar Graphs. ISAAC 2021: 62:1-62:16 - [c126]Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
The Minimum Moving Spanning Tree Problem. WADS 2021: 15-28 - [c125]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. WADS 2021: 186-199 - [i57]Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid:
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. CoRR abs/2109.07524 (2021) - [i56]Joyce Bacic, Saeed Mehrabi, Michiel Smid:
Shortest Beer Path Queries in Outerplanar Graphs. CoRR abs/2110.15693 (2021) - [i55]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Approximating bottleneck spanning trees on partitioned tuples of points. CoRR abs/2111.05780 (2021) - 2020
- [j130]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Optimal Art Gallery Localization is NP-hard. Comput. Geom. 88: 101607 (2020) - [j129]Joachim Gudmundsson, Michiel H. M. Smid:
Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword. Comput. Geom. 88: 101608 (2020) - [j128]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. Comput. Geom. 89: 101631 (2020) - [j127]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Querying relational event graphs using colored range searching data structures. Discret. Appl. Math. 286: 51-61 (2020) - [j126]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and planarity thresholds for random geometric graphs. Discret. Math. Algorithms Appl. 12(1): 2050005:1-2050005:21 (2020) - [j125]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs. Inf. Process. Lett. 153 (2020) - [j124]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster algorithms for some optimization problems on collinear points. J. Comput. Geom. 11(1): 418-432 (2020) - [j123]Michiel Smid, Anil Maheshwari, Wolfgang Mulzer:
A simple randomized $O(n \log n)$-time closest-pair algorithm in doubling metrics. J. Comput. Geom. 11(1): 507-524 (2020) - [c124]Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid:
Covering Points with Pairs of Concentric Disks. CCCG 2020: 33-38 - [c123]Abrar Kazi, Michiel Smid:
Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares. CCCG 2020: 206-213 - [i54]Anil Maheshwari, Wolfgang Mulzer, Michiel H. M. Smid:
A Simple Randomized O(n log n)-Time Closest-Pair Algorithm in Doubling Metrics. CoRR abs/2004.05883 (2020) - [i53]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid:
Tight Bounds on The Clique Chromatic Number. CoRR abs/2006.11353 (2020) - [i52]Abrar Kazi, Michiel Smid:
Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares. CoRR abs/2010.06463 (2020) - [i51]Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
An Instance-Based Algorithm for Deciding the Bias of a Coin. CoRR abs/2011.05502 (2020)
2010 – 2019
- 2019
- [j122]Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid:
Maximum Plane Trees in Multipartite Geometric Graphs. Algorithmica 81(4): 1512-1534 (2019) - [j121]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip distance to some plane configurations. Comput. Geom. 81: 12-21 (2019) - [j120]Sang Won Bae, Michiel H. M. Smid:
Closest-pair queries in fat rectangles. Comput. Geom. 83: 1-8 (2019) - [j119]Gregory Bint, Anil Maheshwari, Michiel H. M. Smid, Subhas C. Nandy:
Partial Enclosure Range Searching. Int. J. Comput. Geom. Appl. 29(1): 73-93 (2019) - [j118]Paz Carmi, Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
The Most Likely Object to be Seen Through a Window. Int. J. Comput. Geom. Appl. 29(4): 269-287 (2019) - [j117]Ulrike Große, Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel H. M. Smid:
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. Int. J. Found. Comput. Sci. 30(2): 293-313 (2019) - [j116]Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:
The discrete Voronoi game in a simple polygon. Theor. Comput. Sci. 793: 28-35 (2019) - [c122]Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid:
On the Spanning and Routing Ratio of Theta-Four. SODA 2019: 2361-2370 - [c121]Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. WADS 2019: 155-167 - [c120]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid:
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. WADS 2019: 211-224 - [c119]Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid:
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. WADS 2019: 283-295 - [i50]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid:
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. CoRR abs/1903.07024 (2019) - [i49]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip Distance to some Plane Configurations. CoRR abs/1905.00791 (2019) - [i48]Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid:
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. CoRR abs/1905.02322 (2019) - 2018
- [j115]Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid:
Geometric Path Problems with Violations. Algorithmica 80(2): 448-471 (2018) - [j114]Prosenjit Bose, Darryl Hill, Michiel H. M. Smid:
Improved Spanning Ratio for Low Degree Plane Spanners. Algorithmica 80(3): 935-976 (2018) - [j113]Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. Algorithmica 80(11): 3177-3191 (2018) - [j112]Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica 80(11): 3316-3334 (2018) - [j111]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Strong matching of points with geometric shapes. Comput. Geom. 68: 186-205 (2018) - [j110]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. Discret. Comput. Geom. 59(4): 864-885 (2018) - [c118]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Window Queries for Problems on Intersecting Objects and Maximal Points. CALDAM 2018: 199-213 - [c117]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Compatible 4-Holes in Point Sets. CCCG 2018: 346-352 - [c116]A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky:
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. SoCG 2018: 2:1-2:12 - [c115]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster Algorithms for some Optimization Problems on Collinear Points. SoCG 2018: 8:1-8:14 - [c114]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel H. M. Smid:
Improved Routing on the Delaunay Triangulation. ESA 2018: 22:1-22:13 - [c113]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip Distance to some Plane Configurations. SWAT 2018: 11:1-11:14 - [p2]Michiel H. M. Smid:
The Well-Separated Pair Decomposition and Its Applications. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [i47]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster Algorithms for some Optimization Problems on Collinear Points. CoRR abs/1802.09505 (2018) - [i46]Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid:
On the Spanning and Routing Ratio of Theta-Four. CoRR abs/1808.01298 (2018) - [i45]Sang Won Bae, Michiel H. M. Smid:
Closest-Pair Queries in Fat Rectangles. CoRR abs/1809.10531 (2018) - [i44]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and Planarity Thresholds for Random Geometric Graphs. CoRR abs/1809.10737 (2018) - [i43]Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. CoRR abs/1810.09232 (2018) - 2017
- [j109]Ahmad Biniaz, Paul Liu, Anil Maheshwari, Michiel H. M. Smid:
Approximation algorithms for the unit disk cover problem in 2D and 3D. Comput. Geom. 60: 8-18 (2017) - [j108]Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An optimal algorithm for plane matchings in multipartite geometric graphs. Comput. Geom. 63: 1-9 (2017) - [j107]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. J. Graph Algorithms Appl. 21(4): 389-415 (2017) - [j106]Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. J. Graph Algorithms Appl. 21(4): 527-546 (2017) - [j105]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards plane spanners of degree 3. J. Comput. Geom. 8(1): 11-31 (2017) - [c112]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Querying Relational Event Graphs Using Colored Range Searching Data Structures. CALDAM 2017: 83-95 - [c111]Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid:
Maximum Plane Trees in Multipartite Geometric Graphs. WADS 2017: 193-204 - [c110]Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid:
Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. WADS 2017: 301-312 - [e5]Joachim Gudmundsson, Michiel H. M. Smid:
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada. 2017 [contents] - [i42]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Art Gallery Localization. CoRR abs/1706.06938 (2017) - [i41]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Optimal Art Gallery Localization is NP-hard. CoRR abs/1706.08016 (2017) - [i40]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Compatible 4-Holes in Point Sets. CoRR abs/1706.08105 (2017) - 2016
- [j104]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Discrete Voronoi games and ϵ-nets, in two and three dimensions. Comput. Geom. 55: 41-58 (2016) - [j103]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. Comput. Geom. 57: 27-39 (2016) - [j102]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Probing convex polygons with a wedge. Comput. Geom. 58: 34-59 (2016) - [j101]Christian Knauer, Michiel H. M. Smid:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 26(3-4): 0-134 (2016) - [j100]Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu:
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. J. Comput. Geom. 7(1): 444-472 (2016) - [j99]Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel H. M. Smid, Prosenjit Bose, Jean-Lou De Carufel:
A plane 1.88-spanner for points in convex position. J. Comput. Geom. 7(1): 520-539 (2016) - [c109]Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. CCCG 2016: 140-146 - [c108]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. ISAAC 2016: 19:1-19:14 - [c107]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. IWOCA 2016: 55-67 - [c106]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. IWOCA 2016: 68-80 - [c105]Prosenjit Bose, Darryl Hill, Michiel H. M. Smid:
Improved Spanning Ratio for Low Degree Plane Spanners. LATIN 2016: 249-262 - [c104]Mahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
A Plane 1.88-Spanner for Points in Convex Position. SWAT 2016: 25:1-25:14 - [c103]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. SWAT 2016: 27:1-27:14 - [r8]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2016: 86-90 - [r7]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Geometric Spanners. Encyclopedia of Algorithms 2016: 846-852 - [r6]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Planar Geometric Spanners. Encyclopedia of Algorithms 2016: 1570-1574 - [i39]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. CoRR abs/1606.08824 (2016) - [i38]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. CoRR abs/1607.01294 (2016) - [i37]Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn:
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. CoRR abs/1607.05547 (2016) - [i36]Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. CoRR abs/1611.01661 (2016) - [i35]Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting a Tree with a Shortcut. CoRR abs/1612.01370 (2016) - 2015
- [j98]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
On full Steiner trees in unit disk graphs. Comput. Geom. 48(6): 453-458 (2015) - [j97]Joachim Gudmundsson, Michiel H. M. Smid:
Fast algorithms for approximate Fréchet matching queries in geometric trees. Comput. Geom. 48(6): 479-494 (2015) - [j96]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties. Comput. Geom. 48(9): 646-660 (2015) - [j95]A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi, Anil Maheshwari, Michiel H. M. Smid:
Approximating the bottleneck plane perfect matching of a point set. Comput. Geom. 48(9): 718-731 (2015) - [j94]Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Average Stretch Factor: How Low Does It Go? Discret. Comput. Geom. 53(2): 296-326 (2015) - [j93]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Packing Plane Perfect Matchings into a Point Set. Discret. Math. Theor. Comput. Sci. 17(2): 119-142 (2015) - [j92]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
On the hardness of full Steiner tree problems. J. Discrete Algorithms 34: 118-127 (2015) - [j91]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. J. Graph Algorithms Appl. 19(1): 11-41 (2015) - [j90]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Matchings in higher-order Gabriel graphs. Theor. Comput. Sci. 596: 67-78 (2015) - [c102]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and Planarity Thresholds for Random Geometric Graphs. ALGOSENSORS 2015: 1-12 - [c101]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CALDAM 2015: 89-100 - [c100]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid, Paul Liu:
A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. CCCG 2015 - [c99]Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn:
Fast Algorithms for Diameter-Optimally Augmenting Paths. ICALP (1) 2015: 678-688 - [c98]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon. TTCS 2015: 56-71 - [c97]Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. WADS 2015: 66-78 - [i34]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Packing Plane Perfect Matchings into a Point Set. CoRR abs/1501.03686 (2015) - [i33]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Discrete Voronoi Games and ε-Nets, in Two and Three Dimensions. CoRR abs/1501.04843 (2015) - [i32]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Strong Matching of Points with Geometric Shapes. CoRR abs/1503.04871 (2015) - [i31]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Probing Convex Polygons with a Wedge. CoRR abs/1506.02572 (2015) - [i30]Prosenjit Bose, Darryl Hill, Michiel H. M. Smid:
Improved Spanning Ratio for Low Degree Plane Spanners. CoRR abs/1506.09061 (2015) - [i29]Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, Michiel H. M. Smid:
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere. CoRR abs/1507.06856 (2015) - [i28]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. CoRR abs/1512.02257 (2015) - [i27]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. CoRR abs/1512.02730 (2015) - 2014
- [j89]Prosenjit Gupta, Ravi Janardan, Yokesh Kumar, Michiel H. M. Smid:
Data structures for range-aggregate extent queries. Comput. Geom. 47(2): 329-347 (2014) - [j88]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem. Comput. Geom. 47(3): 377-380 (2014) - [j87]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
A note on the unsolvability of the weighted region shortest path problem. Comput. Geom. 47(7): 724-727 (2014) - [j86]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-orientation equilateral triangle matching of point sets. Theor. Comput. Sci. 555: 55-70 (2014) - [c96]Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid:
A Facility Coloring Problem in 1-D. AAIM 2014: 88-99 - [c95]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Voronoi Games and Epsilon Nets. CCCG 2014 - [c94]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Approximating Full Steiner Tree in a Unit Disk Graph. CCCG 2014 - [c93]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Bottleneck Bichromatic Plane Matching of Points. CCCG 2014 - [c92]Prosenjit Bose, Simon Pratt, Michiel H. M. Smid:
The Convex Hull of Points on a Sphere is a Spanner. CCCG 2014 - [i26]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CoRR abs/1409.5466 (2014) - [i25]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Matching in Gabriel Graphs. CoRR abs/1410.0540 (2014) - [i24]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CoRR abs/1411.1879 (2014) - 2013
- [j85]Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An in-place min-max priority search tree. Comput. Geom. 46(3): 310-327 (2013) - [j84]Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid:
On the power of the semi-separated pair decomposition. Comput. Geom. 46(6): 631-639 (2013) - [j83]Prosenjit Bose, Michiel H. M. Smid:
On plane geometric spanners: A survey and open problems. Comput. Geom. 46(7): 818-830 (2013) - [j82]Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. J. Comput. Geom. 4(1): 182-211 (2013) - [j81]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust Geometric Spanners. SIAM J. Comput. 42(4): 1720-1736 (2013) - [c91]Peter Brass, Christian Knauer, Chan-Su Shin, Michiel H. M. Smid, Ivo Vigan:
Range-Aggregate Queries for Geometric Extent Problems. CATS 2013: 3-10 - [c90]Luis Barba, Alexis Beingessner, Prosenjit Bose, Michiel H. M. Smid:
Computing Covers of Plane Forests. CCCG 2013 - [c89]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CCCG 2013 - [c88]Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:
The Discrete Voronoi Game in a Simple Polygon. COCOON 2013: 197-207 - [c87]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust geometric spanners. SoCG 2013: 449-458 - [c86]Joachim Gudmundsson, Michiel H. M. Smid:
Fréchet Queries in Geometric Trees. ESA 2013: 565-576 - [c85]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-Orientation Equilateral Triangle Matching of Point Sets. WALCOM 2013: 17-28 - [i23]Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. CoRR abs/1304.1909 (2013) - [i22]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem. CoRR abs/1305.0172 (2013) - [i21]Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Average Stretch Factor: How Low Does It Go? CoRR abs/1305.4170 (2013) - [i20]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
A Note on the Unsolvability of the Weighted Region Shortest Path Problem. CoRR abs/1305.5209 (2013) - [i19]Alexis Beingessner, Michiel H. M. Smid:
Computing the Coverage of an Opaque Forest. CoRR abs/1311.4854 (2013) - [i18]Luis Barba, Alexis Beingessner, Prosenjit Bose, Michiel H. M. Smid:
Computing Covers of Plane Forests. CoRR abs/1311.4860 (2013) - [i17]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Approximating the Bottleneck Plane Perfect Matching of a Point Set. CoRR abs/1311.5197 (2013) - 2012
- [j80]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
π/2-Angle Yao Graphs are Spanners. Int. J. Comput. Geom. Appl. 22(1): 61-82 (2012) - [j79]Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid:
Approximating the average stretch factor of geometric graphs. J. Comput. Geom. 3(1): 132-153 (2012) - [j78]Paz Carmi, Michiel H. M. Smid:
An optimal algorithm for computing angle-constrained spanners. J. Comput. Geom. 3(1): 196-221 (2012) - [c84]Gregory Bint, Anil Maheshwari, Michiel H. M. Smid:
xy-Monotone Path Existence Queries in a Rectilinear Environment. CCCG 2012: 35-40 - [c83]Alexis Beingessner, Michiel H. M. Smid:
Computing the Coverage of an Opaque Forest. CCCG 2012: 95-100 - [c82]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
On Farthest-Point Information in Networks. CCCG 2012: 199-204 - [c81]Pooya Davoodi, Michiel H. M. Smid, Freek van Walderveen:
Two-Dimensional Range Diameter Queries. LATIN 2012: 219-230 - [i16]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust Geometric Spanners. CoRR abs/1204.4679 (2012) - [i15]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-Orientation Equilateral Triangle Matching of Point Sets. CoRR abs/1211.2734 (2012) - 2011
- [j77]Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid:
Algorithms for Marketing-Mix Optimization. Algorithmica 60(4): 1004-1016 (2011) - [j76]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid:
Geometric Spanners for Weighted Point Sets. Algorithmica 61(1): 207-225 (2011) - [j75]Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu:
On a family of strong geometric spanners that admit local routing strategies. Comput. Geom. 44(6-7): 319-328 (2011) - [j74]Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Low-interference networks in metric spaces of bounded doubling dimension. Inf. Process. Lett. 111(23-24): 1120-1123 (2011) - [c80]Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An In-Place Priority Search Tree. CCCG 2011 - [c79]Karim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid:
Approximation Algorithms for a Triangle Enclosure Problem. CCCG 2011 - 2010
- [j73]Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica 58(3): 711-729 (2010) - [j72]Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles. Int. J. Comput. Geom. Appl. 20(1): 69-87 (2010) - [j71]Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Sigma-local graphs. J. Discrete Algorithms 8(1): 15-23 (2010) - [j70]Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid:
On the Stretch Factor of Convex Delaunay Graphs. J. Comput. Geom. 1(1): 41-56 (2010) - [c78]Yakov Nekrich, Michiel H. M. Smid:
Approximating range-aggregate queries using coresets. CCCG 2010: 253-256 - [c77]Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid:
Approximating the Average Stretch Factor of Geometric Graphs. ISAAC (1) 2010: 37-48 - [c76]Paz Carmi, Michiel H. M. Smid:
An Optimal Algorithm for Computing Angle-Constrained Spanners. ISAAC (1) 2010: 316-327 - [c75]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
pi/2-Angle Yao Graphs Are Spanners. ISAAC (2) 2010: 446-457 - [c74]Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu:
Communication-Efficient Construction of the Plane Localized Delaunay Graph. LATIN 2010: 282-293 - [c73]Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Improved Methods For Generating Quasi-gray Codes. SWAT 2010: 224-235 - [i14]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
Pi/2-Angle Yao Graphs are Spanners. CoRR abs/1001.2913 (2010) - [i13]Dana Jansens, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Improved Methods For Generating Quasi-Gray Codes. CoRR abs/1010.0905 (2010)
2000 – 2009
- 2009
- [j69]Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer:
Clamshell Casting. Algorithmica 55(4): 666-702 (2009) - [j68]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric spanners with small chromatic number. Comput. Geom. 42(2): 134-146 (2009) - [j67]Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer:
A linear-space algorithm for distance preserving graph embedding. Comput. Geom. 42(4): 289-304 (2009) - [j66]Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer:
Rotationally monotone polygons. Comput. Geom. 42(5): 471-483 (2009) - [j65]Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid:
On the dilation spectrum of paths, cycles, and trees. Comput. Geom. 42(9): 923-933 (2009) - [j64]Prosenjit Bose, Michiel H. M. Smid, Daming Xu:
Delaunay and diamond Triangulations contain Spanners of Bounded Degree. Int. J. Comput. Geom. Appl. 19(2): 119-140 (2009) - [j63]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Non-Intersection Queries on Aggregated Geometric Data. Int. J. Comput. Geom. Appl. 19(6): 479-506 (2009) - [j62]Joachim Gudmundsson, Michiel H. M. Smid:
On Spanners of Geometric Graphs. Int. J. Found. Comput. Sci. 20(1): 135-149 (2009) - [j61]Marc Mörig, Dieter Rautenbach, Michiel H. M. Smid, Jan Tusch:
An Omega(nlogn) lower bound for computing the sum of even-ranked elements. Inf. Process. Lett. 109(16): 955-956 (2009) - [j60]Rossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette, Michiel H. M. Smid, Stefanie Wuhrer:
Algorithms for optimal outlier removal. J. Discrete Algorithms 7(2): 239-248 (2009) - [j59]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete k-Partite Geometric Graphs. SIAM J. Comput. 38(5): 1803-1820 (2009) - [c72]Michiel H. M. Smid:
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension. Efficient Algorithms 2009: 275-289 - [c71]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid:
Geometric Spanners for Weighted Point Sets. ESA 2009: 190-202 - [c70]Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid:
On the Power of the Semi-Separated Pair Decomposition. WADS 2009: 1-12 - [e4]Gautam Das, Joachim Gudmundsson, Rolf Klein, Christian Knauer, Michiel H. M. Smid:
Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 01.11. - 06.11.2009. Dagstuhl Seminar Proceedings 09451, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i12]Gautam Das, Joachim Gudmundsson, Rolf Klein, Christian Knauer, Michiel H. M. Smid:
09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining. Geometric Networks, Metric Space Embeddings and Spatial Data Mining 2009 - [i11]Marc Mörig, Michiel H. M. Smid, Jan Tusch:
An Omega(n log n) lower bound for computing the sum of even-ranked elements. CoRR abs/0901.0930 (2009) - [i10]Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid:
Algorithms for Marketing-Mix Optimization. CoRR abs/0903.0308 (2009) - 2008
- [j58]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008) - [j57]Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
I/O-efficient algorithms for computing planar geometric spanners. Comput. Geom. 40(3): 252-271 (2008) - [j56]Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Yihui Tang:
On the false-positive rate of Bloom filters. Inf. Process. Lett. 108(4): 210-213 (2008) - [j55]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate distance oracles for geometric spanners. ACM Trans. Algorithms 4(1): 10:1-10:34 (2008) - [c69]Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Michiel H. M. Smid:
Data Structures for Range-Aggregate Extent Queries. CCCG 2008 - [c68]Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid:
On the Stretch Factor of Convex Delaunay Graphs. ISAAC 2008: 656-667 - [c67]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete k -Partite Geometric Graphs. LATIN 2008: 170-181 - [c66]Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401 - [r5]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2008 - [r4]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Geometric Spanners. Encyclopedia of Algorithms 2008 - [r3]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Planar Geometric Spanners. Encyclopedia of Algorithms 2008 - [i9]Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid:
On the Stretch Factor of Convex Delaunay Graphs. CoRR abs/0804.1041 (2008) - [i8]Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu:
Communication-Efficient Construction of the Plane Localized Delaunay Graph. CoRR abs/0809.2956 (2008) - 2007
- [b2]Giri Narasimhan, Michiel H. M. Smid:
Geometric spanner networks. Cambridge University Press 2007, pp. I-XV, 1-500 - [j54]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Distance-preserving approximations of polygonal paths. Comput. Geom. 36(3): 183-196 (2007) - [j53]Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold:
Space-efficient geometric divide-and-conquer algorithms. Comput. Geom. 37(3): 209-227 (2007) - [c65]Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer:
Linear-Space Algorithms for Distance Preserving Embedding. CCCG 2007: 185-188 - [c64]Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles. ISAAC 2007: 88-99 - [c63]Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu:
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies. WADS 2007: 300-311 - [c62]Prosenjit Bose, Aaron Lee, Michiel H. M. Smid:
On Generalized Diamond Spanners. WADS 2007: 325-336 - [c61]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88 - [e3]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff:
Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006. Dagstuhl Seminar Proceedings 06481, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [r2]Michiel H. M. Smid:
The Well-Separated Pair Decomposition and Its Applications. Handbook of Approximation Algorithms and Metaheuristics 2007 - [i7]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric Spanners With Small Chromatic Number. CoRR abs/0711.0114 (2007) - [i6]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete $k$-Partite Geometric Graphs. CoRR abs/0712.0554 (2007) - [i5]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. CoRR abs/cs/0702080 (2007) - [i4]Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu:
On a family of strong geometric spanners that admit local routing strategies. CoRR abs/cs/0702117 (2007) - 2006
- [j52]Anil Maheshwari, Michiel H. M. Smid:
A Dynamic Dictionary for Priced Information with Application. Algorithmica 44(2): 151-165 (2006) - [j51]Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt:
Heuristics for estimating contact area of supports in layered manufacturing. ACM J. Exp. Algorithmics 11 (2006) - [c60]Michiel H. M. Smid:
Geometric spanners with few edges and degree five. CATS 2006: 7-9 - [c59]Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer:
Rotationally Monotone Polygons. CCCG 2006 - [c58]Prosenjit Bose, Michiel H. M. Smid, Daming Xu:
Diamond Triangulations Contain Spanners of Bounded Degree. ISAAC 2006: 173-182 - [c57]Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. LATIN 2006: 80-92 - [c56]Phillip G. Bradford, Irina Perevalova, Michiel H. M. Smid, Charles B. Ward:
Indicator Random Variables in Traffic Analysis and the Birthday Problem. LCN 2006: 1016-1023 - [c55]Joachim Gudmundsson, Michiel H. M. Smid:
On Spanners of Geometric Graphs. SWAT 2006: 388-399 - [i3]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff:
06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. Geometric Networks and Metric Space Embeddings 2006 - 2005
- [j50]Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid:
Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica 42(3-4): 249-264 (2005) - [j49]Danny Z. Chen, Michiel H. M. Smid, Bin Xu:
Geometric Algorithms for Density-based Data Clustering. Int. J. Comput. Geom. Appl. 15(3): 239-260 (2005) - [j48]Danny Krizanc, Pat Morin, Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees. Nord. J. Comput. 12(1): 1-17 (2005) - [c54]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Non-intersection Queries on Aggregated Geometric Data. COCOON 2005: 544-553 - [c53]Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid:
Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles. ISAAC 2005: 849-858 - [c52]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Fast Pruning of Geometric Spanners. STACS 2005: 508-520 - [e2]Ravi Janardan, Michiel H. M. Smid, Debasis Dutta:
Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, October 7-9, 2003. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 67, DIMACS/AMS 2005, ISBN 0-8218-3628-5 [contents] - [i2]Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. CoRR abs/cs/0512091 (2005) - 2004
- [j47]Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh:
Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3): 233-249 (2004) - [j46]Michiel H. M. Smid, Rahul Ray, Ulrich Wendt, Katharina Lange:
Computing large planar regions in terrains, with an application to fracture surfaces. Discret. Appl. Math. 139(1-3): 253-264 (2004) - [j45]Prosenjit Bose, Michiel H. M. Smid, David R. Wood:
Light edges in degree-constrained graphs. Discret. Math. 282(1-3): 35-41 (2004) - [c51]Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt:
Approximating contact-area of supports in layered manufacturing. CCCG 2004: 91-94 - [r1]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Computational Geometry. Handbook of Data Structures and Applications 2004 - 2003
- [j44]Man Chung Hon, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid:
Minimizing the total projection of a set of vectors, with applications to layered manufacturing. Comput. Aided Des. 35(1): 57-68 (2003) - [j43]Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson:
Protecting critical facets in layered manufacturing: implementation and experimental results. Comput. Aided Des. 35(7): 647-657 (2003) - [c50]Ravi Janardan, Michiel H. M. Smid:
Geometric Algorithms for Layered Manufacturing. Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing 2003: 189-220 - [c49]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Distance-Preserving Approximations of Polygonal Paths. FSTTCS 2003: 217-228 - [c48]Anil Maheshwari, Michiel H. M. Smid:
A Dynamic Dictionary for Priced Information with Application. ISAAC 2003: 16-25 - [c47]Danny Krizanc, Pat Morin, Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees. ISAAC 2003: 517-526 - [c46]Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh:
Approximating Geometric Bottleneck Shortest Paths. STACS 2003: 38-49 - [e1]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Michiel H. M. Smid:
Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings. Lecture Notes in Computer Science 2748, Springer 2003, ISBN 3-540-40545-3 [contents] - [i1]Danny Krizanc, Pat Morin, Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees. CoRR cs.DS/0307034 (2003) - 2002
- [j42]Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica 32(1): 144-156 (2002) - [j41]Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram:
A decomposition-based approach to layered manufacturing. Comput. Geom. 23(2): 117-151 (2002) - [j40]Michiel H. M. Smid, Vanam Srilakshmi:
Computing the Smallest T-Shaped Polygon Containing k Points. Int. J. Comput. Math. 79(2): 143-156 (2002) - [j39]Jörg Schwerdt, Michiel H. M. Smid, Man Chung Hon, Ravi Janardan:
Computing an Optimal Hatching Direction in Layered Manufacturing. Int. J. Comput. Math. 79(10): 1067-1081 (2002) - [j38]Giri Narasimhan, Michiel H. M. Smid:
Approximation Algorithms for the Bottleneck Stretch Factor Problem. Nord. J. Comput. 9(1): 13-31 (2002) - [c45]Prosenjit Bose, Michiel H. M. Smid, David R. Wood:
Light edges in degree-constrained graphs. CCCG 2002: 142-145 - [c44]Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid:
Terrain Polygon Decomposition, with Application to Layered Manufacturing. COCOON 2002: 381-390 - [c43]Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl:
Translating a Planar Object to Maximize Point Containment. ESA 2002: 42-53 - [c42]Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid:
Constructing Plane Spanners of Bounded Degree and Low Weight. ESA 2002: 234-246 - [c41]Danny Z. Chen, Michiel H. M. Smid, Bin Xu:
Geometric Algorithms for Density-Based Data Clustering. ESA 2002: 284-296 - [c40]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate Distance Oracles Revisited. ISAAC 2002: 357-368 - [c39]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate distance oracles for geometric graphs. SODA 2002: 828-837 - 2001
- [j37]Danny Z. Chen, Gautam Das, Michiel H. M. Smid:
Lower bounds for computing geometric spanners and approximate shortest paths. Discret. Appl. Math. 110(2-3): 151-167 (2001) - [c38]Man Chung Hon, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid:
Computing Optimal Hatching Directions in Layered Manufacturing. International Conference on Computational Science (1) 2001: 683-692 - [c37]Giri Narasimhan, Michiel H. M. Smid:
Approximation Algorithms for the Bottleneck Stretch Factor Problem. STACS 2001: 502-513 - [c36]Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
I/O-Efficient Shortest Path Queries in Geometric Spanners. WADS 2001: 287-299 - [c35]Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram:
A Decomposition-Based Approach to Layered Manufacturing. WADS 2001: 389-400 - [c34]Katharina Lange, Rahul Ray, Michiel H. M. Smid, Ulrich Wendt:
Computing large planar regions in terrains. IWCIA 2001: 133-145 - 2000
- [j36]Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi:
Protecting critical facets in layered manufacturing. Comput. Geom. 16(3): 187-210 (2000) - [j35]Gautam Das, Michiel H. M. Smid:
A lower bound for approximating the geometric minimum weight matching. Inf. Process. Lett. 74(5-6): 253-255 (2000) - [j34]Giri Narasimhan, Michiel H. M. Smid:
Approximating the Stretch Factor of Euclidean Graphs. SIAM J. Comput. 30(3): 978-989 (2000) - [p1]Michiel H. M. Smid:
Closest-Point Problems in Computational Geometry. Handbook of Computational Geometry 2000: 877-935
1990 – 1999
- 1999
- [j33]Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta:
On some geometric optimization problems in layered manufacturing. Comput. Geom. 12(3-4): 219-239 (1999) - [j32]Jayanth Majhi, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid, Prosenjit Gupta:
Minimizing support structures and trapped area in two-dimensional layered manufacturing. Comput. Geom. 12(3-4): 241-267 (1999) - [j31]Sunil Arya, David M. Mount, Michiel H. M. Smid:
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Comput. Geom. 13(2): 91-107 (1999) - [j30]Michiel H. M. Smid, Ravi Janardan:
On the width and roundness of a set of points in the plane. Int. J. Comput. Geom. Appl. 9(1): 97-108 (1999) - [j29]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. Inf. Process. Lett. 69(1): 7-13 (1999) - [j28]Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan:
Computing the Width of a Three-Dimensional Point Set: An Experimental Study. ACM J. Exp. Algorithmics 4: 8 (1999) - [c33]Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi:
Protecting Facets in Layered Manufacturing. FSTTCS 1999: 291-303 - 1998
- [j27]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Randomized Data Structures for the Dynamic Closest-Pair Problem. SIAM J. Comput. 27(4): 1036-1072 (1998) - [c32]Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Jörg Schwerdt:
Multi-Criteria Geometric Optimization Problems in Layered Manufacturing. SCG 1998: 19-28 - [c31]Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. STOC 1998: 186-195 - [c30]Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan:
Computing the Width of a Three-Dimensional Point Set: An Experimental Study. WAE 1998: 62-73 - 1997
- [j26]Sunil Arya, Michiel H. M. Smid:
Efficient Construction of a Bounded-Degree Spanner with Low Weight. Algorithmica 17(1): 33-54 (1997) - [j25]Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid:
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Algorithmica 19(4): 447-460 (1997) - [j24]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta:
The Rectangle Enclosure and Point-Dominance Problems Revisited. Int. J. Comput. Geom. Appl. 7(5): 437-455 (1997) - [j23]Frank Follert, Elmar Schömer, Jürgen Sellen, Michiel H. M. Smid, Christian Thiel:
Computing a Largest Empty Anchored Cylinder, and Related Problems. Int. J. Comput. Geom. Appl. 7(6): 563-580 (1997) - [j22]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
A Technique for Adding Range Restrictions to Generalized Searching Problems. Inf. Process. Lett. 64(5): 263-269 (1997) - [j21]Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid:
More Efficient Parallel Totally Monotone Matrix Searching. J. Algorithms 23(2): 386-400 (1997) - [c29]Jörg Schwerdt, Michiel H. M. Smid, Stefan Schirra:
Computing the Minimum Diameter for Moving Points: An Exact Implementation Using Parametric Search. SCG 1997: 466-468 - [c28]Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta:
On Some Geometric Optimization Problems in Layered Manufacturing. WADS 1997: 136-149 - 1996
- [j20]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. Comput. Geom. 6: 1-19 (1996) - [j19]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. Comput. Geom. 6: 371-391 (1996) - [j18]Sanjiv Kapoor, Michiel H. M. Smid:
New Techniques for Exact and Approximate Dynamic Closest-Point Problems. SIAM J. Comput. 25(4): 775-796 (1996) - [c27]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. CCCG 1996: 8-13 - [c26]Danny Z. Chen, Gautam Das, Michiel H. M. Smid:
Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. CCCG 1996: 155-160 - [c25]Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis:
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. ESA 1996: 514-528 - [c24]Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid:
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. FSTTCS 1996: 64-75 - 1995
- [j17]Hans-Peter Lenhof, Michiel H. M. Smid:
Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity. Algorithmica 13(3): 301-312 (1995) - [j16]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. Comput. Geom. 5: 321-340 (1995) - [j15]Michiel H. M. Smid:
Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem. Inf. Comput. 116(1): 1-9 (1995) - [j14]Hans-Peter Lenhof, Michiel H. M. Smid:
Sequential and parallel algorithms for the k closest pairs problem. Int. J. Comput. Geom. Appl. 5(3): 273-288 (1995) - [j13]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. J. Algorithms 19(2): 282-317 (1995) - [j12]Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid:
Static and Dynamic Algorithms for k-Point Clustering Problems. J. Algorithms 19(3): 474-503 (1995) - [j11]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems. Nord. J. Comput. 2(1): 3-27 (1995) - [c23]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta:
The Rectangle Enclosure and Point-Dominance Problems Revisited. SCG 1995: 162-171 - [c22]Frank Follert, Elmar Schömer, Jürgen Sellen, Michiel H. M. Smid, Christian Thiel:
Computing a Largest Empty Anchored Cylinder, and Related Problems. FSTTCS 1995: 428-442 - [c21]Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid:
Euclidean spanners: short, thin, and lanky. STOC 1995: 489-498 - 1994
- [j10]Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink:
An Optimal Algorithm for the On-Line Closest-Pair Problem. Algorithmica 12(1): 18-29 (1994) - [j9]Hans-Peter Lenhof, Michiel H. M. Smid:
Using Persistent Data Structures for Adding Range Restrictions to Searching Problems. RAIRO Theor. Informatics Appl. 28(1): 25-49 (1994) - [c20]Sanjiv Kapoor, Michiel H. M. Smid:
New Techniques for Exact and Approximate Dynamic Closest-Point Problems. SCG 1994: 165-174 - [c19]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. SCG 1994: 369-378 - [c18]Hans-Peter Lenhof, Michiel H. M. Smid:
An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm. SCG 1994: 387 - [c17]Sunil Arya, Michiel H. M. Smid:
Efficient Construction of a Bounded Degree Spanner with Low Weight. ESA 1994: 48-59 - [c16]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. ESA 1994: 278-289 - [c15]Sunil Arya, David M. Mount, Michiel H. M. Smid:
Randomized and deterministic algorithms for geometric spanners of small diameter. FOCS 1994: 703-712 - [c14]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
On Intersection Searching Problems Involving Curved Objects. SWAT 1994: 183-194 - 1993
- [j8]Hans-Peter Lenhof, Michiel H. M. Smid:
An optimal construction method for generalized convex layers. Int. J. Comput. Geom. Appl. 3(3): 245-267 (1993) - [c13]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems. CCCG 1993: 246-251 - [c12]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA 1993: 301-310 - [c11]Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid:
Static and Dynamic Algorithms for k-Point Clustering Problems. WADS 1993: 265-276 - [c10]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. WADS 1993: 361-372 - 1992
- [j7]Michiel H. M. Smid:
Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. Discret. Comput. Geom. 7: 415-431 (1992) - [c9]Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink:
An Optimal Algorithm for the On-Line Closest-Pair Problem. SCG 1992: 330-336 - [c8]Hans-Peter Lenhof, Michiel H. M. Smid:
Enumerating the k Closest Pairs Optimally. FOCS 1992: 380-386 - [c7]Christian Schwarz, Michiel H. M. Smid:
An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem. SODA 1992: 280-285 - [c6]Hans-Peter Lenhof, Michiel H. M. Smid:
Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity. SWAT 1992: 388-398 - 1991
- [c5]Hans-Peter Lenhof, Michiel H. M. Smid:
An Optimal Construction Method for Generalized Convex Layers. ISA 1991: 349-363 - [c4]Michiel H. M. Smid:
Rectangular Point Location and the Dynamic Closest Pair Problem. ISA 1991: 364-374 - [c3]Michiel H. M. Smid:
Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. SODA 1991: 1-6 - 1990
- [j6]Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld:
Maintaining Range Trees in Secondary Memory. Part I: Partitions. Acta Informatica 27(5): 423-452 (1990) - [j5]Michiel H. M. Smid, Mark H. Overmars:
Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds. Acta Informatica 27(5): 453-480 (1990) - [j4]Yu-Tai Ching, Kurt Mehlhorn, Michiel H. M. Smid:
Dynamic Deferred Data Structuring. Inf. Process. Lett. 35(1): 37-40 (1990)
1980 – 1989
- 1989
- [b1]Michiel H. M. Smid:
Dynamic data structures on multiple storage media. University Amsterdam, 1989, pp. 1-197 - [j3]Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars:
Two Models for the Reconstruction Problem for Dynamic Data Structures. J. Inf. Process. Cybern. 25(4): 131-155 (1989) - [j2]Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas:
Maintaining Multiple Representations of Dynamic Data Structures. Inf. Comput. 83(2): 206-233 (1989) - [c2]Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas:
Multiple Representations of Dynamic Data Structures. IFIP Congress 1989: 437-442 - 1988
- [c1]Mark H. Overmars, Michiel H. M. Smid:
Maintaining Range Trees in Secondary Memory (Extended Abstract). STACS 1988: 38-51 - 1987
- [j1]Michiel H. M. Smid:
Duadic codes. IEEE Trans. Inf. Theory 33(3): 432- (1987)
Coauthor Index
[c131] [i61] [i60] [i59] [j139] [i58] [j138] [j135] [c126] [c125] [i55] [j126] [j125] [j124] [j122] [j121] [c121] [i49] [j113] [j111] [j110] [c117] [c115] [c113] [i47] [i44] [i43] [j109] [j108] [j106] [j105] [c111] [i40] [j103] [j99] [c109] [c108] [c106] [c104] [i39] [i36] [j98] [j96] [j95] [j93] [j92] [j90] [c102] [c101] [c100] [c98] [c97] [i34] [i32] [i27] [j88] [j86] [c94] [c93] [i26] [i25] [c85] [i22] [i17] [i15]
[j143] [c131] [c129] [i59] [j141] [j139] [i58] [j136] [c126] [j130] [j124] [j122] [c122] [c120] [i50] [j114] [j113] [j112] [j110] [c115] [c114] [i47] [i46] [j107] [j106] [j105] [c111] [i42] [i41] [j103] [j102] [j100] [j99] [c109] [c108] [c107] [c106] [c105] [c104] [i39] [i38] [i36] [j93] [j91] [c98] [i34] [i31] [i30] [i29] [i27] [c92] [i24] [j83] [j82] [j81] [c90] [c89] [c87] [i23] [i18] [j80] [c82] [i16] [j75] [j73] [j71] [j70] [c75] [c74] [c73] [i14] [i13] [j69] [j68] [j67] [j66] [j64] [j60] [j59] [j56] [c68] [c67] [c66] [i9] [i8] [j53] [c65] [c63] [c62] [c61] [i7] [i6] [i4] [c59] [c58] [c57] [j50] [i2] [j47] [j45] [c46] [c45] [c42]
[j143] [c131] [i61] [i59] [j141] [j139] [i58] [j135] [c126] [j130] [j128] [j122] [c122] [c121] [c114] [i46] [i43] [j107] [j105] [c111] [c110] [i42] [i41] [j104] [j102] [j100] [j99] [c108] [c107] [c104] [c103] [i39] [i38] [i35] [j91] [i33] [i31] [i29] [i28] [j87] [c95] [i24] [j82] [c89] [i23] [i20] [c82]
[c131] [c130] [i61] [i60] [i59] [j139] [i58] [j138] [j136] [j135] [j132] [j131] [c128] [c126] [c125] [i57] [i55] [j128] [j127] [j126] [j125] [j124] [j123] [c124] [i54] [j122] [j121] [j119] [j118] [j116] [c121] [c120] [i50] [i49] [j115] [j113] [j111] [j110] [c118] [c117] [c116] [c115] [c113] [i47] [i44] [i43] [j109] [j108] [j106] [j105] [c112] [c111] [i40] [j104] [j103] [j100] [j99] [c109] [c108] [c106] [c104] [c103] [i39] [i36] [j98] [j96] [j95] [j93] [j92] [j91] [j90] [c102] [c101] [c100] [c98] [c97] [i34] [i33] [i32] [i29] [i28] [i27] [j88] [j87] [j86] [c96] [c95] [c94] [c93] [i26] [i25] [i24] [j85] [j82] [c89] [c88] [c85] [i23] [i22] [i20] [i17] [c84] [c82] [i15] [j74] [c80] [c79] [j73] [j71] [c73] [i13] [j68] [j67] [j60] [j59] [j57] [j56] [c67] [c66] [j53] [c65] [c61] [i7] [i6] [j52] [j47] [c48] [c46] [c36]
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 20:41 CET 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:
