河原林 健一

Algorithmic Topological Graph Theory 

42th ACCMCC 2019年12月   招待有り

Some algorithmic aspect using the Four Color Theorem 

Waterloo Coloring Conference 2019 2019年9月   招待有り

Directed Graph Minors 

30th Workshop on Topological Graph Theory 2018年10月   招待有り

疎グラフでのアルゴリズム 

第11回Webとデータベースに関するフォーラム 2018年9月   招待有り

On the half directed disjoint paths problem 

Graph Theory 2018 2018年8月   招待有り

Parameterized Distributed Algorithms. 

33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary. 6:1-6:16 2019年  査読有り

Optimal Distributed Covering Algorithms. 

33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary. 5:1-5:15 - 106 2019年  査読有り

Polylogarithmic approximation for Euler genus on bounded degree graphs. 

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. 164 - 175 2019年  査読有り

Intrinsic Dimensionality Estimation within Tight Localities. 

Proceedings of the 2019 SIAM International Conference on Data Mining, SDM 2019, Calgary, Alberta, Canada, May 2-4, 2019. 181 - 189 2019年  査読有り

Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. 

PRICAI 2019: Trends in Artificial Intelligence - 16th Pacific Rim International Conference on Artificial Intelligence, Cuvu, Yanuca Island, Fiji, August 26-30, 2019, Proceedings, Part I 568 - 582 2019年  査読有り