William E. Devanny

Publication Activity (10 Years)

Years Active: 2012-2021
Publications (10 Years): 16

Top Venues

CoRR

Graph Drawing

J. Graph Algorithms Appl.

ESA

University of California, Irvine, USA (PHD)

Education History

University of California, Irvine, USA

PHD

Publications

William E. Devanny, Michael T. Goodrich, Sandy Irani
A competitive analysis for the Start-Gap algorithm for online memory wear leveling. Inf. Process. Lett. 166 (2021)
Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
Track Layouts, Layered Path Decompositions, and Leveled Planarity. Algorithmica 81 (4) (2019)
Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
Optimally Sorting Evolving Data. CoRR (2018)
Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. ALENEX (2018)
William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter
Graph Drawing Contest Report. Graph Drawing (2018)
Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. CoRR (2018)
Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
Optimally Sorting Evolving Data. ICALP (2018)
William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter
Graph Drawing Contest Report. Graph Drawing (2017)
William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz
The Online House Numbering Problem: Min-Max Online List Labeling. ESA (2017)
Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. CoRR (2017)
Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. ISAAC (2017)
Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
Track Layout Is Hard. Graph Drawing (2016)
William E. Devanny, Michael T. Goodrich, Kristopher Jetviroj
Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis. SPAA (2016)
William E. Devanny, Michael T. Goodrich, Kristopher Jetviroj
Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis. CoRR (2016)
Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. ATMOS (2016)
Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. CoRR (2016)
Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
Track Layouts, Layered Path Decompositions, and Leveled Planarity. CoRR (2015)
Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. J. Graph Algorithms Appl. 19 (2) (2015)
Michael J. Bannister, William E. Devanny, David Eppstein
Small Superpatterns for Dominance Drawing. ANALCO (2014)
Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. Graph Drawing (2014)
Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. CoRR (2014)
Michael J. Bannister, William E. Devanny, Michael T. Goodrich, Joseph A. Simons, Lowell Trott
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets. CCCG (2014)
Michael J. Bannister, William E. Devanny, Michael T. Goodrich, Joseph A. Simons, Lowell Trott
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets. CoRR (2014)
Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein
Superpatterns and Universal Point Sets. J. Graph Algorithms Appl. 18 (2) (2014)
Michael J. Bannister, William E. Devanny, David Eppstein
ERGMs are Hard. CoRR (2014)
Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein
Superpatterns and Universal Point Sets. CoRR (2013)
Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein
Superpatterns and Universal Point Sets. Graph Drawing (2013)
Michael J. Bannister, William E. Devanny, David Eppstein
Small Superpatterns for Dominance Drawing. CoRR (2013)
Marcel H. Schulz, William E. Devanny, Anthony Gitter, Shan Zhong, Jason Ernst, Ziv Bar-Joseph
DREM 2.0: Improved reconstruction of dynamic regulatory networks from time-series expression data. BMC Syst. Biol. 6 (2012)

William E. Devanny.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

William E. Devanny