Sergey Bereg

Miguel Angel Pérez-Cutiño

Alina Kasiuk

Fabio Rodríguez

Inf. Process. Lett., 2025

2024

Improved bounds for permutation arrays under Chebyshev distance.

[BibT_eX]

[DOI]

Brian Malouf

Ivan Hal Sudborough

Des. Codes Cryptogr., April, 2024

Connectivity and stochastic robustness of synchronized multi-drone systems.

[BibT_eX]

[DOI]

Paul Horn

Discret. Appl. Math., 2024

2023

Computing Balanced Convex Partitions of Lines.

[BibT_eX]

[DOI]

Algorithmica, August, 2023

On maximum-sum matchings of points.

[BibT_eX]

[DOI]

Oscar Chacón-Rivera

Clemens Huemer

Carlos Seara

J. Glob. Optim., 2023

The Two-Squirrel Problem and Its Relatives.

[BibT_eX]

[DOI]

CoRR, 2023

Red-Black Spanners for Mixed-Charging Vehicular Networks.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Computing Random r-Orthogonal Latin Squares.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Optimal placement of base stations in border surveillance using limited capacity drones.

[BibT_eX]

[DOI]

Paul Horn

Nestaly Marín

Adriana Ramírez-Vigueras

Theor. Comput. Sci., 2022

Computation of new diagonal graph Ramsey numbers.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2022

Using permutation rational functions to obtain permutation arrays with large hamming distance.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2022

Algorithms for Radon partitions with tolerance.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

New algorithms and bounds for halving pseudolines.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Failure and Communication in a Synchronized Multi-drone System.

[BibT_eX]

[DOI]

Paul Horn

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

On the robustness of a synchronized multi-robot system.

[BibT_eX]

[DOI]

Andrew Brunner

J. Comb. Optim., 2020

Constructing permutation arrays using partition and extension.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

A lower bound on permutation codes of distance n-1.

[BibT_eX]

[DOI]

Peter J. Dukes

Des. Codes Cryptogr., 2020

New lower bounds for Tverberg partitions with tolerance in the plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions.

[BibT_eX]

[DOI]

Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

Constructing Order Type Graphs Using an Axiomatic Approach.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2020

Computing the Caratheodory Number of a Point.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

On some matching problems under the color-spanning model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

New lower bounds for permutation arrays using contraction.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

Equivalence Relations for Computing Permutation Polynomials.

[BibT_eX]

[DOI]

CoRR, 2019

A framework for synchronizing a team of aerial robots in communication-limited environments.

[BibT_eX]

[DOI]

CoRR, 2019

Computing melodic templates in oral music traditions.

[BibT_eX]

[DOI]

Nadine Kroher

Appl. Math. Comput., 2019

2018

Preface.

[BibT_eX]

[DOI]

Daming Zhu

Priya Ranjan Sinha Mahapatra

Theor. Comput. Sci., 2018

Optimizing squares covering a set of points.

[BibT_eX]

[DOI]

Zhao Song

Theor. Comput. Sci., 2018

Computing the k-resilience of a synchronized multi-robot system.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Constructing permutation arrays from groups.

[BibT_eX]

[DOI]

Avi Levy

Ivan Hal Sudborough

Des. Codes Cryptogr., 2018

A construction of product blocks with a fixed block size.

[BibT_eX]

[DOI]

Diana E. Martinez Rodríguez

CoRR, 2018

Maximizing Hamming Distance in Contraction of Permutation Arrays.

[BibT_eX]

[DOI]

CoRR, 2018

Saliency improvement through genetic programming.

[BibT_eX]

[DOI]

Marco A. Contreras-Cruz

Uriel Haile Hernández Belmonte

Víctor Ayala-Ramírez

Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018

Visualization of genome rearrangements using DCJ operations.

[BibT_eX]

[DOI]

Sruthi Chappidi

Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018

2017

A General Framework for Synchronizing a Team of Robots Under Communication Constraints.

[BibT_eX]

[DOI]

Jesús Iván Maza

Aníbal Ollero Baturone

IEEE Trans. Robotics, 2017

Transforming Graphs with the Same Graphic Sequence.

[BibT_eX]

[DOI]

