Haitao Wang

CoRR, June, 2025

Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex Position.

[BibT_eX]

[DOI]

Anastasiia Tkachenko

CoRR, January, 2025

Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex Position.

[BibT_eX]

[DOI]

Anastasiia Tkachenko

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Dynamic Unit-Disk Range Reporting.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

An Optimal Algorithm for Half-plane Hitting Set.

[BibT_eX]

[DOI]

Proceedings of the 2025 Symposium on Simplicity in Algorithms, 2025

Standard Gaussian Process is All You Need for High-Dimensional Bayesian Optimization.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs.

[BibT_eX]

[DOI]

Bruce W. Brewer

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

A Deterministic Partition Tree and Applications.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Algorithms for Computing Closest Points for Segments.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

On Line-Separable Weighted Unit-Disk Coverage and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Optimal Algorithm for the Planar Two-Center Problem.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Dynamic Convex Hulls for Simple Paths.

[BibT_eX]

[DOI]

Bruce W. Brewer

Gerth Stølting Brodal

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Algorithms for Halfplane Coverage and Related Problems.

[BibT_eX]

[DOI]

Jie Xue

Proceedings of the 40th International Symposium on Computational Geometry, 2024

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs.

[BibT_eX]

Bruce W. Brewer

Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

2023

Geometric Hitting Set for Line-Constrained Disks and Related Problems.

[BibT_eX]

[DOI]

CoRR, 2023

An optimal algorithm for L1 shortest paths in unit-disk graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2023

Dynamic Convex Hulls Under Window-Sliding Updates.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Geometric Hitting Set for Line-Constrained Disks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

On the Line-Separable Unit-Disk Coverage and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Improved Algorithms for Distance Selection and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Reverse Shortest Path Problem in Weighted Unit-Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

Unit-Disk Range Searching and Applications.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines.

[BibT_eX]

[DOI]

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Constructing Many Faces in Arrangements of Lines and Segments.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Computing the Minimum Bottleneck Moving Spanning Tree.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

An O(nlog n)-Time Algorithm for the k-Center Problem in Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2021

Reverse Shortest Path Problem for Unit-Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Algorithms for the Line-Constrained Disk Coverage and Related Problems.

[BibT_eX]

[DOI]

Logan Pedersen

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

A new algorithm for Euclidean shortest paths in the plane.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Shortest Paths Among Obstacles in the Plane Revisited.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Algorithms for Covering Barrier Points by Mobile Sensors with Line Constraint.

[BibT_eX]

Princy Jain

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

An Optimal Algorithm for L1 Shortest Paths in Unit-Disk Graphs.

[BibT_eX]

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

A Divide-and-Conquer Algorithm for Two-Point L1 Shortest Path Queries in Polygonal Domains.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2020

Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

On the Planar Two-Center Problem and Circular Hulls.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Pathsin a Metric Space.

[BibT_eX]

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

2019

L1 shortest path queries in simple polygons.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Separating overlapped intervals on a line.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

On Top-k Weighted Sum Aggregate Nearest and Farthest Neighbors in the L1 Plane.

[BibT_eX]

[DOI]

Wuzhou Zhang

Int. J. Comput. Geom. Appl., 2019

A Divide-and-Conquer Algorithm for Two-Point L1 Shortest Path Queries in Polygonal Domains.

[BibT_eX]

[DOI]

CoRR, 2019

Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane.

[BibT_eX]

[DOI]

Algorithmica, 2019

A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space.

[BibT_eX]

[DOI]

Christopher Johnson

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points.

[BibT_eX]

[DOI]

Jie Xue

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.

[BibT_eX]

[DOI]

Jie Xue

Proceedings of the 35th International Symposium on Computational Geometry, 2019

A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Near-linear time approximation schemes for geometric maximum coverage.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Computing the Rectilinear Center of Uncertain Points in the Plane.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2018

L1 Shortest Path Queries in Simple Polygons.

[BibT_eX]

[DOI]

CoRR, 2018

An O(n log n)-Time Algorithm for the k-Center Problem in Trees.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

On the Coverage of Points in the Plane by Disks Centered at a Line.

[BibT_eX]

[DOI]

Logan Pedersen

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Minimizing the Maximum Moving Cost of Interval Coverage.

[BibT_eX]

[DOI]

Victor C. S. Lee

Xiao Zhang

Int. J. Comput. Geom. Appl., 2017

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.

[BibT_eX]

[DOI]

Matias Korman

Joseph S. B. Mitchell

Yoshio Okamoto

Valentin Polishchuk

Discret. Comput. Geom., 2017

Linear Time Approximation Schemes for Geometric Maximum Coverage.

[BibT_eX]

[DOI]

CoRR, 2017

Improved Algorithms For Structured Sparse Recovery.

[BibT_eX]

[DOI]

CoRR, 2017

Covering Uncertain Points in a Tree.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Algorithms for Covering Multiple Barriers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

k-Regret Minimizing Set: Efficient Algorithms and Hardness.

[BibT_eX]

[DOI]

Raymond Chi-Wing Wong

Wei Zhan

Proceedings of the 20th International Conference on Database Theory, 2017

Quickest Visibility Queries in Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Geometric Range Search on Encrypted Spatial Data.

[BibT_eX]

[DOI]

Boyang Wang

Ming Li

IEEE Trans. Inf. Forensics Secur., 2016

A note on computing the center of uncertain data on the real line.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2016

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.

[BibT_eX]

[DOI]

Matias Korman

Joseph S. B. Mitchell

Yoshio Okamoto

Valentin Polishchuk

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Dispersing Points on Intervals.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

On the Geodesic Centers of Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

epsilon-Kernel Coresets for Stochastic Points.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Efficient algorithms for the one-dimensional k-center problem.

