Michiel Smid

发表

Computing the Width of a Three-Dimensional Point Set: Documentation

Jörg Schwerdt, Michiel Smid, 1999 .

Geometric and algorithmic aspects of computer-aided design and manufacturing : DIMACS Workshop Computer Aided Design and Manufacturing, October 7-9, 2003, Piscataway, New Jersey

Ravi Janardan, Michiel Smid, D. Dutta, 2005 .

On the Stretch Factor of Convex Delaunay Graphs

Prosenjit Bose, Paz Carmi, Sébastien Collette, 2010, J. Comput. Geom..

Querying relational event graphs using colored range searching data structures

Anil Maheshwari, Michiel Smid, Farah Chanchary, 2020, Discret. Appl. Math..

An optimal algorithm for plane matchings in multipartite geometric graphs

Anil Maheshwari, Subhas C. Nandy, Ahmad Biniaz, 2017, Comput. Geom..

Algorithms and Graphs

Giri Narasimhan, Michiel Smid, M. Smid, 2007 .

Closest-Point Problems in Computational Geometry

Michiel Smid, M. Smid, 2000, Handbook of Computational Geometry.

The Path-Greedy Algorithm

Giri Narasimhan, Michiel Smid, 2007 .

Algorithms for some intersection searching problems involving curved objects

Prosenjit Gupta, Ravi Janardan, Michiel Smid, 1993 .

Dynamic data structures on multiple storage media, a tutorial

Peter van Emde Boas, Michiel Smid, 1990 .

Constructing Plane Spanners of Bounded Degree and Low Weight

Joachim Gudmundsson, Prosenjit Bose, Michiel Smid, 2002, ESA.

An optimal algorithm for computing angle-constrained spanners

Paz Carmi, Michiel Smid, 2012, J. Comput. Geom..

The reconstruction problem for dynamic data structures, an overview

Michiel Smid, 1990 .

A parallel functional implementation of range queries

Pieter H. Hartel, Michiel Smid, Leen Torenvliet, 1989 .

Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties

Anil Maheshwari, Ahmad Biniaz, Michiel Smid, 2015, Comput. Geom..

Towards plane spanners of degree 3

Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, 2017, J. Comput. Geom..

A plane 1.88-spanner for points in convex position

Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, 2016, J. Comput. Geom..

Geometric spanner networks

Giri Narasimhan, Michiel Smid, M. Smid, 2007 .

Designing Approximation Algorithms with Spanners

Giri Narasimhan, Michiel Smid, 2007 .

Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, October 7-9, 2003

Debasish Dutta, Ravi Janardan, Michiel Smid, 2005, Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing.

Computational Geometry: Generalized (or Colored) Intersection Searching

Prosenjit Gupta, Saladi Rahul, Ravi Janardan, 2018 .

Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006

Alexander Wolff, Joachim Gudmundsson, Giri Narasimhan, 2007, Geometric Networks and Metric Space Embeddings.

Further Dynamic Computational Geometry

Mordecai J. Golin, Michiel Smid, 1992 .

Lecture notes selected topics in data structures

Michiel Smid, 1994 .

Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane

Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid, 2021, ISAAC.

Window queries for intersecting objects, maximal points and approximations using coresets

Anil Maheshwari, Michiel Smid, Farah Chanchary, 2021, Discret. Appl. Math..

The Minimum Moving Spanning Tree Problem

Hugo A. Akitaya, Prosenjit Bose, Jean-Lou De Carufel, 2021, WADS.

Shortest Beer Path Queries in Outerplanar Graphs pdf

Saeed Mehrabi, Michiel Smid, Joyce Bacic, 2021, ArXiv.

Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs

Pat Morin, Paz Carmi, Anil Maheshwari, 2021, Discret. Comput. Geom..

Approximating bottleneck spanning trees on partitioned tuples of points pdf

Anil Maheshwari, Ahmad Biniaz, Michiel Smid, 2021, Comput. Geom. Topol..

Tight Bounds on The Clique Chromatic Number pdf

Piotr Micek, Michiel Smid, Bruce Reed, 2020, Electron. J. Comb..

Euclidean Maximum Matchings in the Plane - Local to Global

Anil Maheshwari, Ahmad Biniaz, Michiel Smid, 2021, WADS.

On the Minimum Consistent Subset Problem

Jean-Lou De Carufel, Paz Carmi, Saeed Mehrabi, 2021, Algorithmica.

Geometric Divide-and-Conquer Algorithms

Prosenjit Bose, Pat Morin, Jan Vahrenhold, 2004 .

Surface topography quantification by integral and feature-related parameters

Michiel Smid, Rahul Ray, Ulrich Wendt, 2002 .

On some combinatorial problems in metric spaces of bounded doubling dimension

Michiel Smid, 2010 .

Finding k points with a smallest enclosing square

Michiel Smid, M. Smid, 1993 .

Spanning trees with O(1) average stretch factor

Michiel Smid, M. Smid, 2009 .

Algorithms for Some Intersection Searching Problems InvolvingCircular Objects

Michiel Smid, Ravi, Prosenjit, 1998 .

Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts

Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid, 2016 .

A polylog-time and $O(n\sqrt\lg n)$-work parallel algorithm for finding the row minima in totally monotone matrices

Rudolf Fleischer, Phillip G. Bradford, Michiel Smid, 1995 .

Notes on Binary Dumbbell Trees

Michiel Smid, 2012 .

Range trees with slack parameter

Michiel Smid, 1991 .

Discrete Voronoi Games and $\epsilon$-Nets, in Two and Three Dimensions

Jean-Lou De Carufel, Anil Maheshwari, Aritra Banik, 2015 .

Unsolvability of the Weighted Region Shortest Path Problem I

Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid, 2012 .