#### Filter Results:

- Full text PDF available (16)

#### Publication Year

1970

2014

- This year (0)
- Last 5 years (2)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Thomas M. J. Fruchterman, Edward M. Reingold
- Softw., Pract. Exper.
- 1991

A graph G = (V,E) is a set V of vertices and a set E of edges, in which an edge joins a pair of vertices. 1 Normally, graphs are depicted with their vertices as points in a plane and their edges asâ€¦ (More)

- Edward M. Reingold, John S. Tilford
- IEEE Transactions on Software Engineering
- 1981

Various algorithms have been proposed for producing tidy drawings of treesâ€“drawings that are aesthetically pleasing and use minimum drawing space. We show that these algorithms contain someâ€¦ (More)

- James R. Bitner, Edward M. Reingold
- Commun. ACM
- 1975

The purpose of this paper is twofold. First, a brief exposition of the general backtrack technique and its history is given. Second, it is shown how the use of macros can considerably shorten theâ€¦ (More)

- Arthur S. Goldstein, Edward M. Reingold
- Theor. Comput. Sci.
- 1995

A robber and k cop~ chno~ starting veaices in a graph and move in alternation from vortex to vertex along the edges of the graph; captttre occurs if a cop ever sha~ a vertex with the robber, if k isâ€¦ (More)

- JÃ¼rg Nievergelt, Edward M. Reingold
- STOC
- 1972

A new class of binary search trees, called trees of bounded balance, is introduced. These trees are easy to maintain in their form despite insertions and deletions of nodes, and the search time isâ€¦ (More)

- Kenneth J. Supowit, Edward M. Reingold
- Acta Informatica
- 1982

We investigate the complexity of producing aesthetically pleasing drawings of binary trees, drawings that are as narrow as possible. The notion of what is aesthetically pleasing is embodied inâ€¦ (More)

- James R. Bitner, Gideon Ehrlich, Edward M. Reingold
- Commun. ACM
- 1976

Algorithms are presented to generate the n-bit binary reflected Gray code and codewords of fixed weight in that code. Both algorithms are efficient in that the time required to generate the nextâ€¦ (More)

- Edward M. Reingold, Robert E. Tarjan
- SIAM J. Comput.
- 1981

, Finding a minimum weighted complete matching on a set of vertices in which the distances satisfy the triangle inequality is of general interest and of particular importance when drawing graphs on aâ€¦ (More)

- Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted
- SIAM J. Comput.
- 1983

We show that the cost (length) Of the shortest traveling salesman tour through n points in the unit square is, in the worst case, aopt v/n + o (x/-n), where 1.075 atsPopt <= 1.414. The cost of theâ€¦ (More)

- Nachum Dershowitz, Edward M. Reingold
- Softw., Pract. Exper.
- 1990

Calendrical calculations are ubiquitous. Banks need to calculate interest on a daily basis. Operating systems need to switch to and from daylight savings time. Dates of secular and religious holidaysâ€¦ (More)