[BibT_eX]

[DOI]

Danny Ziyi Chen

Theor. Comput. Sci., 2015

Balanced splitting on weighted intervals.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

A new algorithm for computing visibility graphs of polygonal obstacles in the plane.

[BibT_eX]

[DOI]

J. Comput. Geom., 2015

Aggregate-MAX Top-k Nearest Neighbor Searching in the L1 Plane.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2015

Computing the L1 geodesic diameter and center of a simple polygon in linear time.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Computing the Center of Uncertain Points on Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Minimizing the Aggregate Movements for Interval Coverage.

[BibT_eX]

[DOI]

Aaron M. Andrews

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Segmenting subcellular structures in histology tissue images.

[BibT_eX]

[DOI]

Jiazhuo Wang

John D. MacKenzie

Rageshree Ramachandran

Yizhe Zhang

Danny Ziyi Chen

Proceedings of the 12th IEEE International Symposium on Biomedical Imaging, 2015

Minimizing the Maximum Moving Cost of Interval Coverage.

[BibT_eX]

[DOI]

Xiao Zhang

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

An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Valentin Polishchuk

Mikko Sysikaski

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Linear Time Approximation Schemes for Geometric Maximum Coverage.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Circular range search on encrypted spatial data.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Communications and Network Security, 2015

Algorithms for Minimizing the Movements of Spreading Points in Linear Domains.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

$ε$-Kernel Coresets for Stochastic Points.

[BibT_eX]

[DOI]

Jeff M. Phillips

CoRR, 2014

Two-Point L1 Shortest Path Queries in the Plane.

[BibT_eX]

[DOI]

Rajasekhar Inkulu

CoRR, 2014

New Algorithms for Facility Location Problems on the Real Line.

[BibT_eX]

[DOI]

Algorithmica, 2014

Tree-Based Multi-dimensional Range Search on Encrypted Data with Enhanced Privacy.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Security and Privacy in Communication Networks, 2014

Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Line-Constrained k -Median, k -Means, and k -Center Problems in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Range Queries on Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Quell.

[BibT_eX]

[DOI]

Minghui Jiang

Pedro J. Tejada

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Two-Point L1 Shortest Path Queries in the Plane.

[BibT_eX]

[DOI]

Rajasekhar Inkulu

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

One-Dimensional k-Center on Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Shortest Color-Spanning Intervals.

[BibT_eX]

[DOI]

Minghui Jiang

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Maple: scalable multi-dimensional range search over encrypted cloud data with tree-based index.

[BibT_eX]

[DOI]

Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security, 2014

The τ-Skyline for Uncertain Data.

[BibT_eX]

[DOI]

Wuzhou Zhang

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Computing Shortest Paths amid Convex Pseudodisks.

[BibT_eX]

[DOI]

John Hershberger

SIAM J. Comput., 2013

A note on searching line arrangements and applications.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Efficient Algorithms for One-Dimensional k-Center Problems

[BibT_eX]

[DOI]

CoRR, 2013

Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.

[BibT_eX]

[DOI]

CoRR, 2013

Approximating Points by a Piecewise Linear Function.

[BibT_eX]

[DOI]

Algorithmica, 2013

Visibility and Ray Shooting Queries in Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

L_1 Shortest Path Queries among Polygonal Obstacles in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Minmax Regret 1-Facility Location on Uncertain Path Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Matroid and Knapsack Center Problems.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Computing shortest paths among curved obstacles in the plane.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

Aggregate-Max Nearest Neighbor Searching in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Fitting a Step Function to a Point Set with Outliers Based on Simplicial thickness Data Structures.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2012

The L1 Nearest Neighbor Searching with Uncertain Queries

[BibT_eX]

[DOI]

Wuzhou Zhang

CoRR, 2012

Computing L1 Shortest Paths among Polygonal Obstacles in the Plane

[BibT_eX]

[DOI]

CoRR, 2012

An improved algorithm for reconstructing a simple polygon from its visibility angles.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Detecting and Tracking Motion of Myxococcus xanthus Bacteria in Swarms.

[BibT_eX]

[DOI]

Proceedings of the Medical Image Computing and Computer-Assisted Intervention - MICCAI 2012, 2012

Weak Visibility Queries of Line Segments in Simple Polygons.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Optimal Point Movement for Covering Circular Regions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Computing the Visibility Polygon of an Island in a Polygonal Domain.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Computing Maximum Non-crossing Matching in Convex Bipartite Graphs.

[BibT_eX]

[DOI]

Xiaomin Liu

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Improved algorithms for path partition and related problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

New algorithms for online rectangle filling with k-lookahead.

[BibT_eX]

[DOI]

Amitabh Chaudhary

J. Comb. Optim., 2011

New Algorithms for 1-D Facility Location and Path Equipartition Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Computing Shortest Paths amid Pseudodisks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Outlier Respecting Points Approximation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Efficient Algorithms for the Weighted k-Center Problem on a Real Line.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

The Topology Aware File Distribution Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

Representing a Functional Curve by Curves with Fewer Peaks.

[BibT_eX]

[DOI]

Chao Wang

Proceedings of the Algorithm Theory, 2010

Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

Locating an Obnoxious Line among Planar Objects.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Approximating Points by a Piecewise Linear Function: I.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Processing an Offline Insertion-Query Sequence with Applications.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008

New Algorithms for Online Rectangle Filling with k-Lookahead.

[BibT_eX]

[DOI]

Amitabh Chaudhary

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

2007

Online Rectangle Filling.

[BibT_eX]

[DOI]

Amitabh Chaudhary

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

2006

An Improved Algorithm for Finding the Closest Pair of Points.

[BibT_eX]

[DOI]

Qi Ge