Michiel H. M. Smid

According to our database1, Michiel H. M. Smid
  • authored at least 271 papers between 1987 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Essential Constraints of Edge-Constrained Proximity Graphs.
J. Graph Algorithms Appl., 2017

Optimal Art Gallery Localization is NP-hard.
CoRR, 2017

Art Gallery Localization.
CoRR, 2017

Compatible 4-Holes in Point Sets.
CoRR, 2017

An optimal algorithm for plane matchings in multipartite geometric graphs.
Comput. Geom., 2017

Approximation algorithms for the unit disk cover problem in 2D and 3D.
Comput. Geom., 2017

Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Maximum Plane Trees in Multipartite Geometric Graphs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Querying Relational Event Graphs Using Colored Range Searching Data Structures.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Planar Geometric Spanners.
Encyclopedia of Algorithms, 2016

Geometric Spanners.
Encyclopedia of Algorithms, 2016

Applications of Geometric Spanner Networks.
Encyclopedia of Algorithms, 2016

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere.
JoCG, 2016

A plane 1.88-spanner for points in convex position.
JoCG, 2016

Guest Editors' Foreword.
Int. J. Comput. Geometry Appl., 2016

Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees.
CoRR, 2016

Minimizing the Continuous Diameter when Augmenting a Tree with a Shortcut.
CoRR, 2016

Essential Constraints of Edge-Constrained Proximity Graphs.
CoRR, 2016

Spanning Trees in Multipartite Geometric Graphs.
CoRR, 2016

Towards Plane Spanners of Degree 3.
CoRR, 2016

Probing convex polygons with a wedge.
Comput. Geom., 2016

Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon.
Comput. Geom., 2016

Discrete Voronoi games and ϵ-nets, in two and three dimensions.
Comput. Geom., 2016

Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

A Plane 1.88-Spanner for Points in Convex Position.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Improved Spanning Ratio for Low Degree Plane Spanners.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Essential Constraints of Edge-Constrained Proximity Graphs.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Plane Bichromatic Trees of Low Degree.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Towards Plane Spanners of Degree 3.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Matchings in higher-order Gabriel graphs.
Theor. Comput. Sci., 2015

Optimal Data Structures for Farthest-Point Queries in Cactus Networks.
J. Graph Algorithms Appl., 2015

On the hardness of full Steiner tree problems.
J. Discrete Algorithms, 2015

Packing Plane Perfect Matchings into a Point Set.
Discrete Mathematics & Theoretical Computer Science, 2015

Average Stretch Factor: How Low Does It Go?
Discrete & Computational Geometry, 2015

Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts.
CoRR, 2015

Improved Spanning Ratio for Low Degree Plane Spanners.
CoRR, 2015

Probing Convex Polygons with a Wedge.
CoRR, 2015

On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere.
CoRR, 2015

Strong Matching of Points with Geometric Shapes.
CoRR, 2015

Plane Bichromatic Trees of Low Degree.
CoRR, 2015

Packing Plane Perfect Matchings into a Point Set.
CoRR, 2015

Discrete Voronoi Games and ε-Nets, in Two and Three Dimensions.
CoRR, 2015

Fast algorithms for approximate Fréchet matching queries in geometric trees.
Comput. Geom., 2015

Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties.
Comput. Geom., 2015

On full Steiner trees in unit disk graphs.
Comput. Geom., 2015

Approximating the bottleneck plane perfect matching of a point set.
Comput. Geom., 2015

An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon.
Proceedings of the Topics in Theoretical Computer Science, 2015

Fast Algorithms for Diameter-Optimally Augmenting Paths.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

Plane and Planarity Thresholds for Random Geometric Graphs.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
Fixed-orientation equilateral triangle matching of point sets.
Theor. Comput. Sci., 2014

Optimal Data Structures for Farthest-Point Queries in Cactus Networks.
CoRR, 2014

Matching in Gabriel Graphs.
CoRR, 2014

Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties.
CoRR, 2014

Data structures for range-aggregate extent queries.
Comput. Geom., 2014

