2014年度の研究成果 2015年度の研究成果 2016年度の研究成果 2017年度の研究成果 2018年度の研究成果 2020年度の研究成果
A: 劣線形時間アルゴリズムグループ(Team A)
D: 劣線形データ構造グループ(Team D)
M: 劣線形モデリンググループ(Team M)
受賞
A Webインテリジェンスとインタラクション研究会，協賛社特別賞 DAYPLA賞，笹嶋宗彦，2019年6月29日．
D 文部科学省，平成31年度科学技術分野の文部科学大臣表彰 科学技術賞（科学技術振興部門），矢田勝俊，2019年4月9日．
D 文部科学省，文部科学大臣表彰 若手科学者賞，谷川眞一，2019年4月17日．
D The 16th International Symposium on Algorithms and Data Structures (WADS 2019), Best Paper Award, Sankardeep Chakraborty, 2019年8月7日．
D 情報処理学会，情報処理学会北海道支部 学術研究賞，鳥谷部直弥・古谷勇・喜田拓也，2019年10月5日．
D 公益財団法人 大川情報通信基金，大川出版賞，定兼邦彦，2019年10月30日．
D 三谷産業株式会社，三谷ビジネスコンテスト，山際伸一，2019年12月13日．
M 情報処理学会，学生奨励賞，勝亦利宗・安田宗樹，2020年3月5日．
メディア
テレビ
A 朝日放送「キャスト」, “地震1年あの日橋には帰宅の行列が…”, 2019年6月18日．
A NHK「かんさい熱視線」, “巨大台風にどう備えるか～高まる”大規模水害”の脅威～”, 2019年9月6日.
A NHK総合, “巨大地震 あなたの町の“地域リスク””, 2019年12月6日.
国際学会および国内学会発表
招待講演（国際）
A Kenjiro Takazawa, “b-branchings: Branchings with High Indegree”, The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2019), Tokyo, Japan, 2019年5月30日．
A Michael Williamson, “Validating NMR protein structures using structural rigidity theory”, Invited seminar at PDBe EBI-EMBL Wellcome Sanger Institute, Cambridge, UK, 2019年6月12日．
A Adnan Sljoka, “Lifting the curtain: probing biological secrets at molecular level with rigidity theory and algorithms”, 2nd International Conference on Applications of Mathematics to Nonlinear Sciences, Pokhara, Nepal, 2019年6月27日．
A Hiro Ito, “Sublinear-Time Paradigm — How to Challenge Big Data (Keynote Speech)”, The 13th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2019), Xiamen, China, 2019年12月13日．
D Katsutoshi Yada, “Sensor Marketing and Data Mining”, 23rd International Conference on Knowledge-Based and Intelligent Information & Engineering Systems, Budapest, Hungary, 2019年9月5日．
D Shin-ichi Nakano, “Dispersion Problems”, 2nd International Conference on Innovation in Engineering and Technology (ICIET-19), Dhaka, Bangladesh, 2019年12月23日．
M Shun Kataoka, “Neural network and its variants”, The 34th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2019), Jeju, Korea, 2019年6月23日．
M Muneki Yasuda, “Empirical Bayes method for Boltzmann machines”, Workshop on Statistical Physics of Disordered Systems and Its Applications (SPDSA2019), Miyagi, 2019年10月27日．
招待講演（国内）
A 加藤直樹，CREST研究課題「ビッグデータ時代に向けた革新的アルゴリズム基盤」と兵庫県立大学社会情報科学部の紹介，OR学会関西支部総会，大阪，2019年4月6日．
A 笹嶋宗彦，データサイエンティストの育成，神戸市主催078. AI時代を切り拓くデータサイエンス，兵庫，2019年4月29日．
A 瀧澤重志，シミュレーションと最適化による都市スケールの避難計画の支援技術，「震災対策技術展」大阪－自然災害対策技術展，大阪，2019年6月6日．
A 笹嶋宗彦，AIの現状と実応用に関する一考察，神戸市北区医師会病院集会，兵庫，2019年8月1日．
A 笹嶋宗彦，兵庫県立大学 社会情報科学部が目指すデータサイエンス教育と実践，京都大学データサイエンス教育公開ワークショップ，京都，2019年8月3日．
A 伊藤大雄，一般化ジャンケン－無駄手，面白さ，異手間引分など，日本数学会秋季総合分科会，石川，2019年9月19日．
A 瀧澤重志，シミュレーションと最適化による大阪市を対象とした避難計画支援技術，日本オペレーションズ・リサーチ学会「危機管理と社会とOR」研究部会，東京，2019年9月30日．
D 定兼邦彦，簡潔データ構造と情報理論，電子情報通信学会 情報理論研究会，鹿児島，2019年11月26日．
M 安田宗樹，ボルツマンマシンのグラフマイニングへの応用，電子情報通信学会総合大会，広島，2020年3月17日．
M 荒井俊太，量子揺らぎによる確率的情報処理，電子情報通信学会総合大会，広島，2020年3月17日．
口頭発表（国際）
A Y. Asahiro, G. Lin, Z. Liu and E. Miyano, “On the Approximability of the Maximum Induced Matching Problem on Regular Graphs”, The 12th Annual Meeting of the Asian Association for Algorithms and Computation, Seoul, South Korea, 2019年4月19日．
A Y. Higashikawa, “An Improved Algorithm for Minsum k-Sink Problems on Dynamic Flow Path Networks”, The 30th European Conference on Operational Research (EURO 2019), Dublin, Ireland, 2019年6月24日．
A J. Kawahara, T. Saitoh, H. Suzuki and R. Yoshinaka, “Colorful Frontier-based Search: Implicit Enumeration of Chordal and Interval Subgraphs”, Special Event on Analysis of Experimental Algorithms, Kalamata, Greece, 2019年6月24日．
A K. Higashizono and H. Ito, “Hyperfiniteness of hierarchical models for complex networks”, The 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2019), Tokyo, Japan, 2019年9月8日．
A H. Ito, C. Nara, I. Shirahama and M. Tomura, “Strip flat folding with parallel oblique or orthogonal zigzag mountain-valley-assigned creases”, The 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2019), Tokyo, Japan, 2019年9月8日．
A A. Sljoka, “Rigidity of graphs for structural protein validation and functional design”, The 5th International Workshop on Innovative Algorithms for Big Data (IABD2019), Kyoto, Japan, 2019年10月30日．
A H. Ito, “Constant-time algorithms on complex networks”, The 5th International Workshop on Innovative Algorithms for Big Data (IABD2019), Kyoto, Japan, 2019年10月30日．
A K. Chiba and H. Ito, “Sublinear progressive algoriothms — The frame work and fundamental theorems”, The 5th International Workshop on Innovative Algorithms for Big Data (IABD2019), Kyoto, Japan, 2019年10月30日．
A D M T. Horiyama, S. Nakano, T. Saitoh, K. Suetsugu, A. Suzuki, R. Uehara, T. Uno and K. Wasa, “Max-Min 3-dispersion Problems”, The 25th International Computing and Combinatorics Conference (COCOON 2019), Xian, China, 2019年7月29日．
D S. Chakraborty, “Succinct Data Structures for Families of Interval Graphs”, 17th Cologne-Twente Workshop on Graphs & Combinatorial Optimization, Enschede, The Netherlands, 2019年7月1日．
D G. Hu, S. Nakano, R. Uehara and T. Uno, “Simple Fold and Cut Problem for Line Segments”, The 31st Canadian Conference in Computational Geometry, Edmonton, Alberta, Canada, 2019年8月8日．
D K. Ishibashi and K. Yada, “Analysis of social influence on in-store purchase behavior by using ecological system of ants”, 23rd International Conference on Knowledge-Based and Intelligent Information & Engineering Systems, Budapest, Hungary, 2019年9月5日．
D K. Yada and H. Gu, “The impact of self-control on search behavior”, 23rd International Conference on Knowledge-Based and Intelligent Information & Engineering Systems, Budapest, Hungary, 2019年9月5日．
D K. Ishibashi, “Application of Deep Learning to Pre-processing of Cousumer’s Eye Tracking Data in Supermarket”, 2019 International Conference on Data Mining Workshops, Beijing, China, 2019年11月8日．
D K. Ishibashi, C. Xiao and K. Yada, “Study of the Effects of Visual Complexity and Consumer Experience on Visual Attention and Purchase Behavior through the Use of Eye Tracking”, 2019 IEEE International Conference on Big Data, Los Angels, USA, 2019年12月9日．
M A. Shioura, “M-convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Re-allocation in Bike Sharing System”, 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Tokyo, Japan, 2019年5月28日．
M A. Shioura, “Connection Between Discrete Convex Analysis and Auction Theory”, SIAM Conference on Applied Algebraic Geometry, Bern, Switzerland, 2019年7月9日．
M A. Suzuki, “Diameter of colorings under Kempe changes”, The 25th International Computing and Combinatorics Conference (COCOON 2019), Xian, China, 2019年7月30日．
M T. Ito, “Shortest Reconfiguration of Perfect Matchings via Alternating Cycles”, The 27th Annual European Symposium on Algorithms (ESA 2019), Munich, Germany, 2019年9月9日．
M M.J. Miyama and A.S. Koshikawa, “No Chain Embedding on Quantum Annealer and its Perspective”, D-Wave Qubits North America Users Conference 2019, Newport, USA, 2019年9月26日．
M S. Arai, “Statistical mechanical analysis of reverse annealing for code-division multiple-access multiuser demodulator”, Statistical Physics of Disordered Systems and Its Applications (SPDSA2019) Statistical-Mechanical Informatics and Statistical Machine Learning Theory in Big Data Sciences, Miyagi, Japan, 2019年10月27日．
M A.S. Koshikawa, “Search for the ground state of a spin glass with Bayesian optimization”, Statistical Physics of Disordered Systems and Its Applications (SPDSA2019) Statistical-Mechanical Informatics and Statistical Machine Learning Theory in Big Data Sciences, Miyagi, Japan, 2019年10月27日．
口頭発表（国内）
A 朝廣雄一，G. Lin, Z. Liu, 宮野英次，C5フリー正則グラフの最大誘導マッチング問題に対する近似アルゴリズム，情報処理学会アルゴリズム研究会，熊本，2019年5月10日．
A 笹嶋宗彦，広域の消費者購買データに基づくオリーブオイル購買の傾向分析と地域実店舗への適用，2019年度人工知能学会全国大会，新潟，2019年6月4日．
A 小林祐貴，一様ブロック積みに基づく立体を剛にする手法，2019年度日本建築学会全国大会，石川，2019年9月5日．
A 朝廣雄一，辺の追加と削除を伴うグラフ有向化問題，情報処理学会アルゴリズム研究会，福岡，2019年11月28-29日．
A 瀧澤重志，川岸裕，大阪市における南海トラフ地震に起因する津波からの最速避難計画手法，日本建築学会第42回情報・システム・利用・技術シンポジウム，東京，2019年12月13日．
A 小林祐貴，単位立体を追加することによる一様ブロック積みを剛にする手法，日本建築学会第42回情報・システム・利用・技術シンポジウム，東京，2019年12月13日．
M 中島克仁，ヘンリアン ディプタラマ，吉仲亮，篠原歩，パラメタ化文字列に対する線形サイズ接尾辞トライ，第173回アルゴリズム研究会，熊本，2019年5月10日．
M 菊池なつみ，Hendrian Diptarama，吉仲亮，篠原歩，密度固定のネックレス文字列に関する考察，2019年度電気関係学会東北支部連合大会，秋田，2019年8月22日．
M H.A.Duc，鈴木顯，八木田剛，kパス頂点被覆遷移問題に対するアルゴリズム，電子情報通信学会コンピュテーション研究会，岡山，2019年9月2日．
M 渡部航也, ディプタラマ ヘンリアン, 吉仲亮, 篠原歩，系列二分決定図の質問学習，第18回情報科学技術フォーラム，岡山，2019年9月5日．
M 奥山真佳，大関真之，平均場量子スピン系に潜む古典非線形可積分系，日本物理学会2019年秋季大会，岐阜，2019年9月13日．
M 小林賢也，カクタス上のコスト付きパスによるパスカバー問題，第72回電気・情報関係学会九州支部連合大会(令和元年度)，福岡，2019年9月27日．
M 寺原一平，無色グラフに対する彩色ハッピー頂点問題のNP困難性，第72回電気・情報関係学会九州支部連合大会(令和元年度)，福岡，2019年9月27日．
M 歌島侃勇，重複無し最長共通部分列問題に対する指数計算時間の上界，第72回電気・情報関係学会九州支部連合大会(令和元年度)，福岡，2019年9月27日．
M 林田将敬，接続制限付きハブ空港配置問題に対するNP困難性，令和元年度OR学会九州支部・若手OR交流会，大分，2019年10月26-27日．
M 御厨徹，機械学習によるオーロラ動画の自動分類，令和元年度OR学会九州支部・若手OR交流会，大分，2019年10月26-27日．
M 吉瀬紘平，適切なグラフ有向化の解の存在性，令和元年度OR学会九州支部・若手OR交流会，大分，2019年10月26-27日．
M 税所航平，初期解からの変更数を制限した最適化問題，令和元年度OR学会九州支部・若手OR交流会，大分，2019年10月26-27日．
M 歌島侃勇，重複無し最長共通部分列問題の計算時間，令和元年度OR学会九州支部・若手OR交流会，大分，2019年10月26-27日．
M 寺原一平，ネットワークの同種親和性を定式化した最適化問題，令和元年度OR学会九州支部・若手OR交流会，大分，2019年10月26-27日．
M 小林賢也，コスト付きパスによるパスカバー問題，令和元年度OR学会九州支部・若手OR交流会，大分，2019年10月26-27日．
M 豊坂祐樹，混合正規分布のデータセットにおけるAntlion clusteringと既存のクラスタリング手法との比較，第21回日本知能情報ファジィ学会九州支部学術講演会，福岡，2019年11月30日．
M 歌島侃勇，重複無し最長共通部分列問題の厳密アルゴリズム，2019年度・冬のLAシンポジウム，京都，2020年2月5-7日．
M 勝亦利宗，安田宗樹，スパース中間層を持つ制限ボルツマンマシン分類器，情報処理学会第82回全国大会，石川，2020年3月5日．
M 加藤航太，安田宗樹，経験ベイズ法を用いた連続値ボルツマンマシンのハイパーパラメータ推定，情報処理学会第82回全国大会，石川，2020年3月5日．
M 千田翼，安田宗樹，ニューラルネットワーク上の入出力逆問題と相互情報量の解析，情報処理学会第82回全国大会，石川，2020年3月5日．
M 菅野友理，安田宗樹，確率的極端学習機械による制限ボルツマンマシン分類器の多層化，情報処理学会第82回全国大会，石川，2020年3月5日．
M 荒井俊太，リバースアニーリングによるCDMAマルチユーザ検出の統計力学的解析，日本物理学会，愛知，2020年3月16日．
ポスター発表（国際）
A N. Fowler, A. Sljoka and M. Williamson, “Validation of NMR protein structures using structural rigidity theory and random coil index”, The 18th European Conference on Computational Biology, Basel, Switzerland, 2019年7月22日．
A A. Sljoka, “Detection of Allosteric Pathways and Hotspots with Rigidity Propagation across GPCR networks”, GPCR Workshop, Hawaii, USA, 2019年12月1日．
A M. Williamson, “Is your NMR protein structure accurate? We have the ANSURR!”, Reson8 5th Biophysical and biochemical symposium, York, USA, 2020年1月10日．
A M. Huai, D. Wang, C. Miao, J. Xu and A. Zhang, “Pairwise Learning with Differ- ential Privacy Guarantees”, AAAI2020, New York, USA, 2020年2月9日．
D S. Yamagiwa, R. Morita and K. Marumo, “Reducing Symbol Search Overhead on Stream-based Lossless Data Compression”, ICCS 2019, Faro, Portugal, 2019年6月13日．
D Y.Z. Zhang, A. Akdemir, G. Tremmel, S. Imoto, S. Miyano, T. Shibuya and R. Yamaguchi, “Nanopore base-calling from a perspective of instance segmentation”, The 18th European Conference on Computational Biology, Basel, Switzerland, 2019年7月21日．
D S. Yamagiwa, E. Hayakawa and K. Marumo, “Adaptive Stream-based Entropy Coding”, Data Compression Conference 2020, Snowbird, Utah, USA, 2020年3月24日．
M M. Okuyama and M. Ohzeki, “An exact solution of the partition function for mean-field quantum spin systems without the static approximation”, Adiabatic Quantum Computing Conference 2019, Innsbruck, Austria, 2019年6月26日．
M S. Arai, M. Ohzeki and K. Tanaka, “Mean-field analysis of quantum error-correcting codes with non-stoquastic Hamiltonian”, Adiabatic Quantum Computing Conference 2019, Innsbruck, Austria, 2019年6月26日．
M C. Takahashi, M. Ohzeki and K. Tanaka, “Statistical-mechanical analysis of restrictecd Boltzmann machine with transverse field”, Adiabatic Quantum Computing Conference 2019, Innsbruck, Austria, 2019年6月26日．
M A. Koshikawa, M. Ohzeki and K. Tanaka, “Black-box optimization with D-Wave 2000Q”, Adiabatic Quantum Computing Conference 2019, Innsbruck, Austria, 2019年6月26日．
M N. Maruyama, M. Ohzeki and K. Tanaka, “Optimization of bus schedule using quantum annealer”, Adiabatic Quantum Computing Conference 2019, Innsbruck, Austria, 2019年6月26日．
M H. Naganuma, D. Hendrian, R. Yoshinaka, A. Shinohara and N. Kobayashi, “Grammar Compression with Probabilistic Context-Free Grammar”, Data Compression Conference 2020, Snowbird, Utah, USA, 2020年3月24日．
ポスター発表（国内）
A 笹嶋宗彦，実践的データサイエンス人材育成の試み，第14回ウェブインテリジェンスとインタラクション研究会，兵庫，2019年6月28日．
D 鳥谷部直弥，古谷勇，喜田拓也，データストリームのための頻出部分文字列発見アルゴリズム，情報処理学会北海道シンポジウム，北海道，2019年10月5日．
M 越川亜美，イジングマシンを用いたベイズ的組合せ最適化，第64回物性若手夏の学校，岐阜，2019年8月6日．
ワークショップ
A D M 加藤CREST第20回全体会議（非公開）, アプローズタワー, 2019年6月8日.
A D M International Workshop on Innovative Algorithms for Big Data（IABD 2019）, 京都大学 数理解析研究所, 2019年10月30日-11月1日.
学術雑誌掲載論文一覧
国際論文誌
A H.L. Bodlaender, T. Hanaka, Y. Okamoto, Y. Otachi and T.C. van der Zanden, “Subgraph Isomorphism on Graph Classes that Exclude a Substructure”, Proceedings of 11th International Conference on Algorithms and Complexity (CIAC 2019), pp.87-98, 2019 (DOI: 10.1007/978-3-030-17402-6_8)
A Y. Asahiro, J. Jansson, E. Miyano, H. Ono and T.P. Sandhya, “Graph orientation with edge modifications”, Proceedings of FAW 2019, Vol.11458, pp.38-50, 2019 (DOI: 10.1007/978-3-030-18126-0_4)
A Y. Asahiro, T. Kubo and E. Miyano, “Experimental evaluation of approximation and heuristic algorithms for maximum distance-bounded subgraph problems”, The Review of Socionetwork Strategies, Vol.13, No.2, pp.143-161, 2019 (DOI: 10.1007/s12626-019-00036-2)
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, Vol.13, No.2, pp.209-225, 2019 (DOI: 10.1007/s12626-019-00037-0)
A E. Boros, K.M. Elbassioni, V. Gurvich and K. Makino, “A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions,” Inf. Comput. No.267, pp.74-95, 2019 (DOI: 10.1016/j.ic.2019.03.005)
A E. Boros, V. Gurvich, N.B. Ho, K. Makino and P. Mursic, “Sprague-Grundy function of symmetric hypergraphs,” Journal of Combinatorial Theory, Series A, No.165, pp.176-186, 2019 (DOI: 10.1016/j.jcta.2019.02.006)
A K. Takazawa and Y. Yokoi, “A generalized-polymatroid approach to disjoint common independent sets in two matroids”, Discrete Mathematics, Vol.342, issue 7, pp.2002-2011, 2019 (DOI: 10.1016/j.disc.2019.03.009)
A D. Wang, C. Chen and J. Xu, “Differentially Private Empirical Risk Minimization with Non-convex Loss Functions”, Proc. the 36th International Conference on Machine Learning (ICML 2019), pp.6326-6535, 2019.
A P. Mehrabi, C.D. Pietrantonio, T.H. Kim, A. Sljoka, K. Taverner, C. Ing, N. Kruglyak, R. Pomès, E.F. Pai and R.S. Prosser, “Substrate-Based Allosteric Regulation of a Homodimeric Enzyme”, J. Am. Chem. Soc., Vol.141, No.29, 11540-11556, 2019 (DOI: 10.1021/jacs.9b03703)
A Y. Kobayashi, Y. Kobayashi, S. Miyazaki and S. Tamaki, “An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number”, IWOCA 2019, Lecture Notes in Computer Science, Vol.11638, pp.327-338, 2019 (DOI: 10.1007/978-3-030-25005-8)
A Y. Kawase, X. Han and K. Makino, “Proportional cost buyback problem with weight bounds”, Theoretical Computer Science, No.774, pp.51-64, 2019 (DOI: 10.1016/j.tcs.2016.06.005)
A H. Hayakawa, T. Ishii, H. Ono and Y. Uno, “Settlement fund circulation problem”, Discrete Applied Mathematics, Vol.265, pp.86-103, 2019 (DOI: 10.1016/j.dam.2019.03.017)
A E.D. Demaine, D. Eppstein, A. Hesterberg, K. Jain, A. Lubiw, R. Uehara and Y. Uno, “Reconfiguring Undirected Paths”, Lecture Notes in Computer Science, Vol.11646, pp.353-365, 2019 (DOI: 10.1007/978-3-030-24766-9_26)
A Y. Kawase, X. Han and K. Makino, “Unit Cost Buyback Problem,” Theory Comput. Syst. Vol.63, No.6, pp.1185-1206, 2019 (DOI: 10.1007/s00224-018-9897-7)
A D. Wang and J. Xu, “Principal Component Analysis in the Local Differential Privacy Model”, Proc. 28th International Joint Conference on Artificial Intelligence (IJCAI 2019), pp.4795-4801, 2019 (DOI: 10.24963/ijcai.2019/66)
A Y. Asahiro, G. Lin, Z. Liu and E. Miyano, “An approximation algorithm for the maximum induced matching problem on C_5-free regular grapha”, IEICE TRANSACTIONS on Information and Systems, Vol.E102-A, No.9, pp.1142-1149, 2019 (DOI: 10.1587/transfun.E102.A.1142)
A H. Ito, A. Nagao and T. Park, “Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable”, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. 102, No.9, pp.1126-1133, 2019 (DOI: 10.1587/transfun.E102.A.1126)
A Y. Higashikawa and N. Katoh, “A Survey on Facility Location Problems in Dynamic Flow Networks”, The Review of Socionetwork Strategies, Vol.13, pp.163-208, 2019 (DOI: 10.1007/s12626-019-00047-z)
A Y. Honda, Y. Inoue, H. Ito, M. Sasajima, J. Teruyama and Y. Uno, “Hyperfiniteness of Real-world Networks”, The Review of Socionetwork Strategies, Vol.13, pp.123-141, 2019 (DOI: 10.1007/s12626-019-00051-3)
A K. Elbassioni and K. Makino, “Oracle-based Primal-dual Algorithms for Packing and Covering Semidefinite Programs”, The 27th Annual European Symposium on Algorithms (ESA 2019), 2019 (DOI: 10.4230/LIPIcs.ESA.2019.43)
A E. Demaine, H. Ito, S. Langerman, J. Lynch, M. Rudoy and K. Xiao, “Cookie Clicker”, Graphs and Combinatorics, Vol.36, pp.269-302, 2020 (DOI: 10.1007/s00373-019-02093-4)
A H. Ito, “What graph properties are constant-time testable? -Dense graphs, sparse graphs, and complex networks”, The Review of Socionetwork Strategies, Vol.13, pp.101-121, 2019 (DOI: 10.1007/s12626-019-00054-0)
A X. Han, Q. Chen and K. Makino, “Online knapsack problem under concave functions”, Theoretical Computer Science Vol.786, pp.88-95, 2019 (DOI: 10.1016/j.tcs.2018.03.025)
A D. Wang and J. Xu, “Faster constrained linear regression via two-step preconditioning”, Neurocomputing, Vol.364, pp.280-296, 2019 (DOI: 10.1016/j.neucom.2019.07.070 )
A T. Sakai, K. Seto, S. Tamaki and J. Teruyama,“Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression”, J. Comput. Syst. Sci., Vol.105, pp.87-103, 2019 (DOI: 10.1016/j.jcss.2019.04.004)
A Y. Asahiro, J. Jansson, G. Lin, E. Miyano, H. Ono and T. Utashima, “Exact algorithms for the bounded repetition longest common subsequence problem”, Proc. 13th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2019), LNCS11949, pp.1-12, 2019 (DOI: 10.1007/978-3-030-36412-0_1)
A X. Han, Y. Kawase, K. Makino and H. Yokomaku, “Online Knapsack Problems with a Resource Buffer”, ISAAC 2019: 28:1-28:14 2019 (DOI: 10.4230/LIPIcs.ISAAC.2019.28)
A O. Aichholzer, M. Korman, Y. Okamoto, I. Parada, D. Perz, A.van Renssen and B. Vogtenhuber, “Graphs with Large Total Angular Resolution”, Proceedings of 27th International Symposium on Graph Drawing and Network Visualization，pp.193-199, 2019 (DOI: 10.1007/978-3-030-35802-0_15)
A Y. Okamoto, A. Ravsky and A. Wolff, “Variants of the Segment Number of a Graph”, Proceedings of 27th International Symposium on Graph Drawing and Network Visualization, pp.430-443, 2019 (DOI: 10.1007/978-3-030-35802-0_33)
A Z. Huang, Q. Feng, J. Wang and J. Xu, “Small Candidate Set for Translational Pattern Search”, Proc. 30th International Symposium on Algorithms and Computation (ISAAC 2019), pp.16:1-26:17, 2019 (DOI: 10.4230/LIPIcs.ISAAC.2019.26)
A E. Boros, V. Gurvich, N.B. Ho, K. Makino and P. Mursic, “Sprague-Grundy function of matroids and related hypergraphs”, Theor. Comput. Sci., Vol.799, pp.40-58, 2019 (DOI: 10.1016/j.tcs.2019.09.041)
A P. Carmi, M.K. Chiu, M.J. Katz, M. Korman, Y. Okamoto, A.van Renssen, M. Roeloffzen, T. Shiitada and S. Smorodinsky, “Balanced line separators of unit disk graphs”, Computational Geometry: Theory and Applications, Vol.86, 2019 (DOI: 10.1016/j.comgeo.2019.101575)
A H. Ito, A. Khoury and I. Newman, “On the characterization of 1-sided error strongly-testable graph properties for bounded-degree graphs”, Journal of Computational Complexity, Vol.29, No.1, pp.1-45, 2020 (DOI: 10.1007/s00037-020-00191-6)
A K. Yamazaki, T. Saitoh, M. Kiyomi and R. Uehara, “Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs”, Theoretical Computer Science, Vol.806, pp.310-322, 2020 (DOI: 10.1016/j.tcs.2019.04.017)
A K. Iwama and J. Teruyama, “Improved Average Complexity for Comparison-based Sorting”, Theoretical Computer Science, Vol.807, pp.201-219, 2019 (DOI: 10.1016/j.tcs.2019.06.032)
A B. Soumen, A. Sljoka and C. Amit, “Allosteric regulation of Glutamate dehydrogenase deamination activity”, Scientific Reports, 2020 (DOI: 10.1016/j.bpj.2019.11.2851)
A Y. Asahiro, H. Eto, T. Hanaka, G. Lin, E. Miyano and I. Terabaru, “Parameterized algorithms for the happy set problem”, Proc. 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020), LNCS12049, pp.323-328, 2020 (DOI: 10.1007/978-3-030-39881-1_27)
A Y. Kawase and K. Makino, “Surrogate optimization for p-norms”, Discret. Optim. 34, 2019 (DOI: 10.1016/j.disopt.2019.05.003)
A R. Mubasher, B. Soumen, A. Sljoka and A. Chakraborty, “Feedforward Control of Plant Nitrate Transporter NRT1.1Biphasic Adaptive Activity”, Biophysical Journal, Vol.118, No.4, pp.898-908, 2019 (DOI: 10.1016/j.bpj.2019.10.018)
A Z. Huang and J. Xu, “An Efficient Sum Query Algorithm for Distance-Based Locally Dominating Functions”, Algorithmica, 2020 (DOI: 10.1007/s00453-020-00691-w)
A R. Benkoczi, B. Bhattacharya, Y. Higashikawa, T. Kameda and N. Katoh, “Minsum k-sink problem on path networks”, Theor. Comput. Sci. 806: 388-401, 2020 (DOI: 10.1016/j.tcs.2019.05.047)
A D. Wang and J. Xu, “Tight Lower Bound of Sparse Covariance Matrix Estimation in the Local Differential Privacy Model”, Theoretical Computer Science, Vol.815, pp.47-59, 2020 (accepted) (DOI: 10.1016/j.tcs.2020.02.02)
A H. Ding and J. Xu, “Learning the Truth Vector in High Dimensions”, Journal of Computer and System Sciences, 109:78-94, 2020 (accepted) (DOI: 10.1016/j.jcss.2019.12.002)
A X. Wang, A. Mafi, A. Sljoka, W.A. Goddard and Y. Libin, “Conformational Insights into Signaling Mechanism of Partial Agonism in GPCRs”, Cell (submitted)
A D M T. Horiyama, S. Nakano, T. Saitoh, K. Suetsugu, A. Suzuki, R. Uehara, T. Uno and K. Wasa, “Max-Min 3-dispersion Problems”, Proc. of COCOON 2019, LNCS 11653, pp.291-300, 2019 (DOI: 10.1007/978-3-030-26176-4_24)
A M T. Ito, N. Kakimura, N. Kamiyama, Y. Kobayashi and Y. Okamoto, “Shortest Reconfiguration of Perfect Matchings via Alternating Cycles,” Proceedings of the 27th Annual European Symposium on Algorithms (ESA 2019), Leibniz International Proceedings in Informatics, Vol.144, pp.61:1-61:15, 2019 (DOI: 10.4230/LIPIcs.ESA.2019.61)
A M J. Kawahara, T. Saitoh, H. Suzuki and R. Yoshinaka, “Colorful Frontier-based Search: Implicit Enumeration of Chordal and Interval Subgraphs,” Special Event on Analysis of Experimental Algorithms, LNCS, Vol.11544, pp.125-141, 2019 (DOI: 10.1007/978-3-030-34029-2_9)
D T. Jordan and S. Tanigawa, “Global rigidity of triangulations with braces”, Journal of Combinatorial Theory, Series B, No.136, pp.249-288, 2019 (DOI: 10.1016/j.jctb.2018.11.003)
D H. Furuta, K. Ishibashi and K. Nakatsu, “Resilient restoration scheduling on road network,” Proceedings of 13th International Conference on Applications of Statistics and Probability in Civil Engineering(ICASP13), pp.1–8, 2019 (DOI: 10.22725/ICASP13.141)
D S. Yamagiwa, R. Morita and K. Marumo, “Reducing Symbol Search Overhead on Stream-based Lossless Data Compression”, Proceedings of ICCS 2019, LNCS 11540, pp.619-626, 2019 (DOI: 10.1007/978-3-030-22750-0_59)
D S. Chakraborty, A. Mukherjee and S.R. Satti, “Space Efficient Algorithms for Breadth-Depth Search”, Fundamentals of Computation Theory – 22nd International Symposium (FCT 2019), pp.201-212, 2019 (DOI: 10.1007/978-3-030-25027-0_14)
D H. Acan, S. Chakraborty, S. Jo and S.R. Satti, “Succinct Data Structures for Families of Interval Graphs”, Workshop on Algorithms and Data Structures (WADS 2019), pp.1-13, 2019 (DOI: 10.1007/978-3-030-24766-9_1)
D S. Denzumi, “New Algorithms for Manipulating Sequence BDDs”, The 24th International Conference on Implementation and Application of Automata (CIAA 2019), pp.108-120, 2019 (DOI: 10.1007/978-3-030-23679-3_9)
D S. Ahmed, S. Nakano and Md.S. Rahman, “One-dimensional r-Gathering under Uncertainty”, Proc. of AAIM 2019, LNCS 11640, pp.1-15, 2019 (DOI: 10.1007/978-3-030-27195-4_1)
D I. Furuya and T. Kida, “Compaction of Church Numerals”, Algorithms, Vol.12, No.8:159, 2019 (DOI: 10.3390/a12080159)
D A. Akdemir and T. Gungor, “A Detailed Analysis and Improvement of Feature-Based Named Entity Recognition for Turkish”, SPECOM 2019, LNAI 11658, pp.9–19, 2019 (DOI: 10.1007/978-3-030-26061-3_2)
D S. Chakraborty and K. Sadakane, “Indexing Graph Search Trees and Applications”, Proceedings of MFCS, LIPIcs 138, pp.67:1-67:14, 2019 (DOI: 10.4230/LIPIcs.MFCS.2019.67)
D K. Yamanaka, Y. Matsui and S. Nakano, “Enumerating Highly-Edge-Connected Spanning Subgraphs”, IEICE TRANS. FUNDAMENTALS, Vol.E102-A, No.9, pp.1002-1006, 2019 (DOI: 10.1587/transfun.E102.A.1002)
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, E102.A(9), pp.1159-1170, 2019 (DOI: 10.1587/transfun.E102.A.986)
D M.J. Kashyop, T. Nagayama and K. Sadakane, “Faster algorithms for shortest path and network flow based on graph decomposition”, Journal of Graph Algorithms and Applications, Vol.23, No.5, pp.781-813, 2019 (DOI: 10.7155/jgaa.00512)
D S. Nakano, “A Simple Algorithm for r-gatherings on the Line”, JGAA, Vol.23, No.5, pp.837-845, 2019 (DOI: 10.7155/jgaa.00514)
D T. Gagie, T. I, G. Manzini, G. Navarro, H. Sakamoto and Y. Takabatake, “Rpair: Rescaling RePair with Rsync”, SPIRE 2019, pp.35-44, 2019 (DOI: 10.1007/978-3-030-32686-9_3)
D T. Shibuya, “Application-Oriented Succinct Data Structures for Big Data”, The Review of Socionetwork Strategies, Vol.13, pp.227–236, 2019 (DOI: 10.1007/s12626-019-00045-1)
D K. Sumigawa and K. Sadakane, “Storing Partitions of Integers in Sublinear Space”, The Review of Socionetwork Strategies, Vol.13, pp.237–252, 2019 (DOI: 10.1007/s12626-019-00044-2)
D K. Ishibashi and K. Yada, “Analysis of social influence on in-store purchase behavior by using ecological system of ants”, Procedia Computer Science, Vol.159, pp.2162-2171, 2019 (DOI: 10.1016/j.procs.2019.09.390)
D K. Ishibashi, “Application of Deep Learning to Pre-processing of Cousumer’s Eye Tracking Data in Supermarket”, Proceedings of 2019 International Conference on Data Mining Workshops (ICDMW), pp.341-348, 2019 (DOI: 10.1109/ICDMW.2019.00057)
D K. Ishibashi, C. Xiao and K. Yada, “Study of the Effects of Visual Complexity and Consumer Experience on Visual Attention and Purchase Behavior through the Use of Eye Tracking”, Proceedings of 2019 IEEE International Conference on Big Data (Big Data), pp.2664-2673, 2019 (DOI: 10.1109/BigData47090.2019.9005498)
D T. Araki and S. Nakano, “Max-Min Dispersion on a Line”, Journal of Combinatorial Optimization, 2020 (DOI: 10.1007/s10878-020-00549-5)
D K. Amano and S. Nakano, “An Approximation Algorithm for the 2-dispersion Problem”, IEICE TRANS. INF.& SYST., Vol.E103-D, No.3, pp.506-508, 2020 (DOI: 10.1587/transinf.2019FCP0005)
D Y. Yoshimoto, M. Kataoka, Y. Takabatake, T. I, K. Shin and H. Sakamoto, “Faster Privacy-Preserving Computation of Edit Distance with Moves”, WALCOM 2020, pp.308-320, 2020 (DOI: 10.1007/978-3-030-39881-1_26)
D S. Chakraborty and K. Sadakane, “Indexing Graph Search Trees and Applications”, Proceedings of MFCS, 2019 (in press)
D I. Furuya, “Practical Repetition-Aware Grammar Compression”, In Proceedings of Data Compression Conference, 2020 (in press)
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 (NOLTA), IEICE, Vol.10, Issue 2, pp.221-235, 2019 (DOI: 10.1587/nolta.10.221)
M T. Ito, N. Kamiyama, Y. Kobayashi and Y. Okamoto, “Algorithms for Gerrymandering Over Graphs”, Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019), pp.1413-1421, 2019 (DOI: 10.5555/3306127.3331851)
M T. Ito and Y. Otachi, “Reconfiguration of Colorable Sets in Classes of Perfect Graphs”, Theoretical Computer Science, Vol.772, pp.111-122, 2019 (DOI: 10.1016/j.tcs.2018.11.024)
M S. Kataoka and M. Yasuda, “Bayesian Image Denoising with Multiple Noisy Images”, The Review of Socionetwork Strategies, Vol.13, No.2, pp.267-280, 2019 (DOI: 10.1007/s12626-019-00043-3)
M M. Bonamy, M. Heinrich, T. Ito, Y. Kobayashi, H. Mizuta, M. Mühlenthaler, A. Suzuki and K. Wasa, “Diameter of colorings under Kempe changes”, Proceedings of COCOON 2019, Vol.11653, pp.52-64, 2019 (DOI: 10.1007/978-3-030-26176-4_5)
M T. Ito, H. Mizuta, N. Nishimura and A. Suzuki, “Incremental optimization of independent sets under the reconfiguration framework”, Proceedings of COCOON 2019, Vol.11653, pp.313-324, 2019 (DOI: 10.1007/978-3-030-26176-4_26)
M Y. Yokoyama, T. Katsumata and M. Yasuda, “Restricted Boltzmann Machine with Multivalued Hidden Variables: a model suppressing over-fitting”, The Review of Socionetwork Strategies, Vol.13, No.2, pp.253-266, 2019 (DOI: 10.1007/s12626-019-00042-4)
M N. Minamikawa and A. Shioura, “Separable convex resource allocation problem with L1-distance constraint”, Journal of Operations Research Society of Japan, Vol.62, pp.109-120, 2019 (DOI: 10.15807/jorsj.62.109)
M S. Kobayashi, D. Hendrian, R. Yoshinaka and A. Shinohara, “An improvement of the Franek-Jennings-Smyth pattern matching algorithm”, Proceedings of Prague Stringology Conference 2019, pp.56-68, 2019.
M M. Bonamy, N. Bousquet, M. Heinrich, T. Ito, Y. Kobayashi, A. Mary, M. Mühlenthaler and K. Wasa, “The Perfect Matching Reconfiguration Problem”, Proceedings of MFCS 2019, Vol.138, pp.80:1-80:14, 2019 (DOI: 10.4230/LIPIcs.MFCS.2019.80)
M H. Mizuta, T. Hatanaka, T. Ito and X. Zhou, “Reconfiguration of Minimum Steiner Trees via Vertex Exchanges”, Proceedings of MFCS 2019, Vol.138, pp.79:1-79:11, 2019 (DOI: 10.4230/LIPIcs.MFCS.2019.79)
M K. Chubachi, D. Hendrian, R. Yoshinaka and A. Shinohara, “Query Learning Algorithm for Residual Symbolic Finite Automata”, In Proceedings of the Tenth International Symposium on Games, Automata, Logics, and Formal Verification, 2019.
M M. Yasuda, K. Katou, Y. Mikuni, Y. Yokoyama, T. Harada, A. Tanaka and M. Yokoyama, “Detection of human-interaction network using Markov random field”, Nonlinear Theory and its Applications (NOLTA), IEICE, Vol.10, Issue 4, pp.485-495, 2019 (DOI: 10.1587/nolta.10.485)
M M. Tsuchiya, A. Tanaka, M. Yasuda, T. Harada, S. Cho and M. Yokoyama, “Estimation of Sleep Onset and Awaking Time Using a Deep Neural Network with Physiological Data during Sleep”, Nonlinear Theory and its Applications (NOLTA), IEICE, Vol.10, Issue 4, pp.366-372, 2019 (DOI: 10.1587/nolta.10.366)
M M. Yasuda and S. Ueno, “Improvement of Batch Normalization in Imbalanced Data”, Proceedings of the 2019 International Symposium on Nonlinear Theory and its Applications (NOLTA2019), pp.146-149, 2019.
M S. Cho, M. Tsuchiya, A. Tanaka, M. Yasuda, T. Harada and M. Yokoyama, “A Study on the Relation Between the Estimated Sleep Satisfaction Levels Using Multiple Regression Analysis and Autonomic Nervous System”, Proceedings of the 2019 International Symposium on Nonlinear Theory and its Applications (NOLTA2019), pp.153-156, 2019.
M A. Tanaka, S. Nagasawa, M. Yasuda, T. Harada and M. Yokoyama, “Overcoming Chasm Phenomena in Diffusion on Cookpad Community”, Proceedings of the 2019 International Symposium on Nonlinear Theory and its Applications (NOLTA2019), pp.150-152, 2019.
M M. Yasuda and T. Obuchi, “Empirical Bayes Method for Boltzmann Machines”, Journal of Physics A: Mathematical and Theoretical, Vol.53, No.1, 2019 (DOI: 10.1088/1751-8121/ab57a7)
M K. Nakashima, D. Hendrian, R. Yoshinaka and A. Shinohara, “An Extension of Linear-size Suffix Tries for Parameterized Strings”, SOFSEM (Doctoral Student Research Forum) 2020: 97-108, 2020.
M D. Jargalsaikhan, D. Hendrian, R. Yoshinaka and A. Shinohara, “Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching,” SOFSEM 2020, pp.211-222, 2020.
M T. Hanaka, T. Ito, H. Mizuta, B. Moore, N. Nishimura, V. Subramanya, A. Suzuki and K. Vaidyanathan, “Reconfiguring Spanning and Induced Subgraphs,” Theoretical Computer Science, Vol.806, pp.553-566, 2020 (DOI: 10.1016/j.tcs.2019.09.018)
M Y. Tamura, T. Ito and X. Zhou, “Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs,” Proceedings of the 14th International Conference and Workshop on Algorithms and Computation (WALCOM 2020), Lecture Notes in Computer Science, Vol.12049, pp.286-295, 2020 (DOI: 10.1007/978-3-030-39881-1_24)
M K. Kimura and A. Suzuki, “Trichotomy for the reconfiguration problem of integer linear systems,” Proceedings of the 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020), Lecture Notes in Computer Science, Vol.12049, pp.336-341, 2020 (DOI: 10.1007/978-3-030-39881-1_29)
M D.A. Hoang, A. Suzuki and T. Yagita, “Reconfiguring k-path vertex covers,” Proceedings of the 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020), Lecture Notes in Computer Science, Vol.12049, pp.133-145, 2020 (DOI: 10.1007/978-3-030-39881-1_12)
M M. Bonamy, M. Heinrich, T. Ito, Y. Kobayashi, H. Mizuta, M. Mühlenthaler, A. Suzuki and K. Wasa, “Shortest Reconfiguration of Colorings Under Kempe Changes,” Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Leibniz International Proceedings in Informatics, Vol.154, pp.35:1-35:14, 2020 (DOI: 10.4230/LIPIcs.STACS.2020.35)
M S. Narisada, D. Hendrian, R. Yoshinaka and A. Shinohara, “Linear-time online algorithm for inferring the shortest path graph from a walk label”, Theor. Comput. Sci., Vol.812, pp.187-202, 2020 (in press) (DOI: 10.1016/j.tcs.2019.10.029)
M A. Blanché, P. Ouvrard, H. Mizuta and A. Suzuki, “Decremental optimization of dominating sets under the reconfiguration framework”, Proceedings of the 31st International Workshop on Combinatorial Algorithms (IWOCA 2020), to appear (accepted)
M M. Okuyama and M. Ohzeki, “Inequality for local energy of Ising models with quenched randomness and its application”, arXiv::2001.10707 (submitted)
国内論文誌
A 加藤直樹，ビッグデータ時代に向けた革新的アルゴリズム基盤（特集 ビッグデータ研究とは何か），オペレーションズ・リサーチ = Communications of the Operations Research Society of Japan : 経営の科学, 64巻，5号, pp.283-289, 2019．
D 四家祐志, 佐藤寛斗, 宮田洋行, 中野眞一, 円周上のmax-min 4-dinspersion問題, 電子情報通信学会論文誌D, Vol.J102-D, No.10, 2019 (DOI: 10.14923/transinfj.2019JDP7012)
総説・書籍など
A 岡本吉央，グラハム数，ラムゼー理論，そして，役に立たない定数時間アルゴリズム，数学セミナー，第58巻7号，pp.18-21，2019.
A 伊藤大雄, イラストで学ぶ離散数学，講談社，2019年9月5日 (ISBN: 978-4-06-517001-4)