Michiel H. M. Smid

Publication Activity (10 Years)

Years Active: 1987-2021
Publications (10 Years): 70

Top Venues

CoRR

Comput. Geom.

CCCG

J. Comput. Geom.

University Amsterdam (PHD)

Education History

University Amsterdam

PHD

Publications

Michiel H. M. Smid
An improved construction for spanners of disks. Comput. Geom. 92 (2021)
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
Optimal Art Gallery Localization is NP-hard. Comput. Geom. 88 (2020)
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. Comput. Geom. 89 (2020)
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
Plane and planarity thresholds for random geometric graphs. Discret. Math. Algorithms Appl. 12 (1) (2020)
Joachim Gudmundsson, Michiel H. M. Smid
Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword. Comput. Geom. 88 (2020)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs. Inf. Process. Lett. 153 (2020)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster algorithms for some optimization problems on collinear points. J. Comput. Geom. 11 (1) (2020)
Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
Querying relational event graphs using colored range searching data structures. Discret. Appl. Math. 286 (2020)
Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid
Tight Bounds on The Clique Chromatic Number. CoRR (2020)
Anil Maheshwari, Wolfgang Mulzer, Michiel H. M. Smid
A Simple Randomized O(n log n)-Time Closest-Pair Algorithm in Doubling Metrics. CoRR (2020)
Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. WADS (2019)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Flip distance to some plane configurations. Comput. Geom. 81 (2019)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Flip Distance to some Plane Configurations. CoRR (2019)
Paz Carmi, Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
The Most Likely Object to be Seen Through a Window. Int. J. Comput. Geom. Appl. 29 (4) (2019)
Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid
The discrete Voronoi game in a simple polygon. Theor. Comput. Sci. 793 (2019)
Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
Maximum Plane Trees in Multipartite Geometric Graphs. Algorithmica 81 (4) (2019)
Sang Won Bae, Michiel H. M. Smid
Closest-pair queries in fat rectangles. Comput. Geom. 83 (2019)
Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid
On the Spanning and Routing Ratio of Theta-Four. SODA (2019)
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid
On the Minimum Consistent Subset Problem. WADS (2019)
Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. CoRR (2019)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. WADS (2019)
Ulrike Große, Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel H. M. Smid
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. Int. J. Found. Comput. Sci. 30 (2) (2019)
Gregory Bint, Anil Maheshwari, Michiel H. M. Smid, Subhas C. Nandy
Partial Enclosure Range Searching. Int. J. Comput. Geom. Appl. 29 (1) (2019)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. CoRR (2019)
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. Algorithmica 80 (11) (2018)
Sang Won Bae, Michiel H. M. Smid
Closest-Pair Queries in Fat Rectangles. CoRR (2018)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Flip Distance to some Plane Configurations. SWAT (2018)
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
Plane Bichromatic Trees of Low Degree. Discret. Comput. Geom. 59 (4) (2018)
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. SoCG (2018)
Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
Window Queries for Problems on Intersecting Objects and Maximal Points. CALDAM (2018)
Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
Spanning Trees in Multipartite Geometric Graphs. Algorithmica 80 (11) (2018)
Prosenjit Bose, Darryl Hill, Michiel H. M. Smid
Improved Spanning Ratio for Low Degree Plane Spanners. Algorithmica 80 (3) (2018)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster Algorithms for some Optimization Problems on Collinear Points. CoRR (2018)
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
Plane and Planarity Thresholds for Random Geometric Graphs. CoRR (2018)
Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid
On the Spanning and Routing Ratio of Theta-Four. CoRR (2018)
Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid
Geometric Path Problems with Violations. Algorithmica 80 (2) (2018)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster Algorithms for some Optimization Problems on Collinear Points. SoCG (2018)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Strong matching of points with geometric shapes. Comput. Geom. 68 (2018)
Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid
On the Minimum Consistent Subset Problem. CoRR (2018)
Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel H. M. Smid
Improved Routing on the Delaunay Triangulation. ESA (2018)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Compatible 4-Holes in Point Sets. CCCG (2018)
Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
Querying Relational Event Graphs Using Colored Range Searching Data Structures. CALDAM (2017)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Compatible 4-Holes in Point Sets. CoRR (2017)
Ahmad Biniaz, Paul Liu, Anil Maheshwari, Michiel H. M. Smid
Approximation algorithms for the unit disk cover problem in 2D and 3D. Comput. Geom. 60 (2017)
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
Art Gallery Localization. CoRR (2017)
Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
Maximum Plane Trees in Multipartite Geometric Graphs. WADS (2017)
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
Essential Constraints of Edge-Constrained Proximity Graphs. J. Graph Algorithms Appl. 21 (4) (2017)
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
Optimal Art Gallery Localization is NP-hard. CoRR (2017)
Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
An optimal algorithm for plane matchings in multipartite geometric graphs. Comput. Geom. 63 (2017)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
Towards plane spanners of degree 3. J. Comput. Geom. 8 (1) (2017)
Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. J. Graph Algorithms Appl. 21 (4) (2017)
Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid
Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. WADS (2017)
Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid
Minimizing the Continuous Diameter when Augmenting a Tree with a Shortcut. CoRR (2016)
Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
Spanning Trees in Multipartite Geometric Graphs. CoRR (2016)
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. SWAT (2016)
Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. CCCG (2016)
Christian Knauer, Michiel H. M. Smid
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 26 (3-4) (2016)
Prosenjit Bose, Darryl Hill, Michiel H. M. Smid
Improved Spanning Ratio for Low Degree Plane Spanners. LATIN (2016)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
Towards Plane Spanners of Degree 3. CoRR (2016)
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
Probing convex polygons with a wedge. Comput. Geom. 58 (2016)
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. Comput. Geom. 57 (2016)
Mahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
A Plane 1.88-Spanner for Points in Convex Position. SWAT (2016)
Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. J. Comput. Geom. 7 (1) (2016)
Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. CoRR (2016)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
Towards Plane Spanners of Degree 3. ISAAC (2016)
Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel H. M. Smid, Prosenjit Bose, Jean-Lou De Carufel
A plane 1.88-spanner for points in convex position. J. Comput. Geom. 7 (1) (2016)
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
Plane Bichromatic Trees of Low Degree. IWOCA (2016)
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
Discrete Voronoi games and ϵ-nets, in two and three dimensions. Comput. Geom. 55 (2016)
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
Essential Constraints of Edge-Constrained Proximity Graphs. CoRR (2016)
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
Essential Constraints of Edge-Constrained Proximity Graphs. IWOCA (2016)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
On full Steiner trees in unit disk graphs. Comput. Geom. 48 (6) (2015)
Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. WADS (2015)
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. J. Graph Algorithms Appl. 19 (1) (2015)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
On the hardness of full Steiner tree problems. J. Discrete Algorithms 34 (2015)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties. Comput. Geom. 48 (9) (2015)
A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi, Anil Maheshwari, Michiel H. M. Smid
Approximating the bottleneck plane perfect matching of a point set. Comput. Geom. 48 (9) (2015)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CALDAM (2015)
Joachim Gudmundsson, Michiel H. M. Smid
Fast algorithms for approximate Fréchet matching queries in geometric trees. Comput. Geom. 48 (6) (2015)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Matchings in higher-order Gabriel graphs. Theor. Comput. Sci. 596 (2015)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Strong Matching of Points with Geometric Shapes. CoRR (2015)
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon. TTCS (2015)
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
Discrete Voronoi Games and ε-Nets, in Two and Three Dimensions. CoRR (2015)
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
Packing Plane Perfect Matchings into a Point Set. CoRR (2015)
Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, Michiel H. M. Smid
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere. CoRR (2015)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid, Paul Liu
A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. CCCG (2015)
Vida Dujmovic, Pat Morin, Michiel H. M. Smid
Average Stretch Factor: How Low Does It Go? Discret. Comput. Geom. 53 (2) (2015)
Prosenjit Bose, Darryl Hill, Michiel H. M. Smid
Improved Spanning Ratio for Low Degree Plane Spanners. CoRR (2015)
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
Plane Bichromatic Trees of Low Degree. CoRR (2015)
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
Probing Convex Polygons with a Wedge. CoRR (2015)
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. CoRR (2015)
Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn
Fast Algorithms for Diameter-Optimally Augmenting Paths. ICALP (1) (2015)
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
Packing Plane Perfect Matchings into a Point Set. Discret. Math. Theor. Comput. Sci. 17 (2) (2015)
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
Plane and Planarity Thresholds for Random Geometric Graphs. ALGOSENSORS (2015)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem. Comput. Geom. 47 (3) (2014)
Prosenjit Gupta, Ravi Janardan, Yokesh Kumar, Michiel H. M. Smid
Data structures for range-aggregate extent queries. Comput. Geom. 47 (2) (2014)
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
Voronoi Games and Epsilon Nets. CCCG (2014)
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid
A note on the unsolvability of the weighted region shortest path problem. Comput. Geom. 47 (7) (2014)
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CoRR (2014)
Prosenjit Bose, Simon Pratt, Michiel H. M. Smid
The Convex Hull of Points on a Sphere is a Spanner. CCCG (2014)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Approximating Full Steiner Tree in a Unit Disk Graph. CCCG (2014)

Michiel H. M. Smid.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michiel H. M. Smid