( en | de | ru )

 

Disambiguation of "Wu, Bang Ye"

Author of the publication

copydeleteadd this publication to your clipboard
A Structural Approach for Finding Real-Friend Links in Internet Social Networks.

, , and . iThings/CPSCom, page 305-312. IEEE Computer Society, (2011)

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.

Ye Wu

Holger Bang

Renate Bang

Claudia Bang

Ilse Bang

 

Other publications of authors with the same name

A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees., , , , , and . SODA, page 21-32. ACM/SIAM, (1998)An improved parameterized algorithm for the p-cluster vertex deletion problem., and . J. Comb. Optim., 33 (2): 373-388 (2017)A 2-approximation algorithm for the clustered minimum routing cost tree problem., and . ICS, volume 274 of Frontiers in Artificial Intelligence and Applications, page 3-10. IOS Press, (2014)On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality., , , , , and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 152-163. (2017)An improved algorithm for the k-source maximum eccentricity spanning trees.. Discret. Appl. Math., 143 (1-3): 342-350 (2004)Constructing Light Spanning Trees with Small Routing Cost., , and . STACS, volume 1563 of Lecture Notes in Computer Science, page 334-344. Springer, (1999)On the Maximum Locally Clustered Subgraph and Some Related Problems.. COCOA, volume 6831 of Lecture Notes in Computer Science, page 234-246. Springer, (2011)On the Clustered Steiner Tree Problem.. COCOA, volume 8287 of Lecture Notes in Computer Science, page 60-71. Springer, (2013)Finding Friend Groups in Blogosphere., , and . AINA Workshops, page 1046-1050. IEEE Computer Society, (2008)Tree edge decomposition with an application to minimum ultrametric tree approximation., , and . J. Comb. Optim., 12 (3): 217-230 (2006)