En-Yu Yao

According to our database, En-Yu Yao authored at least 6 papers between 1990 and 1998.

Collaborative distances:

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

1998

Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times.

Guo-Hui Lin, En-Yu Yao, Yong He

Oper. Res. Lett., 1998

1996

Three-Partitioning Containing Kernels: Complexity and Heuristic.

Shi Ping Chen, Yong He, En-Yu Yao

Computing, 1996

1994

Partitioning Graphs into Two Trees.

Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao

Acta Cybern., 1994

1993

Erratum: Constrained Partitioning Problems.

Rainer E. Burkard, En-Yu Yao

Discret. Appl. Math., 1993

1990

Constrained partitioning problems.

Rainer E. Burkard, En-Yu Yao

Discret. Appl. Math., 1990

Shortest polygonal paths in space.

Rainer E. Burkard, Günter Rote, En-Yu Yao, Zhongliang Yu

Computing, 1990