Proc. 8th Symp. Discrete Algorithms
An efficient algorithm for terrain simplification, AgaDes-SODA-97
Experimental analysis of dynamic minimum spanning tree algorithms, AmaCatIta-SODA-97
Optimal point placement for mesh smoothing, AmeBerEpp-SODA-97
Deterministic algorithms for 2-d convex programming and 3-d online linear programming, Cha-SODA-97
Map labeling and its generalizations, DodMarMir-SODA-97
Faster construction of planar two-centers, Epp-SODA-97
Shortest path in complete bipartite digraph problem and its applications, HeChe-SODA-97
Optimal good-aspect-ratio coarsening for unstructured meshes, MilTalTen-SODA-97
Decremental dynamic connectivity, Tho-SODA-97
[
D. Eppstein publications
] [
Citation database
] [
Locations
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine