Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope.

Ioannis Koutis Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope. 8-13 2006 100 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2006.05.006 db/journals/ipl/ipl100.html#Koutis06