Spring 2017

Title	Type
Depth with respect to a family of convex sets	Page
Efficient Algorithms for Computing Transportation Maps	Page
Toward Natural Human-Robot Collaboration	Page
Random Sampling and the Vector in Subspace Problem	Page
Maximum Scatter TSP in doubling metrics	Page
Minkowski Sums of Polyhedra with Holes	Page
Effective Metrics for Multi-Robot Motion-Planning	Page
On Danzers four points theorem	Page
The planar separator strikes back: exact, approximate and quasi polynomial algorithms	Page
Voronoi diagrams, diameter and distance oracles for planar graphs	Page
Conflict-Free Coloring of Intersection Graphs of Geometric Objects	Page
Incidences & Co. (a love story between discrete objects)	Page
Near optimal algorithms in the linear decision tree model for k-SUM and related problems: The Kane-Lovett-Moran paper	Page
Micha's slides on the KLM (Kane-Lovett-Moran) paper	File