A note on the unsolvability of the weighted region shortest path problem.
Comput. Geom., 2014

An optimal algorithm for the Euclidean bottleneck full Steiner tree problem.
Comput. Geom., 2014

The Convex Hull of Points on a Sphere is a Spanner.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Bottleneck Bichromatic Plane Matching of Points.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Approximating Full Steiner Tree in a Unit Disk Graph.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Voronoi Games and Epsilon Nets.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

A Facility Coloring Problem in 1-D.
Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013
Robust Geometric Spanners.
SIAM J. Comput., 2013

Network Farthest-Point Diagrams.
JoCG, 2013

A Note on the Unsolvability of the Weighted Region Shortest Path Problem
CoRR, 2013

Average Stretch Factor: How Low Does It Go?
CoRR, 2013

An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem
CoRR, 2013

Network Farthest-Point Diagrams
CoRR, 2013

Approximating the Bottleneck Plane Perfect Matching of a Point Set.
CoRR, 2013

Computing the Coverage of an Opaque Forest.
CoRR, 2013

Computing Covers of Plane Forests.
CoRR, 2013

An in-place min-max priority search tree.
Comput. Geom., 2013

On plane geometric spanners: A survey and open problems.
Comput. Geom., 2013

On the power of the semi-separated pair decomposition.
Comput. Geom., 2013

Fixed-Orientation Equilateral Triangle Matching of Point Sets.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Fréchet Queries in Geometric Trees.
Proceedings of the Algorithms - ESA 2013, 2013

Robust geometric spanners.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

The Discrete Voronoi Game in a Simple Polygon.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Optimal Data Structures for Farthest-Point Queries in Cactus Networks.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Computing Covers of Plane Forests.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Range-Aggregate Queries for Geometric Extent Problems.
Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2012
Approximating the average stretch factor of geometric graphs.
JoCG, 2012

An optimal algorithm for computing angle-constrained spanners.
JoCG, 2012

π/2-Angle Yao Graphs are Spanners.
Int. J. Comput. Geometry Appl., 2012

Fixed-Orientation Equilateral Triangle Matching of Point Sets
CoRR, 2012

Robust Geometric Spanners
CoRR, 2012

Two-Dimensional Range Diameter Queries.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

On Farthest-Point Information in Networks.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

xy-Monotone Path Existence Queries in a Rectilinear Environment.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Computing the Coverage of an Opaque Forest.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Low-interference networks in metric spaces of bounded doubling dimension.
Inf. Process. Lett., 2011

On a family of strong geometric spanners that admit local routing strategies.
Comput. Geom., 2011

Algorithms for Marketing-Mix Optimization.
Algorithmica, 2011

Geometric Spanners for Weighted Point Sets.
Algorithmica, 2011

Approximation Algorithms for a Triangle Enclosure Problem.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

An In-Place Priority Search Tree.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
On the Stretch Factor of Convex Delaunay Graphs.
JoCG, 2010

Sigma-local graphs.
J. Discrete Algorithms, 2010

Dilation-Optimal Edge Deletion in Polygonal Cycles.
Int. J. Comput. Geometry Appl., 2010

Improved Methods For Generating Quasi-Gray Codes
CoRR, 2010

Pi/2-Angle Yao Graphs are Spanners
CoRR, 2010

Computing the Greedy Spanner in Near-Quadratic Time.
Algorithmica, 2010

Improved Methods For Generating Quasi-gray Codes.
Proceedings of the Algorithm Theory, 2010

Communication-Efficient Construction of the Plane Localized Delaunay Graph.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Approximating the Average Stretch Factor of Geometric Graphs.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

An Optimal Algorithm for Computing Angle-Constrained Spanners.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

pi/2-Angle Yao Graphs Are Spanners.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Approximating range-aggregate queries using coresets.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Spanners of Complete k-Partite Geometric Graphs.
SIAM J. Comput., 2009

Algorithms for optimal outlier removal.
J. Discrete Algorithms, 2009

