Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michiel H. M. Smid
2010 – today
- 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, Vida Dujmovic, Pat Morin, Michiel H. M. Smid: Robust Geometric Spanners. SIAM J. Comput. 42(4): 1720-1736 (2013)
- [c86]Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid: The Discrete Voronoi Game in a Simple Polygon. COCOON 2013: 197-207
- [c85]
- [c84]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid: Fixed-Orientation Equilateral Triangle Matching of Point Sets. WALCOM 2013: 17-28
- [i18]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)
- [i17]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid: An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem. CoRR abs/1305.0172 (2013)
- [i16]Vida Dujmovic, Pat Morin, Michiel H. M. Smid: Average Stretch Factor: How Low Does It Go? CoRR abs/1305.4170 (2013)
- [i15]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)
- 2012
- [j81]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. Geometry Appl. 22(1): 61-82 (2012)
- [j80]Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid: Approximating the average stretch factor of geometric graphs. JoCG 3(1): 132-153 (2012)
- [j79]
- [c83]Gregory Bint, Anil Maheshwari, Michiel H. M. Smid: xy-Monotone Path Existence Queries in a Rectilinear Environment. CCCG 2012: 35-40
- [c82]Alexis Beingessner, Michiel H. M. Smid: Computing the Coverage of an Opaque Forest. CCCG 2012: 95-100
- [c81]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid: On Farthest-Point Information in Networks. CCCG 2012: 199-204
- [c80]Pooya Davoodi, Michiel H. M. Smid, Freek van Walderveen: Two-Dimensional Range Diameter Queries. LATIN 2012: 219-230
- [i14]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid: Robust Geometric Spanners. CoRR abs/1204.4679 (2012)
- [i13]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid: Fixed-Orientation Equilateral Triangle Matching of Point Sets. CoRR abs/1211.2734 (2012)
- 2011
- [j78]Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid: Algorithms for Marketing-Mix Optimization. Algorithmica 60(4): 1004-1016 (2011)
- [j77]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)
- [j76]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)
- [j75]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)
- [c79]Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid: An In-Place Priority Search Tree. CCCG 2011
- [c78]Karim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid: Approximation Algorithms for a Triangle Enclosure Problem. CCCG 2011
- 2010
- [j74]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)
- [j73]Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang: Dilation-Optimal Edge Deletion in Polygonal Cycles. Int. J. Comput. Geometry Appl. 20(1): 69-87 (2010)
- [j72]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)
- [j71]Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid: On the Stretch Factor of Convex Delaunay Graphs. JoCG 1(1): 41-56 (2010)
- [c77]Yakov Nekrich, Michiel H. M. Smid: Approximating range-aggregate queries using coresets. CCCG 2010: 253-256
- [c76]Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid: Approximating the Average Stretch Factor of Geometric Graphs. ISAAC (1) 2010: 37-48
- [c75]Paz Carmi, Michiel H. M. Smid: An Optimal Algorithm for Computing Angle-Constrained Spanners. ISAAC (1) 2010: 316-327
- [c74]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
- [c73]Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu: Communication-Efficient Construction of the Plane Localized Delaunay Graph. LATIN 2010: 282-293
- [c72]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
- [i12]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)
- [i11]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
- [j70]Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer: Clamshell Casting. Algorithmica 55(4): 666-702 (2009)
- [j69]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)
- [j68]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)
- [j67]Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer: Rotationally monotone polygons. Comput. Geom. 42(5): 471-483 (2009)
- [j66]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)
- [j65]Prosenjit Bose, Michiel H. M. Smid, Daming Xu: Delaunay and diamond Triangulations contain Spanners of Bounded Degree. Int. J. Comput. Geometry Appl. 19(2): 119-140 (2009)
- [j64]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Non-Intersection Queries on Aggregated Geometric Data. Int. J. Comput. Geometry Appl. 19(6): 479-506 (2009)
- [j63]Joachim Gudmundsson, Michiel H. M. Smid: On Spanners of Geometric Graphs. Int. J. Found. Comput. Sci. 20(1): 135-149 (2009)
- [j62]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)
- [j61]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)
- [j60]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)
- [c71]Michiel H. M. Smid: The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension. Efficient Algorithms 2009: 275-289
- [c70]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid: Geometric Spanners for Weighted Point Sets. ESA 2009: 190-202
- [c69]Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid: On the Power of the Semi-Separated Pair Decomposition. WADS 2009: 1-12
- [i10]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)
- [i9]Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid: Algorithms for Marketing-Mix Optimization. CoRR abs/0903.0308 (2009)
- 2008
- [j59]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)
- [j58]Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: I/O-efficient algorithms for computing planar geometric spanners. Comput. Geom. 40(3): 252-271 (2008)
- [j57]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)
- [j56]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms 4(1) (2008)
- [c68]Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Michiel H. M. Smid: Data Structures for Range-Aggregate Extent Queries. CCCG 2008
- [c67]Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid: On the Stretch Factor of Convex Delaunay Graphs. ISAAC 2008: 656-667
- [c66]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
- [c65]Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid: Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401
- [r3]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2008
- [r2]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Geometric Spanners. Encyclopedia of Algorithms 2008
- [r1]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Planar Geometric Spanners. Encyclopedia of Algorithms 2008
- [i8]Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid: On the Stretch Factor of Convex Delaunay Graphs. CoRR abs/0804.1041 (2008)
- [i7]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
- [j55]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-preserving approximations of polygonal paths. Comput. Geom. 36(3): 183-196 (2007)
- [j54]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)
- [c64]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
- [c63]Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang: Dilation-Optimal Edge Deletion in Polygonal Cycles. ISAAC 2007: 88-99
- [c62]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
- [c61]
- [c60]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88
- [e2]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff (Eds.): 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
- [i6]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)
- [i5]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)
- [i4]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)
- [i3]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
- [j53]Anil Maheshwari, Michiel H. M. Smid: A Dynamic Dictionary for Priced Information with Application. Algorithmica 44(2): 151-165 (2006)
- [j52]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 Journal of Experimental Algorithmics 11 (2006)
- [c59]
- [c58]Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer: Rotationally Monotone Polygons. CCCG 2006
- [c57]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
- [c56]Prosenjit Bose, Michiel H. M. Smid, Daming Xu: Diamond Triangulations Contain Spanners of Bounded Degree. ISAAC 2006: 173-182
- [c55]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
- [c54]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
- [c53]
- 2005
- [j51]Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid: Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica 42(3-4): 249-264 (2005)
- [j50]Danny Z. Chen, Michiel H. M. Smid, Bin Xu: Geometric Algorithms for Density-based Data Clustering. Int. J. Comput. Geometry Appl. 15(3): 239-260 (2005)
- [j49]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)
- [c52]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Non-intersection Queries on Aggregated Geometric Data. COCOON 2005: 544-553
- [c51]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
- [c50]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Fast Pruning of Geometric Spanners. STACS 2005: 508-520
- [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
- [j48]Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3): 233-249 (2004)
- [j47]Michiel H. M. Smid, Rahul Ray, Ulrich Wendt, Katharina Lange: Computing large planar regions in terrains, with an application to fracture surfaces. Discrete Applied Mathematics 139(1-3): 253-264 (2004)
- [j46]Prosenjit Bose, Michiel H. M. Smid, David R. Wood: Light edges in degree-constrained graphs. Discrete Mathematics 282(1-3): 35-41 (2004)
- [c49]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
- 2003
- [j45]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. Computer-Aided Design 35(1): 57-68 (2003)
- [j44]Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson: Protecting critical facets in layered manufacturing: implementation and experimental results. Computer-Aided Design 35(7): 647-657 (2003)
- [c48]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-Preserving Approximations of Polygonal Paths. FSTTCS 2003: 217-228
- [c47]Anil Maheshwari, Michiel H. M. Smid: A Dynamic Dictionary for Priced Information with Application. ISAAC 2003: 16-25
- [c46]Danny Krizanc, Pat Morin, Michiel H. M. Smid: Range Mode and Range Median Queries on Lists and Trees. ISAAC 2003: 517-526
- [c45]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 (Eds.): 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
- [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
- [j43]Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica 32(1): 144-156 (2002)
- [j42]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)
- [j41]Michiel H. M. Smid, Vanam Srilakshmi: Computing the Smallest T-Shaped Polygon Containing k Points. Int. J. Comput. Math. 79(2): 143-156 (2002)
- [j40]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)
- [j39]Giri Narasimhan, Michiel H. M. Smid: Approximation Algorithms for the Bottleneck Stretch Factor Problem. Nord. J. Comput. 9(1): 13-31 (2002)
- [c44]Prosenjit Bose, Michiel H. M. Smid, David R. Wood: Light edges in degree-constrained graphs. CCCG 2002: 142-145
- [c43]Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid: Terrain Polygon Decomposition, with Application to Layered Manufacturing. COCOON 2002: 381-390
- [c42]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
- [c41]Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid: Constructing Plane Spanners of Bounded Degree and Low Weight. ESA 2002: 234-246
- [c40]Danny Z. Chen, Michiel H. M. Smid, Bin Xu: Geometric Algorithms for Density-Based Data Clustering. ESA 2002: 284-296
- [c39]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate Distance Oracles Revisited. ISAAC 2002: 357-368
- [c38]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric graphs. SODA 2002: 828-837
- 2001
- [j38]Danny Z. Chen, Gautam Das, Michiel H. M. Smid: Lower bounds for computing geometric spanners and approximate shortest paths. Discrete Applied Mathematics 110(2-3): 151-167 (2001)
- [j37]Katharina Lange, Rahul Ray, Michiel H. M. Smid, Ulrich Wendt: Computing large planar regions in terrains. Electr. Notes Theor. Comput. Sci. 46: 133-145 (2001)
- [c37]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
- [c36]Giri Narasimhan, Michiel H. M. Smid: Approximation Algorithms for the Bottleneck Stretch Factor Problem. STACS 2001: 502-513
- [c35]Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: I/O-Efficient Shortest Path Queries in Geometric Spanners. WADS 2001: 287-299
- [c34]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
- 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)
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. Geometry 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 Journal of Experimental 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. Symposium on Computational Geometry 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. Algorithm Engineering 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. Geometry 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. Geometry 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. Symposium on Computational Geometry 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. Geometry 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. Symposium on Computational Geometry 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. ITA 28(1): 25-49 (1994)
- [c20]Sanjiv Kapoor, Michiel H. M. Smid: New Techniques for Exact and Approximate Dynamic Closest-Point Problems. Symposium on Computational Geometry 1994: 165-174
- [c19]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. Symposium on Computational Geometry 1994: 369-378
- [c18]Hans-Peter Lenhof, Michiel H. M. Smid: An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm. Symposium on Computational Geometry 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. Geometry 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. Discrete & Computational Geometry 7: 415-431 (1992)
- [c9]Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink: An Optimal Algorithm for the On-Line Closest-Pair Problem. Symposium on Computational Geometry 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]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
- [j5]Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld: Maintaining Range Trees in Secondary Memory. Part I: Partitions. Acta Inf. 27(5): 423-452 (1989)
- [j4]Michiel H. M. Smid, Mark H. Overmars: Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds. Acta Inf. 27(5): 453-480 (1989)
- [j3]Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars: Two Models for the Reconstruction Problem for Dynamic Data Structures. Elektronische Informationsverarbeitung und Kybernetik 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]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:18 CEST by the dblp team