小林 靖明

Last Update: 2020/07/23 08:41:16

Print

Name(Kanji/Kana/Abecedarium Latinum)
小林 靖明/コバヤシ ヤスアキ/Kobayashi, Yasuaki
Primary Affiliation(Org1/Job title)
Graduate Schools Informatics/Assistant Professor
Faculty
Org1 Job title
工学部
Academic Degree
Field(Japanese) Field(English) University(Japanese) University(English) Method
修士(工学) 明治大学
博士(理学) 明治大学
ORCID ID
https://orcid.org/0000-0003-3244-6915
researchmap URL
https://researchmap.jp/7000018354
Published Papers
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi Parameterized Complexity of (A,\ell ) -Path Packing Parameterized Complexity of (A,\ell ) -Path Packing Parameterized Complexity of (A,\ell ) -Path Packing Lecture Notes in Computer Science (IWOCA 2020), 43-55 Lecture Notes in Computer Science (IWOCA 2020), 43-55 Lecture Notes in Computer Science (IWOCA 2020), 43-55 2020 Refereed Disclose to all
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi Parameterized algorithms for maximum cut with connectivity constraints Parameterized algorithms for maximum cut with connectivity constraints Parameterized algorithms for maximum cut with connectivity constraints Leibniz International Proceedings in Informatics, LIPIcs, 148, 13:1-13:15 Leibniz International Proceedings in Informatics, LIPIcs, 148, 13:1-13:15 Leibniz International Proceedings in Informatics, LIPIcs, 148, 13:1-13:15 2019/12 Refereed English Research paper(international conference proceedings) Disclose to all
Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara On the complexity of lattice puzzles On the complexity of lattice puzzles On the complexity of lattice puzzles Leibniz International Proceedings in Informatics, LIPIcs, 149, 32:1-32:12 Leibniz International Proceedings in Informatics, LIPIcs, 149, 32:1-32:12 Leibniz International Proceedings in Informatics, LIPIcs, 149, 32:1-32:12 2019/12 Refereed English Research paper(international conference proceedings) Disclose to all
Yusuke Shido, Yasuaki Kobayashi, Akihiro Yamamoto, Atsushi Miyamoto, Tadayuki Matsumura Yusuke Shido, Yasuaki Kobayashi, Akihiro Yamamoto, Atsushi Miyamoto, Tadayuki Matsumura Yusuke Shido, Yasuaki Kobayashi, Akihiro Yamamoto, Atsushi Miyamoto, Tadayuki Matsumura Automatic Source Code Summarization with Extended Tree-LSTM Automatic Source Code Summarization with Extended Tree-LSTM Automatic Source Code Summarization with Extended Tree-LSTM Proceedings of the International Joint Conference on Neural Networks, 2019-July Proceedings of the International Joint Conference on Neural Networks, 2019-July Proceedings of the International Joint Conference on Neural Networks, 2019-July 2019/07 Refereed English Research paper(international conference proceedings) Disclose to all
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden Subgraph Isomorphism on Graph Classes that Exclude a Substructure Subgraph Isomorphism on Graph Classes that Exclude a Substructure Subgraph Isomorphism on Graph Classes that Exclude a Substructure arXiv arXiv arXiv 2019/05/25 Disclose to all
Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki An improved fixed-parameter algorithm for max-cut parameterized by crossing number An improved fixed-parameter algorithm for max-cut parameterized by crossing number An improved fixed-parameter algorithm for max-cut parameterized by crossing number Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11638 LNCS, 327-338 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11638 LNCS, 327-338 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11638 LNCS, 327-338 2019 Refereed English Research paper(international conference proceedings) Disclose to all
Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11949 LNCS, 303-315 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11949 LNCS, 303-315 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11949 LNCS, 303-315 2019 Refereed Research paper(international conference proceedings) Disclose to all
Yasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki Yasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki Yasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki An improved fixed-parameter algorithm for one-page crossing minimization An improved fixed-parameter algorithm for one-page crossing minimization An improved fixed-parameter algorithm for one-page crossing minimization Leibniz International Proceedings in Informatics, LIPIcs, 89, 25:1-25:12 Leibniz International Proceedings in Informatics, LIPIcs, 89, 25:1-25:12 Leibniz International Proceedings in Informatics, LIPIcs, 89, 25:1-25:12 2018/02/01 Refereed English Research paper(international conference proceedings) Disclose to all
Yasuaki Kobayashi, Hisao Tamaki Yasuaki Kobayashi, Hisao Tamaki Yasuaki Kobayashi, Hisao Tamaki Treedepth parameterized by vertex cover number Treedepth parameterized by vertex cover number Treedepth parameterized by vertex cover number Leibniz International Proceedings in Informatics, LIPIcs, 63, 18:1-18-11 Leibniz International Proceedings in Informatics, LIPIcs, 63, 18:1-18-11 Leibniz International Proceedings in Informatics, LIPIcs, 63, 18:1-18-11 2017/02/01 Refereed English Research paper(international conference proceedings) Disclose to all
Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto Improved methods for computing distances between unordered trees using integer programming Improved methods for computing distances between unordered trees using integer programming Improved methods for computing distances between unordered trees using integer programming Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10628 LNCS, 45-60 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10628 LNCS, 45-60 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10628 LNCS, 45-60 2017 Refereed English Research paper(international conference proceedings) Disclose to all
Yasuaki Kobayashi, Hisao Tamaki Yasuaki Kobayashi, Hisao Tamaki Yasuaki Kobayashi, Hisao Tamaki A faster fixed parameter algorithm for two-layer crossing minimization A faster fixed parameter algorithm for two-layer crossing minimization A faster fixed parameter algorithm for two-layer crossing minimization Information Processing Letters, 116, 9, 547-549 Information Processing Letters, 116, 9, 547-549 Information Processing Letters, 116, 9, 547-549 2016/09/01 Refereed English Research paper(scientific journal) Disclose to all
Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano Computing Directed Pathwidth in O(1. 89 <sup>n</sup>) Time Computing Directed Pathwidth in O(1. 89 <sup>n</sup>) Time Computing Directed Pathwidth in O(1. 89 <sup>n</sup>) Time Algorithmica, 75, 1, 138-157 Algorithmica, 75, 1, 138-157 Algorithmica, 75, 1, 138-157 2016/05/01 Refereed English Research paper(scientific journal) Disclose to all
Yasuaki Kobayashi, Hisao Tamaki Yasuaki Kobayashi, Hisao Tamaki Yasuaki Kobayashi, Hisao Tamaki A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization Algorithmica, 72, 3, 778-790 Algorithmica, 72, 3, 778-790 Algorithmica, 72, 3, 778-790 2015/07/12 Refereed English Research paper(scientific journal) Disclose to all
Yasuaki Kobayashi Yasuaki Kobayashi Yasuaki Kobayashi Computing the pathwidth of directed graphs with small vertex cover Computing the pathwidth of directed graphs with small vertex cover Computing the pathwidth of directed graphs with small vertex cover Information Processing Letters, 115, 2, 310-312 Information Processing Letters, 115, 2, 310-312 Information Processing Letters, 115, 2, 310-312 2015/02 Refereed English Research paper(scientific journal) Disclose to all
Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki On the pathwidth of almost semicomplete digraphs On the pathwidth of almost semicomplete digraphs On the pathwidth of almost semicomplete digraphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9294, 816-827 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9294, 816-827 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9294, 816-827 2015 Refereed English Research paper(international conference proceedings) Disclose to all
Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki A linear edge kernel for two-layer crossing minimization A linear edge kernel for two-layer crossing minimization A linear edge kernel for two-layer crossing minimization Theoretical Computer Science, 554, C, 74-81 Theoretical Computer Science, 554, C, 74-81 Theoretical Computer Science, 554, C, 74-81 2014 Refereed English Research paper(scientific journal) Disclose to all
Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki Search space reduction through commitments in pathwidth computation: An experimental study Search space reduction through commitments in pathwidth computation: An experimental study Search space reduction through commitments in pathwidth computation: An experimental study Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8504 LNCS, 388-399 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8504 LNCS, 388-399 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8504 LNCS, 388-399 2014 Refereed English Research paper(international conference proceedings) Disclose to all
Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki A linear edge kernel for two-layer crossing minimization A linear edge kernel for two-layer crossing minimization A linear edge kernel for two-layer crossing minimization Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7936 LNCS, 458-468 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7936 LNCS, 458-468 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7936 LNCS, 458-468 2013 Refereed English Research paper(international conference proceedings) Disclose to all
Yasuaki Kobayashi, Hisao Tamaki Yasuaki Kobayashi, Hisao Tamaki Yasuaki Kobayashi, Hisao Tamaki A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7501 LNCS, 683-694 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7501 LNCS, 683-694 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7501 LNCS, 683-694 2012 Refereed English Research paper(international conference proceedings) Disclose to all
Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano Computing directed pathwidth in O(1.89<sup>n</sup>) time Computing directed pathwidth in O(1.89<sup>n</sup>) time Computing directed pathwidth in O(1.89<sup>n</sup>) time Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7535 LNCS, 182-193 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7535 LNCS, 182-193 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7535 LNCS, 182-193 2012 Refereed English Research paper(international conference proceedings) Disclose to all
Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki k-cyclic orientations of graphs k-cyclic orientations of graphs k-cyclic orientations of graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6507 LNCS, PART 2, 73-84 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6507 LNCS, PART 2, 73-84 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6507 LNCS, PART 2, 73-84 2010 Refereed English Research paper(international conference proceedings) Disclose to all

  • <<
  • >>
