J. ACM
- Color-coding, AloYusZwi-JACM-95
- Polynomial time approximation schemes for Euclidean TSP and other geometric problems, Aro-JACM-98
- An optimal algorithm for approximate nearest neighbor searching in fixed dimensions, AryMouNet-JACM-98
- Dynamic planar convex hull operations in near-logarithmic amortized time, Cha-JACM-01
- Sliver exudation, CheDeyEde-JACM-00
- Sparse dynamic programming I: linear cost functions, EppGalGia-JACM-92-I
- Sparse dynamic programming II: convex and concave cost functions, EppGalGia-JACM-92-II
- Sparsification — A technique for speeding up dynamic graph algorithms, EppGalIta-JACM-97
- Deciding first order properties of locally tree-decomposable structures, FriGro-JACM-01
- Fully dynamic planarity testing with applications, GalItaSar-JACM-99
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation, HenKin-JACM-99
- Poly-logarithmic deterministic fully-dynamic graph algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, HolLicTho-JACM-01
- Separators for sphere-packings and nearest neighbor graphs, MilTenThu-JACM-97
- Mesh refinement via bidirected flows: modeling, complexity, and computational results, MohMueWei-JACM-97
- Polynomial-time approximation schemes for geometric min-sum median clustering, OstRab-JACM-02
