AAAAAA
Results:
1-10
|
Results: 10
Authors:
EVERETT H
STOJMENOVIC I
VALTR P
WHITESIDES S
Citation: H. Everett et al., THE LARGEST K-BALL IN A D-DIMENSIONAL BOX, Computational geometry, 11(2), 1998, pp. 59-67
Authors:
DUDEK G
ROMANIK K
WHITESIDES S
Citation: G. Dudek et al., LOCALIZING A ROBOT WITH MINIMUM TRAVEL, SIAM journal on computing, 27(2), 1998, pp. 583-604
Authors:
KRUSZEWSKI P
WHITESIDES S
Citation: P. Kruszewski et S. Whitesides, A GENERAL RANDOM COMBINATORIAL MODEL OF BOTANICAL TREES, Journal of theoretical biology, 191(2), 1998, pp. 221-236
Authors:
TAMASSIA R
AGARWAL PK
AMATO N
CHEN DZ
DOBKIN D
DRYSDALE S
FORTUNE S
GOODRICH MT
HERSHBERGER J
OROURKE J
PREPARATA MP
SACK JR
SURI S
TOLLIS I
VITTER JS
WHITESIDES S
Citation: R. Tamassia et al., STRATEGIC DIRECTIONS IN COMPUTATIONAL GEOMETRY, ACM computing surveys, 28(4), 1996, pp. 591-606
Authors:
EADES P
WHITESIDES S
Citation: P. Eades et S. Whitesides, THE LOGIC ENGINE AND THE REALIZATION PROBLEM FOR NEAREST-NEIGHBOR GRAPHS, Theoretical computer science, 169(1), 1996, pp. 23-37
Authors:
VANKREVELD M
SNOEYINK J
WHITESIDES S
Citation: M. Vankreveld et al., FOLDING RULERS INSIDE TRIANGLES, Discrete & computational geometry, 15(3), 1996, pp. 265-285
Authors:
EADES P
WHITESIDES S
Citation: P. Eades et S. Whitesides, THE REALIZATION PROBLEM FOR EUCLIDEAN MINIMUM SPANNING-TREES IS NP-HARD, Algorithmica, 16(1), 1996, pp. 60-82
Authors:
EADES P
STIRK C
WHITESIDES S
Citation: P. Eades et al., TECHNIQUES OF KOMOLGOROV AND BARDZIN FOR 3-DIMENSIONAL ORTHOGONAL GRAPH DRAWINGS, Information processing letters, 60(2), 1996, pp. 97-103
Authors:
EADES P
WHITESIDES S
Citation: P. Eades et S. Whitesides, DRAWING GRAPHS IN 2 LAYERS, Theoretical computer science, 131(2), 1994, pp. 361-374
Authors:
BELLANTONI S
HARTMAN IB
PRZYTYCKA T
WHITESIDES S
Citation: S. Bellantoni et al., GRID INTERSECTION GRAPHS AND BOXICITY, Discrete mathematics, 114(1-3), 1993, pp. 41-49
Risultati:
1-10
|