小林 靖明

Last Update: 2021/10/19 11:21:44

Print

Name(Kanji/Kana/Abecedarium Latinum)
小林 靖明/コバヤシ ヤスアキ/Kobayashi, Yasuaki
Primary Affiliation(Org1/Job title)
Graduate School of 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
Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. Theor. Comput. Sci., 873, 38-46 Theor. Comput. Sci., 873, 38-46 Theor. Comput. Sci., 873, 38-46 2021 Refereed English Research paper(scientific journal) Disclose to all
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. Proceedings of CIAC 2021, LNCS, 12701, 271-285 Proceedings of CIAC 2021, LNCS, 12701, 271-285 Proceedings of CIAC 2021, LNCS, 12701, 271-285 2021 Refereed English Research paper(international conference proceedings) Disclose to all
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. Theor. Comput. Sci., 865, 131-140 Theor. Comput. Sci., 865, 131-140 Theor. Comput. Sci., 865, 131-140 2021 Refereed English Research paper(scientific journal) Disclose to all
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi Finding Diverse Trees, Paths, and More. Finding Diverse Trees, Paths, and More. Finding Diverse Trees, Paths, and More. Proceedings of AAAI 2021, 3778-3786 Proceedings of AAAI 2021, 3778-3786 Proceedings of AAAI 2021, 3778-3786 2021 Refereed English Research paper(international conference proceedings) 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. Algorithmica, 83, 5, 1421-1458 Algorithmica, 83, 5, 1421-1458 Algorithmica, 83, 5, 1421-1458 2021 Refereed English Research paper(scientific journal) Disclose to all
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. Proceedings of IPEC 2020, LIPIcs, 180, 21:1-21:10 Proceedings of IPEC 2020, LIPIcs, 180, 21:1-21:10 Proceedings of IPEC 2020, LIPIcs, 180, 21:1-21:10 2020/12 Refereed English Research paper(international conference proceedings) 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 Graph An Optimal Algorithm for Bisection for Bounded-Treewidth Graph An Optimal Algorithm for Bisection for Bounded-Treewidth Graph Proceedings of FAW 2020, LNCS, 12340, 25-36 Proceedings of FAW 2020, LNCS, 12340, 25-36 Proceedings of FAW 2020, LNCS, 12340, 25-36 2020/11 Refereed English Research paper(international conference proceedings) Disclose to all
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 -Path Packing Parameterized Complexity of -Path Packing Parameterized Complexity of -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/08/08 Refereed English Research paper(international conference proceedings) Disclose to all
Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi, Akihiro Yamamoto Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi, Akihiro Yamamoto Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi, Akihiro Yamamoto Metric Learning for Ordered Labeled Trees with pq-grams Metric Learning for Ordered Labeled Trees with pq-grams Metric Learning for Ordered Labeled Trees with pq-grams Frontiers in Artificial Intelligence and Applications, 325, 1475-1482 Frontiers in Artificial Intelligence and Applications, 325, 1475-1482 Frontiers in Artificial Intelligence and Applications, 325, 1475-1482 2020/08 Refereed English Research paper(international conference proceedings) 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 Proceedings of MFCS 2020, 60:1-60:14 Proceedings of MFCS 2020, 60:1-60:14 Proceedings of MFCS 2020, 60:1-60:14 2020/08 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. Algorithmica, 82, 12, 3566-3587 Algorithmica, 82, 12, 3566-3587 Algorithmica, 82, 12, 3566-3587 2020 Refereed English Research paper(scientific journal) 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
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
青池宥希, 清見礼, 小林靖明, 大舘陽太 青池宥希, 清見礼, 小林靖明, 大舘陽太 区間順序上の最長増加部分列 区間順序上の最長増加部分列 情報処理学会研究報告(Web), 2021, AL-184 情報処理学会研究報告(Web), 2021, AL-184 , 2021, AL-184 2021 Disclose to all
吉村仁志, 小林靖明, 山本章博 吉村仁志, 小林靖明, 山本章博 順列グラフのカラフル独立集合問題に対するアルゴリズム 順列グラフのカラフル独立集合問題に対するアルゴリズム 情報処理学会研究報告(Web), 2021, AL-182 情報処理学会研究報告(Web), 2021, AL-182 , 2021, AL-182 2021 Disclose to all
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa Reconfiguring Directed Trees in a Digraph. Reconfiguring Directed Trees in a Digraph. Reconfiguring Directed Trees in a Digraph. CoRR, abs/2107.03092 CoRR, abs/2107.03092 CoRR, abs/2107.03092 2021 Disclose to all
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa Polynomial-Delay Enumeration of Large Maximal Matchings. Polynomial-Delay Enumeration of Large Maximal Matchings. Polynomial-Delay Enumeration of Large Maximal Matchings. CoRR, abs/2105.04146 CoRR, abs/2105.04146 CoRR, abs/2105.04146 2021 Disclose to all
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Kazuhiro Kurita, Yota Otachi Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Kazuhiro Kurita, Yota Otachi Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Kazuhiro Kurita, Yota Otachi An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. CoRR, abs/2012.04910 CoRR, abs/2012.04910 CoRR, abs/2012.04910 2020 Disclose to all
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa Polynomial Delay Enumeration for Minimal Steiner Problems. Polynomial Delay Enumeration for Minimal Steiner Problems. Polynomial Delay Enumeration for Minimal Steiner Problems. CoRR, abs/2010.11462 CoRR, abs/2010.11462 CoRR, abs/2010.11462 2020 Disclose to all
Yasuaki Kobayashi, Yu Nakahata Yasuaki Kobayashi, Yu Nakahata Yasuaki Kobayashi, Yu Nakahata A Note on Exponential-Time Algorithms for Linearwidth. A Note on Exponential-Time Algorithms for Linearwidth. A Note on Exponential-Time Algorithms for Linearwidth. CoRR, abs/2010.02388 CoRR, abs/2010.02388 CoRR, abs/2010.02388 2020 Disclose to all
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints. Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints. Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints. CoRR, abs/2009.08830 CoRR, abs/2009.08830 CoRR, abs/2009.08830 2020 Disclose to all
久保田稜, 小林靖明, 小島健介, 山本章博 久保田稜, 小林靖明, 小島健介, 山本章博 久保田稜, 小林靖明, 小島健介, 山本章博 Towards the Fixed-Parameter Tractability of the Commutative Matching Problem 可換マッチング問題の固定パラメーター容易性に関する研究 Towards the Fixed-Parameter Tractability of the Commutative Matching Problem 人工知能学会人工知能基本問題研究会資料, 112th, 61-66 人工知能学会人工知能基本問題研究会資料, 112th, 61-66 人工知能学会人工知能基本問題研究会資料, 112th, 61-66 2020 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
小林靖明 小林靖明 小林靖明 Parameterized Algorithms for Order Dimension 半順序集合の次元を求める固定パラメータアルゴリズム Parameterized Algorithms for Order Dimension 電子情報通信学会技術研究報告, 119, 21(COMP2019 1-9)(Web) 電子情報通信学会技術研究報告, 119, 21(COMP2019 1-9)(Web) 電子情報通信学会技術研究報告, 119, 21(COMP2019 1-9)(Web) 2019 Disclose to all
松田浩幸, 紫藤佑介, 小林靖明, 山本章博, 宮本篤志, 松村忠幸 松田浩幸, 紫藤佑介, 小林靖明, 山本章博, 宮本篤志, 松村忠幸 コンテキストと構文の情報を用いたニューラルネットによる変数名予測 コンテキストと構文の情報を用いたニューラルネットによる変数名予測 情報処理学会研究報告(Web), 2019, SE-202 情報処理学会研究報告(Web), 2019, SE-202 , 2019, SE-202 2019 Disclose to all
新藤光, 西野正彬, 小林靖明, 山本章博 新藤光, 西野正彬, 小林靖明, 山本章博 pq-gramを用いた木構造間の距離の学習 pq-gramを用いた木構造間の距離の学習 人工知能学会人工知能基本問題研究会資料, 110th 人工知能学会人工知能基本問題研究会資料, 110th , 110th 2019 Disclose to all
小林靖明, 曽根大雅, 土中哲秀 小林靖明, 曽根大雅, 土中哲秀 グラフの2等分割問題に対するアルゴリズムと計算複雑性 グラフの2等分割問題に対するアルゴリズムと計算複雑性 電子情報通信学会技術研究報告, 119, 314(MSS2019 23-40), 41-46 電子情報通信学会技術研究報告, 119, 314(MSS2019 23-40), 41-46 , 119, 314(MSS2019 23-40), 41-46 2019 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 人工知能学会人工知能基本問題研究会資料, 110th, 19-24 人工知能学会人工知能基本問題研究会資料, 110th, 19-24 , 110th, 19-24 2019 Japanese Disclose to all
里見琢聞, 小林靖明, 山本章博 里見琢聞, 小林靖明, 山本章博 Algorithms for Linear Least Common Generalization Problem on Strings 文字列データの線形最小汎化問題に対するアルゴリズム Algorithms for Linear Least Common Generalization Problem on Strings 人工知能学会人工知能基本問題研究会資料, 109th, 78-82 人工知能学会人工知能基本問題研究会資料, 109th, 78-82 , 109th, 78-82 2019 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 人工知能学会人工知能基本問題研究会資料, 108th, 39-44 人工知能学会人工知能基本問題研究会資料, 108th, 39-44 , 108th, 39-44 2019 Japanese Disclose to all
向井達郎, 小林靖明, 紫藤佑介, 山本章博, 宮本篤志, 松村忠幸, 嶺竜治 向井達郎, 小林靖明, 紫藤佑介, 山本章博, 宮本篤志, 松村忠幸, 嶺竜治 トークンのN-gramによるプログラム表現を用いたコードクローン検出手法 トークンのN-gramによるプログラム表現を用いたコードクローン検出手法 情報処理学会研究報告(Web), 2018, SE-199 情報処理学会研究報告(Web), 2018, SE-199 , 2018, SE-199 2018 Disclose to all
久保田稜, 小林靖明, 山本章博 久保田稜, 小林靖明, 山本章博 Integer Programming Formulations for Computing Alignment Distance between Unordered Trees 整数計画法による木構造データ間のアラインメント距離の計算 Integer Programming Formulations for Computing Alignment Distance between Unordered Trees 人工知能学会人工知能基本問題研究会資料, 106th, 82-87 人工知能学会人工知能基本問題研究会資料, 106th, 82-87 , 106th, 82-87 2018 Japanese Disclose to all
小林靖明 小林靖明 小林靖明 Structural Parameterizations of Node Kayles 構造的パラメータを用いた頂点Kaylesの解析 Structural Parameterizations of Node Kayles 電子情報通信学会技術研究報告, 118, 216(COMP2018 9-20)(Web) 電子情報通信学会技術研究報告, 118, 216(COMP2018 9-20)(Web) 電子情報通信学会技術研究報告, 118, 216(COMP2018 9-20)(Web) 2018 Refereed English 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
山浦 智佳子, 小林 靖明, 山本 章博, 久保山 哲二 山浦 智佳子, 小林 靖明, 山本 章博, 久保山 哲二 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
小林靖明, 玉木久夫 小林靖明, 玉木久夫 最小フィルイン問題に対する安全なセパレータについて 最小フィルイン問題に対する安全なセパレータについて 情報処理学会研究報告(Web), 2017, AL-164 情報処理学会研究報告(Web), 2017, AL-164 , 2017, AL-164 2017 Disclose to all
大久保 秀, 安部 健太, 小林 靖明, 神谷 匠 大久保 秀, 安部 健太, 小林 靖明, 神谷 匠 <研究報告>依頼対応記録からの効果的な情報検索とその応用について <研究報告>依頼対応記録からの効果的な情報検索とその応用について 学習院大学計算機センター年報, 38, 116-126 学習院大学計算機センター年報, 38, 116-126 , 38, 116-126 2017 Japanese Disclose to all
HONG Eunpyeong, 小林靖明, 山本章博 HONG Eunpyeong, 小林靖明, 山本章博 整数計画法による木間距離の計算を高速化するための新しい定式化 整数計画法による木間距離の計算を高速化するための新しい定式化 人工知能学会人工知能基本問題研究会資料, 103rd, 78-83 人工知能学会人工知能基本問題研究会資料, 103rd, 78-83 , 103rd, 78-83 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
研究会優秀賞 人工知能学会 2021/06/21
External funds: competitive funds and Grants-in-Aid for Scientific Research (Kakenhi)
Type Position Title(Japanese) Title(English) Period
若手研究 Representative グラフの木分解を用いた高速なメタアルゴリズムの研究 2020/04/01-2023/03/31
研究活動スタート支援 Representative グラフの階層描画におけるSugiyama methodへの厳密アルゴリズムの適用 2014/08/29-2016/03/31
学術変革領域研究(B) Assignment 計算機科学アプローチによる組合せ遷移の展開:アルゴリズムの自動生成に向けて 2020/10/02-2023/03/31
基盤研究(B) Assignment 弱閉集合の代数的構造の解明と知識発見への応用 2017/04/01-2020/03/31
基盤研究(B) Assignment 高次元ブール値テンソルデータからの多項閉集合を用いた知識発見 研究課題 2021/04/01-2024/03/31
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
計算機科学実験及演習1(H26以前入学者) Computer Science Laboratory and Exercise 1 前期 工学部 2021/04-2022/03
計算機科学実験及演習1(H27以降入学者) Computer Science Laboratory and Exercise 1 前期 工学部 2021/04-2022/03
計算機科学のための数学演習 Mathematics in Practice for Computer Science 前期 工学部 2021/04-2022/03
計算論的学習理論 Computational Learning Theory 後期 工学研究科 2021/04-2022/03
計算論的学習理論 Computational Learning Theory 後期 情報学研究科 2021/04-2022/03

  • <<
  • >>
Awards received by supervised students
Student name Award title Giver Date
向井達郎 コンピューターサイエンス領域奨励賞 情報処理学会 2019
Faculty management (title, position)
Title Period
情報セキュリティWG委員 2021/04/01-2022/03/31
システム運用WG委員 2021/04/01-2022/03/31
Academic organizations (editor, editing team)
Organization name(Japanese) Organization name(English) Journal name(Japanese) Journal name(English) Title Period
人工知能学会 The Japanese Society for Artificial Intelligence 編集委員 2019/06/01-
Academic organizaions (conference administrator)
Organization name Group name Title Period
人工知能学会 人工知能基本問題研究会 幹事 2020/04/01-
情報処理学会 アルゴリズム研究会 アルゴリズム研究運営委員会 2020/04/01-
Academic organizaions (other)
Organization name(Japanese) Organization name(English) Misc(Japanese) Misc(English) Period
International Conference on Discovery Science 2017 Local Arrangement Chair -