Michiel H. M. Smid
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
64
Venues
17
Active years
1988–2019
Best venue rank
A*
Where they publish
Papers
64 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2019 | SODA | On the Spanning and Routing Ratio of Theta-Four. | Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid |
| 2019 | WADS | On the Minimum Consistent Subset Problem. | Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid |
| 2019 | WADS | Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. | Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid |
| 2019 | WADS | Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. | Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid |
| 2018 | ESA | Improved Routing on the Delaunay Triangulation. | Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despr, Darryl Hill, Michiel H. M. Smid |
| 2017 | WADS | Maximum Plane Trees in Multipartite Geometric Graphs. | Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid |
| 2017 | WADS | Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. | Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid |
| 2016 | ISAAC | Towards Plane Spanners of Degree 3. | Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid |
| 2016 | IWOCA | Plane Bichromatic Trees of Low Degree. | Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid |
| 2016 | IWOCA | Essential Constraints of Edge-Constrained Proximity Graphs. | Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid |
| 2016 | LATIN | Improved Spanning Ratio for Low Degree Plane Spanners. | Prosenjit Bose, Darryl Hill, Michiel H. M. Smid |
| 2015 | Algosensors | Plane and Planarity Thresholds for Random Geometric Graphs. | Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid |
| 2015 | ICALP | Fast Algorithms for Diameter-Optimally Augmenting Paths. | Ulrike Groe, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn |
| 2015 | WADS | An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. | Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid |
| 2014 | AAIM | A Facility Coloring Problem in 1-D. | Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid |
| 2013 | COCOON | The Discrete Voronoi Game in a Simple Polygon. | Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid |
| 2013 | ESA | Frchet Queries in Geometric Trees. | Joachim Gudmundsson, Michiel H. M. Smid |
| 2013 | WALCOM | Fixed-Orientation Equilateral Triangle Matching of Point Sets. | Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid |
| 2012 | LATIN | Two-Dimensional Range Diameter Queries. | Pooya Davoodi, Michiel H. M. Smid, Freek van Walderveen |
| 2010 | ISAAC | Untitled record | Prosenjit Bose, Mirela Damian, Karim Doueb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer |
| 2010 | ISAAC | An Optimal Algorithm for Computing Angle-Constrained Spanners. | Paz Carmi, Michiel H. M. Smid |
| 2010 | ISAAC | Approximating the Average Stretch Factor of Geometric Graphs. | Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid |
| 2010 | LATIN | Communication-Efficient Construction of the Plane Localized Delaunay Graph. | Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu |
| 2009 | ESA | Geometric Spanners for Weighted Point Sets. | Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid |
| 2009 | WADS | On the Power of the Semi-Separated Pair Decomposition. | Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid |
| 2008 | ISAAC | On the Stretch Factor of Convex Delaunay Graphs. | Prosenjit Bose, Paz Carmi, Sbastien Collette, Michiel H. M. Smid |
| 2008 | LATIN | Spanners of Complete k -Partite Geometric Graphs. | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid |
| 2007 | ISAAC | Dilation-Optimal Edge Deletion in Polygonal Cycles. | Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang |
| 2007 | WADS | On a Family of Strong Geometric Spanners That Admit Local Routing Strategies. | Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu |
| 2007 | WADS | On Generalized Diamond Spanners. | Prosenjit Bose, Aaron Lee, Michiel H. M. Smid |
| 2007 | WAOA | Geometric Spanners with Small Chromatic Number. | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
| 2006 | ISAAC | Diamond Triangulations Contain Spanners of Bounded Degree. | Prosenjit Bose, Michiel H. M. Smid, Daming Xu |
| 2006 | LATIN | Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. | Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid |
| 2006 | LCN | Indicator Random Variables in Traffic Analysis and the Birthday Problem. | Phillip G. Bradford, Irina Perevalova, Michiel H. M. Smid, Charles B. Ward |
| 2005 | COCOON | Efficient Non-intersection Queries on Aggregated Geometric Data. | Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid |
| 2005 | ISAAC | Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles. | Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid |
| 2005 | STACS | Fast Pruning of Geometric Spanners. | Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid |
| 2003 | ISAAC | Range Mode and Range Median Queries on Lists and Trees. | Danny Krizanc, Pat Morin, Michiel H. M. Smid |
| 2003 | ISAAC | A Dynamic Dictionary for Priced Information with Application. | Anil Maheshwari, Michiel H. M. Smid |
| 2003 | STACS | Approximating Geometric Bottleneck Shortest Paths. | Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh |
| 2002 | COCOON | Terrain Polygon Decomposition, with Application to Layered Manufacturing. | Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid |
| 2002 | ESA | Translating a Planar Object to Maximize Point Containment. | Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl |
| 2002 | ESA | Constructing Plane Spanners of Bounded Degree and Low Weight. | Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid |
| 2002 | ESA | Geometric Algorithms for Density-Based Data Clustering. | Danny Z. Chen, Michiel H. M. Smid, Bin Xu |
| 2002 | ISAAC | Approximate Distance Oracles Revisited. | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
| 2002 | SODA | Approximate distance oracles for geometric graphs. | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
| 2001 | ICCS | Computing Optimal Hatching Directions in Layered Manufacturing. | Man Chung Hon, Ravi Janardan, Jrg Schwerdt, Michiel H. M. Smid |
| 2001 | STACS | Approximation Algorithms for the Bottleneck Stretch Factor Problem. | Giri Narasimhan, Michiel H. M. Smid |
| 2001 | WADS | A Decomposition-Based Approach to Layered Manufacturing. | Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jrg Schwerdt, Michiel H. M. Smid, Ram D. Sriram |
| 2001 | WADS | I/O-Efficient Shortest Path Queries in Geometric Spanners. | Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
| 1998 | STOC | Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. | Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
| 1997 | WADS | On Some Geometric Optimization Problems in Layered Manufacturing. | Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta |
| 1996 | ESA | Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. | Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis |
| 1995 | STOC | Euclidean spanners: short, thin, and lanky. | Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid |
| 1994 | ESA | Efficient Construction of a Bounded Degree Spanner with Low Weight. | Sunil Arya, Michiel H. M. Smid |
| 1994 | ESA | Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. | Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid |
| 1994 | FOCS | Randomized and deterministic algorithms for geometric spanners of small diameter | Sunil Arya, David M. Mount, Michiel H. M. Smid |
| 1993 | SODA | Randomized Data Structures for the Dynamic Closest-Pair Problem. | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid |
| 1993 | WADS | Static and Dynamic Algorithms for k-Point Clustering Problems. | Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid |
| 1993 | WADS | Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. | Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid |
| 1992 | FOCS | Enumerating the k Closest Pairs Optimally | Hans-Peter Lenhof, Michiel H. M. Smid |
| 1992 | SODA | An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem. | Christian Schwarz, Michiel H. M. Smid |
| 1991 | SODA | Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. | Michiel H. M. Smid |
| 1988 | STACS | Maintaining Range Trees in Secondary Memory (Extended Abstract). | Mark H. Overmars, Michiel H. M. Smid |