J. Keil

activity

20182024

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.CG2021

Bottleneck Convex Subsets: Finding $k$ Large Convex Sets in a Point Set

Stephane Durocher, J. Mark Keil, Saeed Mehrabi +1

Chvátal and Klincsek (1980) gave an $O (n^{3})$ -time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane.…

cs.CG2021

Finding a Maximum Clique in a Grounded 1-Bend String Graph

J. Mark Keil, Debajyoti Mondal, Ehsan Moradi +1

A grounded 1-bend string graph is an intersection graph of a set of polygonal lines, each with one bend, such that the lines lie above a common horizontal line $ℓ$ and have exac…

Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set

Finding a Maximum Clique in a Grounded 1-Bend String Graph

Bottleneck Convex Subsets: Finding $k$ Large Convex Sets in a Point Set