William E. Devanny

Available identifiers

zbMath Open devanny.william-eMaRDI QIDQ1739108

List of research outcomes

Publication	Date of Publication	Type
A competitive analysis for the start-gap algorithm for online memory wear leveling	2021-02-04	Paper
The Online House Numbering Problem: Min-Max Online List Labeling	2020-05-27	Paper
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection	2019-10-24	Paper
Small Superpatterns for Dominance Drawing	2019-09-17	Paper
Track layouts, layered path decompositions, and leveled planarity	2019-04-25	Paper
Track Layout Is Hard	2017-02-21	Paper
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings	2016-01-07	Paper
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings	2015-01-07	Paper
Superpatterns and Universal Point Sets	2014-05-22	Paper
Superpatterns and Universal Point Sets	2013-12-20	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: William E. Devanny