Photo of Will Devanny

William E. Devanny

Graduate student

I am a Computer Science PhD student in the Center for Algorithms and Theory of Computation at University of California, Irvine. I am advised by David Eppstein.

Teaching

Summer 2016 Teaching: ICS/CSE 46

Publications

The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
M J Bannister, W E Devanny, D Eppstein, M T Goodrich
Presented at Graph Drawing 2014
Journal version in JGAA
Preprint available at arXiv

Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets
M J Bannister, W E Devanny, M T Goodrich, J A Simons, L Trott
Presented at CCCG2014
Paper available at CCCG2014 Proceedings

Small superpatterns for dominance drawing
M J Bannister, W E Devanny, D Eppstein
Presented at ANALCO14
Preprint available at arXiv

Superpatterns and universal point sets
M J Bannister, Z Cheng, W E Devanny, D Eppstein
Presented at Graph Drawing 2013
Journal version in JGAA
Preprint available at arXiv

DREM 2.0: Improved reconstruction of dynamic regulatory networks from time-series expression data
M H Schulz, W E Devanny, A Gitter, S Zhong, J Ernst, Z Bar-Joseph
Published in BMC Systems Biology - Highly Accessed
Software available here