Michiel H. M. Smid

320 papers A* 12A 13B 31C 5Misc 4Journal 180Unranked 59

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	An improved construction for spanners of disks. Comput. Geom. Michiel H. M. Smid
2020	J	`jnl`	A Simple Randomized O(n log n)-Time Closest-Pair Algorithm in Doubling Metrics. CoRR Anil Maheshwari, Wolfgang Mulzer, Michiel H. M. Smid
2020	J	`jnl`	Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs. Inf. Process. Lett. Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2020	J	`jnl`	Faster algorithms for some optimization problems on collinear points. J. Comput. Geom. Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
2020	J	`jnl`	Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. Comput. Geom. Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid
2020	J	`jnl`	Optimal Art Gallery Localization is NP-hard. Comput. Geom. Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
2020	J	`jnl`	Plane and planarity thresholds for random geometric graphs. Discret. Math. Algorithms Appl. Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
2020	J	`jnl`	Querying relational event graphs using colored range searching data structures. Discret. Appl. Math. Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
2020	J	`jnl`	Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword. Comput. Geom. Joachim Gudmundsson, Michiel H. M. Smid
2020	J	`jnl`	Tight Bounds on The Clique Chromatic Number. CoRR Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid
2019	J	`jnl`	Closest-pair queries in fat rectangles. Comput. Geom. Sang Won Bae, Michiel H. M. Smid
2019	B	`conf`	Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. WADS Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
2019	J	`jnl`	Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. CoRR Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
2019	J	`jnl`	Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. Int. J. Found. Comput. Sci. Ulrike Große, Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel H. M. Smid
2019	J	`jnl`	Flip Distance to some Plane Configurations. CoRR Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2019	J	`jnl`	Flip distance to some plane configurations. Comput. Geom. Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2019	J	`jnl`	Maximum Plane Trees in Multipartite Geometric Graphs. Algorithmica Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
2019	B	`conf`	On the Minimum Consistent Subset Problem. WADS Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid
2019	A*	`conf`	On the Spanning and Routing Ratio of Theta-Four. SODA Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid
2019	B	`conf`	Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. WADS Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid
2019	J	`jnl`	Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. CoRR Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid
2019	J	`jnl`	Partial Enclosure Range Searching. Int. J. Comput. Geom. Appl. Gregory Bint, Anil Maheshwari, Michiel H. M. Smid, Subhas C. Nandy
2019	J	`jnl`	The Most Likely Object to be Seen Through a Window. Int. J. Comput. Geom. Appl. Paz Carmi, Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
2019	J	`jnl`	The discrete Voronoi game in a simple polygon. Theor. Comput. Sci. Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid
2018	A*	`conf`	Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. SoCG A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky
2018	J	`jnl`	Closest-Pair Queries in Fat Rectangles. CoRR Sang Won Bae, Michiel H. M. Smid
2018	—	`conf`	Compatible 4-Holes in Point Sets. CCCG Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2018	J	`jnl`	Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
2018	A*	`conf`	Faster Algorithms for some Optimization Problems on Collinear Points. SoCG Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
2018	J	`jnl`	Faster Algorithms for some Optimization Problems on Collinear Points. CoRR Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
2018	—	`conf`	Flip Distance to some Plane Configurations. SWAT Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2018	J	`jnl`	Geometric Path Problems with Violations. Algorithmica Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid
2018	A	`conf`	Improved Routing on the Delaunay Triangulation. ESA Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel H. M. Smid
2018	J	`jnl`	Improved Spanning Ratio for Low Degree Plane Spanners. Algorithmica Prosenjit Bose, Darryl Hill, Michiel H. M. Smid
2018	J	`jnl`	On the Minimum Consistent Subset Problem. CoRR Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid
2018	J	`jnl`	On the Spanning and Routing Ratio of Theta-Four. CoRR Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid
2018	J	`jnl`	Plane Bichromatic Trees of Low Degree. Discret. Comput. Geom. Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2018	J	`jnl`	Plane and Planarity Thresholds for Random Geometric Graphs. CoRR Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
2018	J	`jnl`	Spanning Trees in Multipartite Geometric Graphs. Algorithmica Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2018	J	`jnl`	Strong matching of points with geometric shapes. Comput. Geom. Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2018	—	`ch.`	The Well-Separated Pair Decomposition and Its Applications. Handbook of Approximation Algorithms and Metaheuristics (2) Michiel H. M. Smid
2018	—	`conf`	Window Queries for Problems on Intersecting Objects and Maximal Points. CALDAM Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
2017	J	`jnl`	An optimal algorithm for plane matchings in multipartite geometric graphs. Comput. Geom. Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2017	J	`jnl`	Approximation algorithms for the unit disk cover problem in 2D and 3D. Comput. Geom. Ahmad Biniaz, Paul Liu, Anil Maheshwari, Michiel H. M. Smid
2017	J	`jnl`	Art Gallery Localization. CoRR Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
2017	J	`jnl`	Compatible 4-Holes in Point Sets. CoRR Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2017	J	`jnl`	Essential Constraints of Edge-Constrained Proximity Graphs. J. Graph Algorithms Appl. Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
2017	J	`jnl`	Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. J. Graph Algorithms Appl. Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid
2017	B	`conf`	Maximum Plane Trees in Multipartite Geometric Graphs. WADS Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
2017	B	`conf`	Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. WADS Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid
2017	J	`jnl`	Optimal Art Gallery Localization is NP-hard. CoRR Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
2017	—	`ed.`	Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada CCCG Joachim Gudmundsson, Michiel H. M. Smid
2017	—	`conf`	Querying Relational Event Graphs Using Colored Range Searching Data Structures. CALDAM Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
2017	J	`jnl`	Towards plane spanners of degree 3. J. Comput. Geom. Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
2016	—	`conf`	A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. CCCG Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid
2016	—	`conf`	A Plane 1.88-Spanner for Points in Convex Position. SWAT Mahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
2016	J	`jnl`	A plane 1.88-spanner for points in convex position. J. Comput. Geom. Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel H. M. Smid, Prosenjit Bose, Jean-Lou De Carufel
2016	—	`ch.`	Applications of Geometric Spanner Networks. Encyclopedia of Algorithms Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
2016	J	`jnl`	Discrete Voronoi games and ϵ-nets, in two and three dimensions. Comput. Geom. Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
2016	C	`conf`	Essential Constraints of Edge-Constrained Proximity Graphs. IWOCA Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
2016	J	`jnl`	Essential Constraints of Edge-Constrained Proximity Graphs. CoRR Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
2016	J	`jnl`	Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. CoRR Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn
2016	—	`ch.`	Geometric Spanners. Encyclopedia of Algorithms Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
2016	J	`jnl`	Guest Editors' Foreword. Int. J. Comput. Geom. Appl. Christian Knauer, Michiel H. M. Smid
2016	B	`conf`	Improved Spanning Ratio for Low Degree Plane Spanners. LATIN Prosenjit Bose, Darryl Hill, Michiel H. M. Smid
2016	—	`conf`	Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. SWAT Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2016	J	`jnl`	Minimizing the Continuous Diameter when Augmenting a Tree with a Shortcut. CoRR Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid
2016	J	`jnl`	On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. J. Comput. Geom. Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu
2016	—	`ch.`	Planar Geometric Spanners. Encyclopedia of Algorithms Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
2016	C	`conf`	Plane Bichromatic Trees of Low Degree. IWOCA Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2016	J	`jnl`	Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. Comput. Geom. Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2016	J	`jnl`	Probing convex polygons with a wedge. Comput. Geom. Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
2016	J	`jnl`	Spanning Trees in Multipartite Geometric Graphs. CoRR Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2016	B	`conf`	Towards Plane Spanners of Degree 3. ISAAC Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
2016	J	`jnl`	Towards Plane Spanners of Degree 3. CoRR Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
2015	—	`conf`	A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. CCCG Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid, Paul Liu
2015	B	`conf`	An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. WADS Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2015	J	`jnl`	Approximating the bottleneck plane perfect matching of a point set. Comput. Geom. A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi, Anil Maheshwari, Michiel H. M. Smid
2015	J	`jnl`	Average Stretch Factor: How Low Does It Go? Discret. Comput. Geom. Vida Dujmovic, Pat Morin, Michiel H. M. Smid
2015	J	`jnl`	Discrete Voronoi Games and ε-Nets, in Two and Three Dimensions. CoRR Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
2015	—	`conf`	Fast Algorithms for Diameter-Optimally Augmenting Paths. ICALP (1) Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn
2015	J	`jnl`	Fast algorithms for approximate Fréchet matching queries in geometric trees. Comput. Geom. Joachim Gudmundsson, Michiel H. M. Smid
2015	—	`conf`	Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CALDAM Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2015	J	`jnl`	Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties. Comput. Geom. Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2015	J	`jnl`	Improved Spanning Ratio for Low Degree Plane Spanners. CoRR Prosenjit Bose, Darryl Hill, Michiel H. M. Smid
2015	J	`jnl`	Matchings in higher-order Gabriel graphs. Theor. Comput. Sci. Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2015	J	`jnl`	Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. CoRR Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2015	J	`jnl`	On full Steiner trees in unit disk graphs. Comput. Geom. Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2015	J	`jnl`	On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere. CoRR Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, Michiel H. M. Smid
2015	J	`jnl`	On the hardness of full Steiner tree problems. J. Discrete Algorithms Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2015	J	`jnl`	Optimal Data Structures for Farthest-Point Queries in Cactus Networks. J. Graph Algorithms Appl. Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2015	J	`jnl`	Packing Plane Perfect Matchings into a Point Set. CoRR Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2015	J	`jnl`	Packing Plane Perfect Matchings into a Point Set. Discret. Math. Theor. Comput. Sci. Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2015	J	`jnl`	Plane Bichromatic Trees of Low Degree. CoRR Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2015	—	`conf`	Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon. TTCS Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2015	C	`conf`	Plane and Planarity Thresholds for Random Geometric Graphs. ALGOSENSORS Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
2015	J	`jnl`	Probing Convex Polygons with a Wedge. CoRR Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
2015	J	`jnl`	Strong Matching of Points with Geometric Shapes. CoRR Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014	C	`conf`	A Facility Coloring Problem in 1-D. AAIM Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid
2014	J	`jnl`	A note on the unsolvability of the weighted region shortest path problem. Comput. Geom. Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid
2014	J	`jnl`	An optimal algorithm for the Euclidean bottleneck full Steiner tree problem. Comput. Geom. Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014	—	`conf`	Approximating Full Steiner Tree in a Unit Disk Graph. CCCG Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014	—	`conf`	Bottleneck Bichromatic Plane Matching of Points. CCCG Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014	J	`jnl`	Data structures for range-aggregate extent queries. Comput. Geom. Prosenjit Gupta, Ravi Janardan, Yokesh Kumar, Michiel H. M. Smid
2014	J	`jnl`	Fixed-orientation equilateral triangle matching of point sets. Theor. Comput. Sci. Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014	J	`jnl`	Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CoRR Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014	J	`jnl`	Matching in Gabriel Graphs. CoRR Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014	J	`jnl`	Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CoRR Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2014	—	`conf`	The Convex Hull of Points on a Sphere is a Spanner. CCCG Prosenjit Bose, Simon Pratt, Michiel H. M. Smid
2014	—	`conf`	Voronoi Games and Epsilon Nets. CCCG Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
2013	J	`jnl`	A Note on the Unsolvability of the Weighted Region Shortest Path Problem CoRR Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid
2013	J	`jnl`	An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem CoRR Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2013	J	`jnl`	An in-place min-max priority search tree. Comput. Geom. Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2013	J	`jnl`	Approximating the Bottleneck Plane Perfect Matching of a Point Set. CoRR Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2013	J	`jnl`	Average Stretch Factor: How Low Does It Go? CoRR Vida Dujmovic, Pat Morin, Michiel H. M. Smid
2013	—	`conf`	Computing Covers of Plane Forests. CCCG Luis Barba, Alexis Beingessner, Prosenjit Bose, Michiel H. M. Smid
2013	J	`jnl`	Computing Covers of Plane Forests. CoRR Luis Barba, Alexis Beingessner, Prosenjit Bose, Michiel H. M. Smid
2013	J	`jnl`	Computing the Coverage of an Opaque Forest. CoRR Alexis Beingessner, Michiel H. M. Smid
2013	B	`conf`	Fixed-Orientation Equilateral Triangle Matching of Point Sets. WALCOM Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2013	A	`conf`	Fréchet Queries in Geometric Trees. ESA Joachim Gudmundsson, Michiel H. M. Smid
2013	J	`jnl`	Network Farthest-Point Diagrams CoRR Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid
2013	J	`jnl`	Network Farthest-Point Diagrams. J. Comput. Geom. Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid
2013	J	`jnl`	On plane geometric spanners: A survey and open problems. Comput. Geom. Prosenjit Bose, Michiel H. M. Smid
2013	J	`jnl`	On the power of the semi-separated pair decomposition. Comput. Geom. Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid
2013	—	`conf`	Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CCCG Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2013	—	`conf`	Range-Aggregate Queries for Geometric Extent Problems. CATS Peter Brass, Christian Knauer, Chan-Su Shin, Michiel H. M. Smid, Ivo Vigan
2013	J	`jnl`	Robust Geometric Spanners. SIAM J. Comput. Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid
2013	A*	`conf`	Robust geometric spanners. SoCG Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid
2013	Misc	`conf`	The Discrete Voronoi Game in a Simple Polygon. COCOON Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid
2012	J	`jnl`	An optimal algorithm for computing angle-constrained spanners. J. Comput. Geom. Paz Carmi, Michiel H. M. Smid
2012	J	`jnl`	Approximating the average stretch factor of geometric graphs. J. Comput. Geom. Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid
2012	—	`conf`	Computing the Coverage of an Opaque Forest. CCCG Alexis Beingessner, Michiel H. M. Smid
2012	J	`jnl`	Fixed-Orientation Equilateral Triangle Matching of Point Sets CoRR Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2012	—	`conf`	On Farthest-Point Information in Networks. CCCG Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2012	J	`jnl`	Robust Geometric Spanners CoRR Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid
2012	B	`conf`	Two-Dimensional Range Diameter Queries. LATIN Pooya Davoodi, Michiel H. M. Smid, Freek van Walderveen
2012	—	`conf`	xy-Monotone Path Existence Queries in a Rectilinear Environment. CCCG Gregory Bint, Anil Maheshwari, Michiel H. M. Smid
2012	J	`jnl`	π/2-Angle Yao Graphs are Spanners. Int. J. Comput. Geom. Appl. Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer
2011	J	`jnl`	Algorithms for Marketing-Mix Optimization. Algorithmica Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid
2011	—	`conf`	An In-Place Priority Search Tree. CCCG Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2011	—	`conf`	Approximation Algorithms for a Triangle Enclosure Problem. CCCG Karim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid
2011	J	`jnl`	Geometric Spanners for Weighted Point Sets. Algorithmica Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid
2011	J	`jnl`	Low-interference networks in metric spaces of bounded doubling dimension. Inf. Process. Lett. Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2011	J	`jnl`	On a family of strong geometric spanners that admit local routing strategies. Comput. Geom. Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
2010	—	`conf`	An Optimal Algorithm for Computing Angle-Constrained Spanners. ISAAC (1) Paz Carmi, Michiel H. M. Smid
2010	—	`conf`	Approximating range-aggregate queries using coresets. CCCG Yakov Nekrich, Michiel H. M. Smid
2010	—	`conf`	Approximating the Average Stretch Factor of Geometric Graphs. ISAAC (1) Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid
2010	B	`conf`	Communication-Efficient Construction of the Plane Localized Delaunay Graph. LATIN Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu
2010	J	`jnl`	Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid
2010	J	`jnl`	Dilation-Optimal Edge Deletion in Polygonal Cycles. Int. J. Comput. Geom. Appl. Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang
2010	J	`jnl`	Improved Methods For Generating Quasi-Gray Codes CoRR Dana Jansens, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2010	—	`conf`	Improved Methods For Generating Quasi-gray Codes. SWAT Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2010	J	`jnl`	On the Stretch Factor of Convex Delaunay Graphs. J. Comput. Geom. Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid
2010	J	`jnl`	Pi/2-Angle Yao Graphs are Spanners CoRR Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer
2010	J	`jnl`	Sigma-local graphs. J. Discrete Algorithms Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2009	—	`conf`	09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining. Geometric Networks, Metric Space Embeddings and Spatial Data Mining Gautam Das, Joachim Gudmundsson, Rolf Klein, Christian Knauer, Michiel H. M. Smid
2009	J	`jnl`	A linear-space algorithm for distance preserving graph embedding. Comput. Geom. Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer
2009	J	`jnl`	Algorithms for Marketing-Mix Optimization CoRR Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid
2009	J	`jnl`	Algorithms for optimal outlier removal. J. Discrete Algorithms Rossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette, Michiel H. M. Smid, Stefanie Wuhrer
2009	J	`jnl`	An Omega(n log n) lower bound for computing the sum of even-ranked elements CoRR Marc Mörig, Michiel H. M. Smid, Jan Tusch
2009	J	`jnl`	An Omega(nlogn) lower bound for computing the sum of even-ranked elements. Inf. Process. Lett. Marc Mörig, Dieter Rautenbach, Michiel H. M. Smid, Jan Tusch
2009	J	`jnl`	Clamshell Casting. Algorithmica Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer
2009	J	`jnl`	Delaunay and diamond Triangulations contain Spanners of Bounded Degree. Int. J. Comput. Geom. Appl. Prosenjit Bose, Michiel H. M. Smid, Daming Xu
2009	J	`jnl`	Efficient Non-Intersection Queries on Aggregated Geometric Data. Int. J. Comput. Geom. Appl. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
2009	—	`ed.`	Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 01.11. - 06.11.2009 Geometric Networks, Metric Space Embeddings and Spatial Data Mining Gautam Das, Joachim Gudmundsson, Rolf Klein, Christian Knauer, Michiel H. M. Smid
2009	A	`conf`	Geometric Spanners for Weighted Point Sets. ESA Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid
2009	J	`jnl`	Geometric spanners with small chromatic number. Comput. Geom. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2009	J	`jnl`	On Spanners of Geometric Graphs. Int. J. Found. Comput. Sci. Joachim Gudmundsson, Michiel H. M. Smid
2009	B	`conf`	On the Power of the Semi-Separated Pair Decomposition. WADS Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid
2009	J	`jnl`	On the dilation spectrum of paths, cycles, and trees. Comput. Geom. Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid
2009	J	`jnl`	Rotationally monotone polygons. Comput. Geom. Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer
2009	J	`jnl`	Spanners of Complete k-Partite Geometric Graphs. SIAM J. Comput. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2009	—	`conf`	The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension. Efficient Algorithms Michiel H. M. Smid
2008	—	`ch.`	Applications of Geometric Spanner Networks. Encyclopedia of Algorithms Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
2008	J	`jnl`	Approximate distance oracles for geometric spanners. ACM Trans. Algorithms Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
2008	J	`jnl`	Communication-Efficient Construction of the Plane Localized Delaunay Graph CoRR Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu
2008	—	`conf`	Computing the Greedy Spanner in Near-Quadratic Time. SWAT Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid
2008	—	`conf`	Data Structures for Range-Aggregate Extent Queries. CCCG Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Michiel H. M. Smid
2008	—	`ch.`	Geometric Spanners. Encyclopedia of Algorithms Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
2008	J	`jnl`	I/O-efficient algorithms for computing planar geometric spanners. Comput. Geom. Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2008	J	`jnl`	On the Stretch Factor of Convex Delaunay Graphs CoRR Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid
2008	B	`conf`	On the Stretch Factor of Convex Delaunay Graphs. ISAAC Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid
2008	J	`jnl`	On the false-positive rate of Bloom filters. Inf. Process. Lett. Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Yihui Tang
2008	—	`ch.`	Planar Geometric Spanners. Encyclopedia of Algorithms Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
2008	B	`conf`	Spanners of Complete k -Partite Geometric Graphs. LATIN Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2008	J	`jnl`	Sparse geometric graphs with small dilation. Comput. Geom. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
2007	B	`conf`	Dilation-Optimal Edge Deletion in Polygonal Cycles. ISAAC Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang
2007	J	`jnl`	Distance-preserving approximations of polygonal paths. Comput. Geom. Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
2007	—	`ed.`	Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006 Geometric Networks and Metric Space Embeddings Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff
2007	J	`jnl`	Geometric Spanners With Small Chromatic Number CoRR Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2007	B	`conf`	Geometric Spanners with Small Chromatic Number. WAOA Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2007	—	`book`	Geometric spanner networks. Giri Narasimhan, Michiel H. M. Smid
2007	—	`conf`	Linear-Space Algorithms for Distance Preserving Embedding. CCCG Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer
2007	B	`conf`	On Generalized Diamond Spanners. WADS Prosenjit Bose, Aaron Lee, Michiel H. M. Smid
2007	B	`conf`	On a Family of Strong Geometric Spanners That Admit Local Routing Strategies. WADS Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
2007	J	`jnl`	On a family of strong geometric spanners that admit local routing strategies CoRR Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
2007	J	`jnl`	Space-efficient geometric divide-and-conquer algorithms. Comput. Geom. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold
2007	J	`jnl`	Spanners of Complete $k$-Partite Geometric Graphs CoRR Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2007	J	`jnl`	Sparse geometric graphs with small dilation CoRR Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
2007	—	`ch.`	The Well-Separated Pair Decomposition and Its Applications. Handbook of Approximation Algorithms and Metaheuristics Michiel H. M. Smid
2006	—	`conf`	06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. Geometric Networks and Metric Space Embeddings Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff
2006	J	`jnl`	A Dynamic Dictionary for Priced Information with Application. Algorithmica Anil Maheshwari, Michiel H. M. Smid
2006	B	`conf`	Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. LATIN Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
2006	B	`conf`	Diamond Triangulations Contain Spanners of Bounded Degree. ISAAC Prosenjit Bose, Michiel H. M. Smid, Daming Xu
2006	—	`conf`	Geometric spanners with few edges and degree five. CATS Michiel H. M. Smid
2006	J	`jnl`	Heuristics for estimating contact area of supports in layered manufacturing. ACM J. Exp. Algorithmics Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt
2006	B	`conf`	Indicator Random Variables in Traffic Analysis and the Birthday Problem. LCN Phillip G. Bradford, Irina Perevalova, Michiel H. M. Smid, Charles B. Ward
2006	—	`conf`	On Spanners of Geometric Graphs. SWAT Joachim Gudmundsson, Michiel H. M. Smid
2006	—	`conf`	Rotationally Monotone Polygons. CCCG Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer
2005	J	`jnl`	Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid
2005	J	`jnl`	Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams CoRR Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
2005	Misc	`conf`	Efficient Non-intersection Queries on Aggregated Geometric Data. COCOON Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
2005	B	`conf`	Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles. ISAAC Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid
2005	A	`conf`	Fast Pruning of Geometric Spanners. STACS Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
2005	J	`jnl`	Geometric Algorithms for Density-based Data Clustering. Int. J. Comput. Geom. Appl. Danny Z. Chen, Michiel H. M. Smid, Bin Xu
2005	—	`ed.`	Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, October 7-9, 2003 Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing Ravi Janardan, Michiel H. M. Smid, Debasis Dutta
2005	J	`jnl`	Range Mode and Range Median Queries on Lists and Trees. Nord. J. Comput. Danny Krizanc, Pat Morin, Michiel H. M. Smid
2004	—	`conf`	Approximating contact-area of supports in layered manufacturing. CCCG Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt
2004	J	`jnl`	Approximating geometric bottleneck shortest paths. Comput. Geom. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
2004	—	`ch.`	Computational Geometry. Handbook of Data Structures and Applications Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
2004	J	`jnl`	Computing large planar regions in terrains, with an application to fracture surfaces. Discret. Appl. Math. Michiel H. M. Smid, Rahul Ray, Ulrich Wendt, Katharina Lange
2004	J	`jnl`	Light edges in degree-constrained graphs. Discret. Math. Prosenjit Bose, Michiel H. M. Smid, David R. Wood
2003	B	`conf`	A Dynamic Dictionary for Priced Information with Application. ISAAC Anil Maheshwari, Michiel H. M. Smid
2003	B	`ed.`	Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings WADS Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Michiel H. M. Smid
2003	A	`conf`	Approximating Geometric Bottleneck Shortest Paths. STACS Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
2003	—	`conf`	Distance-Preserving Approximations of Polygonal Paths. FSTTCS Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
2003	—	`conf`	Geometric Algorithms for Layered Manufacturing. Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing Ravi Janardan, Michiel H. M. Smid
2003	J	`jnl`	Minimizing the total projection of a set of vectors, with applications to layered manufacturing. Comput. Aided Des. Man Chung Hon, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid
2003	J	`jnl`	Protecting critical facets in layered manufacturing: implementation and experimental results. Comput. Aided Des. Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson
2003	J	`jnl`	Range Mode and Range Median Queries on Lists and Trees CoRR Danny Krizanc, Pat Morin, Michiel H. M. Smid
2003	B	`conf`	Range Mode and Range Median Queries on Lists and Trees. ISAAC Danny Krizanc, Pat Morin, Michiel H. M. Smid
2002	J	`jnl`	A decomposition-based approach to layered manufacturing. Comput. Geom. Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram
2002	B	`conf`	Approximate Distance Oracles Revisited. ISAAC Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
2002	A*	`conf`	Approximate distance oracles for geometric graphs. SODA Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
2002	J	`jnl`	Approximation Algorithms for the Bottleneck Stretch Factor Problem. Nord. J. Comput. Giri Narasimhan, Michiel H. M. Smid
2002	J	`jnl`	Computing an Optimal Hatching Direction in Layered Manufacturing. Int. J. Comput. Math. Jörg Schwerdt, Michiel H. M. Smid, Man Chung Hon, Ravi Janardan
2002	J	`jnl`	Computing the Smallest T-Shaped Polygon Containing k Points. Int. J. Comput. Math. Michiel H. M. Smid, Vanam Srilakshmi
2002	A	`conf`	Constructing Plane Spanners of Bounded Degree and Low Weight. ESA Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid
2002	A	`conf`	Geometric Algorithms for Density-Based Data Clustering. ESA Danny Z. Chen, Michiel H. M. Smid, Bin Xu
2002	J	`jnl`	Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
2002	—	`conf`	Light edges in degree-constrained graphs. CCCG Prosenjit Bose, Michiel H. M. Smid, David R. Wood
2002	Misc	`conf`	Terrain Polygon Decomposition, with Application to Layered Manufacturing. COCOON Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid
2002	A	`conf`	Translating a Planar Object to Maximize Point Containment. ESA Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl
2001	B	`conf`	A Decomposition-Based Approach to Layered Manufacturing. WADS Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram
2001	A	`conf`	Approximation Algorithms for the Bottleneck Stretch Factor Problem. STACS Giri Narasimhan, Michiel H. M. Smid
2001	Misc	`conf`	Computing Optimal Hatching Directions in Layered Manufacturing. International Conference on Computational Science (1) Man Chung Hon, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid
2001	C	`conf`	Computing large planar regions in terrains. IWCIA Katharina Lange, Rahul Ray, Michiel H. M. Smid, Ulrich Wendt
2001	B	`conf`	I/O-Efficient Shortest Path Queries in Geometric Spanners. WADS Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2001	J	`jnl`	Lower bounds for computing geometric spanners and approximate shortest paths. Discret. Appl. Math. Danny Z. Chen, Gautam Das, Michiel H. M. Smid
2000	J	`jnl`	A lower bound for approximating the geometric minimum weight matching. Inf. Process. Lett. Gautam Das, Michiel H. M. Smid
2000	J	`jnl`	Approximating the Stretch Factor of Euclidean Graphs. SIAM J. Comput. Giri Narasimhan, Michiel H. M. Smid
2000	—	`ch.`	Closest-Point Problems in Computational Geometry. Handbook of Computational Geometry Michiel H. M. Smid
2000	J	`jnl`	Protecting critical facets in layered manufacturing. Comput. Geom. Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi
1999	J	`jnl`	Computing the Width of a Three-Dimensional Point Set: An Experimental Study. ACM J. Exp. Algorithmics Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan
1999	J	`jnl`	Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Comput. Geom. Sunil Arya, David M. Mount, Michiel H. M. Smid
1999	J	`jnl`	Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. Inf. Process. Lett. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
1999	J	`jnl`	Minimizing support structures and trapped area in two-dimensional layered manufacturing. Comput. Geom. Jayanth Majhi, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid, Prosenjit Gupta
1999	J	`jnl`	On some geometric optimization problems in layered manufacturing. Comput. Geom. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta
1999	J	`jnl`	On the width and roundness of a set of points in the plane. Int. J. Comput. Geom. Appl. Michiel H. M. Smid, Ravi Janardan
1999	—	`conf`	Protecting Facets in Layered Manufacturing. FSTTCS Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi
1998	—	`conf`	Computing the Width of a Three-Dimensional Point Set: An Experimental Study. WAE Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan
1998	A*	`conf`	Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. STOC Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
1998	—	`conf`	Multi-Criteria Geometric Optimization Problems in Layered Manufacturing. SCG Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Jörg Schwerdt
1998	J	`jnl`	Randomized Data Structures for the Dynamic Closest-Pair Problem. SIAM J. Comput. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1997	J	`jnl`	A Technique for Adding Range Restrictions to Generalized Searching Problems. Inf. Process. Lett. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
1997	J	`jnl`	Computing a Largest Empty Anchored Cylinder, and Related Problems. Int. J. Comput. Geom. Appl. Frank Follert, Elmar Schömer, Jürgen Sellen, Michiel H. M. Smid, Christian Thiel
1997	—	`conf`	Computing the Minimum Diameter for Moving Points: An Exact Implementation Using Parametric Search. SCG Jörg Schwerdt, Michiel H. M. Smid, Stefan Schirra
1997	J	`jnl`	Efficient Construction of a Bounded-Degree Spanner with Low Weight. Algorithmica Sunil Arya, Michiel H. M. Smid
1997	J	`jnl`	More Efficient Parallel Totally Monotone Matrix Searching. J. Algorithms Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid
1997	B	`conf`	On Some Geometric Optimization Problems in Layered Manufacturing. WADS Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta
1997	J	`jnl`	On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Algorithmica Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid
1997	J	`jnl`	The Rectangle Enclosure and Point-Dominance Problems Revisited. Int. J. Comput. Geom. Appl. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta
1996	J	`jnl`	Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. Comput. Geom. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
1996	—	`conf`	Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. CCCG Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
1996	J	`jnl`	Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. Comput. Geom. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
1996	—	`conf`	Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. CCCG Danny Z. Chen, Gautam Das, Michiel H. M. Smid
1996	J	`jnl`	New Techniques for Exact and Approximate Dynamic Closest-Point Problems. SIAM J. Comput. Sanjiv Kapoor, Michiel H. M. Smid
1996	—	`conf`	On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. FSTTCS Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid
1996	A	`conf`	Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. ESA Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis
1995	J	`jnl`	Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. Comput. Geom. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
1995	—	`conf`	Computing a Largest Empty Anchored Cylinder, and Related Problems. FSTTCS Frank Follert, Elmar Schömer, Jürgen Sellen, Michiel H. M. Smid, Christian Thiel
1995	J	`jnl`	Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem Inf. Comput. Michiel H. M. Smid
1995	A*	`conf`	Euclidean spanners: short, thin, and lanky. STOC Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid
1995	J	`jnl`	Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. J. Algorithms Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
1995	J	`jnl`	Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity. Algorithmica Hans-Peter Lenhof, Michiel H. M. Smid
1995	J	`jnl`	Sequential and parallel algorithms for the k closest pairs problem. Int. J. Comput. Geom. Appl. Hans-Peter Lenhof, Michiel H. M. Smid
1995	J	`jnl`	Simple Randomized Algorithms for Closest Pair Problems. Nord. J. Comput. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1995	J	`jnl`	Static and Dynamic Algorithms for J. Algorithms Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid
1995	—	`conf`	The Rectangle Enclosure and Point-Dominance Problems Revisited. SCG Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta
1994	—	`conf`	An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm. SCG Hans-Peter Lenhof, Michiel H. M. Smid
1994	J	`jnl`	An Optimal Algorithm for the On-Line Closest-Pair Problem. Algorithmica Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink
1994	—	`conf`	Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. SCG Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
1994	A	`conf`	Efficient Construction of a Bounded Degree Spanner with Low Weight. ESA Sunil Arya, Michiel H. M. Smid
1994	A	`conf`	Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. ESA Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
1994	—	`conf`	New Techniques for Exact and Approximate Dynamic Closest-Point Problems. SCG Sanjiv Kapoor, Michiel H. M. Smid
1994	—	`conf`	On Intersection Searching Problems Involving Curved Objects. SWAT Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
1994	A*	`conf`	Randomized and deterministic algorithms for geometric spanners of small diameter FOCS Sunil Arya, David M. Mount, Michiel H. M. Smid
1994	J	`jnl`	Using Persistent Data Structures for Adding Range Restrictions to Searching Problems. RAIRO Theor. Informatics Appl. Hans-Peter Lenhof, Michiel H. M. Smid
1993	J	`jnl`	An optimal construction method for generalized convex layers. Int. J. Comput. Geom. Appl. Hans-Peter Lenhof, Michiel H. M. Smid
1993	B	`conf`	Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. WADS Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
1993	A*	`conf`	Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1993	—	`conf`	Simple Randomized Algorithms for Closest Pair Problems. CCCG Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1993	B	`conf`	Static and Dynamic Algorithms for k-Point Clustering Problems. WADS Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid
1992	A*	`conf`	An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem. SODA Christian Schwarz, Michiel H. M. Smid
1992	—	`conf`	An Optimal Algorithm for the On-Line Closest-Pair Problem. SCG Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink
1992	A*	`conf`	Enumerating the k Closest Pairs Optimally FOCS Hans-Peter Lenhof, Michiel H. M. Smid
1992	J	`jnl`	Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. Discret. Comput. Geom. Michiel H. M. Smid
1992	—	`conf`	Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity. SWAT Hans-Peter Lenhof, Michiel H. M. Smid
1991	—	`conf`	An Optimal Construction Method for Generalized Convex Layers. ISA Hans-Peter Lenhof, Michiel H. M. Smid
1991	A*	`conf`	Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. SODA Michiel H. M. Smid
1991	—	`conf`	Rectangular Point Location and the Dynamic Closest Pair Problem. ISA Michiel H. M. Smid
1990	J	`jnl`	Dynamic Deferred Data Structuring. Inf. Process. Lett. Yu-Tai Ching, Kurt Mehlhorn, Michiel H. M. Smid
1990	J	`jnl`	Maintaining Range Trees in Secondary Memory. Part I: Partitions. Acta Informatica Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld
1990	J	`jnl`	Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds. Acta Informatica Michiel H. M. Smid, Mark H. Overmars
1989	—	`—`	Dynamic data structures on multiple storage media. Michiel H. M. Smid
1989	J	`jnl`	Maintaining Multiple Representations of Dynamic Data Structures Inf. Comput. Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
1989	—	`conf`	Multiple Representations of Dynamic Data Structures. IFIP Congress Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
1989	J	`jnl`	Two Models for the Reconstruction Problem for Dynamic Data Structures. J. Inf. Process. Cybern. Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars
1988	A	`conf`	Maintaining Range Trees in Secondary Memory (Extended Abstract). STACS Mark H. Overmars, Michiel H. M. Smid
1987	J	`jnl`	Duadic codes. IEEE Trans. Inf. Theory Michiel H. M. Smid