小林 靖明

Last Update: 2019/10/03 11:29:24

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
修士(工学) 明治大学
博士(理学) 明治大学
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
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 Proc. of IJCNN 2019 Proc. of IJCNN 2019 2019 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 Proc. of IWOCA 2019, 11638, 327-338 Proc. of IWOCA 2019, 11638, 327-338 Proc. of IWOCA 2019, 11638, 327-338 2019 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 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 Proc. of ISAAC 2019 Proc. of ISAAC 2019 Proc. of ISAAC 2019 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 Proc. of COCOA 2019 Proc. of COCOA 2019 Proc. of COCOA 2019 2019 Refereed English Research paper(international conference proceedings) 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 Proc. of IPEC 2019 Proc. of IPEC 2019 Proc. of IPEC 2019 2019 Refereed English Disclose to all
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 Proc. of COCOA 2017, LNCS, 10628, 45-60 Proc. of COCOA 2017, LNCS, 10628, 45-60 Proc. of COCOA 2017, LNCS, 10628, 45-60 2017 Refereed English Research paper(international conference proceedings) Disclose to all
Yasuaki Kobayahsi, Hiromu Ohtsuka, Hisao Tamaki Yasuaki Kobayahsi, Hiromu Ohtsuka, Hisao Tamaki Yasuaki Kobayahsi, 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 Proc. of IPEC 2017, 89, 25:1-25:12 Proc. of IPEC 2017, 89, 25:1-25:12 Proc. of IPEC 2017, 89, 25:1-25:12 2017 Refereed English Research paper(international conference proceedings) Disclose to all
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 Proc. of IPEC 2016, LIPICS, 63, 18:1-18-11 Proc. of IPEC 2016, LIPICS, 63, 18:1-18-11 Proc. of IPEC 2016, LIPICS, 63, 18:1-18-11 2016 Refereed English Research paper(international conference proceedings) Disclose to all
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 Refereed English Research paper(scientific journal) Disclose to all
Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano Kitsunai K., Kobayashi Y., Komuro K., Tano T., Tamaki H. Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano Computing directed pathwidth in O(1.89^n) time Computing directed pathwidth in O(1.89^n) time Computing directed pathwidth in O(1.89^n) time Algorithmica, 75, 1, 138-157 Algorithmica, 75, 1, 138-157 Algorithmica, 75, 1, 138-157 2016 Refereed English Research paper(scientific journal) Disclose to all
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 Refereed English Research paper(scientific journal) Disclose to all
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 Refereed English Research paper(scientific journal) Disclose to all
Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki Kitsunai K., Kobayashi Y., Tamaki H. 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 Proc. of ESA 2015, LNCS, 9294, 816-827 Proc. of ESA 2015, LNCS, 9294, 816-827 Proc. of ESA 2015, LNCS, 9294, 816-827 2015 Refereed English Research paper(international conference proceedings) Disclose to all
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 Proc. of SEA 2014, LNCS, 8504, 388-399 Proc. of SEA 2014, LNCS, 8504, 388-399 Proc. of SEA 2014, LNCS, 8504, 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 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, 74-81 Theoretical Computer Science, 554, 74-81 Theoretical Computer Science, 554, 74-81 2014 Refereed English Research paper(scientific journal) Disclose to all
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 Proc. of COCOON 2013, LNCS, 7936, 458-468 Proc. of COCOON 2013, LNCS, 7936, 458-468 Proc. of COCOON 2013, LNCS, 7936, 458-468 2013 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 Computing directed pathwidth in O(1.89^n) time Computing directed pathwidth in O(1.89^n) time Computing directed pathwidth in O(1.89^n) time Proc. of IPEC 2012, LNCS, 7535, 182-193 Proc. of IPEC 2012, LNCS, 7535, 182-193 Proc. of IPEC 2012, LNCS, 7535, 182-193 2012 Refereed English Research paper(international conference proceedings) Disclose to all
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 Proc. of ESA 2012, LNCS, 7501, 683-694 Proc. of ESA 2012, LNCS, 7501, 683-694 Proc. of ESA 2012, LNCS, 7501, 683-694 2012 Refereed English Research paper(international conference proceedings) Disclose to all
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 Proc. of ISAAC 2010, LNCS, 6507, 2, 73-84 Proc. of ISAAC 2010, LNCS, 6507, 2, 73-84 Proc. of ISAAC 2010, LNCS, 6507, 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 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 2018/09 Refereed English 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