research
∙
08/22/2023
Finding Small Complete Subgraphs Efficiently
(I) We revisit the algorithmic problem of finding all triangles in a gra...
share
research
∙
06/20/2023
Observation Routes and External Watchman Routes
We introduce the Observation Route Problem () defined as follows: Given ...
research
∙
04/07/2023
Maximal Distortion of Geodesic Diameters in Polygonal Domains
For a polygon P with holes in the plane, we denote by ϱ(P) the ratio bet...
research
∙
02/15/2023
Two-sided convexity testing with certificates
We revisit the problem of property testing for convex position for point...
research
∙
11/11/2022
Peeling Sequences
Given an n-element point set in the plane, in how many ways can it be pe...
research
∙
05/06/2022
Finding Points in Convex Position in Density-Restricted Sets
For a finite set A⊂ℝ^d, let Δ(A) denote the spread of A, which is the ra...
research
∙
04/21/2022
Lattice and Non-lattice Piercing of Axis-Parallel Rectangles: Exact Algorithms and a Separation Result
For a given family of shapes ℱ in the plane, we study what is the lowest...
research
∙
06/14/2021
Piercing All Translates of a Set of Axis-Parallel Rectangles
For a given shape S in the plane, one can ask what is the lowest possibl...
research
∙
05/04/2021
Finding Triangles or Independent Sets
(I) We revisit the algorithmic problem of finding all triangles in a gra...
research
∙
04/12/2020
Multiparty Selection
Given a sequence A of n numbers and an integer (target) parameter 1≤ i≤ ...
research
∙
02/18/2020
Sparse Hop Spanners for Unit Disk Graphs
A unit disk graph G on a given set of points P in the plane is a geometr...
research
∙
12/03/2019
On the Shortest Separating Cycle
According to a result of Arkin (2016), given n point pairs in the plane...
research
∙
06/24/2019
On the Stretch Factor of Polygonal Chains
Let P=(p_1, p_2, ..., p_n) be a polygonal chain. The stretch factor of P...
research
∙
01/25/2019
Finding a Mediocre Player
Consider a totally ordered set S of n elements; as an example, a set of ...
research
∙
12/29/2018
Convex Polygons in Cartesian Products
We study several problems concerning convex polygons whose vertices lie ...
research
∙
09/10/2018
New Lower Bounds for the Number of Pseudoline Arrangements
Arrangements of lines and pseudolines are fundamental objects in discret...
research
∙
12/08/2017
On the Longest Spanning Tree with Neighborhoods
We study a maximization problem for geometric network design. Given a se...
research
∙
08/08/2017
