- Finding $k$ points with minimum diameter and related problems, AgaImaKat-Algs-91
- Selection in monotone matrices and computing $k$th nearest neighbors, AgaSen-Algs-96
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs, AlbFia-Algs-04
- Optimal point placement for mesh smoothing, AmeBerEpp-Algs-99
- Incremental algorithms for minimal length paths, AusItaMar-Algs-91
- Sparse dynamic programming for longest common subsequence from fragments, BakGia-Algs-02
- 3-coloring in time $O(1.3289^n)$, BeiEpp-Algs-05
- The complexity of finding small triangulations of convex 3-polytopes , BelLoeRic-Algs-04
- Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains, BerMatRag-Algs-98
- Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values, BerSchVis-Algs-93
- Efficient algorithms for Petersen's matching theorem, BieBosDem-Algs-01
- The $k$-Steiner ratio in the rectilinear plane, BorDu-Algs-98
- Parallel algorithms with processor failures and delays, BusKanRag-Algs-96
- Edge coloring series parallel graphs, CasDek-Algs-95
- Deterministic algorithms for 2-d convex programming and 3-d online linear programming, Cha-Algs-98
- Fly cheaply: on the minimum fuel consumption problem, ChaEfr-Algs-01
- Finding an optimal path without growing the tree, CheDaeHu-Algs-03
- Vertex cover: further observations and further improvements, CheJia-Algs-01
- Static and dynamic algorithms for $k$-point clustering problems, DatLenSch-Algs-95
- Fast parallel algorithms for all-sources lexicographic search and path-algebra problems, DelKru-Algs-95
- Incremental and decremental maintenance of planar width, Epp-Algs-00
- Sequence comparison with mixed convex and concave costs, Epp-Algs-90
- Offline algorithms for dynamic minimum spanning tree problems, Epp-Algs-94
- Minimum range balanced cuts via dynamic subset sums, Epp-Algs-97
- Choosing subsets with maximum weighted average, EppHir-Algs-97
- Maintenance of a minimum spanning forest in a dynamic planar graph, EppItaTam-Algs-92
- Maintenance of a minimum spanning forest in a dynamic planar graph, EppItaTam-Algs-93
- On envelopes of arrangements of lines, EuGueTou-Algs-96
- Worst-case time bounds for coloring and satisfiability problems, FedMot-Algs-02
- An efficient exact algorithm for constraint bipartite vertex cover, FerNie-Algs-01
- A data structure for dynamically maintaining rooted trees, Fre-Algs-97
- Fully dynamic shortest paths in digraphs with arbitrary arc weights, FriMarNan-Algs-03
- Fully dynamic algorithms for maintaining shortest path trees, GFriMarNan-Algs-00
- The 2-center problem with obstacles, HalShaGol-Algs-02
- A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity, Hen-Algs-97
- A unified approach to approximation problems for NP- and PSPACE-hard problems for geometric graphs, HunMarRad-Algs-98
- Elastic labels around the perimeter of a map, ItuLub-Algs-03
- Space efficient algorithms for directed series-parallel graphs, JakLisRei-Algs-06
- Superlinear bounds for matrix searching problems, Kla-Algs-92
- A randomized parallel algorithm for single-source shortest paths, KleSub-Algs-97
- On the common substring alignment problem, Lan-Algs-01
- On-line dynamic programming with applications to the prediction of RNA secondary structure, LarSch-Algs-91
- Quasi-greedy triangulations approximating the minimum weight triangulation, LevKrz-Algs-98
- Derandomization in computational geometry, Mat-Algs-96
- Linear optimization queries, MatSch-Algs-93
- On parallel hashing and integer sorting, MatVis-Algs-91
- Optimal coarsening of unstructured meshes, MilTalTen-Algs-99
- New upper bounds for maximum satisfiability, NieRos-Algs-00
- Repetitive hidden surface removal for polyhedra, Pel-Algs-96
- Dynamic algebraic algorithms, ReiTat-Algs-97
- A Delaunay refinement algorithm for 2-dimensional mesh generation, Rup-Algs-95
- Faster subtree isomorphism, ShaTsu-Algs-99
- Self-adjusting $k$-ary search-trees, She-Algs-95
- Inverse parametric sequence alignment, SunFerYu-Algs-04
- On-line planar graph embedding, Tam-Algs-96
- Low energy and mutually distant sampling, Ten-Algs-99
- Decremental dynamic connectivity, Tho-Algs-99
- Detecting tetrahedralizations of a set of line segments, YanWan-Algs-04
- An NC parallel algorithm for edge-coloring series-parallel multigraphs, ZhoSuzNis-Algs-97