Christopher S. Helvig Research Assistant in Computer Science Department of Computer Science University of Virginia Charlottesville, VA 22903-2442, USA csh5t@cs.virginia.edu http://www.cs.virginia.edu/~csh5t/ (804) 984-6276 Office: 235 Olsson Hall, UVA

Education

• M.S. in Computer Science, University of Virginia, 1998

• B.S. in Mathematical Sciences with Computer Science Option, UNC Chapel Hill , 1995

Honors and Awards

• Graduated with Honors from UNC Chapel Hill , 1995

• Dean's list

Experience

• Graduate Research Assistant, Department of Computer Science, University of Virginia (8/96 to present): I worked in the field computer aided design of very large scale integrated chips (VLSI CAD) and computational geometry developing algorithms to solve variants of the well-known Steiner tree problem and Traveling Salesman problem.

• Graduate Teaching Assistant, Department of Computer Science, University of Virginia (8/96 to 5/97): I taught lab sections for a second-semester C++ course, and I gave lectures and graded for a Usability Engineering course.

• Undergraduate Research Assistant, Department of Computer Science, UNC Chapel Hill (4/93 to 5/96): I worked in the field of computer vision, running experiments to determine the effect of geometry on human proficiency at detecting stenoses (narrowings) in angiograms (blood vessel images) with the goal of reducing error rates in radiology.

Membership in Professional Societies

• Association for Computing Machinery (ACM)

• ACM Special Interest Group on Design Automation (SIGDA)

Refereed Journal Papers

• C. S. Helvig, G. Robins, and A. Zelikovsky, New Approximation Algorithms for Routing with Multi-Port Terminals, to appear in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

Refereed Conference Papers

1. J.P. Rolland, K. Muller, and C. S. Helvig, Visual Search in Medical Images: A New Methodology to Quantify Saliency , Proc. SPIE 2436, 1995, 40-48.

2. J.P. Rolland and C. S. Helvig, Visual Search in Angiograms: Does geometry play a role in saliency? , Proc. SPIE 2712, 1996, 78-88.

3. C. D. Bateman, C. S. Helvig, G. Robins, and A. Zelikovsky, Provably-Good Routing Tree Construction with Multi-Port Terminals, ACM/SIGDA International Symposium on Physical Design, Napa Valley, CA, April, 1997, pp. 96-102.

4. C. S. Helvig, G. Robins, and A. Zelikovsky, Improved Approximation Bounds for the Group Steiner Problem, Proc. Conference on Design Automation and Test in Europe, Paris, France, February, 1998, pp. 406-413.

5. C. S. Helvig, G. Robins, and A. Zelikovsky, Moving-Target TSP and Related Problems, to appear in European Symposium on Algorithms, Venice, Italy, August, 1998.

Technical Reports

1. C. D. Bateman, C. S. Helvig, G. Robins, and A. Zelikovsky, Provably-Good Routing Tree Construction with Multi-Port Terminals, University of Virginia, Department of Computer Science Technical Report # CS-97-07, April 1997.

2. C. S. Helvig, G. Robins, and A. Zelikovsky, An Approximation Scheme for the Group Steiner Problem, University of Virginia, Department of Computer Science Technical Report # CS-97-18, July 1997.

3. C. S. Helvig, G. Robins, and A. Zelikovsky, Moving-Target TSP and Related Problems, University of Virginia, Department of Computer Science Technical Report # CS-98-07, April 1998.

Invited Talks

• Improved Approximation Bounds for the Group Steiner Problem, Invited speaker at the Design Automation, and Test in Europe (DATE) conference in Paris, 1998.

Code Distributions

• Group Steiner code (Java)

University Service

1. Remodeled and improved the Lounge at the UVa Department of Computer Science, including the acquisition and setup of a self-sustaining food and beverage service, and various games/puzzles.

2. Involved in the creation of the new Department of Computer Science Brochure and posters, 1998.

3. Helps organize and speak in weekly "graduate students only" research meetings on the topic of algorithms

4. Frequent proofreader of colleagues' conference and journal papers.

Computer Languages

Operating Systems / Environments

Hardware Platforms

Hobbies and Interests