William E. Devanny
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
11
Venues
7
Active years
2013–2018
Best venue rank
A*
Where they publish
Papers
11 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2018 | ALENEX | 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 |
| 2018 | GD | Graph Drawing Contest Report. | William E. Devanny, Philipp Kindermann, Maarten Lffler, Ignaz Rutter |
| 2018 | ICALP | Optimally Sorting Evolving Data. | Juan Jos Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson |
| 2017 | ESA | The Online House Numbering Problem: Min-Max Online List Labeling. | William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz |
| 2017 | GD | Graph Drawing Contest Report. | William E. Devanny, Philipp Kindermann, Maarten Lffler, Ignaz Rutter |
| 2017 | ISAAC | Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. | Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson |
| 2016 | ATMOS | Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. | Juan Jos Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich |
| 2016 | GD | Track Layout Is Hard. | Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood |
| 2016 | SPAA | Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis. | William E. Devanny, Michael T. Goodrich, Kristopher Jetviroj |
| 2014 | GD | 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 |
| 2013 | GD | Superpatterns and Universal Point Sets. | Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein |