AAAAAA
Results:
1-10
|
Results: 10
Authors:
HUANG ML
EADES P
COHEN RF
Citation: Ml. Huang et al., WEBOFDAV - NAVIGATING AND VISUALIZING THE WEB ONLINE WITH ANIMATED CONTEXT SWAPPING, Computer networks and ISDN systems, 30(1-7), 1998, pp. 638-642
Authors:
COHEN RF
EADES P
LIN T
RUSKEY F
Citation: Rf. Cohen et al., 3-DIMENSIONAL GRAPH DRAWING, Algorithmica, 17(2), 1997, pp. 199-208
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:
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
Citation: P. Eades, EDGE CROSSINGS IN LAYERED DRAWINGS OF GRAPHS, Zeitschrift fur angewandte Mathematik und Mechanik, 76, 1996, pp. 47-50
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:
EADES P
WORMALD NC
Citation: P. Eades et Nc. Wormald, EDGE CROSSINGS IN DRAWINGS OF BIPARTITE GRAPHS, Algorithmica, 11(4), 1994, pp. 379-403
Authors:
EADES P
RAPPAPORT D
Citation: P. Eades et D. Rappaport, THE COMPLEXITY OF COMPUTING MINIMUM SEPARATING POLYGONS, Pattern recognition letters, 14(9), 1993, pp. 715-718
Authors:
EADES P
LIN XM
SMYTH WF
Citation: P. Eades et al., A FAST AND EFFECTIVE HEURISTIC FOR THE FEEDBACK ARC SET PROBLEM, Information processing letters, 47(6), 1993, pp. 319-323
Risultati:
1-10
|