dblp.uni-trier.dewww.uni-trier.de

Michiel H. M. Smid Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
153EEMohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid: Geometric Spanners for Weighted Point Sets. ESA 2009: 190-202
152EEMichiel H. M. Smid: The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension. Efficient Algorithms 2009: 275-289
151EEMohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid: On the Power of the Semi-Separated Pair Decomposition. WADS 2009: 1-12
150EEProsenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer: Clamshell Casting. Algorithmica 55(4): 666-702 (2009)
149EEMarc 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)
148EEJoachim Gudmundsson, Pat Morin, Michiel H. M. Smid: Algorithms for Marketing-Mix Optimization CoRR abs/0903.0308: (2009)
147EEProsenjit 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)
146EETetsuo 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)
145EEMarc 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)
144EEProsenjit 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)
143EEJoachim Gudmundsson, Michiel H. M. Smid: On Spanners of Geometric Graphs. Int. J. Found. Comput. Sci. 20(1): 135-149 (2009)
142EERossen 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)
141EEProsenjit 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)
2008
140 Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Michiel H. M. Smid: Data Structures for Range-Aggregate Extent Queries. CCCG 2008
139EEProsenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid: On the Stretch Factor of Convex Delaunay Graphs. ISAAC 2008: 656-667
138EEProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Spanners of Complete k -Partite Geometric Graphs. LATIN 2008: 170-181
137EEProsenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid: Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401
136EEJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2008
135EEJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Geometric Spanners. Encyclopedia of Algorithms 2008
134EEJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Planar Geometric Spanners. Encyclopedia of Algorithms 2008
133EEJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms 4(1): (2008)
132EEProsenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid: On the Stretch Factor of Convex Delaunay Graphs CoRR abs/0804.1041: (2008)
131EEProsenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu: Communication-Efficient Construction of the Plane Localized Delaunay Graph CoRR abs/0809.2956: (2008)
130EEBoris 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)
129EEAnil Maheshwari, Michiel H. M. Smid, Norbert Zeh: I/O-efficient algorithms for computing planar geometric spanners. Comput. Geom. 40(3): 252-271 (2008)
128EEProsenjit 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)
2007
127 Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff: Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
126 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
125EEHee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang: Dilation-Optimal Edge Deletion in Polygonal Cycles. ISAAC 2007: 88-99
124EEProsenjit 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
123EEProsenjit Bose, Aaron Lee, Michiel H. M. Smid: On Generalized Diamond Spanners. WADS 2007: 325-336
122EEProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88
121EEProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners With Small Chromatic Number CoRR abs/0711.0114: (2007)
120EEProsenjit 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)
119EEBoris 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)
118EEProsenjit 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)
117EEJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-preserving approximations of polygonal paths. Comput. Geom. 36(3): 183-196 (2007)
116EEProsenjit 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)
2006
115EEMichiel H. M. Smid: Geometric spanners with few edges and degree five. CATS 2006: 7-9
114EEProsenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer: Rotationally Monotone Polygons. CCCG 2006
113EEJoachim 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
112EEProsenjit Bose, Michiel H. M. Smid, Daming Xu: Diamond Triangulations Contain Spanners of Bounded Degree. ISAAC 2006: 173-182
111EEBoris 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
110EEPhillip 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
109EEJoachim Gudmundsson, Michiel H. M. Smid: On Spanners of Geometric Graphs. SWAT 2006: 388-399
108EEIvaylo 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)
107EEAnil Maheshwari, Michiel H. M. Smid: A Dynamic Dictionary for Priced Information with Application. Algorithmica 44(2): 151-165 (2006)
2005
106EEProsenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Non-intersection Queries on Aggregated Geometric Data. COCOON 2005: 544-553
105EERolf 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
104EEJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Fast Pruning of Geometric Spanners. STACS 2005: 508-520
103EEProsenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid: Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica 42(3-4): 249-264 (2005)
102EEBoris 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)
101EEDanny 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)
100 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)
2004
99EEIvaylo 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
98EEProsenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3): 233-249 (2004)
97EEMichiel 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)
96EEProsenjit Bose, Michiel H. M. Smid, David R. Wood: Light edges in degree-constrained graphs. Discrete Mathematics 282(1-3): 35-41 (2004)
2003
95 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 Springer 2003
94EEJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-Preserving Approximations of Polygonal Paths. FSTTCS 2003: 217-228
93EEAnil Maheshwari, Michiel H. M. Smid: A Dynamic Dictionary for Priced Information with Application. ISAAC 2003: 16-25
92EEDanny Krizanc, Pat Morin, Michiel H. M. Smid: Range Mode and Range Median Queries on Lists and Trees. ISAAC 2003: 517-526
91EEProsenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating Geometric Bottleneck Shortest Paths. STACS 2003: 38-49
90EEDanny Krizanc, Pat Morin, Michiel H. M. Smid: Range Mode and Range Median Queries on Lists and Trees CoRR cs.DS/0307034: (2003)
89EEMan 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)
88EEJö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)
2002
87EEProsenjit Bose, Michiel H. M. Smid, David R. Wood: Light edges in degree-constrained graphs. CCCG 2002: 142-145
86EEIvaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid: Terrain Polygon Decomposition, with Application to Layered Manufacturing. COCOON 2002: 381-390
85EEProsenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid: Constructing Plane Spanners of Bounded Degree and Low Weight. ESA 2002: 234-246
84EEDanny Z. Chen, Michiel H. M. Smid, Bin Xu: Geometric Algorithms for Density-Based Data Clustering. ESA 2002: 284-296
83EEPankaj 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
82EEJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate Distance Oracles Revisited. ISAAC 2002: 357-368
81EEJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric graphs. SODA 2002: 828-837
80EEChristos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica 32(1): 144-156 (2002)
79 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)
78EEJö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)
77EEMichiel H. M. Smid, Vanam Srilakshmi: Computing the Smallest T-Shaped Polygon Containing k Points. Int. J. Comput. Math. 79(2): 143-156 (2002)
76 Giri Narasimhan, Michiel H. M. Smid: Approximation Algorithms for the Bottleneck Stretch Factor Problem. Nord. J. Comput. 9(1): 13-31 (2002)
2001
75EEMan 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
74EEGiri Narasimhan, Michiel H. M. Smid: Approximation Algorithms for the Bottleneck Stretch Factor Problem. STACS 2001: 502-513
73EEAnil Maheshwari, Michiel H. M. Smid, Norbert Zeh: I/O-Efficient Shortest Path Queries in Geometric Spanners. WADS 2001: 287-299
72EEIvaylo 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
71 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)
70EEKatharina Lange, Rahul Ray, Michiel H. M. Smid, Ulrich Wendt: Computing large planar regions in terrains. Electr. Notes Theor. Comput. Sci. 46: (2001)
2000
69 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)
68EEGautam Das, Michiel H. M. Smid: A lower bound for approximating the geometric minimum weight matching. Inf. Process. Lett. 74(5-6): 253-255 (2000)
67EEGiri Narasimhan, Michiel H. M. Smid: Approximating the Stretch Factor of Euclidean Graphs. SIAM J. Comput. 30(3): 978-989 (2000)
1999
66EEJörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi: Protecting Facets in Layered Manufacturing. FSTTCS 1999: 291-303
65EEJö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)
64 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)
63 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)
62 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)
61EEProsenjit 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)
60 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)
1998
59 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
58EEChristos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. STOC 1998: 186-195
57EEJayanth 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
56EEMordecai 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)
1997
55EEJö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
54 Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta: On Some Geometric Optimization Problems in Layered Manufacturing. WADS 1997: 136-149
53 Sunil Arya, Michiel H. M. Smid: Efficient Construction of a Bounded-Degree Spanner with Low Weight. Algorithmica 17(1): 33-54 (1997)
52 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)
51EEProsenjit 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)
50 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)
49 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)
48 Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid: More Efficient Parallel Totally Monotone Matrix Searching. J. Algorithms 23(2): 386-400 (1997)
1996
47 Danny Z. Chen, Gautam Das, Michiel H. M. Smid: Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. CCCG 1996: 155-160
46 Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. CCCG 1996: 8-13
45EESrinivasa 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
44EEGautam Das, Sanjiv Kapoor, Michiel H. M. Smid: On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. FSTTCS 1996: 64-75
43 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)
42 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)
41 Sanjiv Kapoor, Michiel H. M. Smid: New Techniques for Exact and Approximate Dynamic Closest-Point Problems. SIAM J. Comput. 25(4): 775-796 (1996)
1995
40EEFrank 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
39EESunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid: Euclidean spanners: short, thin, and lanky. STOC 1995: 489-498
38EEProsenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta: The Rectangle Enclosure and Point-Dominance Problems Revisited. Symposium on Computational Geometry 1995: 162-171
37 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)
36 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)
35 Michiel H. M. Smid: Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem Inf. Comput. 116(1): 1-9 (1995)
34 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)
33 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)
32 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)
31 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)
1994
30EEProsenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. ESA 1994: 278-289
29EESunil Arya, Michiel H. M. Smid: Efficient Construction of a Bounded Degree Spanner with Low Weight. ESA 1994: 48-59
28 Sunil Arya, David M. Mount, Michiel H. M. Smid: Randomized and deterministic algorithms for geometric spanners of small diameter FOCS 1994: 703-712
27EEProsenjit Gupta, Ravi Janardan, Michiel H. M. Smid: On Intersection Searching Problems Involving Curved Objects. SWAT 1994: 183-194
26EESanjiv Kapoor, Michiel H. M. Smid: New Techniques for Exact and Approximate Dynamic Closest-Point Problems. Symposium on Computational Geometry 1994: 165-174
25EEProsenjit 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
24EEHans-Peter Lenhof, Michiel H. M. Smid: An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm. Symposium on Computational Geometry 1994: 387
23 Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink: An Optimal Algorithm for the On-Line Closest-Pair Problem. Algorithmica 12(1): 18-29 (1994)
22 Hans-Peter Lenhof, Michiel H. M. Smid: Using Persistent Data Structures for Adding Range Restrictions to Searching Problems. ITA 28(1): 25-49 (1994)
1993
21 Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid: Simple Randomized Algorithms for Closest Pair Problems. CCCG 1993: 246-251
20 Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid: Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA 1993: 301-310
19 Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid: Static and Dynamic Algorithms for k-Point Clustering Problems. WADS 1993: 265-276
18 Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. WADS 1993: 361-372
17 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)
1992
16 Hans-Peter Lenhof, Michiel H. M. Smid: Enumerating the k Closest Pairs Optimally FOCS 1992: 380-386
15EEChristian 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
14EEHans-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
13EEChristian Schwarz, Michiel H. M. Smid, Jack Snoeyink: An Optimal Algorithm for the On-Line Closest-Pair Problem. Symposium on Computational Geometry 1992: 330-336
12 Michiel H. M. Smid: Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. Discrete & Computational Geometry 7: 415-431 (1992)
1991
11 Hans-Peter Lenhof, Michiel H. M. Smid: An Optimal Construction Method for Generalized Convex Layers. ISA 1991: 349-363
10 Michiel H. M. Smid: Rectangular Point Location and the Dynamic Closest Pair Problem. ISA 1991: 364-374
9 Michiel H. M. Smid: Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. SODA 1991: 1-6
1990
8 Yu-Tai Ching, Kurt Mehlhorn, Michiel H. M. Smid: Dynamic Deferred Data Structuring. Inf. Process. Lett. 35(1): 37-40 (1990)
1989
7 Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas: Multiple Representations of Dynamic Data Structures. IFIP Congress 1989: 437-442
6 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)
5 Michiel H. M. Smid, Mark H. Overmars: Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds. Acta Inf. 27(5): 453-480 (1989)
4 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)
3 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)
1988
2EEMark H. Overmars, Michiel H. M. Smid: Maintaining Range Trees in Secondary Memory (Extended Abstract). STACS 1988: 38-51
1987
1 Michiel H. M. Smid: Duadic codes. IEEE Transactions on Information Theory 33(3): 432- (1987)

