Approximation algorithms for partitioning a rectangle with interior points Teofilo GonzalezSi-Qing Zheng OriginalPaper Pages: 11 - 42
Efficient parallel algorithms for graph problems Clyde P. KruskalLarry RudolphMarc Snir OriginalPaper Pages: 43 - 64
On the complexity of embedding planar graphs to minimize certain distance measures Daniel BienstockClyde L. Monma OriginalPaper Pages: 93 - 109
On heuristics for minimum length rectilinear partitions Dingzhu DuYanjun Zhang OriginalPaper Pages: 111 - 128
Efficient parallel algorithms forr-dominating set andp-center problems on trees Xin HeYaacov Yesha OriginalPaper Pages: 129 - 145
An algorithm for constructing gröbner bases from characteristic sets and its application to geometry Shang-Ching ChouWilliam F. SchelterJin-Gen Yang OriginalPaper Pages: 147 - 154
Parallel geometric algorithms on a mesh-connected computer C. S. JeongD. T. Lee OriginalPaper Pages: 155 - 177
Solving some combinatorial problems on arrays with one-way dataflow Carla D. SavageMatthias StallmannJo Ellen Perry OriginalPaper Pages: 179 - 199
A fast algorithm for computing sparse visibility graphs S. SudarshanC. Pandu Rangan OriginalPaper Pages: 201 - 214
Internal and external algorithms for the points-in-regions problem—the inside join of geo-relational algebra Gabriele BlankenagelRalf Hartmut Güting OriginalPaper Pages: 251 - 276
Dynamic detection of subgraphs in computer networks Israel CidonInder S. Gopal OriginalPaper Pages: 277 - 294
Analysis of the standard deletion algorithms in exact fit domain binary search trees Joseph CulbersonJ. Ian Munro OriginalPaper Pages: 295 - 311
A linear-time algorithm for finding approximate shortest common superstrings Esko Ukkonen OriginalPaper Pages: 313 - 323
Asynchronous distributed termination—parallel and symmetric solutions with echo algorithms Friedemann Mattern OriginalPaper Pages: 325 - 340
An optimal approximation algorithm for the rectilinearm-center problem M. T. KoR. C. T. LeeJ. S. Chang OriginalPaper Pages: 341 - 352
The complexity of planar compliant motion planning under uncertainty Bruce R. Donald OriginalPaper Pages: 353 - 382
An efficient distributed algorithm for maximum matching in general graphs Michael M. WuMichael C. Loui OriginalPaper Pages: 383 - 406
Computing euclidean maximum spanning trees Clyde MonmaMichael PatersonFrances Yao OriginalPaper Pages: 407 - 419
Computational geometry in a curved world David P. DobkinDiane L. Souvaine OriginalPaper Pages: 421 - 457
A better performance guarantee for approximate graph coloring Bonnie BergerJohn Rompel OriginalPaper Pages: 459 - 466
Some chain visibility problems in a simple polygon Sang-Ho LeeKyung-Yong Chwa OriginalPaper Pages: 485 - 507
Dynamic maintenance of planar digraphs, with applications Roberto TamassiaFranco P. Preparata OriginalPaper Pages: 509 - 527
A new scheme for the deterministic simulation of PRAMs in VLSI F. LuccioA. PietracaprinaG. Pucci OriginalPaper Pages: 529 - 544
Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs Xin He OriginalPaper Pages: 545 - 559
Searching for empty convex polygons David P. DobkinHerbert EdelsbrunnerMark H. Overmars OriginalPaper Pages: 561 - 571
An optimal algorithm for the boundary of a cell in a union of rays Panagiotis AlevizosJean-Daniel BoissonnatFranco P. Preparata OriginalPaper Pages: 573 - 590
Comments on Bern's probabilistic results on rectilinear Steiner trees F. K. HwangY. C. Yao OriginalPaper Pages: 591 - 598
