Jhih-Hong Ye

According to our database, Jhih-Hong Ye authored at least 7 papers between 2012 and 2020.

Collaborative distances:

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

2020

An improved algorithm for the minmax regret path center problem on trees.

Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li

J. Comput. Syst. Sci., 2020

2018

An improved algorithm for the minmax regret path centdian problem on trees.

Jhih-Hong Ye, Chih-Yu Li, Biing-Feng Wang

J. Comput. Syst. Sci., 2018

On the Minmax Regret Path Center Problem on Trees.

Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2016

Efficient algorithms for the round-trip 1-center and 1-median problems.

Biing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen

J. Comput. Syst. Sci., 2016

2015

On the minmax regret path median problem on trees.

Jhih-Hong Ye, Biing-Feng Wang

J. Comput. Syst. Sci., 2015

2013

A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property.

Chih-Hsuan Li, Jhih-Hong Ye, Biing-Feng Wang

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

On the Round-Trip 1-Center and 1-Median Problems.

Biing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012