An O(n^2.5) Algorithm for Maximum Matching in General Graphs - Shimon Even; Oded Kariv (FOCS, 1975)

Algorithms for Edge Coloring Bipartite Graphs - Harold N. Gabow; Oded Kariv (STOC, 1978)

Algorithms for Edge Coloring Bipartite Graphs and Multigraphs. - Harold N. Gabow; Oded Kariv (SIAM J. Comput., 1982)

Midwest theory of computation symposium: on a generalization of edge-coloring in graphs. - S. Louis Hakimi; Oded Kariv (SIGACT News, 1984)

Algorithms for finding P-centers on a weighted tree (for relatively small P). - M. Jeger; Oded Kariv (Networks, 1985)

A generalization of edge-coloring in graphs. - S. Louis Hakimi; Oded Kariv (J. Graph Theory, 1986)