DREM 2.0: Improved reconstruction of dynamic regulatory networks from time-series expression data. - Marcel H. Schulz; William E. Devanny; Anthony Gitter; Shan Zhong; Jason Ernst; Ziv Bar-Joseph (BMC Syst. Biol., 2012)

Small Superpatterns for Dominance Drawing. - Michael J. Bannister; William E. Devanny; David Eppstein (ANALCO, 2014)

Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets. - Michael J. Bannister; William E. Devanny; Michael T. Goodrich; Joseph A. Simons; Lowell Trott (CCCG, 2014)

ERGMs are Hard. - Michael J. Bannister; William E. Devanny; David Eppstein (CoRR, 2014)

Superpatterns and Universal Point Sets. - Michael J. Bannister; Zhanpeng Cheng; William E. Devanny; David Eppstein (J. Graph Algorithms Appl., 2014)

The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. - Michael J. Bannister; William E. Devanny; David Eppstein; Michael T. Goodrich (J. Graph Algorithms Appl., 2015)

Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. - Juan José Besa Vial; William E. Devanny; David Eppstein; Michael T. Goodrich (ATMOS, 2016)

Track Layout Is Hard. - Michael J. Bannister; William E. Devanny; Vida Dujmovic; David Eppstein; David R. Wood (GD, 2016)

Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis. - William E. Devanny; Michael T. Goodrich; Kristopher Jetviroj (SPAA, 2016)

The Online House Numbering Problem: Min-Max Online List Labeling. - William E. Devanny; Jeremy T. Fineman; Michael T. Goodrich; Tsvi Kopelowitz (ESA, 2017)

Graph Drawing Contest Report. - William E. Devanny; Philipp Kindermann; Maarten Löffler; Ignaz Rutter (GD, 2017)

Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. - Giordano Da Lozzo; William E. Devanny; David Eppstein; Timothy Johnson (ISAAC, 2017)

An Assortment of Sorts: Three Modern Variations on the Classic Sorting Problem. - William E. Devanny (2017)

Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. - Juan José Besa Vial; William E. Devanny; David Eppstein; Michael T. Goodrich; Timothy Johnson (ALENEX, 2018)

Optimally Sorting Evolving Data. - Juan José Besa Vial; William E. Devanny; David Eppstein; Michael T. Goodrich; Timothy Johnson (ICALP, 2018)

Track Layouts, Layered Path Decompositions, and Leveled Planarity. - Michael J. Bannister; William E. Devanny; Vida Dujmovic; David Eppstein; David R. Wood (Algorithmica, 2019)

A competitive analysis for the Start-Gap algorithm for online memory wear leveling. - William E. Devanny; Michael T. Goodrich; Sandy Irani (Inf. Process. Lett., 2021)