- Home
- Best Scientists - Computer Science
- Michiel Smid

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
31
Citations
4,514
261
World Ranking
9819
National Ranking
405

- Algorithm
- Combinatorics
- Geometry

Michiel Smid mainly focuses on Combinatorics, Computational geometry, Spanner, Discrete mathematics and Path. Combinatorics and Euclidean distance are frequently intertwined in his study. His Computational geometry study integrates concerns from other disciplines, such as Object, Integer and Closest pair of points problem.

His Spanner research is multidisciplinary, incorporating elements of Theta graph, Algorithmics, Symbolic computation and Degree. His work deals with themes such as Geometric networks and Convex position, which intersect with Discrete mathematics. His studies in Path integrate themes in fields like Preprocessor, Artificial intelligence, Pattern recognition, Range and Sequence.

- Geometric Spanner Networks (397 citations)
- Euclidean spanners: short, thin, and lanky (191 citations)
- Closest-Point Problems in Computational Geometry (137 citations)

His primary areas of study are Combinatorics, Discrete mathematics, Time complexity, Algorithm and Computational geometry. His Combinatorics research is multidisciplinary, incorporating perspectives in Point, Plane and Regular polygon. His Discrete mathematics study combines topics from a wide range of disciplines, such as Spanner, Spatial network, Shortest path problem and Euclidean distance.

Bounded function is closely connected to Degree in his research, which is encompassed under the umbrella topic of Spanner. As part of the same scientific family, Michiel Smid usually focuses on Time complexity, concentrating on Constant and intersecting with Integer. Michiel Smid combines subjects such as Geometric spanner, Algorithmics, Line segment and Real number with his study of Computational geometry.

- Combinatorics (70.43%)
- Discrete mathematics (32.26%)
- Time complexity (16.94%)

- Combinatorics (70.43%)
- Plane (14.52%)
- Discrete mathematics (32.26%)

Michiel Smid mostly deals with Combinatorics, Plane, Discrete mathematics, Point and Regular polygon. Michiel Smid combines topics linked to Upper and lower bounds with his work on Combinatorics. He has researched Plane in several fields, including Gabriel graph, Convex hull and Planar graph.

His Discrete mathematics research incorporates elements of Matching and Approximation algorithm. His studies deal with areas such as Range, Time complexity, Algorithm and Simple polygon as well as Point. His work on Computational geometry as part of general Algorithm study is frequently connected to Colored, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.

- Approximation algorithms for the unit disk cover problem in 2D and 3D (23 citations)
- Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts (23 citations)
- Fast Algorithms for Diameter-Optimally Augmenting Paths ⋆ (18 citations)

- Algorithm
- Combinatorics
- Geometry

Michiel Smid spends much of his time researching Combinatorics, Discrete mathematics, Plane, Regular polygon and Point. His Combinatorics study typically links adjacent topics like Voronoi diagram. His Discrete mathematics research includes themes of Matching, Algorithm, Approximation algorithm and Upper and lower bounds.

Michiel Smid combines subjects such as Spanner and Convex hull with his study of Plane. The various areas that Michiel Smid examines in his Regular polygon study include Wedge, Delaunay triangulation, Equilateral triangle and Topology. His research integrates issues of Intersection, Line segment and Tree in his study of Point.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Geometric Spanner Networks

Giri Narasimhan;Michiel Smid.

**(2007)**

517 Citations

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane

Srinivasa Rao Arikati;Danny Z. Chen;L. Paul Chew;Gautam Das.

european symposium on algorithms **(1996)**

262 Citations

Euclidean spanners: short, thin, and lanky

Sunil Arya;Gautam Das;David M. Mount;Jeffrey S. Salowe.

symposium on the theory of computing **(1995)**

253 Citations

Closest-Point Problems in Computational Geometry

Michiel H. M. Smid.

Handbook of Computational Geometry **(1995)**

212 Citations

On the false-positive rate of Bloom filters

Prosenjit Bose;Hua Guo;Evangelos Kranakis;Anil Maheshwari.

Information Processing Letters **(2008)**

207 Citations

Constructing plane spanners of bounded degree and low weight

Prosenjit Bose;Joachim Gudmundsson;Michiel H. M. Smid.

Algorithmica **(2005)**

123 Citations

Static and dynamic algorithms for k -point clustering problems

Amitava Datta;Hans-Peter Lenhof;Christian Schwarz;Michiel Smid.

Journal of Algorithms **(1995)**

111 Citations

On some geometric optimization problems in layered manufacturing

Jayanth Majhi;Ravi Janardan;Michiel Smid;Prosenjit Gupta.

Computational Geometry: Theory and Applications **(1999)**

110 Citations

Randomized and deterministic algorithms for geometric spanners of small diameter

S. Arya;D.M. Mount;M. Smid.

foundations of computer science **(1994)**

109 Citations

Further results on generalized intersection searching problems: counting, reporting, and dynamization

Prosenjit Gupta;Ravi Janardan;Michiel Smid.

Journal of Algorithms **(1995)**

104 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Carleton University

University of Sydney

The University of Texas at Arlington

University of Notre Dame

New York University

Utrecht University

University of Bonn

Eindhoven University of Technology

University of Leicester

University of Maryland, College Park

Something went wrong. Please try again later.