From 2001 to 2007, I worked at Wolfram Research, developing numerical and graph theoritical software. Prior to April 2001, I worked in the Computational Science and Engineering Department at Daresbury Laboratory, conducting research in algorithms for high performance computing. For further chronological details, see here.

A Maxent-Stress Model for Graph Layout (2012)

Visualizing the tree of life (2011)

A Gallery of Large Graphs featured by: IEEE Spectrum fastcodesign.com butdoesitfloat.com (2010)

Bundling edges fast with the agglomerative multilevel bundling algorithm . (2010)

Visualizing dynamic info with Trend Map (2010)

The landscape of Music, Movie, TV, Books and the Internet (2010)

Visualizing Relations and Structures as Maps: GMap (2010)

Visualizing the Mathematics Genealogy Trees. (2008)

A Gallery of Large Graphs: graph drawing of all square matrices in the Univ. Florida collection (2008)

Interior point method for nonlinear programming, Mathematica 6.0 (2006).

GraphPlot: automatic graph drawing/graph layout, Mathematica 6.0 (2006). Also see paper.

A survey of all major symmetric sparse solvers, in collaboration with Drs. Jennifer Scott and Nick Gould from Rutherford Lab (May 2005).

Interior point method for linear programming, Mathematica 5.0 (2003).

FCAT -- a FORTRAN coverage analysis tool. (Febrary 2001).

JASPA -- a benchmark contains F90, C and Java codes for testing the I/O and compute performance of sparse matrix multiplication kernals appear frequently in large scale scientific and engineering applications. It can be used to compare the performance of Java with F90 and C on you chosen platform. (August 2000).

MONET -- a software which orders a unsymmetric into (single) bordered block diagonal matrix (June 2000).