Edward M. Reingold
Illinois Institute of Technology · 168 works · 10,077 citations · h-index 25
Top works
- Graph drawing by force‐directed placement
- Combinatorial Algorithms: Theory and Practice
- Binary Search Trees of Bounded Balance
- Backtrack programming techniques
- Combinatorial Algorithms: Theory and Practice.
- On the Optimality of Some Set Algorithms
- Tidier Drawings of Trees
- Efficient generation of the binary reflected gray code and its applications
- Binary search trees of bounded balance
- On the time required to detect cycles and connectivity in graphs
- On the Time Required to Detect Cycles and Connectivity in Directed Graphs
- The complexity of drawing trees nicely
- On a Greedy Heuristic for Complete Matching
- Computing the maximum and the median
- Computer Approaches to Mathematical Problems
- Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
- Calendrical calculations
- Understanding the complexity of interpolation search
- Heuristics for weighted perfect matching
- A nonrecursive list moving algorithm