Ilias Diakonikolas

I am a theory student at Columbia University. My advisor is Mihalis Yannakakis.

I did my undergraduate studies in the school of Electrical and Computer Engineering at the National Technical University of Athens, Greece.

I am mainly interested in approximation algorithms. My thesis work is focused on approximating multiobjective optimization problems.

I also have strong interests in computational learning theory, property testing, hardness of approximation, and analysis of boolean functions.

Publications:

· Optimally Approximating Weighted Majority Functions
I. Diakonikolas, R. Servedio.
Manuscript, 2008.

· Efficient Succinct Approximation of Convex Pareto Curves
I. Diakonikolas, M. Yannakakis.
Manuscript, 2008.

· Efficiently Testing Sparse GF(2) Polynomials
I. Diakonikolas, H. Lee, K. Matulef, R. Servedio, A. Wan.
ICALP 2008. [extended abstract (pdf)] [arXiv]

· Succinct Approximate Convex Pareto Curves
I. Diakonikolas, M. Yannakakis.
SODA 2008. [extended abstract (pdf)] [full version in preparation]

· Testing For Concise Representations
I. Diakonikolas, H. Lee, K. Matulef, K. Onak, R. Rubinfeld, R. Servedio, A. Wan.
FOCS 2007. [extended abstract (pdf)] [ECCC Report 2007]

· Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
I. Diakonikolas, M. Yannakakis.
APPROX 2007. [extended abstract (pdf)] [full version (pdf)] [arXiv]

· Optimal Node Placement for Path Disjoint Network Monitoring
L. Breslau, I. Diakonikolas, N. Duffield, Y. Gu, M. Hajiaghayi, D.S. Johnson, H. Karloff, M. Resende, S. Sen .
Submitted, 2008.

Contact Information:

Department of Computer Science
Columbia University
469 Computer Science Building
New York, NY 10027

phone: 646-775-6029
email should be obvious from this url