From post

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.

 

Другие публикации лиц с тем же именем

Near-optimal Steiner tree computation powered by node embeddings., и . Knowl. Inf. Syst., 65 (11): 4563-4583 (ноября 2023)How to Build Templates for RDF Question/Answering: An Uncertain Graph Similarity Join Approach., , , , , и . SIGMOD Conference, стр. 1809-1824. ACM, (2015)Towards Generating Hop-constrained s-t Simple Path Graphs., , , и . Proc. ACM Manag. Data, 1 (1): 61:1-61:26 (2023)Multi-document Question Answering Powered by External Knowledge., и . WISE, том 13724 из Lecture Notes in Computer Science, стр. 463-477. Springer, (2022)ESTI: Efficient k-Hop Reachability Querying over Large General Directed Graphs., и . DASFAA (Workshops), том 12680 из Lecture Notes in Computer Science, стр. 71-89. Springer, (2021)Answering Label-Constrained Reachability Queries via Reduction Techniques., и . DASFAA (1), том 13943 из Lecture Notes in Computer Science, стр. 114-131. Springer, (2023)Efficient Weighted Independent Set Computation over Large Graphs., , , и . ICDE, стр. 1970-1973. IEEE, (2020)Computing a Near-Maximum Independent Set in Dynamic Graphs., , , и . ICDE, стр. 76-87. IEEE, (2019)Towards combinational relation linking over knowledge graphs., , , , и . World Wide Web, 24 (6): 1975-1994 (2021)Automated Query Graph Generation for Querying Knowledge Graphs., и . CIKM, стр. 2698-2707. ACM, (2021)