2014年度の研究成果 2015年度の研究成果 2016年度の研究成果 2017年度の研究成果 2019年度の研究成果 2020年度の研究成果
A: 劣線形時間アルゴリズムグループ(Team A)
D: 劣線形データ構造グループ(Team D)
M: 劣線形モデリンググループ(Team M)
受賞
A マイクロソフト情報学研究賞, 吉田悠一, 2018年3月1日.
A Best Paper Award, International Conference on Artificial Intelligence and Statistics (AISTATS), Yuichi Yoshida, 2018年4月1日.
A 電子情報通信学会 フェロー, 加藤直樹, 2019年3月21日.
D 第5回IoT Lab Selectionファイナリスト, 山際伸一, 2018年3月1日.
D 第5回Rise Up Festa「優秀賞」, 山際伸一, 2018年5月1日.
D 大学発ベンチャー表彰2018 科学技術振興機構理事長賞, 山際伸一, 坂本比呂志, 2018年8月30日.
M 日本オペレーションズ・リサーチ学会60周年記念論文賞, 塩浦昭義, 2018年9月6日.
M Student Paper Award, 2018 International Symposium on Nonlinear Theory and its Applications, Minami Tsuchiya et. al., 2018年9月6日.
メディア
新聞報道
A 毎日新聞, 足止めくっきりと 大阪市昼50万人減, 2018年6月26日.
A 朝日新聞, 直下地震揺らいだ都市, 2018年7月18日.
テレビ
A 関西テレビ放送「報道ランナー」, 走れ！ギモン調査部「地震時「歩いて出社・帰宅」専門家が見た危険性は？」, 2018年7月13日.
国際学会および国内学会発表
招待講演（国際）
A Naoki Katoh, “Concept and Challenge of Faculty of Social Information Science, University of Hyogo”, International Conference on Education of Data Science in Hikone 2018 (HDS2018), Shiga, Japan, 2018年11月15日.
A Adnan Sljoka, “Rigidity theory and its applications to protein function analysis”, Workshop of CREST Big Data Applications, Kyoto, Japan, 2019年1月24日.
D Kunihiko Sadakane, “Renge minimum Queries and Applications”, IWOCA 2018: 29th International Workshop on Combinational Algorithms, Singapore, 2018年7月17日.
招待講演（国内）
A 瀧澤重志, 避難計画のための数理技術, 大阪市立大学防災講座「自然災害と都市」, 大阪, 2018年9月7日.
A 笹嶋宗彦, 現場の知識とデータを活かすデータサイエンティストの育成, 兵庫県立大学知の交流シンポジウム2018, 兵庫, 2018年9月26日.
A 高澤兼二郎, 制約付きマッチングとその応用, 日本オペレーションズ・リサーチ学会RAMPシンポジウム, 広島, 2018年10月11日.
A 岡本吉央, 幾何的最短路に関する諸問題, 第30回RAMPシンポジウム, 広島, 2018年10月11日.
A 瀧澤重志, 空間の解析と生成：数理・情報科学による計画研究の拡張, 関西建築技術研究会第301回本会, 大阪, 2018年10月31日.
A 笹嶋宗彦, 現場志向のデータサイエンス教育へのチャレンジ, 滋賀大学データサイエンスフォーラム2018「日本の大学及び大学院におけるデータサイエンス教育の現状と展望」, 滋賀, 2018年11月30日.
A 玉置卓, 精緻な計算複雑性と暗号理論, 第10回暗号及び情報セキュリティと数学の相関ワークショップ (CRISMATH 2018), 東京, 2018年12月28日.
A 瀧澤重志, 避難計画のための数理技術と主に大阪市を対象とした応用例の紹介, 日本オペレーションズ・リサーチ学会2019年春季研究発表会, 千葉, 2019年3月13日.
A 笹嶋宗彦, データサイエンティストの育成, 兵庫県立大学知の創造フォーラム「AI時代を切り拓く」, 兵庫, 2019年3月13日.
D 矢田勝俊, データ主導型研究の展開と現実, 大阪大学産業科学研究所招待講演, 大阪, 2018年6月25日.
D 矢田勝俊, 消費者はどのようにカタログを見ているのか？, コープさっぽろ分析力養成講座, 北海道, 2018年11月30日.
D 矢田勝俊, センサーマーケティングとビジネスの最前線, 関西大学先端科学技術シンポジウム, 大阪, 2019年1月24日.
M 安田宗樹, 統計的機械学習, 第37回日本医用画像工学会大会, 茨城, 2018年7月27日.
M 安田宗樹, 人と機械のデータサイエンス, 第54回日本眼光学学会総会, 新潟, 2018年9月8日.
M 高橋茶子, 安田宗樹, 統計的機械学習への発展的な平均場近似の応用, 第30回RANPシンポジウム（RAMP2018）, 広島, 2018年10月11日.
口頭講演（国際）
A Y. Okamoto, “Submodular reassignment problem for reallocating agents to tasks with synergy effects”, 11th Combinatorial Algorithms Day, ETH Zurich, 2018年6月4日.
A Y. Okamoto, “Submodular reassignment problem for reallocating agents to tasks with synergy effects”, First Conference on Discrete Optimization and Machine Learning, Tokyo, Japan, 2018年7月23日.
A Y. Kobayashi, “Generation Methods of Panel-Hinge Frameworks Based on Regular Skew Polyhedra”, Bridges 2018 : Mathematics, Music, Art, Architecture, Culture, Stockholm, Sweden, 2018年7月27日.
A K. Takazawa, “The b-branching problem in digraphs”, The 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Liverpool, UK, 2018年8月27日.
A Y. Kobayashi, “Periodic Sponge Surfaces and Their Rigidity”, The 21th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2018), Metro Manila, Philippines, 2018年9月1日.
A A. Nagao and M. Yokota, “PSPACE-completeness for Snakebird”, The 21th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, (JCDCGGG 2018), Metro Manila, Philippines, 2018年9月2日.
A N. Tsuchimura, “Distributed Computation for Protein Structure Analysis”, The 10th International Conference on Intelligent Networking and Collaborative Systems (INCoS-2018), Bratislava, Slovakia, 2018年9月5日.
A Y. Higashikawa, “Characterizing minimally rigid body-bar graphs without proper rigid subgraphs”, Operations Research 2018, The annual international conference of the German Operations Research Society (GOR), Brussels, Belgium, 2018年9月13日.
A X. Bultel, J. Dreier, J. Dumas, P. Lafourcade, D. Miyahara, T. Mizuki, A. Nagao, T. Sasaki, K. Shinagawa and H. Sone, “Physical Zero-Knowledge Proof for Makaro”, 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Tokyo, Japan, 2018年11月5日.
A S. Tamaki, “Beating Brute Force for Systems of Polynomial Equations over Finite Fields”, MPI-INF and MPI-MiS joint workshop on Theoretical Computer Science and Algebraic Geometry, Saarbrücken, Germany, 2019年1月18日.
D K. Amano and S. Nakano, “Away from Rivals”, 30th Canadian Conference on Computational Geometry, CCCG 2018, Winnipeg, Canada, 2018年8月8日.
D M. Ikeda, “Cut Sparsifiers for Balanced Digraphs”, 16th International Workshop on Approximation and Online Algorithms (WAOA2018), Helsinki, Finland, 2018年8月24日.
D K. Ishibashi and K. Yada, “Assessment of Effect of POP on Purchase Behavior: Comparison of Effectiveness of Eyetracking Data and Shopping Path Data”, 5th Asia-Pacific World Congress on Computer Science and Engineering (APWC on CSE 2018), Momi Bay, Fiji, 2018年12月12日.
M S. Arai, M. Ohzeki and K. Tanaka, “Deep Neural Network detects quantum phase transition in D-Wave 2000Q”, Adiabatic Quantum Computing Conference 2018, Moffett field, CA, 2018年6月28日.
M A. Shioura, “M-convex Function Minimization Under L1-distance Constraint”, 23rd International Symposium on Mathematical Programming, Bordeaux, France, 2018年7月4日.
M C. Takahashi, M. Yasuda and K. Tanaka, “Learning restricted Boltzmann machine via the adaptive Thouless-Anderson-Palmer mean-field approximation”, Statistical Physics of Disordered Systems and Its Applications (SPDSA2018), Miyagi, Japan, 2018年11月7日.
M M. Okuyama and M. Ohzeki, “Optimal control theory solves mean-field quantum spin systems”, Statistical Physics of Disordered Systems and Its Applications (SPDSA2018), Miyagi, Japan, 2018年11月7日.
M S. Arai, M. Ohzeki and K. Tanaka, “Dynamics of order parameters of non-stoquastic Hamiltonian in adaptive quantum Monte Carlo method”, Statistical Physics of Disordered Systems and Its Applications (SPDSA2018), Miyagi, Japan, 2018年11月7日.
口頭講演（国内）
A 小林祐貴, 切頂八面体に基づく柔軟な周期的立体の展開図, 第24回折り紙の科学・数学・教育研究集会（日本折紙学会）, 東京, 2018年6月16日.
A 川岸裕, 瀧澤重志, 道路ネットワーク簡略化による大規模徒歩帰宅シミュレーションの高速化の検討, 日本建築学会大会学術講演（東北）, 宮城, 2018年9月5日.
A 小林祐貴, 剛なbody-barフレームワークの生成手法, 日本建築学会大会学術講演（東北）, 宮城, 2018年9月6日.
A 平田峻介, ルガル フランソワ, 玉置卓, 照山順一, 定数次数グラフにおけるkモジュラリティ最大化問題のNP困難性, 電子情報通信学会コンピュテーション研究会, 福岡, 2018年9月18日.
A 大勝章平, 媒介変数表示される重みに対する最大後悔最小化1-センター問題, 電子情報通信学会コンピュテーション研究会, 福岡, 2018年9月18日.
A 東園和樹, 伊藤大雄, 階層構造に基づく複雑ネットワーク生成モデルの超有限性, 電子情報通信学会コンピュテーション研究会, 京都, 2018年10月26日.
A 小林祐貴, 切頂八面体に基づく柔軟な空間充填立体を剛にする手法, 日本建築学会第41回情報・システム・利用・技術シンポジウム, 東京, 2018年12月6日.
A 川岸裕，瀧澤重志, 大阪市における南海トラフ地震に起因する津波からの最速避難計画手法, 日本建築学会第41回情報・システム・利用・技術シンポジウム, 東京, 2018年12月7日.
A 長尾篤樹, パズルの唯一解をめぐるヒント数の計算量について, 第14回組合せゲーム・パズル研究集会, 東京, 2019年3月11日.
A 岡本吉央, “Mind the Mind with Synchronous Clocks”, 第14回組合せゲーム・パズル研究集会, 東京, 2019年3月11日.
D 山岸大騎, 髙木拓也, 渋谷哲朗, 有村博紀, 重み付き有向非巡回グラフに対する効率良いテキスト索引の構築アルゴリズム, 第17回情報科学技術フォーラム（FIT2018）, 福岡, 2018年9月20日.
D 古谷勇, 髙木拓也, 中島祐人, 稲永俊介, 坂内英夫, 喜田拓也, 極大反復部分文字列に基づく文法圧縮”, 第171回アルゴリズム研究会, 大阪, 2019年1月30日.
M 安田宗樹, 小渕智之, レプリカ法を用いたボルツマンマシンに対する経験ベイズ推定, 日本物理学会第74回年次大会, 福岡, 2019年3月17日.
M 荒井俊太, 大関真之, 田中和之, D-Waveマシンにおける量子相転移の解析, 日本物理学会2018年秋季大会, 京都, 2018年9月10日.
M 奥山真佳, 大関真之, 静的近似を用いない量子系の平均場模型の分配関数の厳密解, 日本物理学会2018年秋季大会, 京都, 2018年9月10日.
M 越川亜美, 大関真之, 観山正道, 門脇正史, 田中和之, ベイズ的最適化によるスピングラスの基底状態の探索, 日本物理学会第74回年次大会, 福岡, 2019年3月14日.
M 荒井俊太, 大関真之, 田中和之, マスター方程式を用いた非擬似古典確率的なハミルトニアンの秩序変数のダイナミクス, 日本物理学会第74回年次大会, 福岡, 2019年3月15日.
M 山本雅之, 大関真之, 田中和之, シミュレーテッド・アニーリングを量子アニーリングでシミュレートすることによるフェアサンプリング, 電子情報通信学会2019年総合大会, 東京, 2019年3月19日.
ポスター発表（国際）
D S. Yamagiwa, R. Morita and K. Marumo, “Bank Select Method for Reducing Symbol Search Operations on Stream-based Lossless Data Compression”, Data Compression Conference 2019, Snowbird, UT, 2019年3月28日.
M S. Arai, S. Okada, M. Ohzeki and K. Tanaka, “Acceleration of adaptive quantum Monte Carlo Sampling for a class of non-stoquastic Hamiltonian by using D-Wave 2000Q”, Adiabatic Quantum Computing Conference 2018 (AQC-18), Moffett field, CA, 2018年6月25日.
M C. Takahashi, M. Ohzeki, S. Okada, M. Terabe, S. Taguchi and K. Tanaka, “Statistical Mechanical Analysis of Hamiltonian Estimation of Ising Spin Glass Based on the Framework of Statistical Query Learning”, Adiabatic Quantum Computing Conference 2018 (AQC-18), Moffett field, CA, 2018年6月26日.
M M. Okuyama and M. Ohzeki, “Classical speed limit applied to imaginary-time Grover problem”, Adiabatic Quantum Computing Conference 2018 (AQC-18), Moffett field, CA, 2018年6月28日.
M S. Arai, M. Ohzeki and K. Tanaka, “Adaptive quantum Monte Carlo method for a class of non-stoquastic Hamiltonian by using D-Wave machine”, Qubits 2018, Knoxville, USA, 2018年9月26日.
ポスター発表（国内）
A 岡本吉央, 劣モジュラ再割当問題, 本部SSOR2018, 群馬, 2018年8月29日.
A 長尾篤樹, 松本直己, グラフ上の帰還ゲームとそのPSPACE完全性, 情報系 Winter Festa Episode 4, 東京, 2018年12月26日.
M 高橋茶子，安田宗樹，田中和之, 適応 Thouless-Anderson-Palmer 近似による勾配法を用いた制限ボルツマンマシンの学習, 第21回情報論的学習理論ワークショップ (IBIS2018), 北海道, 2018年11月5日.
M 高橋茶子，安田宗樹，田中和之, 適応 Thouless-Anderson-Palmer 近似による勾配法を用いた制限ボルツマンマシンの学習, 情報系 Winter Festa Episode 4, 東京, 2018年12月26日.
学術雑誌掲載論文一覧
国際論文誌
A K. Kimura and K. Makino, “Linear satisfiability preserving assignments (Extended Abstract)”, IJCAI 2018, pp.5622-5626, 2018 (DOI: 10.24963/ijcai.2018/797)
A A. Kawachi, K. Kawano, F.L. Gall and S. Tamaki, “Quantum Query Complexity of Unitary Operator Discrimination”, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E102-D, No.3, pp.483-491, 2019 (DOI: 10.1587/transinf.2018FCP0012)
A T. Akagi, T. Araki, T. Horiyama, S. Nakano, Y. Okamoto, Y. Otachi, T. Saitoh, R. Uehara, T. Uno and K. Wasa, “Exact Algorithms for the Max-Min Dispersion Problem”, Lecture Notes in Computer Science, Vol.10823, pp.263-272, 2018 (DOI: 10.1007/978-3-319-78455-7_20)
A A. Golovnev, A.S. Kulikov, A.V. Smal and S. Tamaki, “Gate Elimination: Circuit Size Lower Bounds and #SAT Upper Bounds”, Theoretical Computer Science, Vol.719, pp.46-63, 2018 (DOI: 10.1016/j.tcs.2017.11.008)
A L. Ye, C. Neale, A. Sljoka, B. Lyda, D. Pichugin, N. Tsuchimura, S.T. Larda, R. Pomès, A.E. García, O.P. Ernst, R.K. Sunahara and R.S. Prosser, “Mechanistic insights into allosteric regulation of the A2A adenosine G protein-coupled receptor by physiological cations”, Nature Communication, 1, 9:1372, 2018 (DOI: 10.1038/s41467-018-03314-9)
A Y. Asahiro, J. Jansson, E. Miyano, H. Nikpey and H. Ono, “Graph orientation with splits”, ISCO2018, Lecture Notes in Computer Science, 10856, pp.52-63, 2018 (DOI: 10.1007/978-3-319-96151-4_5)
A E. Boros, V. Gurvich, N.B. Ho, K. Makino and P. Mursic, “On the Sprague-Grundyfunction of Exact k-Nim”, Discrete Applied Mathematics, 239, pp.1-14, 2018 (DOI: 10.1016/j.dam.2017.08.007)
A T. Ito, N. Kakimura, N. Kamiyama, Y. Kobayashi and Y. Okamoto, “Reconfiguration of Maximum-Weight b-Matchings in a Graph”, Journal of Combinatorial Optimization, Vol.37, pp.454-464, 2019 (DOI: 10.1007/s10878-018-0289-3)
A P. Zhang, Y. Xu, T. Jian, A. Li, G. Lin and E. Miyano, “Improved approximation algorithms for the maximum happy vertices and edges problems”, Algorithmica, Vol.80, No.5, pp.1412-1438, 2018 (DOI: 10.1007/s00453-017-0302-8)
A Y. Asahiro, Y. Doi, E. Miyano, K. Samizo and H. Shimizu, “Optimal approximation algorithms for maximum distance-bounded subgraph problems”, Algorithmica, Vol.80, No.6, pp.1834-1856, 2018 (DOI: 10.1007/s00453-017-0344-y)
A K. Yamanaka, T. Horiyama, J.M. Keil, D.G. Kirkpatrick, Y. Otachi, T. Saitoh, R. Uehara and Y. Uno, “Swapping colored token on graphs”, Theoretical Computer Science, Vol.729, pp.1-10, 2018 (DOI: 10.1016/j.tcs.2018.03.016)
A H. Sumita, N. Kakimura and K. Makino, “Total dual integrality of the linear complementarity problem”, Annals OR, 274, pp.531-553, 2019 (DOI: 10.1007/s10479-018-2926-8)
A T. Ito and Y. Otachi, “Reconfiguration of Colorable Sets in Classes of Perfect Graphs”, Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), LIPIcs 101, pp.27:1-27:13, 2018 (DOI: 10.4230/LIPIcs.SWAT.2018.27)
A K. Elbassioni and K. Makino, “Enumerating vertices of 0/1-polyhedra associated with 0/1-Totally unimodular matrices”, SWAT 2018, pp.18:1-18:14, 2018 (DOI: 10.4230/LIPIcs.SWAT.2018.18)
A S. Li, J. Xu and M. Ye, “Approximating Global Optimum for Probabilistic Truth Discovery”, Proc. 24th International Computing and Combinatorics Conference (COCOON 2018), Vol.10976, 2018 (DOI: 10.1007/978-3-319-94776-1_9)
A R. Benkoczi, B. Bhattacharya, Y. Higashikawa, T. Kameda and N. Katoh, “Minsum k-Sink Problem on Dynamic Flow Path Networks”, Proceedings of IWOCA 2018, pp.78-89, 2018 (DOI: 10.1007/978-3-319-94667-2_7)
A Y. Asahiro, E. Miyano and T. Yagita, “Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks”, ICCSA 2018, Lecture Notes in Computer Science, Vol.10961, pp.607-623, 2018 (DOI: 10.1007/978-3-319-95165-2_43)
A Y. Kawase, K. Makino and K. Seimi, “Optimal composition ordering problems for piecewise linear functions”, Algorithmica, 80, pp.2134-2159, 2018 (DOI: 10.1007/s00453-017-0397-y)
A T. Feng, T. Horiyama, Y. Okamoto, Y. Otachi, T. Saitoh, T. Uno and R. Uehara, “Computational Complexity of Robot Arm Simulation Problems”, Lecture Notes in Computer Science, Vol.10979, pp.177-188, 2018 (DOI: 10.1007/978-3-319-94667-2_15)
A W. Tong, E. Miyano, R. Goebel and G. Lin, “An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops”, Theoretical Computer Science, Vol.734, pp.24-31, 2018 (DOI: 10.1016/j.tcs.2017.09.018)
A Y. Higashikawa, S.W. Cheng, T. Kameda, N. Katoh and S. Saburi, “Minimax Regret 1-Median Problem in Dynamic Path Networks”, Theory of Computing Systems, Vol.62(6), pp.1392-1408, 2018 (DOI: 10.1007/s00224-017-9783-8)
A S. Tamaki and Y. Yoshida, “Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues”, ACM Transactions on Algorithms, Vol.14, No.4, pp.45:1-45:13, 2018 (DOI: 10.1145/3228342)
A N. Tsuchimura and A. Sljoka, “Distributed Computation for Protein Structure Analysis”, Advances in Intelligent Networking and Collaborative Systems. INCoS 2018. Lecture Notes on Data Engineering and Communications Technologies, Vol.23, pp.16-23, 2019 (DOI: 10.1007/978-3-319-98557-2_2)
A N. Kakimura, N. Kamiyama and K. Takazawa, “The b-branching problem in digraphs”, Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Leibniz International Proceedings in Informatics 117, pp.12:1-12:15, 2018 (DOI: 10.4230/LIPIcs.MFCS.2018.12)
A K. Yamanaka, Md.S. Rahman and S. Nakano, “Enumerating Floorplans with Columns”, IEICE TRANS. FUNDAMENTALS, Vol.E101-A, No.9, pp.1392-1397, 2018 (DOI: 10.1587/transfun.E101.A.1392)
A S. Ehara, K. Iwama and J. Teruyama, “Small Complexity Gaps for Comparison-Based Sorting”, Adventures Between Lower Bounds and Higher Altitudes – Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, LNCS 1011, pp.280-296, 2018 (DOI: 10.1007/978-3-319-98355-4)
A E. Argyriou, S. Cornelsen, H. Förster, M. Kaufmann, M. Nöllenburg, Y. Okamoto, C. Raftopoulou and A. Wolff, “Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity”, Lecture Notes in Computer Science, Vol.11282, pp.509-523, 2018 (DOI: 10.1007/978-3-030-04414-5_36)
A A. Nagao, K. Seto and J. Teruyama, “A Moderately Exponential Time Algorithm for k-IBDD Satisfiability”, Algorithmica, Vol.80, No.10, pp.2725–2741, 2018 (DOI: 10.1007/s00453-017-0332-2)
A M. Lampis, K. Makino, V. Mitsou and Y. Uno, “Parameterized edge Hamiltonicity”, Discrete Applied Mathematics, Vol.248, pp.68-78, 2018 (DOI: 10.1016/j.dam.2017.04.045)
A Y. Hanawa, Y. Higashikawa, N. Kamiyama, N. Katoh and A. Takizawa, “The mixed evacuation problem”, Journal of Combinatorial Optimization, Vol.36(4), pp.1299-1314, 2018 (DOI: 10.1007/s10878-017-0237-7)
A E. Boros, K. Elbassioni, M. Fouz, V. Gurvich, K. Makino and B. Manthey, “Approximation schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions”, Algorithmica, 80, pp.3132-3157, 2018 (DOI: 10.1007/s00453-017-0372-7)
A S. Langerman and Y. Uno, “Threes!, Fives, 1024!, and 2048 are hard”, Theoretical Computer Science, Vol.748, pp.17-27, 2018 (DOI: 10.1016/j.tcs.2018.03.018)
A B. Bhattacharya, Y. Higashikawa, T. Kameda and N. Katoh, “An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks”, Proceedings of ISAAC 2018, pp.14:1-14:13, 2018 (DOI: 10.4230/LIPIcs.ISAAC.2018.14)
A Z. Abel, E.D. Demaine, M.L. Demaine, H. Ito, J. Snoeyink and R. Uehara, “Bumpy pyramid folding”, Computational Geometry, Vol.75, pp.22-31, 2018 (DOI: 10.1016/j.comgeo.2018.06.007)
A D. Wang, M. Gaboardi and J. Xu, “Empirical Risk Minimization in Non-interactive Local Differential Privacy Revisited”, Proc. 32nd Annual Conference on Advances in Neural Information Processing Systems (NeurIPS 2018), pp.965-974, 2018.
A E. Arseneva, M.K. Chiu, M. Korman, A. Markovic, Y. Okamoto, A. Ooms, A. van Renssen and M. Roeloffzen, “Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain”, Leibniz International Proceedings in Informatics, Vol.123, pp.58:1-58:13, 2018 (DOI: 10.4230/LIPIcs.ISAAC.2018.58)
A T. Ito, N. Kakimura, N. Kamiyama, Y. Kobayashi and Y. Okamoto, “Minimum-Cost b-Edge Dominating Sets on Trees”, Algorithmica, Vol.81, No.1, pp.343-366, 2019 (DOI: 10.1007/s00453-018-0448-z)
A K. Iwama and A. Nagao, “Read-Once Branching Programs for Tree Evaluation Problems”, ACM Transactions on Computation Theory, Vol.11, No.1, 2019, Article No.5, 2019 (DOI: 10.1145/3282433)
A J. Kawahara, T. Saitoh and R. Yoshinaka, “The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant”, Journal of Graph Algorithms and Applications, Vol.23, No.1, pp.29-70, 2018 (DOI: 10.7155/jgaa.00483)
A J. Andro-Vasko, W. Bein and H. Ito, “Energy efficiency and renewable energy management with multi-state power-down system”, special issue “Information technology: new generation (ITNG 2018),” Information, MDPI, Vol.10, No.2, Article 44, pp.1-21, 2019 (DOI: 10.3390/info10020044)
A D. Wang and J. Xu, “Differentially private empirical risk minimization with smooth nonconvex loss functions: A non-stationary view”, Proc. the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI 2019), 2019.
A T. Ito, N. Kakimura, N. Kamiyama, Y. Kobayashi and Y. Okamoto, “Reconfiguration of Maximum-Weight b-Matchings in a Graph”, Journal of Combinatorial Optimization, Vol.37, No.2, pp.454-464, 2019.
A Y. Kishi, N. Kitsuwan, H. Ito, B.C. Chatterjee and E. Oki, “Modulation-Adaptive Link-Disjoint Path Selection Model for 1+1 Protected Elastic Optical Networks”, IEEE Access, Vol.7, No.1, pp.25422-25437, 2019 (DOI: 10.1109/ACCESS.2019.2901018)
A S.W. Bae, M. Korman and Y. Okamoto, “Computing the Geodesic Centers of a Polygonal Domain”, Computational Geometry: Theory and Applications, Vol.77, pp.3-9, 2019 (DOI: 10.1016/j.comgeo.2015.10.009)
A Z. Huang, H. Ding and J. Xu, “Faster Algorithm for Truth Discovery via Range Cover”, Accepted to the special issue of Algorithmica on a few invited paper from WADS 2017, pp.1–16, 2019 (DOI: 10.1007/s00453-019-00562-z)
A R. Yamamoto and A. Takizawa, “Partitioning vertical evacuation areas in Umeda underground mall to minimize the evacuation completion time”, The Review of Socionetwork Strategies, pp.1-17, 2019.
A Y. Higashikawa and N. Katoh, “A Survey on Facility Location Problems in Dynamic Flow Networks”, The Review of Socionetwork Strategies (submitted)
A K. Takazawa and Y. Yokoi, “A generalized-polymatroid approach to disjoint common independent sets in two matroids”, Discrete Mathematics, 342, pp.2002-2011, 2019.
A H. Ding and J. Xu, “A Unified Framework for Clustering Constrained Data Without Locality Property”, Argorithmica, Online ISSN 1432-0541, pp.1-45, 2019 (DOI: 10.1007/s00453-019-00616-2)
A E.D. Demaine, H. Ito, S. Langerman, J. Lynch, M. Rudoy and K. Xiao, “Cookie Clicker”, special issue of JCDCG^3 2017, Graphs and Combinatorics, Springer, 2019 (in press)
A H. Ito, A. Nagao and T. Park, “Generalized shogi, chess, and xiangqui are constant-time testable”, IEICE Transactions, 2019 (in press)
A K. Elbassioni and K. Makino, “Finding Sparse Solutions for Packing and Covering Semidefinite Programs”, 2019 (submitted)
ADM K. Yamanaka, E.D. Demaine, T. Horiyama, A. Kawamura, S. Nakano, Y. Okamoto, T. Saitoh, A. Suzuki, R. Uehara and T. Uno, “Sequentially Swapping Colored Tokens on Graphs”, Journal of Graph Algorithms and Applications (JGAA), Vol.23, No.1, pp.3-27, 2019 (DOI: 10.7155/jgaa.00482)
D P. Abedin, A. Ganguly, W.K. Hon, Y. Nekrich, R. Shah, S.V. Thankachan and K. Sadakane, “A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time”, Proceedings of COCOON, LNCS 10976, pp.615-625, 2018 (DOI: 10.1007/978-3-319-94776-1_51)
D K. Yamanaka, Y. Matsui and S. Nakano, “More Routes for Evacuation”, Proc. of COCOON 2018, LNCS 10976, pp.76-83, 2018 (DOI: 10.1007/978-3-319-94776-1_7)
D T. Ohno, K. Goto, Y. Takabatake, T. I and H. Sakamoto, “LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression”, IWOCA 2018, 323-335, 2018.
D S. Denzumi, J. Kawahara, K. Tsuda, H. Arimura, S. Minato and K. Sadakane, “DenseZDD: A Compact and Fast Index for Families of Sets”, Algorithms, 11(8), 128, 2018 (DOI: 10.3390/a11080128)
D A. Conte, G. Ferraro, R. Grossi, A. Marino, K. Sadakane and T. Uno, “Node Similarity with q-Grams for Real-World Labeled Networks”, Proceedings of KDD, pp.1282-1291, 2018 (DOI: 10.1145/3219819.3220085)
D H.T. Wei, W.K. Hon, P. Horn, C.S. Liao and K. Sadakane, “An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity”, Proceedings of APPROX, 27:1-27:14, 2018 (DOI: 10.4230/LIPIcs.APPROX-RANDOM.2018.27)
D T. Ohno, K. Sakai, Y. Takabatake, T. I and H. Sakamoto, “A faster implementation of online RLBWT and its application to LZ77 parsing”, J. Discrete Algorithms, 52, 18-28, 2018 (DOI: 10.1016/j.jda.2018.11.002)
D S. Nakagawa, T. Sakamoto, Y. Takabatake, T. I, K. Shin and H. Sakamoto, “Privacy-Preserving String Edit Distance with Moves”, SISAP 2018: 226-240, 2018.
D B. Wu, Y. Sun and K. Yada, “The Short-term Impact of an Item-based Loyalty Program”, Proceedings of 2018 IEEE Conference on System, Man and Cybernetics, IEEE Press, pp.1846-1851, 2018 (DOI: 10.1109/SMC.2018.00319)
D Y. Zuo, K. Yada, T. Li and P. Chen, “Application of Network Analysis Techniques for Customer In-store Behavior in Supermarket”, Proc. of 2018 IEEE Conference on System, Man and Cybernetics, IEEE Press, pp.1861-1866, 2018 (DOI: 10.1109/SMC.2018.00322)
D X. Zhong, K. Ishibashi and K. Yada, “An Empirical Study of the Relationship among Self-Control, Price Promotions and Consumer Purchase Behavior”, Proc. of 2018 IEEE Conference on System, Man and Cybernetics, IEEE Press, pp.1867-1872, 2018 (DOI: 10.1109/SMC.2018.00323)
D Y. Kaneko, K. Yada, W. Ihara and R. Odagiri, “How Game Users Consume Virtual Currency: The Relationship Between Consumed Quantity, Inventory, and Elapsed Time Since Last Consumption in the Mobile Game World”, ICDM 2018 Workshop Proceeding, pp.848-855, 2018 (DOI: 10.1109/ICDMW.2018.00125)
D T. Araki and S. Nakano, “The Max-Min Dispersion on a Line”, Proc. of COCOA 2018, LNCS 11346, pp.672-678, 2018 (DOI: 10.1007/978-3-030-04651-4_45)
D K. Nakamura and K. Sadakane, “Space-Efficient Fully Dynamic DFS in Undirected Graphs”, Algorithms, 12(3), Article No.52, 2019 (DOI: 10.3390/a12030052)
D S. Ahmed, S. Nakano and Md.S. Rahman, “r-Gatherings on a Star”, Proc. of WALCOM 2019, LNCS11355, pp.31-42, 2019 (DOI: 10.1007/978-3-030-10564-8_3)
D I. Furuya, T. Takagi, Y. Nakashima, S. Inenaga, H. Bannai and T. Kida, “MR-RePair: Grammar Compression Based on Maximal Repeats”, In Proceedings of Data Compression Conference (DCC2019), IEEE Computer Society Press, pp.508-517, 2019.
D Y. Sasaki, T. Shibuya, K. Ito and H. Arimura, “Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score”, IEICE Transactions on Fundamentals, Vol.E102-A, No.9, pp.1159-1170, 2019 (DOI: 10.1587/transfun.E102.A.1159)
D K. Sakai, T. Ohno, K. Goto, Y. Takabatake, T. I and H. Sakamoto, “RePair in Compressed Space and Time”, DCC2019, to appear (in press)
D K. Ishibashi and K. Yada, “Assessment of Effect of POP on Purchase Behavior: Comparison of Effectiveness of Eyetracking Data and Shopping Path Data”, Proceedings of 5th Asia-Pacific World Congress on Computer Science and Engineering (APWC on CSE 2018), to appear (in press)
M M. Ohzeki, Y. Kudo and K. Tanaka, “An Extension of Estimation of Critical Points in Ground State for Random Spin Systems”, Journal of the Physical Society of Japan, Vol.87, No.1, Article ID.015001, pp.1-2, 2018 (DOI: 10.7566/JPSJ.87.015001)
M K. Murota and A. Shioura, “On Equivalence of M^\natural-concavity of a Set Function and Submodularity of its Conjugate”, Journal of Operations Research Society of Japan, Vol.61, pp.163-171, 2018 (DOI: 10.15807/jorsj.61.163)
M M. Yasuda, “Learning Algorithm of Boltzmann machine based on Spatial Monte Carlo integration Method”, Algorithms, Vol.11, No.4, Article ID: 42, 2018 (DOI: 10.3390/a11040042)
M C. Takahashi, M. Ohzeki, S. Okada, M. Terabe, S. Taguchi and K. Tanaka, “Statistical-Mechanical Analysis of Compressed Sensing for Hamiltonian Estimation of Ising Spin Glass”, Journal of the Physical Society of Japan, Vol. 87, No.7, article no. 074001, pp.1–7, 2018 (DOI: 10.7566/JPSJ.87.074001)
M T. Hanaka, T. Ito, H. Mizuta, B. Moore, N. Nishimura, V. Subramanya, A. Suzuki and K. Vaidyanathan, “Reconfiguring Spanning and Induced Subgraphs”, Proceedings of the 24th Annual International Computing and Combinatorics Conference (COCOON 2018), LNCS 10976, pp.428-440, 2018 (DOI: 10.1007/978-3-319-94776-1_36)
M K. Tanaka, M. Nakamura, S. Kataoka, M. Ohzeki and M. Yasuda, “Momentum-space renormalization group transformation in Bayesian image modeling by Gaussian graphical model”, Journal of the Physical Society of Japan, Vol.87, No.8, Article ID.085001, pp.1-2, 2018 (DOI: 10.7566/JPSJ.87.085001)
M S. Cho, M. Tsuchiya, M. Yasuda and M. Yokoyama, “Estimation System of Blood Pressure Variation Using Multiple Regression Analysis and Neural Network”, Proceedings of the International Conference on Advances in Next Generation Computer and Information Technology V (NGCIT2018), Advanced Science and Technology Letters, Vol.152, pp.61-64, 2018 (DOI: 10.14257/astl.2018.152.13)
M T. Hatanaka, T. Ito and X. Zhou, “Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters”, Theoretical Computer Science, Vol.739, pp.65-79, 2018 (DOI: 10.1016/j.tcs.2018.05.005)
M H. Maniwa, T. Oki, A. Suzuki, K. Uchizawa and X. Zhou, “Computational power of threshold circuits of energy at most two”, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E101-A, No.9, pp.1431-1439, 2018 (DOI: 10.1587/transfun.E101.A.1431)
M M. Tsuchiya, A. Tanaka, M. Yasuda, T. Harada, S. Cho and M. Yokoyama, “Estimation of Awaking Time Using a Deep Neural Network with Physiological Data During Sleep”, Proceedings of the 2018 International Symposium on Nonlinear Theory and its Applications (NOLTA2018), pp.27-30, 2018.
M T. Harada, M. Yokoyama, M. Yasuda and A. Tanaka, “The Multiple Beacon System for Detection of the Gathering Degree of People in a Certain Place”, Proceedings of the 2018 International Symposium on Nonlinear Theory and its Applications (NOLTA2018), pp.31-33, 2018.
M M. Yasuda, Y. Mikuni, Y. Yokoyama, T. Harada, A. Tanaka and M. Yokoyama, “Detecting Human-Interaction Networks Based on Statistical Machine Learning and Sparse Modeling”, Proceedings of the 2018 International Symposium on Nonlinear Theory and its Applications (NOLTA2018), pp.34-37, 2018.
M A. Tanaka, S. Cho, M. Yasuda, T. Harada and M. Yokoyama, “Community Analysis of Social Networks Based on Network Indexes”, Proceedings of the 2018 International Symposium on Nonlinear Theory and its Applications (NOLTA2018), pp.38-41, 2018.
M M. Ohzeki, C. Takahashi, S. Okada, M. Terabe, S. Taguchi and K. Tanaka, “Quantum annealing: next-generation computation and how to implement it when information is missing”, Nonlinear Theory and Its Applications, IEICE, Vol.9, No.4, pp.392–405, 2018 (DOI: 10.1587/nolta.9.392)
M A. Shioura, N.V. Shakhlevich, V.A. Strusevich and B. Primas, “Models and Algorithms for Energy-Efficient Scheduling with Immediate Start of Jobs”, Journal of Scheduling, Vol.21, pp.505–516, 2018 (DOI: 10.1007/s10951-017-0552-y)
M S. Cho, M. Yasuda, M. Tsuchiya, T. Harada, A. Tanaka and M. Yokoyama, “Estimation of Correlation between Multiple Parameters and Sleep Satisfaction Using Deep Neural Network for Pleasant Sleeping Support System”, Proceedings of the 31th International Conference on Computer Applications in Industry and Engineering (CAINE2018), pp.26-30, 2018.
M S. Cho, T. Negishi, M. Tsuchiya, M. Yasuda and M. Yokoyama, “Estimation system of blood pressure variation with photoplethysmography signals using multiple regression analysis and neural network”, International Journal of Fuzzy Logic and Intelligent Systems, Vol.18, No.4, pp.229-236, 2018 (DOI: 10.5391/IJFIS.2018.18.4.229)
M S. Okada, M. Ohzeki and K. Tanaka, “Phase diagrams of one-dimensional Ising and XY models with fully connected ferromagnetic and anti-ferromagnetic quantum fluctuations”, Journal of the Physical Society of Japan, Vol.88, No.2, Article ID.024802, pp.1-6, 2019 (DOI: 10.7566/JPSJ.88.024802)
M S. Okada, M. Ohzeki and K. Tanaka, “Difference between quantum annealing by imaginary-time and real-time Schrodinger equations of Grover’s search”, Journal of the Physical Society of Japan, Vol.88, No.2, Article ID.024803, pp.1-6, 2019 (DOI: 10.7566/JPSJ.88.024803)
M T. Hatanaka, T. Ito and X. Zhou, “The Coloring Reconfiguration Problem on Specific Graph Classes”, IEICE Trans. on Information and Systems, Vol.E102-D, No.3, pp.423-429, 2019 (DOI: 10.1587/transinf.2018FCP0005)
M S. Arai, M. Ohzeki and K. Tanaka, “Dynamics of order parameters of nonstoquastic Hamiltonians in the adaptive quantum Monte Carlo method”, Physical Review E, Vol.99, article No.032120, 2019 (DOI: 10.1103/PhysRevE.99.032120)
M M. Yasuda, H. Sakata, S.I. Cho, T. Harada, A. Tanaka and M. Yokoyama, “An efficient test method for noise robustness of deep neural networks”, Nonlinear Theory and its Applications, IEICE, Vol.10, No.2, pp.221-235, 2019.
国内論文誌
A 山本 遼，瀧澤 重志, Dynamic Tree Networkによる避難完了時間を最小化する垂直避難領域分割手法 梅田地下街を対象としたグラフの分割長さを変えた検証，日本建築学会大会学術講演梗概集（東北），選抜梗概，2018.
A K. Nishiyama, T. Saitoh and A. Sljoka, “Validation of NMR protein structures using rigidity theory and chemical shifts”, 研究報告バイオ情報学（BIO）, No.2018-BIO-56, Vol.6, pp.1-2, 2018.
D 金子雄太, 石橋健, 矢田勝俊, 視線追跡データ取得のための店舗実験と消費者行動の分析―消費者の注視情報から購買傾向を探る―, 経営システム, Vol.28, No.2, pp.103-108, 2019.
総説・書籍など
A M. Ikeda and S. Tanigawa, “Cut Sparsifiers for Balanced Digraphs”, Proceedings of the 16th International Workshop on Approximation and Online Algorithms, LNCS 11312, pp.277-294, 2018 (DOI: 10.1007/978-3-030-04693-4_17)