William E. Devanny

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