Author of the publication

Link Prediction for Annotation Graphs Using Graph Summarization.

, , , , , , and . International Semantic Web Conference (1), volume 7031 of Lecture Notes in Computer Science, page 714-729. Springer, (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.

 

Other publications of authors with the same name

Revisiting Connected Dominating Sets: An Optimal Local Algorithm?, and . APPROX-RANDOM, volume 60 of LIPIcs, page 11:1-11:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Minimizing Uncertainty through Sensor Placement with Angle Constraints., , and . CCCG, page 287-294. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)Efficient Minimum Cost Matching Using Quadrangle Inequality, , , , and . FOCS, page 583-592. IEEE Computer Society, (1992)Flow in Planar Graphs with Vertex Capacities., and . IPCO, page 367-384. University of Waterloo Press, (1990)The full-degree spanning tree problem., , , and . Networks, 36 (4): 203-209 (2000)Scalable and Secure Data Collection Using Bistro., , , , and . DG.O, Digital Government Research Center, (2002)Balancing Minimum Spanning and Shortest Path Trees., , and . SODA, page 243-250. ACM/SIAM, (1993)Approximating the Minimum Equivalent Diagraph., , and . SODA, page 177-186. ACM/SIAM, (1994)Bases for Polynomial Invariants of Conjugates of Permutation Groups., , and . J. Algorithms, 32 (1): 58-61 (1999)Approximation algorithms for data placement on parallel disks., , , , and . SODA, page 223-232. ACM/SIAM, (2000)