Hiro Ito

J. Inf. Process., 2017

Node Overlap Removal by Growing a Tree.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Monadic Decomposition.

[BibT_eX]

[DOI]

J. ACM, 2017

Extending permutation arrays: improving MOLS bounds.

[BibT_eX]

[DOI]

Linda Morales

Ivan Hal Sudborough

Des. Codes Cryptogr., 2017

A new algorithmic framework for basic problems on binary images.

[BibT_eX]

[DOI]

Lilian Buzer

Discret. Appl. Math., 2017

Efficient Inspection of Underground Galleries Using k Robots with Limited Energy.

[BibT_eX]

[DOI]

Proceedings of the ROBOT 2017: Third Iberian Robotics Conference, 2017

Kronecker product and tiling of permutation arrays for hamming distances.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Parallel Partition and Extension.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Conference on Information Sciences and Systems, 2017

2016

Representing Permutations with Few Moves.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Optimizing some constructions with bars: new geometric knapsack problems.

[BibT_eX]

[DOI]

Stefan Langerman

J. Comb. Optim., 2016

Resilience of a synchronized multi-agent system.

[BibT_eX]

[DOI]

CoRR, 2016

Edge routing with ordered bundles.

[BibT_eX]

[DOI]

Comput. Geom., 2016

On the edge crossing properties of Euclidean minimum weight Laman graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2016

On the 2-Center Problem Under Convex Polyhedral Distance Function.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Balanced partitions of 3-colored geometric sets in the plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

On balanced 4-holes in bichromatic point sets.

[BibT_eX]

[DOI]

Ruy Fabila Monroy

Adriana Ramírez-Vigueras

Toshinori Sakai

Comput. Geom., 2015

An intra-fraction markerless daily lung tumor localization algorithm for EPID images.

[BibT_eX]

[DOI]

Timothy Rozario

Weihua Mao

Proceedings of the 8th ACM International Conference on PErvasive Technologies Related to Assistive Environments, 2015

Colored Non-crossing Euclidean Steiner Forest.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

The synchronization problem for information exchange between aerial robots under communication constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2015

Smallest Maximum-Weight Circle for Weighted Points in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

2014

Embedding the double Circle in a Square Grid of Minimum Size.

[BibT_eX]

[DOI]

Ruy Fabila Monroy

Int. J. Comput. Geom. Appl., 2014

Continuous Surveillance of Points by rotating Floodlights.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2014

Guarding Orthogonal Galleries with Rectangular Rooms.

[BibT_eX]

[DOI]

António Leslie Bajuelos

Ana Mafalda Martins

Comput. J., 2014

A markerless tiling method for tracking daily lung tumor motion on imperfectly matched images.

[BibT_eX]

[DOI]

Timothy Rozario

Weihua Mao

Proceedings of the 7th International Conference on PErvasive Technologies Related to Assistive Environments, 2014

2013

Drawing the double circle on a grid of minimum size

[BibT_eX]

[DOI]

Ruy Fabila Monroy

CoRR, 2013

On the coarseness of bicolored point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Effectively Monadic Predicates.

[BibT_eX]

[DOI]

Proceedings of the LPAR 2013, 2013

Drawing Permutations with Few Corners.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

Optimizing Phylogenetic Networks for Circular Split Systems.

[BibT_eX]

[DOI]

Paul Phipps

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Approximating Metrics with Planar boundary-Labeled Phylogenetic Networks.

[BibT_eX]

[DOI]

Ruogu Sheng

J. Bioinform. Comput. Biol., 2012

Computing generalized ham-sandwich cuts.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Angle Optimization of Graphs Embedded in the Plane

[BibT_eX]

[DOI]

Timothy Rozario

CoRR, 2012

The class cover problem with boxes.

[BibT_eX]

[DOI]

Sergio Cabello

Carlos Seara

Comput. Geom., 2012

Balanced Line for a 3-Colored Point Set in the Plane.

[BibT_eX]

[DOI]

Mikio Kano

Electron. J. Comb., 2012

Small Work Space Algorithms for Some Basic Problems on Binary Images.

[BibT_eX]

[DOI]

Lilian Buzer

Proceedings of the Combinatorial Image Analysis - 15th International Workshop, 2012

