I am interested in algorithmic and structural aspects of planar graphs. I studied extensively problems related to shortest paths, cuts and flows in planar graphs. I am also interested in stringology (algorithms on strings) and in the relation between some probelms in stringology and in planar graphs. My work often involves designing data structures that support the structural and algorithmic insights, and developing (conditional) lower bounds that complement the algorithmic results.
A smaller portion of my work deals with approximations for hard problems.