Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job". - Gur Mosheiov; Uri Yovel (Eur. J. Oper. Res., 2004)

Predictive ranking of computer scientists using CiteSeer data. - Dror G. Feitelson; Uri Yovel (J. Documentation, 2004)

Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs. - Gur Mosheiov; Uri Yovel (Eur. J. Oper. Res., 2006)

An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs. - Chung-Lun Li; Gur Mosheiov; Uri Yovel (Comput. Oper. Res., 2008)

Uniform unweighted set cover: The power of non-oblivious local search. - Asaf Levin; Uri Yovel (Theor. Comput. Sci., 2011)

Nonoblivious 2-Opt heuristics for the traveling salesman problem. - Asaf Levin; Uri Yovel (Networks, 2013)

Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees. - Asaf Levin; Uri Yovel (J. Comb. Optim., 2014)

Sequential scheduling on identical machines. - Refael Hassin; Uri Yovel (Oper. Res. Lett., 2015)