After several wonderful years at EPFL (with Janos Pach) and Max-Planck Institute (with Kurt Mehlhorn), I am currently a Professor at ESIEE Paris and member of LIGM.

I completed my Habilitation (HDR) at Université Paris-Est in 2013, which can be downloaded here.

I graduated with MS and PhD from Duke University in 2004, where I had the good fortune to have Pankaj Agarwal as my advisor.

Things I do with my time

Research: algorithms, computational geometry, combinatorics, and computer graphics.

Papers (DBLP) can be downloaded here. A sampling of some recent work:

Optimal Bounds on VC dimension of Geometric Set Systems. Journal of Machine Learning Research (JMLR), 2019.

Theorems of Caratheodory, Tverberg and Helly without Dimension. SODA, 2019.

A Simple Proof of Optimal Epsilon-Nets. Combinatorica, 2018.

Limits of Local Search: Quality and Efficiency. Discrete & Computational Geometry, 2017.

On the Zarankiewicz Problem for Intersection Hypergraphs. Journal of Combinatorial Theory, Series A (JCTA), 2016.

IlluminationCut. Eurographics, 2015.

Settling the APX-hardness for Geometric Set-Cover. FOCS, 2014.

Other technical activities such as expository writings, presentations here.

Teaching

My teaching for the past several years has included computer science theory courses (algorithms, complexity theory, computational geometry) as well as math courses (discrete mathematics, combinatorics, topology) as well as more technology and programming-oriented courses (GPU programming, OpenGL on Android devices, computer graphics, geometric modeling).