Graph drawing by force‐directed placement TMJ Fruchterman, EM Reingold Software: Practice and experience 21 (11), 1129-1164, 1991 | 8340 | 1991 |
Combinatorial algorithms: theory and practice EM Reingold, J Nievergelt, N Deo Prentice Hall College Div, 1977 | 1879 | 1977 |
Tidier drawings of trees EM Reingold, JS Tilford IEEE Transactions on software Engineering, 223-228, 1981 | 879 | 1981 |
Backtrack programming techniques JR Bitner, EM Reingold Communications of the ACM 18 (11), 651-656, 1975 | 518 | 1975 |
Binary search trees of bounded balance J Nievergelt, EM Reingold Proceedings of the fourth annual ACM symposium on Theory of computing, 137-142, 1972 | 450 | 1972 |
Efficient generation of the binary reflected Gray code and its applications JR Bitner, G Ehrlich, EM Reingold Communications of the ACM 19 (9), 517-521, 1976 | 393 | 1976 |
Calendrical calculations N Dershowitz, EM Reingold Cambridge University Press, 2007 | 206 | 2007 |
The complexity of drawing trees nicely KJ Supowit, EM Reingold Acta Informatica 18 (4), 377-392, 1983 | 177 | 1983 |
The complexity of pursuit on a graph AS Goldstein, EM Reingold Theoretical computer science 143 (1), 93-112, 1995 | 153 | 1995 |
On a greedy heuristic for complete matching EM Reingold, RE Tarjan SIAM Journal on Computing 10 (4), 676-681, 1981 | 125 | 1981 |
On the optimality of some set algorithms EM Reingold Journal of the ACM (JACM) 19 (4), 649-659, 1972 | 94 | 1972 |
Data structures EM Reingold, WJ Hansen (No Title), 1983 | 88 | 1983 |
The travelling salesman problem and minimum matching in the unit square KJ Supowit, EM Reingold, DA Plaisted SIAM Journal on Computing 12 (1), 144-156, 1983 | 85 | 1983 |
Determining the majority L Alonso, EM Reingold, R Schott Information Processing Letters 47 (5), 253-255, 1993 | 75 | 1993 |
Calendrical Calculations Millennium Edition EM Reingold, N Dershowitz Cambridge University Press, 2001 | 73 | 2001 |
“Lion and man”: Upper and lower bounds L Alonso, AS Goldstein, EM Reingold ORSA Journal on Computing 4 (4), 447-452, 1992 | 69 | 1992 |
Index assignment for multichannel communication under failure TY Berger-Wolf, EM Reingold IEEE Transactions on Information Theory 48 (10), 2656-2668, 2002 | 67 | 2002 |
Understanding the complexity of interpolation search Y Perl, EM Reingold Information Processing Letters 6 (6), 219-222, 1977 | 65 | 1977 |
Optimum lopsided binary trees S Kapoor, EM Reingold Journal of the ACM (JACM) 36 (3), 573-590, 1989 | 62 | 1989 |
The average-case complexity of determining the majority L Alonso, EM Reingold, R Schott SIAM Journal on Computing 26 (1), 1-14, 1997 | 60 | 1997 |