Proc. 22nd Int. Coll. Automata, Languages, and Programming (ICALP 1995)
Approximating minimum cuts under insertions, Hen-ICALP-95
Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time, NikReiSpi-ICALP-95
[
D. Eppstein publications
] [
Citation database
] [
Locations
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