Coauthor Index

1Mohammad Ali Abam [151] [153]
2Pankaj K. Agarwal [83]
3Hee-Kap Ahn [125]
4Srinivasa Rao Arikati [45]
5Boris Aronov [102] [111] [119] [130]
6Sunil Arya [28] [29] [39] [53] [62]
7Tetsuo Asano [126] [146]
8Rossen Atanassov [142]
9Mark de Berg [6] [119] [130] [153]
10Peter van Emde Boas [3] [4] [7]
11Prosenjit Bose [85] [87] [91] [96] [98] [102] [103] [111] [112] [114] [116] [118] [120] [121] [122] [123] [124] [126] [128] [131] [132] [137] [138] [139] [141] [142] [144] [146] [147] [150]
12Phillip G. Bradford [48] [110]
13Paz Carmi [118] [120] [121] [122] [124] [126] [131] [132] [137] [138] [139] [141] [146] [147] [151]
14Paul Castillo [99] [108]
15Danny Z. Chen [45] [47] [71] [84] [101]
16Otfried Cheong (Otfried Schwarzkopf) [119] [130]
17L. Paul Chew [45]
18Yu-Tai Ching [8]
19Sébastien Collette [132] [139]
20Mathieu Couture [118] [120] [121] [122] [124] [138] [141] [142] [147]
21Gautam Das [39] [44] [45] [47] [52] [68] [71]
22Bhaskar DasGupta [38] [50]
23Amitava Datta [19] [32]
24Frank K. H. A. Dehne [95]
25Erik D. Demaine [102] [111]
26Mohammad Farshi [125] [137] [151] [153]
27Rudolf Fleischer [48]
28Frank Follert [40] [49]
29Mordecai J. Golin [20] [21] [31] [56]
30Joachim Gudmundsson [81] [82] [85] [94] [102] [103] [104] [109] [111] [113] [117] [119] [127] [130] [133] [134] [135] [136] [143] [148] [153]
31Hua Guo [128]
32Prosenjit Gupta [18] [25] [27] [30] [33] [36] [38] [42] [43] [46] [50] [51] [54] [61] [63] [64] [106] [140]
33Torben Hagerup [83]
34Herman J. Haverkort [119] [130]
35Man Chung Hon [75] [78] [89]
36John Iacono [102] [111]
37Ivaylo Ilinkin [72] [79] [86] [99] [108]
38Ravi Janardan [18] [25] [27] [30] [33] [36] [38] [42] [43] [46] [50] [51] [54] [57] [59] [60] [61] [63] [64] [65] [66] [69] [72] [75] [78] [79] [86] [88] [89] [99] [106] [108] [140]
39Eric Johnson [66] [69] [88] [99] [108]
40Sanjiv Kapoor [26] [41] [44] [52]
41Rolf Klein [105] [113] [127]
42Christian Knauer [105] [125]
43Evangelos Kranakis [128]
44Marc J. van Kreveld [6]
45Danny Krizanc [90] [92] [100]
46Yokesh Kumar [140]
47Katharina Lange [70] [97]
48Stefan Langerman [102] [111]
49Aaron Lee [123]
50Hans-Peter Lenhof [11] [14] [16] [17] [19] [22] [24] [32] [34] [37]
51Christos Levcopoulos [58] [80] [81] [82] [133]
52Anil Maheshwari [73] [91] [93] [98] [107] [116] [120] [121] [122] [126] [128] [129] [137] [138] [141] [142] [146] [147]
53Jayanth Majhi [54] [57] [59] [63] [64] [65] [66] [69] [72] [79]
54Kurt Mehlhorn [8]
55Marc Mörig [145] [149]
56Pat Morin [90] [92] [100] [114] [116] [120] [128] [138] [141] [142] [148] [150]
57Jason Morrison [116] [128]
58David M. Mount [28] [39] [62]
59Giri Narasimhan [58] [67] [74] [76] [80] [81] [82] [91] [94] [98] [104] [105] [113] [117] [127] [133] [134] [135] [136]
60Mark H. Overmars [2] [3] [4] [5] [6] [7]
61Michel Paquette [142]
62Irina Perevalova [110]
63Rajeev Raman [20] [21] [31] [56]
64Dieter Rautenbach [145]
65Rahul Ray [70] [83] [97]
66Jörg-Rüdiger Sack [95]
67Jeffrey S. Salowe [39]
68Stefan Schirra [55]
69Elmar Schömer [40] [49]
70Christian Schwarz [13] [15] [19] [20] [21] [23] [31] [32] [56]
71Jörg Schwerdt [55] [57] [59] [63] [65] [66] [69] [72] [75] [78] [79] [88] [89] [99] [108]
72Jürgen Sellen [40] [49]
73Micha Sharir [83]
74Chang Shu [126] [146]
75Jack Snoeyink [13] [23]
76Vanam Srilakshmi [77]
77Ram D. Sriram [72] [79]
78Yihui Tang [128]
79Christian Thiel [40] [49]
80Leen Torenvliet [3] [4] [7]
81Jan Tusch [145] [149]
82Jan Vahrenhold [116]
83Antoine Vigneron [119] [130]
84Yajun Wang [125]
85Charles B. Ward [110]
86Emo Welzl [83]
87Ulrich Wendt [70] [97]
88Alexander Wolff [113] [127]
89David R. Wood [87] [96]
90Stefanie Wuhrer [114] [126] [142] [146] [150]
91Bin Xu [84] [101]
92Daming Xu [112] [118] [124] [131] [144]
93Christos D. Zaroliagis [45]
94Norbert Zeh [73] [91] [98] [121] [122] [129] [147]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)