George W. Furnas
- 1.Botafogo, R.A., Rivlin, E., Schneiderman, B., Structural analysis of hypertext: identifying hierarchies and useful metrics, A CM Transactions on Information Systems, 10(2), 1992, 142-180. Google Scholar
Digital Library
- 2.Creech, M. L., Freeze, D. E, Griss, M. L., Using hypertext in selecting reusable software components, Hypertext'91Proceedings, ACM, 25-38, 1991. Google ScholarDigital Library
- 3.Egan, D. E., Remde, J. R., Landauer, T. K., Lochbaum, C. L., and Gomez, L. M., Behavioral Evaluation and Analysis of a Hypertext Browser, Proceedings ofA CM CHI'89 Conference on Human Factors in Computing Systems 205-210, 1989. Google ScholarDigital Library
- 4.Feiner, S. (1988). Seeing the forest for the trees: Hierarchical display of hypertext structure. Proc. A CM Conf. Office Information Systems (Palo Alto, CA, 23- 25 March), 205-212. Google ScholarDigital Library
- 5.Furnas, G. W., The FISHEYE view: A new look at structured files. Bell Laboratories Technical Memorandum, 1982.Google Scholar
- 6.Furnas, G. W., Generalized fisheye views. Human Factors in Computing Systems CHI '86 Conference Proceedings, Boston, April 13-17, 1986, 16-23. Google ScholarDigital Library
- 7.Landauer, T. K., Dumais, S. T., Oomez, L. M., & Furnas, G. W., Human factors in data access. Bell System Technical Journal, (Special Issue on Data Bases), 61, 1982, pp. 2487-2509. Reprinted in: Journal of Information and Image Management. September, 1983, Vol 16(9), pp. 18-29.Google Scholar
- 8.Parunak, H. Van Dyke, Hypermedia topologies and user navigation, Hypertext'89 Proceedings, ACM, 43- 50, 1989. Google ScholarDigital Library
Index Terms
- Multitrees: enriching and reusing hierarchical structure
Recommendations
Spanning Directed Trees with Many Leaves
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e., a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we obtain two combinatorial results on the number of leaves in out-...
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
An out-tree T of a directed graph D is a rooted tree subgraph with all arcs directed outwards from the root. An out-branching is a spanning out-tree. By ℓ(D) and ℓs(D), we denote the maximum number of leaves over all out-trees and out-branchings of D, ...
Quasi‐graphic matroids*
AbstractFrame matroids and lifted‐graphic matroids are two interesting generalizations of graphic matroids. Here, we introduce a new generalization, quasi‐graphic matroids, that unifies these two existing classes. Unlike frame matroids and lifted‐...
Comments