Langi Zsolt:

An algorithm to find maximum area polygons circumscribed about a convex polygon

Abstract: 
A convex polygon Q is circumscribed about a convex polygon P if every vertex 
of P lies on at least one side of Q. We present an algorithm for finding a 
maximum area convex polygon circumscribed about any given convex n-gon in 
O(n^3) time. As an application, we disprove a conjecture of Farris. 
The presented results are joint work with M. Ausserhofer, S. Dann and G. Toth.