Ming-Yang Kao Department of Electrical Engineering and Computer Science Northwestern University 2145 Sheridan Road, Room M324 Evanston, IL 60208 (o) 847-230-9867 kao@northwestern.edu www.cs.northwestern.edu/~kao (last updated 1/2/2012)

Experience: o Current Positions: o Professor of Computer Science o Member of the Theoretical Computer Science Group o Head of the EECS Division of Computing, Algorithms, and Applications o Education: o B.S. in Mathematics, 1978, National Taiwan University, Republic of China (Taiwan) o Ph.D. in Computer Science, 1986, Yale University, U.S.A. Research and Service: My primary research interest is in algorithms and their applications. I am attracted to any problem that has significant algorithmic substance. o Current Main Efforts: o Algorithm Areas: Discrete Algorithms and Combinatorial Optimization. o Application Areas: DNA Self-Assembly, Computational Finance, Bioinformatics. o Publications: A Publication List; AMS MathSciNet; DBLP Bibliography. o Editorial Services: Among my editorial works, I serve as Editor-in-Chief of Algorithmica. Please submit your original work directly to your preferred editor through the Algorithmica online submission system. Proposals for special issues are most welcome and should be emailed directly to me. Teaching: I teach a range of courses, including the following. Also, I enjoy working with both undergraduate students and graduate students on research as project courses or as non-course research collaborations. o For the 2011-2012 academic year, 1. EA 1: Engineering Analysis I, Fall 2011 (10:00-10:50, MTuWF) 2. EECS 336: Design and Analysis of Algorithms, Winter 2012 (2:00-3:20, TuTh) o For the previous four years, 1. EECS 101: An Introduction of Computer Science for Everyone, Spring, 2011 (3:30-4:50 TuTh) 2. EECS 510: Algorithmic DNA Self-Assembly, Spring 2011, Spring 2011 (2:00-3:20, WF) 3. EECS 395/495: Algorithmic Techniques for Bioinformatics, Fall 2010 (2:00-3:20 TuTh) 4. EECS 328: Numerical Methods for Engineers, Spring 2009 (3:00-3:50, MWF) 5. EECS 395: Approximation Algorithms, Spring 2007 (4:00-5:15 MWF, twice weekly) 6. EECS 395: Algorithmic Research for E-Commerce, Winter 2007 (4:00-5:15 MWF, twice weekly)