| 1985 | ||
|---|---|---|
| j2 | M. Jeger, Oded Kariv: Algorithms for finding P-centers on a weighted tree (for relatively small P). Networks 15(3): 381-389 (1985) | |
| 1982 | ||
| j1 | Harold N. Gabow, Oded Kariv: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs. SIAM J. Comput. 11(1): 117-129 (1982) | |
| 1981 | ||
| e1 | Shimon Even, Oded Kariv (Eds.): Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings. Lecture Notes in Computer Science 115, Springer 1981, isbn 3-540-10843-2 | |
| 1978 | ||
| c2 | ||
| 1975 | ||
| c1 | Shimon Even, Oded Kariv: An O(n^2.5) Algorithm for Maximum Matching in General Graphs. FOCS 1975: 100-112 | |
| 1 | Shimon Even | |
| 2 | Harold N. Gabow | |
| 3 | M. Jeger |
Data released under the ODC-BY 1.0 license — See also our legal information page