The following pages link to Greg N. Frederickson (Q215688):
Displaying 50 items.
- Hugo Hadwiger's influence on geometric dissections with special properties (Q613905) (← links)
- Shortest path computations in source-deplanarized graphs (Q685480) (← links)
- A new approach to the dynamic maintenance of maximal points in a plane (Q751238) (← links)
- Recursively rotated orders and implicit data structures: A lower bound (Q792764) (← links)
- Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
- A faster algorithm for the maximum weighted tardiness problem (Q916393) (← links)
- A distributed shortest path algorithm for a planar network (Q918205) (← links)
- A tree-covering problem arising in integrity of tree-structured data (Q975533) (← links)
- The heptagon to the square, and other wild twists (Q1013659) (← links)
- On linear-time algorithms for five-coloring planar graphs (Q1057278) (← links)
- A note on finding a maximum empty rectangle (Q1079570) (← links)
- On-line updating of solutions to a class of matroid intersection problems (Q1090461) (← links)
- Upper bounds for time-space trade-offs in sorting and selection (Q1101238) (← links)
- Designing networks with compact routing tables (Q1104109) (← links)
- Distributed algorithms for selection in sets (Q1112607) (← links)
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms (Q1149248) (← links)
- The complexity of selection and ranking in X+Y and matrices with sorted columns (Q1161291) (← links)
- On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162) (← links)
- (Q1273937) (redirect page) (← links)
- Maintaining regular properties dynamically in \(k\)-terminal graphs (Q1273938) (← links)
- Algorithms for measuring perturbality in matroid optimization (Q1297736) (← links)
- Scheduling unit-time tasks with integer release times and deadlines (Q1838035) (← links)
- Searching among intervals and compact routing tables (Q1913700) (← links)
- An optimal algorithm for selection in a min-heap (Q2366561) (← links)
- Unexpected twists in geometric dissections (Q2373427) (← links)
- Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683) (← links)
- Hinged dissection of polyominoes and polyforms (Q2486086) (← links)
- Folding Polyominoes from One Level to Two (Q2901233) (← links)
- Bracing Regular Polygons As We Race into the Future (Q2901259) (← links)
- The Proof Is in the Pizza (Q2911536) (← links)
- (Q3053053) (← links)
- Casting Light on Cube Dissections (Q3103319) (← links)
- (Q3138951) (← links)
- (Q3140419) (← links)
- Generalized Selection and Ranking: Sorted Matrices (Q3323282) (← links)
- A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors (Q3325433) (← links)
- Self-Organizing Heuristics for Implicit Data Structures (Q3326852) (← links)
- (Q3414868) (← links)
- Space-Efficient Message Routing in<i>c</i>-Decomposable Networks (Q3474267) (← links)
- Reflecting Well: Dissections of Two Regular Polygons to One (Q3517469) (← links)
- Designing a Table Both Swinging and Stable (Q3601724) (← links)
- Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows (Q3603460) (← links)
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications (Q3694711) (← links)
- Implicit data structures for weighted elements (Q3703301) (← links)
- (Q3735086) (← links)
- (Q3741076) (← links)
- Electing a leader in a synchronous ring (Q3768383) (← links)
- Planar linear arrangements of outerplanar graphs (Q3778778) (← links)
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications (Q3801095) (← links)
- Space-efficient and fault-tolerant message routing in outerplanar networks (Q3814807) (← links)
