| |
| 1992 | ||
|---|---|---|
| 5 | EE | David Hartvigsen, Eitan Zemel: The Complexity of Lifted Inequalities for the Knapsack Problem. Discrete Applied Mathematics 39(2): 113-123 (1992) |
| 1987 | ||
| 4 | Eitan Zemel: A Linear Time Randomizing Algorithm for Searching Ranked Functions. Algorithmica 2: 81-90 (1987) | |
| 1986 | ||
| 3 | Nimrod Megiddo, Eitan Zemel: An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem. J. Algorithms 7(3): 358-368 (1986) | |
| 1984 | ||
| 2 | Eitan Zemel: An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems. Inf. Process. Lett. 18(3): 123-128 (1984) | |
| 1981 | ||
| 1 | Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran: An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM J. Comput. 10(2): 328-337 (1981) | |
| 1 | Ramaswamy Chandrasekaran (R. Chandrasekaran) | [1] |
| 2 | David Hartvigsen | [5] |
| 3 | Nimrod Megiddo | [1] [3] |
| 4 | Arie Tamir | [1] |