My research largely focuses on the design and analysis of algorithms for online network routing and machine scheduling problems. An online algorithm is one that processes its input one element at a time instead of all at once like a traditional algorithm. For example, an online room scheduling algorithm would have to assign a room to each event as it "arrives" without knowing what events might need to be scheduled later. Online algorithms usually cannot come up with optimal solutions due to their lack of knowledge about the future. Instead, we try to design algorithms that find solutions that are provably within some factor of optimal. I am also interested in problems in computational biology.

Recent publications

Embracing the Liberal Arts in an Interdisciplinary Data Analytics Program. In Proceedings of the 50th ACM SIGCSE Technical Symposium on Computer Science Education, 2019.

Improved Upper Bounds for Online Malleable Job Scheduling (withN. Kell). Journal of Scheduling 18(4), pp. 393—410, 2015.


A new approach for detecting riboswitches in DNA sequences (with C.Bhatiya, S. M. Johnson, J. D. Sheets, J. S. Thompson). Bionformatics30(21), pp. 3012—3019,2014.

Bringing extinct sponges to life: StromoGrow, a new program for modeling stromatoporoid growth (abstract/poster, withT. E. Masters and D. H. Goodwin). Geological Society of America Annual Meeting, Denver, Colorado, 2013.

Optimal Online Ring Routing(with K. R. Hutson). Networks 57(2), pp. 187—197, 2011.

Online Malleable Job Scheduling for m ≤ 3. Information Processing Letters 111(1), pp. 31—35, 2010.

Competitive Online Scheduling of Perfectly Malleable Jobs with Setup Times(with W. Mao). European Journal of Operational Research187(3), pp. 1126—1142, 2008.

Technically Speaking: Fostering the Communication Skills of Computer Science and Mathematics Students(with L. D. Ludwig). ACM SIGCSE Technical Symposium on CS Education, 185—189, 2007.

Jessen Havill 2020