Proc. 33rd Symp. Foundations of Computer Science
Dynamic algorithms for half-space reporting, proximity problems, and geometric minimum spanning trees, AgaEppMat-FOCS-92
Sparsification — A technique for speeding up dynamic graph algorithms, EppGalIta-FOCS-92
Fully dynamic biconnectivity in graphs, Rau-FOCS-92
[
D. Eppstein publications
] [
Citation database
] [
Locations
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
