Gabriel Y. Handler

According to our database, Gabriel Y. Handler authored at least 9 papers between 1980 and 2004.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2004

The absolute center of a network.

Dov Dvir, Gabriel Y. Handler

Networks, 2004

1990

The Constrained Bottleneck Problem in Networks.

Oded Berman, D. Einav, Gabriel Y. Handler

Oper. Res., 1990

1987

Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations.

Oded Berman, Gabriel Y. Handler

Transp. Sci., 1987

1985

On Highway Fuel and Time Expenditures.

Dan Trietsch, Gabriel Y. Handler

Transp. Sci., 1985

Medi-Centers of a Tree.

Gabriel Y. Handler

Transp. Sci., 1985

The Gilbert and Pollak conjecture - a generalization.

Dan Trietsch, Gabriel Y. Handler

Networks, 1985

The continuous <i>m</i>-center problem on a network.

Gabriel Y. Handler, Margalit Rozman

Networks, 1985

1984

The Absolute <i>m</i>-Center Problem on a Directed Network.

Gabriel Y. Handler

Transp. Sci., 1984

1980

A dual algorithm for the constrained shortest path problem.

Gabriel Y. Handler, Israel Zang

Networks, 1980