An Omega(nlogn) lower bound for computing the sum of even-ranked elements.
Inf. Process. Lett., 2009

On Spanners of Geometric Graphs.
Int. J. Found. Comput. Sci., 2009

Efficient Non-Intersection Queries on Aggregated Geometric Data.
Int. J. Comput. Geometry Appl., 2009

Delaunay and diamond Triangulations contain Spanners of Bounded Degree.
Int. J. Comput. Geometry Appl., 2009

Algorithms for Marketing-Mix Optimization
CoRR, 2009

An Omega(n log n) lower bound for computing the sum of even-ranked elements
CoRR, 2009

On the dilation spectrum of paths, cycles, and trees.
Comput. Geom., 2009

Rotationally monotone polygons.
Comput. Geom., 2009

Geometric spanners with small chromatic number.
Comput. Geom., 2009

A linear-space algorithm for distance preserving graph embedding.
Comput. Geom., 2009

Clamshell Casting.
Algorithmica, 2009

On the Power of the Semi-Separated Pair Decomposition.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Geometric Spanners for Weighted Point Sets.
Proceedings of the Algorithms, 2009

09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining.
Proceedings of the Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 01.11., 2009

The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension.
Proceedings of the Efficient Algorithms, 2009

2008
Planar Geometric Spanners.
Proceedings of the Encyclopedia of Algorithms, 2008

Geometric Spanners.
Proceedings of the Encyclopedia of Algorithms, 2008

Applications of Geometric Spanner Networks.
Proceedings of the Encyclopedia of Algorithms, 2008

Approximate distance oracles for geometric spanners.
ACM Trans. Algorithms, 2008

On the false-positive rate of Bloom filters.
Inf. Process. Lett., 2008

Communication-Efficient Construction of the Plane Localized Delaunay Graph
CoRR, 2008

On the Stretch Factor of Convex Delaunay Graphs
CoRR, 2008

I/O-efficient algorithms for computing planar geometric spanners.
Comput. Geom., 2008

Sparse geometric graphs with small dilation.
Comput. Geom., 2008

Computing the Greedy Spanner in Near-Quadratic Time.
Proceedings of the Algorithm Theory, 2008

Spanners of Complete k -Partite Geometric Graphs.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

On the Stretch Factor of Convex Delaunay Graphs.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Data Structures for Range-Aggregate Extent Queries.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
The Well-Separated Pair Decomposition and Its Applications.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

On a family of strong geometric spanners that admit local routing strategies
CoRR, 2007

Sparse geometric graphs with small dilation
CoRR, 2007

Spanners of Complete $k$-Partite Geometric Graphs
CoRR, 2007

Geometric Spanners With Small Chromatic Number
CoRR, 2007

Distance-preserving approximations of polygonal paths.
Comput. Geom., 2007

Space-efficient geometric divide-and-conquer algorithms.
Comput. Geom., 2007

Geometric Spanners with Small Chromatic Number.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

On Generalized Diamond Spanners.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

On a Family of Strong Geometric Spanners That Admit Local Routing Strategies.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Dilation-Optimal Edge Deletion in Polygonal Cycles.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Linear-Space Algorithms for Distance Preserving Embedding.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Geometric spanner networks.
Cambridge University Press, 2007

2006
Heuristics for estimating contact area of supports in layered manufacturing.
ACM Journal of Experimental Algorithmics, 2006

A Dynamic Dictionary for Priced Information with Application.
Algorithmica, 2006

On Spanners of Geometric Graphs.
Proceedings of the Algorithm Theory, 2006

Indicator Random Variables in Traffic Analysis and the Birthday Problem.
Proceedings of the LCN 2006, 2006

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Diamond Triangulations Contain Spanners of Bounded Degree.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings.
Proceedings of the Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006, 2006

Rotationally Monotone Polygons.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Geometric spanners with few edges and degree five.
Proceedings of the Theory of Computing 2006, 2006

2005
Range Mode and Range Median Queries on Lists and Trees.
Nord. J. Comput., 2005

