William E. Devanny

According to our database, William E. Devanny authored at least 17 papers between 2012 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

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

2019

Track Layouts, Layered Path Decompositions, and Leveled Planarity.

Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood

Algorithmica, 2019

2018

Optimally Sorting Evolving Data.

Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

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

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

An Assortment of Sorts: Three Modern Variations on the Classic Sorting Problem.

William E. Devanny

PhD thesis, 2017

Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs.

Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Graph Drawing Contest Report.

William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

The Online House Numbering Problem: Min-Max Online List Labeling.

William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis.

William E. Devanny, Michael T. Goodrich, Kristopher Jetviroj

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Track Layout Is Hard.

Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection.

Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich

Proceedings of the 16th Workshop on Algorithmic Approaches for Transportation Modelling, 2016

2015

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

2014

Superpatterns and Universal Point Sets.

Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein

J. Graph Algorithms Appl., 2014

ERGMs are Hard.

Michael J. Bannister, William E. Devanny, David Eppstein

CoRR, 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

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Small Superpatterns for Dominance Drawing.

Michael J. Bannister, William E. Devanny, David Eppstein

Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2012

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