7 citations · 18 across the 6 of their papers we have counts for
6 papers
Two-Phase Bicriterion Search for Finding Fast and Efficient Electric Vehicle Routes
Michael T. Goodrich, Paweł Pszona
The problem of finding an electric vehicle route that optimizes both driving time and energy consumption can be modeled as a bicriterion path problem. Unfortunately, the problem of…
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
David Eppstein, Michael T. Goodrich, Michael Mitzenmacher +1
We study wear-leveling techniques for cuckoo hashing, showing that it is possible to achieve a memory wear bound of after the insertion of items into a table…
Achieving Good Angular Resolution in 3D Arc Diagrams
Michael T. Goodrich, Paweł Pszona
We study a three-dimensional analogue to the well-known graph visualization approach known as arc diagrams. We provide several algorithms that achieve good angular resolution for 3…
Streamed Graph Drawing and the File Maintenance Problem
Michael T. Goodrich, Paweł Pszona
In streamed graph drawing, a planar graph, G, is given incrementally as a data stream and a straight-line drawing of G must be updated after each new edge is released. To preserve…
Cole's Parametric Search Technique Made Practical
Michael T. Goodrich, Paweł Pszona
Parametric search has been widely used in geometric algorithms. Cole's improvement provides a way of saving a logarithmic factor in the running time over what is achievable using t…
External-Memory Network Analysis Algorithms for Naturally Sparse Graphs
Michael T. Goodrich, Pawel Pszona
In this paper, we present a number of network-analysis algorithms in the external-memory model. We focus on methods for large naturally sparse graphs, that is, n-vertex graphs that…