Leighton, T.,
Shor, P.,
Tight Bounds For Minimax Grid Matching, With Applications To The Average Case Analysis Of Algorithms,
STOC(87), pp. 91-103.
BibRef
Yannakakis, M.,
Four Pages Are Necessary And Sufficient For Planar Graphs,
STOC(87), pp. 104-108.
BibRef
Sleator, D.D.,
Tarjan, R.E.,
Thurston, W.P.,
Rotation Distance, Triangulations, And Hyperbolic Geometry,
STOC(87), pp. 122-135.
BibRef
Tarjan, R.E.,
Van Wyk, C.J.,
A Linear-Time Algorithm For Triangulating Simple Polygons,
STOC(87), pp. 380-383.
BibRef
Avnaim, F.,
Boissonnat, J.D.,
Simultaneous Containment Of Several Polygons,
CG(87), pp. 242-250.
BibRef
Reckhow, R.A.,
Culberson, J.,
Covering A Simple Orthogonal Polygon With A Minimum Number Of Orthogonally Convex Polygons,
CG(87), pp. 268-277.
BibRef
Rappaport, D.,
Computing Simple Circuits From A Set Of Line Segments Is Np-Complete,
CG(87), pp. 322-330.
BibRef
Baykan, C.A.,
Fox, M.S.,
An Investigation Of Opportunistic Constraint Satisfaction In Space Planning,
IJCAI(87), pp. 1035-1038.
BibRef
Kundu, S.,
Singh, R.,
Spatial Reasoning In Rectangular Dissection,
SRMSF(87), pp. 82-91.
BibRef
Karp, R.M.,
Leighton, F.T.,
Rivest, R.L.,
Thompson, C.D.,
Vazirani, U.V.,
Vazirani, V.V.,
Global Wire Routing In Two-Dimensional Arrays,
ALGORITHMICA(2), 1987, pp. 113-129.
BibRef
Levcopoulos, C.,
Lingas, A.,
On Approximation Behavior Of The Greedy Triangulation For Convex Polygons,
ALGORITHMICA(2), 1987, pp. 175-193.
BibRef
Wagon, S.,
Fourteen Proofs Of A Result About Tiling A Rectangle,
AMERICAN MATHEMATICAL MONTHLY(94), 1987, pp. 601-617.
BibRef
Fejes Toth, L.,
Densest Packing Of Translates Of The Union Of Two Circles,
DCG(1), 1986, pp. 307-314.
BibRef
Tamassia, R.,
Tollis, I.G.,
A Unified Approach To Visibility Representations Of Planar Graphs,
DCG(1), 1986, pp. 321-341.
BibRef
Rosenstiehl, P.,
Tarjan, R.E.,
Rectilinear Planar Layouts And Bipolar Orientations Of Planar Graphs,
DCG(1), 1986, pp. 343-353.
BibRef
Hayward, R.B.,
A Lower Bound For The Optimal Crossing-Free Hamiltonian Cycle Problem,
DCG(2), 1987, pp. 327-343.
BibRef
Fejes Toth, G.,
Finite Coverings By Translates Of Centrally Symmetric Convex Domains,
DCG(2), 1987, pp. 353-363.
BibRef
Becker, B.,
Osthof, H.G.,
Layouts With Wires Of Bounded Length,
IC(73), 1987, pp. 45-58.
BibRef
Maley, F.M.,
An Observation Concerning Constraint-Based Compaction,
IPL(25), 1987, pp. 119-122.
BibRef
Bhatt, S.N.,
Cosmadakis, S.S.,
The Complexity Of Minimizing Wire Lengths In Vlsi Layouts,
IPL(25), 1987, pp. 263-267.
BibRef
Hochbaum, D.S.,
Maas, W.,
Fast Approximation Algorithms For A Nonconvex Covering Problem,
J. ALGORITHMS(8), 1987, pp. 305-323.
BibRef
Lai, T.H.,
Sprague, A.,
On The Routability Of A Convex Grid,
J. ALGORITHMS(8), 1987, pp. 372-384.
BibRef
Baker, B.S.,
Fortune, S.J.,
Mahoney, S.R.,
Polygon Containment Under Translation,
J. ALGORITHMS(7), 1986, pp. 532-548.
BibRef
Mirzaian, A.,
River Routing In Vlsi,
J. COMPUTER & SYSTEM SCIENCES(34), 1987, pp. 43-54.
BibRef
Tamassia, R.,
On Embedding A Graph In The Grid With The Minimum Number Of Bends,
SIAM JC(16), 1987, pp. 421-444.
BibRef
Becker, B.,
Hotz, G.,
On The Optimal Layout Of Planar Graphs,
SIAM JC(16), 1987, pp. 946-972.
BibRef
Santoro, N.,
Sidney, J.B.,
Sidney, S.J.,
Urrutia, J.,
Geometric Containment And Vector Dominance,
TCS(53), 1987, pp. 345-352.
BibRef
Luk, W.K.,
Sipala, P.,
Wong, C.K.,
Minimum-Area Wiring For Slicing Structures,
T-COMP(36), 1987, pp. 745-760.
BibRef
Gordon, D.,
Efficient Embeddings Of Binary Trees In Vlsi Arrays,
T-COMP(36), 1987, pp. 1009-1018.
BibRef
Chapter on Rosenfeld Bibliography for 1987 continues in
H.5. Path planning .