
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...
read it

Finding a Maximum Clique in a Grounded 1Bend String Graph
A grounded 1bend string graph is an intersection graph of a set of poly...
read it

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...
read it

Polygon Simplification by Minimizing Convex Corners
Let P be a polygon with r>0 reflex vertices and possibly with holes and ...
read it

Boundary Labeling for Rectangular Diagrams
Given a set of n points (sites) inside a rectangle R and n points (label...
read it

Swapping Colored Tokens on Graphs
We investigate the computational complexity of the following problem. We...
read it
J. Mark Keil
is this you? claim profile