The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michiel H. M. Smid: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michiel H. M. Smid, Mark H. Overmars
    Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds. [Citation Graph (5, 0)][DBLP]
    Acta Inf., 1989, v:27, n:5, pp:453-480 [Journal]
  2. Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld
    Maintaining Range Trees in Secondary Memory. Part I: Partitions. [Citation Graph (4, 0)][DBLP]
    Acta Inf., 1989, v:27, n:5, pp:423-452 [Journal]
  3. Mark H. Overmars, Michiel H. M. Smid
    Maintaining Range Trees in Secondary Memory (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    STACS, 1988, pp:38-51 [Conf]
  4. Prosenjit Bose, Michiel H. M. Smid, David R. Wood
    Light edges in degree-constrained graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:142-145 [Conf]
  5. Danny Z. Chen, Gautam Das, Michiel H. M. Smid
    Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:155-160 [Conf]
  6. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Simple Randomized Algorithms for Closest Pair Problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:246-251 [Conf]
  7. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:8-13 [Conf]
  8. Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt
    Approximating contact-area of supports in layered manufacturing. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:91-94 [Conf]
  9. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Non-intersection Queries on Aggregated Geometric Data. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:544-553 [Conf]
  10. Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid
    Terrain Polygon Decomposition, with Application to Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:381-390 [Conf]
  11. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:369-378 [Conf]
  12. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta
    The Rectangle Enclosure and Point-Dominance Problems Revisited. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:162-171 [Conf]
  13. Sanjiv Kapoor, Michiel H. M. Smid
    New Techniques for Exact and Approximate Dynamic Closest-Point Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:165-174 [Conf]
  14. Hans-Peter Lenhof, Michiel H. M. Smid
    An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:387- [Conf]
  15. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Jörg Schwerdt
    Multi-Criteria Geometric Optimization Problems in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:19-28 [Conf]
  16. Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink
    An Optimal Algorithm for the On-Line Closest-Pair Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:330-336 [Conf]
  17. Jörg Schwerdt, Michiel H. M. Smid, Stefan Schirra
    Computing the Minimum Diameter for Moving Points: An Exact Implementation Using Parametric Search. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:466-468 [Conf]
  18. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:514-528 [Conf]
  19. Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl
    Translating a Planar Object to Maximize Point Containment. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:42-53 [Conf]
  20. Sunil Arya, Michiel H. M. Smid
    Efficient Construction of a Bounded Degree Spanner with Low Weight. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:48-59 [Conf]
  21. Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid
    Constructing Plane Spanners of Bounded Degree and Low Weight. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:234-246 [Conf]
  22. Danny Z. Chen, Michiel H. M. Smid, Bin Xu
    Geometric Algorithms for Density-Based Data Clustering. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:284-296 [Conf]
  23. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:278-289 [Conf]
  24. Sunil Arya, David M. Mount, Michiel H. M. Smid
    Randomized and deterministic algorithms for geometric spanners of small diameter [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:703-712 [Conf]
  25. Hans-Peter Lenhof, Michiel H. M. Smid
    Enumerating the k Closest Pairs Optimally [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:380-386 [Conf]
  26. Frank Follert, Elmar Schömer, Jürgen Sellen, Michiel H. M. Smid, Christian Thiel
    Computing a Largest Empty Anchored Cylinder, and Related Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:428-442 [Conf]
  27. Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid
    On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:64-75 [Conf]
  28. Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
    Distance-Preserving Approximations of Polygonal Paths. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:217-228 [Conf]
  29. Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi
    Protecting Facets in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:291-303 [Conf]
  30. Man Chung Hon, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid
    Computing Optimal Hatching Directions in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (1), 2001, pp:683-692 [Conf]
  31. Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
    Multiple Representations of Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:437-442 [Conf]
  32. Hans-Peter Lenhof, Michiel H. M. Smid
    An Optimal Construction Method for Generalized Convex Layers. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:349-363 [Conf]
  33. Michiel H. M. Smid
    Rectangular Point Location and the Dynamic Closest Pair Problem. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:364-374 [Conf]
  34. Prosenjit Bose, Michiel H. M. Smid, Daming Xu
    Diamond Triangulations Contain Spanners of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:173-182 [Conf]
  35. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Approximate Distance Oracles Revisited. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:357-368 [Conf]
  36. Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid
    Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:849-858 [Conf]
  37. Danny Krizanc, Pat Morin, Michiel H. M. Smid
    Range Mode and Range Median Queries on Lists and Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:517-526 [Conf]
  38. Anil Maheshwari, Michiel H. M. Smid
    A Dynamic Dictionary for Priced Information with Application. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:16-25 [Conf]
  39. 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. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:80-92 [Conf]
  40. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Randomized Data Structures for the Dynamic Closest-Pair Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:301-310 [Conf]
  41. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Approximate distance oracles for geometric graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:828-837 [Conf]
  42. Christian Schwarz, Michiel H. M. Smid
    An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:280-285 [Conf]
  43. Michiel H. M. Smid
    Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:1-6 [Conf]
  44. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
    Approximating Geometric Bottleneck Shortest Paths. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:38-49 [Conf]
  45. Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
    Fast Pruning of Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:508-520 [Conf]
  46. Giri Narasimhan, Michiel H. M. Smid
    Approximation Algorithms for the Bottleneck Stretch Factor Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:502-513 [Conf]
  47. Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid
    Euclidean spanners: short, thin, and lanky. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:489-498 [Conf]
  48. Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:186-195 [Conf]
  49. Joachim Gudmundsson, Michiel H. M. Smid
    On Spanners of Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:388-399 [Conf]
  50. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    On Intersection Searching Problems Involving Curved Objects. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:183-194 [Conf]
  51. Hans-Peter Lenhof, Michiel H. M. Smid
    Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:388-398 [Conf]
  52. Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid
    Static and Dynamic Algorithms for k-Point Clustering Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:265-276 [Conf]
  53. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:361-372 [Conf]
  54. Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram
    A Decomposition-Based Approach to Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:389-400 [Conf]
  55. Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
    I/O-Efficient Shortest Path Queries in Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:287-299 [Conf]
  56. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta
    On Some Geometric Optimization Problems in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:136-149 [Conf]
  57. Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan
    Computing the Width of a Three-Dimensional Point Set: An Experimental Study. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:62-73 [Conf]
  58. Sunil Arya, Michiel H. M. Smid
    Efficient Construction of a Bounded-Degree Spanner with Low Weight. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:1, pp:33-54 [Journal]
  59. Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid
    Constructing Plane Spanners of Bounded Degree and Low Weight. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:3-4, pp:249-264 [Journal]
  60. Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid
    On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:4, pp:447-460 [Journal]
  61. Hans-Peter Lenhof, Michiel H. M. Smid
    Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:3, pp:301-312 [Journal]
  62. Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Improved Algorithms for Constructing Fault-Tolerant Spanners. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:1, pp:144-156 [Journal]
  63. Anil Maheshwari, Michiel H. M. Smid
    A Dynamic Dictionary for Priced Information with Application. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:2, pp:151-165 [Journal]
  64. Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink
    An Optimal Algorithm for the On-Line Closest-Pair Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:1, pp:18-29 [Journal]
  65. 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. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2003, v:35, n:1, pp:57-68 [Journal]
  66. Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson
    Protecting critical facets in layered manufacturing: implementation and experimental results. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2003, v:35, n:7, pp:647-657 [Journal]
  67. Sunil Arya, David M. Mount, Michiel H. M. Smid
    Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:2, pp:91-107 [Journal]
  68. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
    Approximating geometric bottleneck shortest paths. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:3, pp:233-249 [Journal]
  69. Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram
    A decomposition-based approach to layered manufacturing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:117-151 [Journal]
  70. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:321-340 [Journal]
  71. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:1-19 [Journal]
  72. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:371-391 [Journal]
  73. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta
    On some geometric optimization problems in layered manufacturing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:3-4, pp:219-239 [Journal]
  74. Jayanth Majhi, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid, Prosenjit Gupta
    Minimizing support structures and trapped area in two-dimensional layered manufacturing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:3-4, pp:241-267 [Journal]
  75. Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi
    Protecting critical facets in layered manufacturing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:3, pp:187-210 [Journal]
  76. Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
    Distance-preserving approximations of polygonal paths. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:3, pp:183-196 [Journal]
  77. Danny Krizanc, Pat Morin, Michiel H. M. Smid
    Range Mode and Range Median Queries on Lists and Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  78. Danny Z. Chen, Gautam Das, Michiel H. M. Smid
    Lower bounds for computing geometric spanners and approximate shortest paths. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:151-167 [Journal]
  79. Michiel H. M. Smid, Rahul Ray, Ulrich Wendt, Katharina Lange
    Computing large planar regions in terrains, with an application to fracture surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:139, n:1-3, pp:253-264 [Journal]
  80. Michiel H. M. Smid
    Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:415-431 [Journal]
  81. Prosenjit Bose, Michiel H. M. Smid, David R. Wood
    Light edges in degree-constrained graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:35-41 [Journal]
  82. Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars
    Two Models for the Reconstruction Problem for Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1989, v:25, n:4, pp:131-155 [Journal]
  83. Katharina Lange, Rahul Ray, Michiel H. M. Smid, Ulrich Wendt
    Computing large planar regions in terrains. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:46, n:, pp:- [Journal]
  84. Michiel H. M. Smid
    Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:116, n:1, pp:1-9 [Journal]
  85. Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
    Maintaining Multiple Representations of Dynamic Data Structures [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:2, pp:206-233 [Journal]
  86. Danny Z. Chen, Michiel H. M. Smid, Bin Xu
    Geometric Algorithms for Density-based Data Clustering. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:3, pp:239-260 [Journal]
  87. Frank Follert, Elmar Schömer, Jürgen Sellen, Michiel H. M. Smid, Christian Thiel
    Computing a Largest Empty Anchored Cylinder, and Related Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:6, pp:563-580 [Journal]
  88. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta
    The Rectangle Enclosure and Point-Dominance Problems Revisited. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:5, pp:437-455 [Journal]
  89. Hans-Peter Lenhof, Michiel H. M. Smid
    Sequential and parallel algorithms for the k closest pairs problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:273-288 [Journal]
  90. Hans-Peter Lenhof, Michiel H. M. Smid
    An optimal construction method for generalized convex layers. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:245-267 [Journal]
  91. Michiel H. M. Smid, Ravi Janardan
    On the width and roundness of a set of points in the plane. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:1, pp:97-108 [Journal]
  92. Jörg Schwerdt, Michiel H. M. Smid, Man Chung Hon, Ravi Janardan
    Computing an Optimal Hatching Direction in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:10, pp:1067-1081 [Journal]
  93. Michiel H. M. Smid, Vanam Srilakshmi
    Computing the Smallest T-Shaped Polygon Containing k Points. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:2, pp:143-156 [Journal]
  94. Yu-Tai Ching, Kurt Mehlhorn, Michiel H. M. Smid
    Dynamic Deferred Data Structuring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:1, pp:37-40 [Journal]
  95. Gautam Das, Michiel H. M. Smid
    A lower bound for approximating the geometric minimum weight matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:5-6, pp:253-255 [Journal]
  96. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    A Technique for Adding Range Restrictions to Generalized Searching Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:5, pp:263-269 [Journal]
  97. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:1, pp:7-13 [Journal]
  98. Hans-Peter Lenhof, Michiel H. M. Smid
    Using Persistent Data Structures for Adding Range Restrictions to Searching Problems. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:1, pp:25-49 [Journal]
  99. Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid
    More Efficient Parallel Totally Monotone Matrix Searching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:386-400 [Journal]
  100. Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid
    Static and Dynamic Algorithms for k-Point Clustering Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:3, pp:474-503 [Journal]
  101. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:2, pp:282-317 [Journal]
  102. 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. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
  103. Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan
    Computing the Width of a Three-Dimensional Point Set: An Experimental Study. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1999, v:4, n:, pp:8- [Journal]
  104. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Simple Randomized Algorithms for Closest Pair Problems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1995, v:2, n:1, pp:3-27 [Journal]
  105. Danny Krizanc, Pat Morin, Michiel H. M. Smid
    Range Mode and Range Median Queries on Lists and Trees. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2005, v:12, n:1, pp:1-17 [Journal]
  106. Giri Narasimhan, Michiel H. M. Smid
    Approximation Algorithms for the Bottleneck Stretch Factor Problem. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2002, v:9, n:1, pp:13-31 [Journal]
  107. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Randomized Data Structures for the Dynamic Closest-Pair Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1036-1072 [Journal]
  108. Sanjiv Kapoor, Michiel H. M. Smid
    New Techniques for Exact and Approximate Dynamic Closest-Point Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:4, pp:775-796 [Journal]
  109. Giri Narasimhan, Michiel H. M. Smid
    Approximating the Stretch Factor of Euclidean Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:978-989 [Journal]
  110. Michiel H. M. Smid
    Duadic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:432-0 [Journal]
  111. Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer
    Linear-Space Algorithms for Distance Preserving Embedding. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:185-188 [Conf]
  112. Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer
    Rotationally Monotone Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  113. Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
    On a Family of Strong Geometric Spanners That Admit Local Routing Strategies. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:300-311 [Conf]
  114. Prosenjit Bose, Aaron Lee, Michiel H. M. Smid
    On Generalized Diamond Spanners. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:325-336 [Conf]
  115. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold
    Space-efficient geometric divide-and-conquer algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:3, pp:209-227 [Journal]
  116. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
    Sparse geometric graphs with small dilation [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  117. Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
    On a family of strong geometric spanners that admit local routing strategies [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  118. The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension. [Citation Graph (, )][DBLP]


  119. Geometric spanners with few edges and degree five. [Citation Graph (, )][DBLP]


  120. Data Structures for Range-Aggregate Extent Queries. [Citation Graph (, )][DBLP]


  121. Approximating range-aggregate queries using coresets. [Citation Graph (, )][DBLP]


  122. 06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. [Citation Graph (, )][DBLP]


  123. Geometric Spanners for Weighted Point Sets. [Citation Graph (, )][DBLP]


  124. Dilation-Optimal Edge Deletion in Polygonal Cycles. [Citation Graph (, )][DBLP]


  125. On the Stretch Factor of Convex Delaunay Graphs. [Citation Graph (, )][DBLP]


  126. Communication-Efficient Construction of the Plane Localized Delaunay Graph. [Citation Graph (, )][DBLP]


  127. Spanners of Complete k -Partite Geometric Graphs. [Citation Graph (, )][DBLP]


  128. Indicator Random Variables in Traffic Analysis and the Birthday Problem. [Citation Graph (, )][DBLP]


  129. Computing the Greedy Spanner in Near-Quadratic Time. [Citation Graph (, )][DBLP]


  130. Improved Methods For Generating Quasi-gray Codes. [Citation Graph (, )][DBLP]


  131. On the Power of the Semi-Separated Pair Decomposition. [Citation Graph (, )][DBLP]


  132. Geometric Spanners with Small Chromatic Number. [Citation Graph (, )][DBLP]


  133. Clamshell Casting. [Citation Graph (, )][DBLP]


  134. Sparse geometric graphs with small dilation. [Citation Graph (, )][DBLP]


  135. I/O-efficient algorithms for computing planar geometric spanners. [Citation Graph (, )][DBLP]


  136. A linear-space algorithm for distance preserving graph embedding. [Citation Graph (, )][DBLP]


  137. Geometric spanners with small chromatic number. [Citation Graph (, )][DBLP]


  138. Rotationally monotone polygons. [Citation Graph (, )][DBLP]


  139. On the dilation spectrum of paths, cycles, and trees. [Citation Graph (, )][DBLP]


  140. Geometric Spanners With Small Chromatic Number [Citation Graph (, )][DBLP]


  141. Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams [Citation Graph (, )][DBLP]


  142. Spanners of Complete $k$-Partite Geometric Graphs [Citation Graph (, )][DBLP]


  143. On the Stretch Factor of Convex Delaunay Graphs [Citation Graph (, )][DBLP]


  144. Communication-Efficient Construction of the Plane Localized Delaunay Graph [Citation Graph (, )][DBLP]


  145. An Omega(n log n) lower bound for computing the sum of even-ranked elements [Citation Graph (, )][DBLP]


  146. Algorithms for Marketing-Mix Optimization [Citation Graph (, )][DBLP]


  147. Pi/2-Angle Yao Graphs are Spanners [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.018secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002