Proc. 36th Symp. Foundations of Computer Science
3-coloring in time $O(1.3446^n)$: a no-MIS algorithm, BeiEpp-FOCS-95
Optimal on-line search and sublinear time update in string matching, FerGro-FOCS-95
An approximation scheme for planar graph TSP, GriKouPap-FOCS-95
Fully dynamic biconnectivity and transitive closure, HenKin-FOCS-95
[
D. Eppstein publications
] [
Citation database
] [
Locations
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
