( en | de | ru )

 

Disambiguation of "Akiba, Takuya"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling.

, , , , and . AAAI, page 2-8. AAAI Press, (2015)

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.

Takuya Soma

Takuya Suzuki

Charles Akiba Jol︠

 

Other publications of authors with the same name

Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover., and . Theor. Comput. Sci., (2016)Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover., and . ALENEX, page 70-81. SIAM, (2015)Computing Personalized PageRank Quickly by Exploiting Graph Structures., , , and . Proc. VLDB Endow., 7 (12): 1023-1034 (2014)An Exact Algorithm for Diameters of Large Real Directed Graphs., , and . SEA, volume 9125 of Lecture Notes in Computer Science, page 56-67. Springer, (2015)BDD-Constrained A* Search: A Fast Method for Solving Constrained DAG Shortest-Path Problems., , , , , and . AAAI Workshops, volume WS-17 of AAAI Technical Report, AAAI Press, (2017)Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling., , , , and . AAAI, page 2-8. AAAI Press, (2015)Evolutionary Optimization of Model Merging Recipes., , , , and . CoRR, (2024)Dynamic Influence Analysis in Evolving Networks., , , and . Proc. VLDB Endow., 9 (12): 1077-1088 (2016)Network structural analysis via core-tree-decomposition Publication of this article pending inquiry., , and . KDD, page 1476-1485. ACM, (2014)Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction., , and . CIKM, page 909-918. ACM, (2013)