research
∙
03/02/2023
Geometric Spanning Trees Minimizing the Wiener Index
The Wiener index of a network, introduced by the chemist Harry Wiener, i...
share
research
∙
02/21/2023
Dynamic Euclidean Bottleneck Matching
A fundamental question in computational geometry is for a set of input p...
research
∙
09/22/2022
Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree
Let P be a set of points in the plane and let T be a maximum-weight span...
research
∙
12/11/2021
Piercing Pairwise Intersecting Geodesic Disks by Five Points
Given a simple polygon P on n vertices, and a set D of m pairwise inters...
research
∙
12/10/2020
A Linear-Time Algorithm for Minimum k-Hop Dominating Set of a Cactus Graph
Given a graph G=(V,E) and an integer k ≥ 1, a k-hop dominating set D of ...
research
∙
04/19/2020
Planar Bichromatic Bottleneck Spanning Trees
Given a set P of n red and blue points in the plane, a planar bichromati...
research
∙
04/19/2020