Title language:
Misc
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
Yasuaki Kobayashi, Yota Otachi Yasuaki Kobayashi, Yota Otachi Yasuaki Kobayashi, Yota Otachi Parameterized Complexity of Graph Burning Parameterized Complexity of Graph Burning Parameterized Complexity of Graph Burning arXiv arXiv arXiv 2020/07/17 Disclose to all
Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza Computing the Largest Bond and the Maximum Connected Cut of a Graph Computing the Largest Bond and the Maximum Connected Cut of a Graph Computing the Largest Bond and the Maximum Connected Cut of a Graph arXiv arXiv arXiv 2020/07/09 Disclose to all
Kazuhiro Kurita, Yasuaki Kobayashi Kazuhiro Kurita, Yasuaki Kobayashi Kazuhiro Kurita, Yasuaki Kobayashi Efficient Enumerations for Minimal Multicuts and Multiway Cuts Efficient Enumerations for Minimal Multicuts and Multiway Cuts Efficient Enumerations for Minimal Multicuts and Multiway Cuts arXiv arXiv arXiv 2020/06/29 Disclose to all
Yasuaki Kobayashi Yasuaki Kobayashi Yasuaki Kobayashi On Structural Parameterizations of Node Kayles On Structural Parameterizations of Node Kayles On Structural Parameterizations of Node Kayles JCDCGGG 2018 JCDCGGG 2018 JCDCGGG 2018 2020/03/26 Refereed English Disclose to all
久保田 稜, 小林 靖明, 小島 健介, 山本 章博 久保田 稜, 小林 靖明, 小島 健介, 山本 章博 Towards the Fixed-Parameter Tractability of the Commutative Matching Problem 可換マッチング問題の固定パラメーター容易性に関する研究 (特集 「命題論理の充足可能性問題SATの最新動向」および一般) Towards the Fixed-Parameter Tractability of the Commutative Matching Problem 人工知能基本問題研究会, 112, 61-66 人工知能基本問題研究会, 112, 61-66 , 112, 61-66 2020/03/08 Japanese Disclose to all
Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone An optimal algorithm for Bisection for bounded-treewidth graphs An optimal algorithm for Bisection for bounded-treewidth graphs An optimal algorithm for Bisection for bounded-treewidth graphs arXiv arXiv arXiv 2020/02/28 Disclose to all
小林 靖明, 曽根 大雅, 土中 哲秀 小林 靖明, 曽根 大雅, 土中 哲秀 グラフの2等分割問題に対するアルゴリズムと計算複雑性 (システム数理と応用) グラフの2等分割問題に対するアルゴリズムと計算複雑性 (システム数理と応用) 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 119, 314, 41-46 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 119, 314, 41-46 , 119, 314, 41-46 2019/11/28 Japanese Disclose to all
小林 靖明, 中畑 裕 小林 靖明, 中畑 裕 An Exact Algorithm for Linearwidth and Its Application to Frontier-Based Search 線形枝幅を計算する厳密アルゴリズムとフロンティア法への応用 (特集 「知識に関する処理の最新動向」および一般) An Exact Algorithm for Linearwidth and Its Application to Frontier-Based Search 人工知能基本問題研究会, 110, 19-24 人工知能基本問題研究会, 110, 19-24 , 110, 19-24 2019/09/24 Japanese Disclose to all
Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi, Akihiro Yamamoto 新藤 光, 西野 正彬, 小林 靖明, 山本 章博 Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi, Akihiro Yamamoto Metric Learning for Trees with pq-gram pq-gramを用いた木構造間の距離の学習 (特集 「知識に関する処理の最新動向」および一般) Metric Learning for Trees with pq-gram 人工知能基本問題研究会, 110, 13-18 人工知能基本問題研究会, 110, 13-18 , 110, 13-18 2019/09/24 Japanese Disclose to all
Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki An FPT Algorithm for Max-Cut Parameterized by Crossing Number An FPT Algorithm for Max-Cut Parameterized by Crossing Number An FPT Algorithm for Max-Cut Parameterized by Crossing Number arXiv arXiv arXiv 2019/04/10 Disclose to all
里見 琢聞, 小林 靖明, 山本 章博 里見 琢聞, 小林 靖明, 山本 章博 Algorithms for Linear Least Common Generalization Problem on Strings 文字列データの線形最小汎化問題に対するアルゴリズム (特集 「命題論理の充足可能性問題SATの最新動向」および一般) Algorithms for Linear Least Common Generalization Problem on Strings 人工知能基本問題研究会, 109, 78-82 人工知能基本問題研究会, 109, 78-82 , 109, 78-82 2019/03/13 Japanese Disclose to all
久保田 稜, 小林 靖明, 山本 章博 久保田 稜, 小林 靖明, 山本 章博 A faster fixed-parameter algorithm for computing an optimal alignment for bounded degree trees 定数次数の木に対する高速な最適アラインメント計算について (特集 「生命科学における離散構造」および一般) A faster fixed-parameter algorithm for computing an optimal alignment for bounded degree trees 人工知能基本問題研究会, 108, 39-44 人工知能基本問題研究会, 108, 39-44 , 108, 39-44 2019/01/29 Japanese Disclose to all
久保田 稜, 小林 靖明, 山本 章博 久保田 稜, 小林 靖明, 山本 章博 Integer Programming Formulations for Computing Alignment Distance between Unordered Trees 整数計画法による木構造データ間のアラインメント距離の計算 (特集 「命題論理の充足可能性問題SATの最新動向」および一般) Integer Programming Formulations for Computing Alignment Distance between Unordered Trees 人工知能基本問題研究会, 106, 82-87 人工知能基本問題研究会, 106, 82-87 , 106, 82-87 2018/03/16 Japanese Disclose to all
紫藤 佑介, 山本 章博, 小林 靖明, 久保山 哲二 紫藤 佑介, 山本 章博, 小林 靖明, 久保山 哲二 A Feature Selection Method for Relational Data Based on Modularity モジュラリティを基準とした関係データに対する特徴選択 (特集 「SAT技術の理論,実装,応用」および一般) A Feature Selection Method for Relational Data Based on Modularity 人工知能基本問題研究会, 103, 89-94 人工知能基本問題研究会, 103, 89-94 , 103, 89-94 2017/03/13 Japanese Disclose to all
洪 恩平, 小林 靖明, 山本 章博 洪 恩平, 小林 靖明, 山本 章博 整数計画法による木間距離の計算を高速化するための新しい定式化 (特集 「SAT技術の理論,実装,応用」および一般) 整数計画法による木間距離の計算を高速化するための新しい定式化 (特集 「SAT技術の理論,実装,応用」および一般) 人工知能基本問題研究会, 103, 78-83 人工知能基本問題研究会, 103, 78-83 , 103, 78-83 2017/03/13 Japanese Disclose to all
山浦 智佳子, 小林 靖明, 山本 章博, 久保山 哲二 山浦 智佳子, 小林 靖明, 山本 章博, 久保山 哲二 Analysis of Biclustering Algorithms Assuming Several Types of Cluster Structure クラスタ構造を仮定した場合の双クラスタリングアルゴリズムの解析 (特集 「SAT技術の理論,実装,応用」および一般) Analysis of Biclustering Algorithms Assuming Several Types of Cluster Structure 人工知能基本問題研究会, 103, 67-72 人工知能基本問題研究会, 103, 67-72 , 103, 67-72 2017/03/13 Japanese Disclose to all
大久保 秀, 安部 健太, 小林 靖明, 神谷 匠 大久保 秀, 安部 健太, 小林 靖明, 神谷 匠 <研究報告>依頼対応記録からの効果的な情報検索とその応用について <研究報告>依頼対応記録からの効果的な情報検索とその応用について 学習院大学計算機センター年報, 38, 116-126 学習院大学計算機センター年報, 38, 116-126 , 38, 116-126 2017 Japanese Disclose to all
小林 靖明, 玉木 久夫 小林 靖明, 玉木 久夫 頂点被覆数が小さいグラフの最適消去木の計算について (システム数理と応用) 頂点被覆数が小さいグラフの最適消去木の計算について (システム数理と応用) 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 115, 316, 53-58 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 115, 316, 53-58 , 115, 316, 53-58 2015/11/20 Japanese Disclose to all
橘内 謙太, 小林 靖明, 玉木 久夫 橘内 謙太, 小林 靖明, 玉木 久夫 準完全有向グラフとその一般化に対するパス幅計算について 準完全有向グラフとその一般化に対するパス幅計算について 情報処理学会研究報告. AL, アルゴリズム研究会報告, 2015, 3, 1-8 情報処理学会研究報告. AL, アルゴリズム研究会報告, 2015, 3, 1-8 , 2015, 3, 1-8 2015/02/24 Japanese Disclose to all
大野 志郎, 横山 悦郎, 城所 弘泰, 伊藤 大河, 小林 靖明 大野 志郎, 横山 悦郎, 城所 弘泰, 伊藤 大河, 小林 靖明 <研究報告>教員のICT機器利用支援のための動画講習教材の作成と評価 <研究報告>教員のICT機器利用支援のための動画講習教材の作成と評価 学習院大学計算機センター年報, 36, 81-88 学習院大学計算機センター年報, 36, 81-88 , 36, 81-88 2015/01/01 Japanese Disclose to all

  • <<
  • >>
