research
∙
03/14/2023
Finding a Maximum Clique in a Disk Graph
A disk graph is an intersection graph of disks in the Euclidean plane, w...
share
research
∙
09/26/2022
Improved and Generalized Algorithms for Burning a Planar Point Set
Given a set P of points in the plane, a point burning process is a discr...
research
∙
08/12/2022
Minimum Ply Covering of Points with Unit Squares
Given a set P of points and a set U of axis-parallel unit squares in the...
research
∙
05/10/2022
Burning Number for the Points in the Plane
The burning process on a graph G starts with a single burnt vertex, and ...
research
∙
08/27/2021
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
Chvátal and Klincsek (1980) gave an O(n^3)-time algorithm for the proble...
research
∙
07/12/2021
Finding a Maximum Clique in a Grounded 1-Bend String Graph
A grounded 1-bend string graph is an intersection graph of a set of poly...
research
∙
03/17/2019
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives
A graph G with n vertices is called an outerstring graph if it has an in...
research
∙
12/13/2018
Polygon Simplification by Minimizing Convex Corners
Let P be a polygon with r>0 reflex vertices and possibly with holes and ...
research
∙
03/28/2018
Boundary Labeling for Rectangular Diagrams
Given a set of n points (sites) inside a rectangle R and n points (label...
research
∙
03/19/2018
