Ying-Fung Wu

According to our database, Ying-Fung Wu authored at least 9 papers between 1985 and 1990.

Collaborative distances:

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

1990

Minimum Cuts for Circular-Arc Graphs.

D. T. Lee, Majid Sarrafzadeh, Ying-Fung Wu

SIAM J. Comput., 1990

1989

Rectilinear Shortest Paths in the presence of Rectangular Barriers.

Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu

Discret. Comput. Geom., 1989

1987

Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles.

Ying-Fung Wu, Peter Widmayer, Martine D. F. Schlag, C. K. Wong

IEEE Trans. Computers, 1987

On Some Distance Problems in Fixed Orientations.

Peter Widmayer, Ying-Fung Wu, C. K. Wong

SIAM J. Comput., 1987

1986

On some union and intersection problems for polygons with fixed orientations.

Peter Widmayer, Ying-Fung Wu, Martine D. F. Schlag, Chak-Kuen Wong

Computing, 1986

Geometric Complexity of Some Loction Problems.

D. T. Lee, Ying-Fung Wu

Algorithmica, 1986

A Faster Approximation Algorithm for the Steiner Problem in Graphs.

Ying-Fung Wu, Peter Widmayer, C. K. Wong

Acta Informatica, 1986

1985

Distance problems in computational geometry with fixed orientations.

Peter Widmayer, Ying-Fung Wu, C. K. Wong

Proceedings of the First Annual Symposium on Computational Geometry, 1985

Rectilinear shortest paths with rectangular barriers.

Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu

Proceedings of the First Annual Symposium on Computational Geometry, 1985