A New Framework for Connected Components Labeling of Binary Images.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis - 15th International Workshop, 2012

2011

On the red/blue spanning tree problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

The Maximum Box Problem for moving points in the plane.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

2010

Maximum Area Independent Sets in Disk Intersection Graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

On Covering Problems of Rado.

[BibT_eX]

[DOI]

Algorithmica, 2010

Guarding a Terrain by Two Watchtowers.

[BibT_eX]

[DOI]

Algorithmica, 2010

Orthogonal Ham-Sandwich Theorem in R3.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2009

On Characterizations of Rigid Graphs in the Plane Using Spanning Trees - On Characterizations of Rigid Graphs in the Plane.

[BibT_eX]

[DOI]

Graphs Comb., 2009

Traversing a Set of Points with a Minimum Number of Turns.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Matching points with rectangles and squares.

[BibT_eX]

[DOI]

Nikolaus Mutsanas

Alexander Wolff

Comput. Geom., 2009

Orthogonal equipartitions.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Compatible geometric matchings.

[BibT_eX]

[DOI]

Oswin Aichholzer

Alfredo García Olaverri

Comput. Geom., 2009

A PTAS for Cutting Out Polygons with Lines.

[BibT_eX]

[DOI]

Ovidiu Daescu

Algorithmica, 2009

Counting Faces in Split Networks.

[BibT_eX]

[DOI]

Lichen Bao

Proceedings of the Bioinformatics Research and Applications, 5th International Symposium, 2009

Finding Nearest Larger Neighbors.

[BibT_eX]

[DOI]

Proceedings of the Efficient Algorithms, 2009

Approximating Barrier Resilience in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008

Robust Point-Location in Generalized Voronoi Diagrams.

[BibT_eX]

[DOI]

Yuanyi Zhang

Proceedings of the Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence, 2008

Sliding Disks in the Plane.

[BibT_eX]

[DOI]

János Pach

Int. J. Comput. Geom. Appl., 2008

Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Automatically Approximating 3D Points with Co-Axisal Objects.

[BibT_eX]

[DOI]

Proceedings of the Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, 2008

On Some City Guarding Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Clustered SplitsNetworks.

[BibT_eX]

[DOI]

Lichen Bao

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Phylogenetic Networks Based on the Molecular Clock Hypothesis.

[BibT_eX]

[DOI]

Yuanyi Zhang

IEEE ACM Trans. Comput. Biol. Bioinform., 2007

RNA multiple structural alignment with longest common subsequences.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Wiener indices of balanced binary trees.

[BibT_eX]

[DOI]

Hao Wang

Discret. Appl. Math., 2007

Faster Algorithms for Rigidity in the Plane

[BibT_eX]

[DOI]

CoRR, 2007

Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance

[BibT_eX]

[DOI]

Binhai Zhu

CoRR, 2007

On finding widest empty curved corridors.

[BibT_eX]

[DOI]

Carlos Seara

Comput. Geom., 2007

Straightening Drawings of Clustered Hierarchical Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Transforming Graphs with the Same Degree Sequence.

[BibT_eX]

[DOI]

Hiro Ito

Proceedings of the Computational Geometry and Graph Theory, 2007

2006

Competitive Algorithms for Maintaining a Mobile Center.

[BibT_eX]

[DOI]

Mob. Networks Appl., 2006

The Lifting Model for Reconfiguration.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

Equitable subdivisions within polygonal regions.

[BibT_eX]

[DOI]

Prosenjit Bose

Comput. Geom., 2006

Moving coins.

[BibT_eX]

[DOI]

Manuel Abellanas

Ferran Hurtado

Alfredo García Olaverri

David Rappaport

Javier Tejel

Comput. Geom., 2006

Robust Point-Location in Generalized Voronoi Diagrams.

[BibT_eX]

[DOI]

Yuanyi Zhang

Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

Recent Developments and Open Problems in Voronoi Diagrams.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

2005

An approximate morphing between polylines.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2005

Facility location problems with uncertainty on the plane.

[BibT_eX]

[DOI]

Igor Averbakh

Discret. Optim., 2005

Equipartitions of Measures by 2-Fans.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

