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, LIPICS, 149, 32:1-32:12 |
Proc. of ISAAC 2019, LIPICS, 149, 32:1-32:12 |
Proc. of ISAAC 2019, LIPICS, 149, 32:1-32:12 |
2019/12 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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, LIPICS, 148, 13:1-13:15 |
Proc. of IPEC 2019, LIPICS, 148, 13:1-13:15 |
Proc. of IPEC 2019, LIPICS, 148, 13:1-13:15 |
2019/12 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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 |
|
|
|
公開 |
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 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Kitsunai K., Kobayashi Y., Komuro K., Tano T., Tamaki H. |
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 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
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 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
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 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Kitsunai K., Kobayashi Y., Tamaki H. |
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 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
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 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
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 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |