Address: Via Giuseppe Buffi 13, Lugano, CH-6900
Tel: +41 58 666 41 22
Fax: +41 58 666 45 36
Curriculum Vitae: (PDF)
My research interests span the area of algorithms, computational geometry, applied geometry, data structures, and algorithmic aspects of problems emerging in applications areas especially problems with a geometric flavor. My recent research activity has been a combination of Design and Analysis of Algorithms, Computational Geometry, Implementation of Algorithms, and VLSI Computer-Aided Design. I have addressed problems in VLSI Design Automation for Manufacturing (DFM) such as yield prediction, critical area extraction, subresolution assist feature (SRAF) placement, using concepts from the theory of algorithms and computational geometry. I have worked extensively with generalized Voronoi diagrams such as Voronoi diagrams of polygonal objects, higher order Voronoi diagrams, the Hausdorff Voronoi diagram, and I have used them to build industrial VLSI CAD tools that address DFM issues in practice.
I obtained my Ph.D. from Northwestern University, Evanston, Illinois, in December 1995. In 1996 I joined the IBM T. J. Watson Research Center in Yorktown Heights, New York, initially as a Postdoctoral Research Fellow (1996-1998) and later as a Research Staff Member from 1998 through 2008. I have also been affiliated with the Computer Science department at the Athens University of Economics and Business, Greece. While at IBM I introduced generalized Voronoi diagrams of polygonal objects in the area of VLSI DFM - Design Automation for Manufacturability, as a basic tool to address Critical Area Analysis and other DFM related VLSI issues. For my work on "Voronoi based Critical Area Analysis" I received the IBM Outstanding Innovation Award, August 2006, and an IBM rating of Technical Accomplishment, December 2006. This work is now in production mode and it is being widely used by IBM Microelectronics. In September 2008 I joined the Faculty of Informatics at University of Lugano, where I am currently an Associate Professor.