Geometric Algorithms for Density-based Data Clustering.
Int. J. Comput. Geometry Appl., 2005

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
CoRR, 2005

Constructing Plane Spanners of Bounded Degree and Low Weight.
Algorithmica, 2005

Fast Pruning of Geometric Spanners.
Proceedings of the STACS 2005, 2005

Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Efficient Non-intersection Queries on Aggregated Geometric Data.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Computational Geometry.
Proceedings of the Handbook of Data Structures and Applications., 2004

Light edges in degree-constrained graphs.
Discrete Mathematics, 2004

Computing large planar regions in terrains, with an application to fracture surfaces.
Discrete Applied Mathematics, 2004

Approximating geometric bottleneck shortest paths.
Comput. Geom., 2004

Approximating contact-area of supports in layered manufacturing.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Range Mode and Range Median Queries on Lists and Trees
CoRR, 2003

Protecting critical facets in layered manufacturing: implementation and experimental results.
Computer-Aided Design, 2003

Minimizing the total projection of a set of vectors, with applications to layered manufacturing.
Computer-Aided Design, 2003

Approximating Geometric Bottleneck Shortest Paths.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

A Dynamic Dictionary for Priced Information with Application.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Range Mode and Range Median Queries on Lists and Trees.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Distance-Preserving Approximations of Polygonal Paths.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Geometric Algorithms for Layered Manufacturing.
Proceedings of the Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, 2003

2002
Approximation Algorithms for the Bottleneck Stretch Factor Problem.
Nord. J. Comput., 2002

Computing the Smallest T-Shaped Polygon Containing k Points.
Int. J. Comput. Math., 2002

Computing an Optimal Hatching Direction in Layered Manufacturing.
Int. J. Comput. Math., 2002

A decomposition-based approach to layered manufacturing.
Comput. Geom., 2002

Improved Algorithms for Constructing Fault-Tolerant Spanners.
Algorithmica, 2002

Approximate distance oracles for geometric graphs.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Approximate Distance Oracles Revisited.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Geometric Algorithms for Density-Based Data Clustering.
Proceedings of the Algorithms, 2002

Constructing Plane Spanners of Bounded Degree and Low Weight.
Proceedings of the Algorithms, 2002

Translating a Planar Object to Maximize Point Containment.
Proceedings of the Algorithms, 2002

Terrain Polygon Decomposition, with Application to Layered Manufacturing.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

Light edges in degree-constrained graphs.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Computing large planar regions in terrains.
Electr. Notes Theor. Comput. Sci., 2001

Lower bounds for computing geometric spanners and approximate shortest paths.
Discrete Applied Mathematics, 2001

I/O-Efficient Shortest Path Queries in Geometric Spanners.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

A Decomposition-Based Approach to Layered Manufacturing.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Approximation Algorithms for the Bottleneck Stretch Factor Problem.
Proceedings of the STACS 2001, 2001

Computing Optimal Hatching Directions in Layered Manufacturing.
Proceedings of the Computational Science - ICCS 2001, 2001

2000
Approximating the Stretch Factor of Euclidean Graphs.
SIAM J. Comput., 2000

A lower bound for approximating the geometric minimum weight matching.
Inf. Process. Lett., 2000

Protecting critical facets in layered manufacturing.
Comput. Geom., 2000

1999
Computing the Width of a Three-Dimensional Point Set: An Experimental Study.
ACM Journal of Experimental Algorithmics, 1999

Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons.
Inf. Process. Lett., 1999

On the width and roundness of a set of points in the plane.
Int. J. Comput. Geometry Appl., 1999

Minimizing support structures and trapped area in two-dimensional layered manufacturing.
Comput. Geom., 1999

On some geometric optimization problems in layered manufacturing.
Comput. Geom., 1999

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions.
Comput. Geom., 1999

Protecting Facets in Layered Manufacturing.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998
Randomized Data Structures for the Dynamic Closest-Pair Problem.
SIAM J. Comput., 1998

