( en | de | ru )

 

Disambiguation of "Fan, Jia-Hao"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity Analysis of Balloon Drawing for Rooted Trees

, , , and . CoRR, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hao Fan

Jia Jia

Xiaofei Hao

Wenjin Hao

Jin Hao

 

Other publications of authors with the same name

Complexity Analysis of Balloon Drawing for Rooted Trees, , , and . CoRR, (2010)Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees., , and . WG, volume 8165 of Lecture Notes in Computer Science, page 152-164. Springer, (2013)An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem., , and . FCT, volume 8070 of Lecture Notes in Computer Science, page 84-94. Springer, (2013)Identifying Complexes from Protein Interaction Networks According to Different Types of Neighborhood Density., , and . J. Comput. Biol., 19 (12): 1284-1294 (2012)A hybrid feature selection algorithm for microarray data., , , , , , and . J. Supercomput., 76 (5): 3494-3526 (2020)Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees., , and . Theor. Comput. Sci., (2015)A novel hybrid algorithm for feature selection., , , , , , and . Personal and Ubiquitous Computing, 22 (5-6): 971-985 (2018)Multicut in trees viewed through the eyes of vertex cover., , , , and . J. Comput. Syst. Sci., 78 (5): 1637-1650 (2012)Multicut in Trees Viewed through the Eyes of Vertex Cover., , , , and . WADS, volume 6844 of Lecture Notes in Computer Science, page 219-230. Springer, (2011)An O*(1.84sk) Parameterized Algorithm for the Multiterminal Cut Problem., , and . CoRR, (2017)