# William W. Donaldson

2699 Aikin Circle N.

Lewis Center, OH 43035

740 972 9476

Raytheon Company

2970 Presidental Dr.

Fairborn, OH

937 429 5429 ext. 22

wwd@cs.wisc.edu

## Statement of Purpose

To develop and implement algorithms for modelling real-world data. My most recent
work involved algorithms for partitioning graphs.
### Academic Interests

- Data Modelling
- Combinatorics
- Algorithm Design
- Graph Theory

### Areas in which I have done work

- Algorithm Design and Analysis
- Data Structures
- Multivariate Statistics
- Regression Analysis
- Large-Data-Set Processing
- Linear Programming
- Graph Theory
- Network Flows
- Integer Programming
- Time Series Analysis

## Brief History

I received a Bachelor of Science Degree in Mathematics from the Ohio State University in 1985. I then earned a
Master's of Applied Statistics Degree from the Ohio State University in 1987. After graduation
I worked for the United States Department of Agriculture, first in Washington, D.C. and then
in Madison, WI. I was with the USDA from 1987 to 1992.

While in Washington, I applied time-series and multivariate analyses to farm economic data. The
multivariate analysis involved processing very large data sets on a PC. It was this exposure to
high quantity computing that lead me into computer science.

I completed my Ph.D. in Computer Science during the Spring, 2000 under the supervision of Robert
R. Meyer. All of my research pertained
to graph theory. In particular, I studied ways of partitioning a certain class of graphs. The
title of my dissertation is "Grid-Graph Partitioning". You may either look at the
abstract
or the full text.

The following three pointers show how the Donaldson-Meyer algorithm partitioned
a diamond, an
ellipse, and a
torus each into 64 parts.

I am currently working as an applied mathematician with the Raytheon Co. in Garland, TX.

For my full resume click here.

## Recent Publications

Donaldson, W.W., 2000. "Grid-Graph Par.titioning", Ph.D. Dissertation.

Donaldson, W.W. and R.R. Meyer, 2000. ``A Dynamic Programming Heuristic for

Regular Grid-Graph Partitioning". To appear.

Donaldson, W.W. and R.R. Meyer, 2000 ``Generating Locally Optimal Partitions for the
Rectangular Grid-Graph Problem".

Donaldson, W.W. and R.R. Meyer, 2001. ``Imposing Exploitable Substructure to a Sub-class
of the Graph Partitioning Problem''.

## References

Dr. Eric Bach

Comuputer Science Department

University of Wisconsin

Dr. Rolf E. Bargmann

Department of Statistics

University of Georgia

Dr. Deborah A. Joseph

Computer Science Department

University of Wisconsin

Dr. Robert R. Meyer

Computer Science Department

University of Wisconsin