論文

• Yasushi, Tomomi Matsui, Atsushi Miyauchi. Additive approximation algorithms for modularity maximization, Journal of Computer and System Sciences, Vol. 117, pp. 182-201, May 2021.
• Yasushi Kawase, Atsushi Miyauchi. The Densest Subgraph Problem with a Convex/Concave Size Function, Algorithmica, Vol. 80, No. 12, pp. 3461-3480, Dec. 2018.

国際会議発表 (査読有り)

• Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi. Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation, IJCAI2019, Aug. 2019.
• Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi. 'Additive approximation algorithms for modularity maximization, the 27th International Symposium on Algorithms and Computation, 2017.
• Yasushi Kawase, Atsushi Miyauchi. The Densest Subgraph Problem with a Convex/Concave Size Function, The 27th International Symposium on Algorithms and Computation, Dec. 2016.
• Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi. Additive Approximation Algorithms for Modularity Maximization, The 27th International Symposium on Algorithms and Computation, Proceedings of ISAAC2016, pp. 43:1-43:13, Dec. 2016.

国内会議発表 (査読なし・不明)

• 河瀬 康志, 松井 知己, 宮内 敦史. モジュラリティ最大化に対する加法的近似解法, 電子情報通信学会総合大会, COMP-ELC 学生シンポジウム, 2017.
• 河瀬康志, 松井知己, 宮内敦史. モジュラリティ最大化に対する加法的近似解法, 日本オペレーションズリサーチ学会2016年秋季研究発表会, 2016.
• 滝田潤, 高橋佑典, 昆野修平, 八木祐樹, 宮内敦史, 河瀬康志, 松井知己. 整数計画を用いたナンバーリンクの解法, DAシンポジウム2015, 2015.

学位論文

• Community Detection in Networks: Models and Algorithms,  Thesis,  Doctor (Engineering),  Tokyo Institute of Technology,  2017/03/26,   
• Community Detection in Networks: Models and Algorithms,  Summary,  Doctor (Engineering),  Tokyo Institute of Technology,  2017/03/26,   
• Community Detection in Networks: Models and Algorithms,  Exam Summary,  Doctor (Engineering),  Tokyo Institute of Technology,  2017/03/26,   

[ BibTeX 形式で保存 ]    [ 論文・著書をCSV形式で保存 ]    [ 特許をCSV形式で保存 ]