An efficient network flow code for finding all minimum cost s-t cutsets. - Norman D. Curet; Jason DeVinney; Matthew E. Gaston (Comput. Oper. Res., 2002)

Classification Using Class Cover Catch Digraphs. - Carey E. Priebe; David J. Marchette; Jason DeVinney; Diego A. Socolinsky (J. Classif., 2003)

A new family of proximity graphs: Class cover catch digraphs. - Jason DeVinney; Carey E. Priebe (Discret. Appl. Math., 2006)

A Unified Runtime for PGAS and Event-Driven Programming. - Sri Raj Paul; Kun Chen; Akihiro Hayashi; Max Grossman; Vivek Sarkar; Jason DeVinney; Bill Carlson (ESPM2@SC, 2018)