Photo of Prof. Reuven Bar-Yehuda

Prof. Reuven Bar-Yehuda

Contact information
Office Hours:
No office hours
Research interests
Combinatorial optimization: Graph algorithms; Scheduling algorithms, Computational geometry.
Selected publications

BAR-YEHUDA, R., and EVEN, S., "A local-ratio theorem for approximating the weighted vertex cover problem", Annals of Discrete Mathematics, Vol. 25, pp. 27-46, 1985.

BAR-YEHUDA, R., GOLDREICH, O., and ITAI, A., "On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization", Journal of Computer and System Sciences, Vol. 45 pp. 104-126, 1992.

BAR-YEHUDA, R., and CHAZELLE, B., "Triangulating disjoint Jordan chains", International Journal of Computational Geometry & Applications, Vol. 4, No. 4, pp. 475-481, 1994.

BAR-YEHUDA, R., and BEN-HANOCH, E., "A linear time algorithm for covering simple polygons with similar rectangles", International Journal of Computational Geometry & Applications, Vol. 6, No. 1, pp. 79-102, 1996.

BAR-YEHUDA, R., and GOTSMAN, C., "Time/space tradeoffs for polygon mesh rendering", ACM Transactions on Graphics, Vol. 15, No. 2, pp.141-152, 1996.

COHEN, S., ELBER, G., and BAR-YEHUDA, R., "Matching of freeform curves. Computer Aided Design", Vol. 29, No. 5, pp. 369-378, 1997.

BAR-YEHUDA, R., GEIGER, D., NAOR, J., and ROTH, R., "Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and bayesian inference", SIAM Journal on Computing, Vol. 27, No. 4 1998, pp. 942-959.

BAR-YEHUDA, R., and FOGEL, S., "Partitioning a sequence into few monotone subsequences", accepted to Acta Informatica.

BAR-YEHUDA, R., "One for the Price of Two: A unified approach for approximating covering problems", TR CS0920, Computer Science Department, Technion, 1997, accepted to Algorithmica.

BAR-YEHUDA, R., "Using Homogenous Weights for Approximating the Partial Cover Problem", to apear SODA99.