Work Experience

advertisement
Curriculum Vitae
Kostas Tsioutsiouliklis
Contact
E-mail:
Webpage:
kt@cs.princeton.edu
http://www.cs.princeton.edu/~kt
Work Experience
May ’04 – present:
Senior Engineering Manager
(Apr ’08 – Mar ’09: Principal Research Engineer)
(Dec ’06 – July ‘07: Engineering Manager)
(May ‘04 – Nov ‘06: Technical Yahoo – Sr. Engineer)
Yahoo! Labs, Yahoo Search Technology
Yahoo! Inc., Sunnyvale, CA
June ’00 – May ‘04:
Scientist
(June ’00 – July ’02: Full-time intern)
Computer Science Division, Web Technology Group
NEC Laboratories America, Princeton, NJ
Sept. ’96 – Jan. ’98:
Part-time Teaching Assistant
Princeton University, Princeton, NJ
Part-time Operator and Data Base Administrator
Computer Technology Institute (CTI), Patras, Greece
Sept. ’93 – June ’96:
Education
Sept. ’98 – June ’02:
Ph.D. in Computer Science
Princeton University, Princeton, NJ
Title of thesis: Maximum Flow Techniques for Network
Clustering
Advisor: Robert E. Tarjan
Sept. ’96 – Sept. ’98:
M.A. in Computer Science
Princeton University, Princeton, NJ
Sept. ’91 – June ’96:
Bachelor’s in Computer Engineering and Informatics
Technical University of Patras, Greece
Thesis: Comparative Study of Models of Parallel Computation
Publications
Conferences and journals


H. Han, E. Manavoglou, H. Zha, K. Tsioutsiouliklis, C.L. Giles, Rule-based Word
Clustering for Document Metadata Extraction, to appear in Proceedings of the 20 th
Annual ACM Symposium on Applied Computing Special Track on Information Access
and Retrieval (SAC-IAR’05), 2005.
G.W. Flake, R.E. Tarjan, and K. Tsioutsiouliklis, Graph Clustering and Minimum Cut
Trees, to appear in Journal of Internet Mathematics.









G. Pant, K. Tsioutsiouliklis, J. Johnson, and C.L. Giles, Panorama: Extending Digital
Libraries with Topical Crawlers, to appear in Proceeding of ACM/IEEE Joint Conference
on Digital Libraries (JCDL 2004), Tucson, Arizona, June 7-11, 2004.
H. Han, C.L. Giles, H. Zha, C. Li, and K. Tsioutsiouliklis. Two Supervised Learning
Approaches for Name Disambiguation in Author Citations, to appear in Proceedings of
ACM/IEEE Joint Conference on Digital Libraries (JCDL 2004), Tucson Arizona, June 711, 2004.
G.W. Flake, K. Tsioutsiouliklis, L. Zhukov, Methods for Mining Web Communities:
Bibliometric, Spectral, and Flow. Book chapter in Web Dynamics, Springer Verlag. To
appear.
J. Johnson, K. Tsioutsiouliklis, C.L. Giles, Evolving Strategies for Focused Web
Crawlering. Proc. of the 20th International Conference on Machine Learning (ICML),
Washington, DC, 2003.
M. Hindman, K. Tsioutsiouliklis, J.A. Johnson, “Googlearchy”: How a Few Heavily-Linked
Sites Dominate Politics on the Web, Annual Meeting of the Midwest Political Science
Association, Chicago, IL, April 3-6 2003.
E. Glover, K. Tsioutsiouliklis, S. Lawrence, D. Pennock, G.W. Flake, Using Web Structure
for Classifying and Describing Web Pages, 11th International World Wide Web
Conference, 2002.
H. Kaplan, R.E. Tarjan, K. Tsioutsiouliklis, Faster Kinetic Heaps and Their Use in
Broadcast Scheduling, Proc. 12th ACM-SIAM Symposium on Discrete Algorithms
(SODA), 2001.
A.V. Goldberg and K. Tsioutsiouliklis, Cut tree algorithms: an experimental study, ACM
Journal of Algorithms. 38 (2001), no. 1, 51--83.
A.V. Goldberg, K. Tsioutsiouliklis, Cut Tree Algorithms, Proc. 10th ACM-SIAM
Symposium on Discrete Algorithms (SODA), 1999.
Presentations at conferences and workshops
 J. Johnson, M.R. Miller, K. Tsioutsiouliklis, An Efficient Scalable Web Collection System:
A Case Study on the Adult Web, Workshop on Defining Evaluation Methodologies for
Terabyte-Scale Collections, Toronto, Canada, 2003. (Held in conjunction with the 26 th
International ACM SIGIR 2003.)
 G.W. Flake, R.E. Tarjan, K. Tsioutsiouliklis, Minimum Cut Tree Clustering, First
Workshop on Algorithms and Models for the Web-Graph (WAW 2002), Vancouver,
Canada, 2002. (Held in conjunction with IEEE Symposium on Foundations of Computer
Science -- FOCS 2002).
 G.W. Flake, K. Tsioutsiouliklis, S. Lawrence, Minimum Cut Clustering, The Learning
Workshop, Snowbird, Utah, April 10-13 2001.
Scholarships



September ’96 – June ’01: Full scholarship from Princeton University for graduate
studies.
Summer ’97 and ’99: Two DIMACS graduate student fellowships for research in data
structures and algorithms.
Academic years ’92 and ’93: Two scholarships from the National Scholarship Foundation
of Greece during my studies at the Department of Computer Engineering and Informatics
at the Technical University of Patras.
References available upon request
Download