岩田 陽一

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. 

Proceedings of the 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany. 23:1-23:14 2019年9月  査読有り

Separator-based Pruned Dynamic Programming for Steiner Tree 

Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI) 1520-1527 2019年  査読有り

0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms. 

59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018 462-473 2018年  査読有り

Parameterized Algorithms to Compute Ising Partition Function. 

IEICE Transactions 101-A(9) 1398-1403 2018年  査読有り

Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover. 

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015 70-81 2015年  査読有り

Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. 

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA. 2-8 2015年  査読有り

Linear-Time FPT Algorithms via Network Flow. 

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014 1749-1761 2014年  査読有り

Computing Personalized PageRank Quickly by Exploiting Graph Structures. 

PVLDB 7(12) 1023-1034 2014年  査読有り