Enumerating pseudo-triangulations in the plane.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Curvature-bounded traversals of narrow corridors.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Certifying and constructing minimally rigid graphs in the plane.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Guarding a terrain by two watchtowers.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

RNA Multiple Structural Alignment with Longest Common Subsequences.

[BibT_eX]

[DOI]

Binhai Zhu

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Constructing Phylogenetic Networks from Trees.

[BibT_eX]

[DOI]

Kathryn Bean

Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005

2004

Dynamic Algorithms for Approximating Interdistances.

[BibT_eX]

Nord. J. Comput., 2004

Selecting distances in arrangements of hyperplanes spanned by points.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

Transforming pseudo-triangulations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Cylindrical hierarchy for deforming necklaces.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2004

Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.

[BibT_eX]

[DOI]

Algorithmica, 2004

A Conjecture on Wiener Indices in Combinatorial Chemistry.

[BibT_eX]

[DOI]

Yih-En Andrew Ban

Nabil H. Mustafa

Algorithmica, 2004

Contour interpolation with bounded dihedral angles.

[BibT_eX]

[DOI]

Binhai Zhu

Proceedings of the Ninth ACM Symposium on Solid Modeling and Applications, 2004

Reconstruction of gt-Networks from Gene Trees.

[BibT_eX]

Proceedings of the International Conference on Mathematics and Engineering Techniques in Medicine and Biological Scienes, 2004

Encoding Homotopy of Paths in the Plane.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

New Bounds on Map Labeling with Circular Labels.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

The fitting line problem in the laguerre geometry.

[BibT_eX]

[DOI]

Francois Anton

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Algorithms for shortest paths and d-cycle problems.

[BibT_eX]

[DOI]

Andrei V. Kelarev

J. Discrete Algorithms, 2003

An Algorithm for Analysis of Images in Spatial Information Systems.

[BibT_eX]

[DOI]

Andrei V. Kelarev

J. Autom. Lang. Comb., 2003

Computing homotopic shortest paths in the plane.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Computing Closest Points for Segments.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2003

An O(nlogn) algorithm for the zoo-keeper's problem.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Approximating the geometric minimum-diameter spanning tree.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Efficient algorithms for centers and medians in interval and circular-arc graphs.

[BibT_eX]

[DOI]

J. Mark Keil

Networks, 2002

An Optimal Morphing Between Polylines.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2002

An efficient algorithm for enumeration of triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2002

Packing two disks in a polygon.

[BibT_eX]

[DOI]

Comput. Geom., 2002

Fast Algorithms for Approximating Distances.

[BibT_eX]

[DOI]

Algorithmica, 2002

Constrained Equitable 3-Cuttings.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

On Partitioning a Cake.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Lower and Upper Bounds for Tracking Mobile Users.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001

An Efficient Algorithm for the Three-Dimensional Diameter Problem.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

Fast Maintenance of Rectilinear Centers.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2001, 2001

Enumerating Triangulations of Convex Polytopes.

[BibT_eX]

[DOI]

Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

On the Planar Two-Watchtower Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Enumerating longest increasing subsequences and patience sorting.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Covering a set of points by two axis-parallel boxes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Optimal Facility Location Under Various Distance Functions.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2000

Generalizing Ham Sandwich Cuts to Equitable Subdivisions.

[BibT_eX]

[DOI]

Jack Snoeyink

Discret. Comput. Geom., 2000

Queries with segments in Voronoi diagrams.

[BibT_eX]

[DOI]

Jack Snoeyink

Comput. Geom., 2000

Mobile facility location.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000), 2000

1999

Rectilinear Static and Dynamic Discrete 2-center Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Optimal Facility Location under Various Distance Functions.

[BibT_eX]

[DOI]

Klara Kedem

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Rectilinear 2-center problems.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

An Optimal Algorithm for Closest-Pair Maintenance.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

1997

On Constructing Minimum Spanning Trees in Rkl.

[BibT_eX]

[DOI]

Algorithmica, 1997

1996

Dynamic Algorithms for Approximate Neighbor Searching.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

An Optimal Algorithm for Closest Pair Maintenance (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

The Region Approach for some Dynamic Closest-Point Problems.

[BibT_eX]