next up previous
Next: Refereed papers in professional Up: Publications Previous: Publications

Theses

  1. The Complexity of Finding k-Path-Free Dominating Set in Graphs, M.Sc. Thesis, Computer Science Department, Technion IIT - Israel, July 1980. Thesis advisor: S. Even.
  2. Approximation Algorithms for Graph Cover Problems, Ph.D. Thesis, Computer Science Department, Technion IIT - Israel, February 1983. Thesis advisor: S. Even.



& Bar-Yehuda 2020-09-27