research
∙
02/24/2022
Removing Popular Faces in Curve Arrangements
A face in a curve arrangement is called popular if it is bounded by the ...
share
research
∙
02/13/2020
An almost optimal bound on the number of intersections of two simple polygons
What is the maximum number of intersections of the boundaries of a simpl...
research
∙
11/12/2019
FPT Algorithms for Diverse Collections of Hitting Sets
In this work, we study the d-Hitting Set and Feedback Vertex Set problem...
research
∙
05/27/2019
The Largest Contained Quadrilateral and the Smallest Enclosing Parallelogram of a Convex Polygon
We present a linear-time algorithm for finding the quadrilateral of larg...
research
∙
05/27/2019
The Largest Quadrilateral in a Convex Polygon
We present a simple linear-time algorithm for finding the quadrilateral ...
research
∙
03/11/2019
Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results
A tree with n vertices has at most 95^n/13 minimal dominating sets. The ...
research
∙
02/11/2019
Geometric Multicut
We study the following separation problem: Given a collection of colored...
research
∙
10/24/2018
Approximate Minimum-Weight Matching with Outliers under Translation
Our goal is to compare two planar point sets by finding subsets of a giv...
research
∙
11/13/2017
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
A bipartite graph G=(U,V,E) is convex if the vertices in V can be linear...
research
∙
08/24/2017
