 | 2010 |
|---|
| 156 |       | 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) |
| 155 | | 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) |
| 2009 |
|---|
| 154 | | Mohammad Ali Abam,
Mark de Berg,
Mohammad Farshi,
Joachim Gudmundsson,
Michiel H. M. Smid:
Geometric Spanners for Weighted Point Sets.
ESA 2009: 190-202 |
| 153 | | Michiel H. M. Smid:
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension.
Efficient Algorithms 2009: 275-289 |
| 152 | | Mohammad Ali Abam,
Paz Carmi,
Mohammad Farshi,
Michiel H. M. Smid:
On the Power of the Semi-Separated Pair Decomposition.
WADS 2009: 1-12 |
| 151 | | Prosenjit Bose,
Pat Morin,
Michiel H. M. Smid,
Stefanie Wuhrer:
Clamshell Casting.
Algorithmica 55(4): 666-702 (2009) |
| 150 | | 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) |
| 149 | | Joachim Gudmundsson,
Pat Morin,
Michiel H. M. Smid:
Algorithms for Marketing-Mix Optimization
CoRR abs/0903.0308: (2009) |
| 148 | | 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) |
| 147 | | 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) |
| 146 | | 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) |
| 145 | | 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) |
| 144 | | 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) |
| 143 | | Joachim Gudmundsson,
Michiel H. M. Smid:
On Spanners of Geometric Graphs.
Int. J. Found. Comput. Sci. 20(1): 135-149 (2009) |
| 142 | | 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) |
| 141 | | 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) |
| 2008 |
|---|
| 140 |  | Ravi Janardan,
Prosenjit Gupta,
Yokesh Kumar,
Michiel H. M. Smid:
Data Structures for Range-Aggregate Extent Queries.
CCCG 2008 |
| 139 | | Prosenjit Bose,
Paz Carmi,
Sébastien Collette,
Michiel H. M. Smid:
On the Stretch Factor of Convex Delaunay Graphs.
ISAAC 2008: 656-667 |
| 138 | | 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 |
| 137 | | Prosenjit Bose,
Paz Carmi,
Mohammad Farshi,
Anil Maheshwari,
Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time.
SWAT 2008: 390-401 |
| 136 | | Joachim Gudmundsson,
Giri Narasimhan,
Michiel H. M. Smid:
Applications of Geometric Spanner Networks.
Encyclopedia of Algorithms 2008 |
| 135 | | Joachim Gudmundsson,
Giri Narasimhan,
Michiel H. M. Smid:
Geometric Spanners.
Encyclopedia of Algorithms 2008 |
| 134 | | Joachim Gudmundsson,
Giri Narasimhan,
Michiel H. M. Smid:
Planar Geometric Spanners.
Encyclopedia of Algorithms 2008 |
| 133 | | Joachim Gudmundsson,
Christos Levcopoulos,
Giri Narasimhan,
Michiel H. M. Smid:
Approximate distance oracles for geometric spanners.
ACM Transactions on Algorithms 4(1): (2008) |
| 132 | | Prosenjit Bose,
Paz Carmi,
Sébastien Collette,
Michiel H. M. Smid:
On the Stretch Factor of Convex Delaunay Graphs
CoRR abs/0804.1041: (2008) |
| 131 | | Prosenjit Bose,
Paz Carmi,
Michiel H. M. Smid,
Daming Xu:
Communication-Efficient Construction of the Plane Localized Delaunay Graph
CoRR abs/0809.2956: (2008) |
| 130 | | 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) |
| 129 | | Anil Maheshwari,
Michiel H. M. Smid,
Norbert Zeh:
I/O-efficient algorithms for computing planar geometric spanners.
Comput. Geom. 40(3): 252-271 (2008) |
| 128 | | 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) |
| 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 |
| 125 | | Hee-Kap Ahn,
Mohammad Farshi,
Christian Knauer,
Michiel H. M. Smid,
Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles.
ISAAC 2007: 88-99 |
| 124 | | 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 |
| 123 | | Prosenjit Bose,
Aaron Lee,
Michiel H. M. Smid:
On Generalized Diamond Spanners.
WADS 2007: 325-336 |
| 122 | | Prosenjit Bose,
Paz Carmi,
Mathieu Couture,
Anil Maheshwari,
Michiel H. M. Smid,
Norbert Zeh:
Geometric Spanners with Small Chromatic Number.
WAOA 2007: 75-88 |
| 121 | | 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) |
| 120 | | 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) |
| 119 | | 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) |
| 118 | | 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) |
| 117 | | Joachim Gudmundsson,
Giri Narasimhan,
Michiel H. M. Smid:
Distance-preserving approximations of polygonal paths.
Comput. Geom. 36(3): 183-196 (2007) |
| 116 | | 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) |
| 2006 |
|---|
| 115 | | Michiel H. M. Smid:
Geometric spanners with few edges and degree five.
CATS 2006: 7-9 |
| 114 | | Prosenjit Bose,
Pat Morin,
Michiel H. M. Smid,
Stefanie Wuhrer:
Rotationally Monotone Polygons.
CCCG 2006 |
| 113 | | 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 |
| 112 | | Prosenjit Bose,
Michiel H. M. Smid,
Daming Xu:
Diamond Triangulations Contain Spanners of Bounded Degree.
ISAAC 2006: 173-182 |
| 111 | | 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 |
| 110 | | 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 |
| 109 | | Joachim Gudmundsson,
Michiel H. M. Smid:
On Spanners of Geometric Graphs.
SWAT 2006: 388-399 |
| 108 | | 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) |
| 107 | | Anil Maheshwari,
Michiel H. M. Smid:
A Dynamic Dictionary for Priced Information with Application.
Algorithmica 44(2): 151-165 (2006) |
| 2005 |
|---|
| 106 | | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
Efficient Non-intersection Queries on Aggregated Geometric Data.
COCOON 2005: 544-553 |
| 105 | | 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 |
| 104 | | Joachim Gudmundsson,
Giri Narasimhan,
Michiel H. M. Smid:
Fast Pruning of Geometric Spanners.
STACS 2005: 508-520 |
| 103 | | Prosenjit Bose,
Joachim Gudmundsson,
Michiel H. M. Smid:
Constructing Plane Spanners of Bounded Degree and Low Weight.
Algorithmica 42(3-4): 249-264 (2005) |
| 102 | | 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) |
| 101 | | 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) |
| 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 |
|---|
| 99 | | 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 |
| 98 | | Prosenjit Bose,
Anil Maheshwari,
Giri Narasimhan,
Michiel H. M. Smid,
Norbert Zeh:
Approximating geometric bottleneck shortest paths.
Comput. Geom. 29(3): 233-249 (2004) |
| 97 | | 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) |
| 96 | | Prosenjit 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 |
| 94 | | Joachim Gudmundsson,
Giri Narasimhan,
Michiel H. M. Smid:
Distance-Preserving Approximations of Polygonal Paths.
FSTTCS 2003: 217-228 |
| 93 | | Anil Maheshwari,
Michiel H. M. Smid:
A Dynamic Dictionary for Priced Information with Application.
ISAAC 2003: 16-25 |
| 92 | | Danny Krizanc,
Pat Morin,
Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees.
ISAAC 2003: 517-526 |
| 91 | | Prosenjit Bose,
Anil Maheshwari,
Giri Narasimhan,
Michiel H. M. Smid,
Norbert Zeh:
Approximating Geometric Bottleneck Shortest Paths.
STACS 2003: 38-49 |
| 90 | | Danny Krizanc,
Pat Morin,
Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees
CoRR cs.DS/0307034: (2003) |
| 89 | | 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) |
| 88 | | 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) |
| 2002 |
|---|
| 87 | | Prosenjit Bose,
Michiel H. M. Smid,
David R. Wood:
Light edges in degree-constrained graphs.
CCCG 2002: 142-145 |
| 86 | | Ivaylo Ilinkin,
Ravi Janardan,
Michiel H. M. Smid:
Terrain Polygon Decomposition, with Application to Layered Manufacturing.
COCOON 2002: 381-390 |
| 85 | | Prosenjit Bose,
Joachim Gudmundsson,
Michiel H. M. Smid:
Constructing Plane Spanners of Bounded Degree and Low Weight.
ESA 2002: 234-246 |
| 84 | | Danny Z. Chen,
Michiel H. M. Smid,
Bin Xu:
Geometric Algorithms for Density-Based Data Clustering.
ESA 2002: 284-296 |
| 83 | | 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 |
| 82 | | Joachim Gudmundsson,
Christos Levcopoulos,
Giri Narasimhan,
Michiel H. M. Smid:
Approximate Distance Oracles Revisited.
ISAAC 2002: 357-368 |
| 81 | | Joachim Gudmundsson,
Christos Levcopoulos,
Giri Narasimhan,
Michiel H. M. Smid:
Approximate distance oracles for geometric graphs.
SODA 2002: 828-837 |
| 80 | | Christos 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) |
| 78 | | 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) |
| 77 | | Michiel 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 |
|---|
| 75 | | 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 |
| 74 | | Giri Narasimhan,
Michiel H. M. Smid:
Approximation Algorithms for the Bottleneck Stretch Factor Problem.
STACS 2001: 502-513 |
| 73 | | Anil Maheshwari,
Michiel H. M. Smid,
Norbert Zeh:
I/O-Efficient Shortest Path Queries in Geometric Spanners.
WADS 2001: 287-299 |
| 72 | | 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 |
| 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) |
| 70 | | Katharina 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) |
| 68 | | 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) |
| 67 | | Giri Narasimhan,
Michiel H. M. Smid:
Approximating the Stretch Factor of Euclidean Graphs.
SIAM J. Comput. 30(3): 978-989 (2000) |
| 1999 |
|---|
| 66 | | Jörg Schwerdt,
Michiel H. M. Smid,
Ravi Janardan,
Eric Johnson,
Jayanth Majhi:
Protecting Facets in Layered Manufacturing.
FSTTCS 1999: 291-303 |
| 65 | | 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) |
| 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) |
| 61 | | 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) |
| 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 |
| 58 | | Christos Levcopoulos,
Giri Narasimhan,
Michiel H. M. Smid:
Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners.
STOC 1998: 186-195 |
| 57 | | 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 |
| 56 | | 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) |
| 1997 |
|---|
| 55 | | 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 |
| 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) |
| 51 | | 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) |
| 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 |
| 45 | | 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 |
| 44 | | 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 |
| 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 |
|---|
| 40 | | 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 |
| 39 | | Sunil Arya,
Gautam Das,
David M. Mount,
Jeffrey S. Salowe,
Michiel H. M. Smid:
Euclidean spanners: short, thin, and lanky.
STOC 1995: 489-498 |
| 38 | | 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 |
| 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 |
|---|
| 30 | | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects.
ESA 1994: 278-289 |
| 29 | | Sunil 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 |
| 27 | | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
On Intersection Searching Problems Involving Curved Objects.
SWAT 1994: 183-194 |
| 26 | | Sanjiv Kapoor,
Michiel H. M. Smid:
New Techniques for Exact and Approximate Dynamic Closest-Point Problems.
Symposium on Computational Geometry 1994: 165-174 |
| 25 | | 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 |
| 24 | | Hans-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 |
| 15 | | 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 |
| 14 | | 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 |
| 13 | | 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 |
| 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 |
|---|
| 2 | | Mark 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) |