Computing the Width of a Three-Dimensional Point Set: An Experimental Study.
Proceedings of the Algorithm Engineering, 1998

Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Multi-Criteria Geometric Optimization Problems in Layered Manufacturing.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
More Efficient Parallel Totally Monotone Matrix Searching.
J. Algorithms, 1997

A Technique for Adding Range Restrictions to Generalized Searching Problems.
Inf. Process. Lett., 1997

The Rectangle Enclosure and Point-Dominance Problems Revisited.
Int. J. Comput. Geometry Appl., 1997

Computing a Largest Empty Anchored Cylinder, and Related Problems.
Int. J. Comput. Geometry Appl., 1997

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees.
Algorithmica, 1997

Efficient Construction of a Bounded-Degree Spanner with Low Weight.
Algorithmica, 1997

On Some Geometric Optimization Problems in Layered Manufacturing.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Computing the Minimum Diameter for Moving Points: An Exact Implementation Using Parametric Search.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
New Techniques for Exact and Approximate Dynamic Closest-Point Problems.
SIAM J. Comput., 1996

Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects.
Comput. Geom., 1996

Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems.
Comput. Geom., 1996

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane.
Proceedings of the Algorithms, 1996

Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem
Inf. Comput., January, 1995

Simple Randomized Algorithms for Closest Pair Problems.
Nord. J. Comput., 1995

Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization.
J. Algorithms, 1995

Static and Dynamic Algorithms for k-Point Clustering Problems.
J. Algorithms, 1995

Sequential and parallel algorithms for the k closest pairs problem.
Int. J. Comput. Geometry Appl., 1995

Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems.
Comput. Geom., 1995

Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity.
Algorithmica, 1995

Euclidean spanners: short, thin, and lanky.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Computing a Largest Empty Anchored Cylinder, and Related Problems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

The Rectangle Enclosure and Point-Dominance Problems Revisited.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Using Persistent Data Structures for Adding Range Restrictions to Searching Problems.
ITA, 1994

An Optimal Algorithm for the On-Line Closest-Pair Problem.
Algorithmica, 1994

On Intersection Searching Problems Involving Curved Objects.
Proceedings of the Algorithm Theory, 1994

Randomized and deterministic algorithms for geometric spanners of small diameter
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects.
Proceedings of the Algorithms, 1994

Efficient Construction of a Bounded Degree Spanner with Low Weight.
Proceedings of the Algorithms, 1994

An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

New Techniques for Exact and Approximate Dynamic Closest-Point Problems.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
An optimal construction method for generalized convex layers.
Int. J. Comput. Geometry Appl., 1993

Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Static and Dynamic Algorithms for k-Point Clustering Problems.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Randomized Data Structures for the Dynamic Closest-Pair Problem.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Simple Randomized Algorithms for Closest Pair Problems.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time.
Discrete & Computational Geometry, 1992

Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity.
Proceedings of the Algorithm Theory, 1992

An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Enumerating the k Closest Pairs Optimally
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

An Optimal Algorithm for the On-Line Closest-Pair Problem.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Rectangular Point Location and the Dynamic Closest Pair Problem.
Proceedings of the ISA '91 Algorithms, 1991

An Optimal Construction Method for Generalized Convex Layers.
Proceedings of the ISA '91 Algorithms, 1991

1990
Dynamic Deferred Data Structuring.
Inf. Process. Lett., 1990

Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds.
Acta Inf., 1990

Maintaining Range Trees in Secondary Memory. Part I: Partitions.
Acta Inf., 1990

1989
Maintaining Multiple Representations of Dynamic Data Structures
Inf. Comput., November, 1989

Two Models for the Reconstruction Problem for Dynamic Data Structures.
Elektronische Informationsverarbeitung und Kybernetik, 1989

Multiple Representations of Dynamic Data Structures.
IFIP Congress, 1989

Dynamic data structures on multiple storage media.
PhD thesis, 1989

1988
Maintaining Range Trees in Secondary Memory (Extended Abstract).
Proceedings of the STACS 88, 1988

1987
Duadic codes.
IEEE Trans. Information Theory, 1987


  Loading...