Title language:
Awards
Title(Japanese) Title(English) Organization name(Japanese) Organization name(English) Date
学生優秀発表賞 日本オペレーションズ・リサーチ学会 「OR横断若手の会」研究部会 2012/10/27
コンピュータサイエンス領域奨励賞 情報処理学会 2014/09/12
The 2nd Parameterized Algorithms and Computational Experiments Challenge Track B, 1st place The 2nd Parameterized Algorithms and Computational Experiments Challenge 2017/09/06
Best Paper Award 30th International Workshop on Combinatorial Algorithms 2019/07/23
Teaching subject(s)
Name(Japanese) Name(English) Term Department Period
計算機科学実験及演習1 Computer Science Laboratory and Exercise 1 前期 工学部 2017/04-2018/03
Computational Learning Theory Computational Learning Theory 後期 情報学研究科 2018/04-2019/03
計算機科学のための数学演習 Mathematics in Practice for Computer Science 前期 工学部 2019/04-2020/03
計算論的学習理論 Computational Learning Theory 後期 情報学研究科 2019/04-2020/03
計算機科学のための数学演習 Mathematics in Practice for Computer Science 前期 工学部 2020/04-2021/03
計算論的学習理論 Computational Learning Theory 後期 工学研究科 2020/04-2021/03
計算論的学習理論 Computational Learning Theory 後期 情報学研究科 2020/04-2021/03