Follow
Yasuaki Kobayashi
Yasuaki Kobayashi
Verified email at ist.hokudai.ac.jp - Homepage
Title
Cited by
Cited by
Year
Automatic source code summarization with extended tree-lstm
Y Shido, Y Kobayashi, A Yamamoto, A Miyamoto, T Matsumura
2019 International Joint Conference on Neural Networks (IJCNN), 1-8, 2019
502019
Computing Directed Pathwidth in O(1.89 n ) Time
K Kitsunai, Y Kobayashi, K Komuro, H Tamaki, T Tano
International Symposium on Parameterized and Exact Computation, 182-193, 2012
37*2012
Parameterized algorithms for maximum cut with connectivity constraints
H Eto, T Hanaka, Y Kobayashi, Y Kobayashi
arXiv preprint arXiv:1908.03389, 2019
122019
Treedepth parameterized by vertex cover number
Y Kobayashi, H Tamaki
11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017
112017
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
Y Kobayashi, H Tamaki
Algorithmica 72 (3), 778-790, 2015
102015
A linear edge kernel for two-layer crossing minimization
Y Kobayashi, H Maruta, Y Nakae, H Tamaki
Theoretical Computer Science 554, 74-81, 2014
102014
On the pathwidth of almost semicomplete digraphs
K Kitsunai, Y Kobayashi, H Tamaki
Algorithms-ESA 2015, 816-827, 2015
72015
Search space reduction through commitments in pathwidth computation: An experimental study
Y Kobayashi, K Komuro, H Tamaki
International Symposium on Experimental Algorithms, 388-399, 2014
72014
Finding diverse trees, paths, and more
T Hanaka, Y Kobayashi, K Kurita, Y Otachi
Proceedings of the AAAI Conference on Artificial Intelligence 35 (5), 3778-3786, 2021
62021
Improved methods for computing distances between unordered trees using integer programming
E Hong, Y Kobayashi, A Yamamoto
International Conference on Combinatorial Optimization and Applications, 45-60, 2017
62017
Computing the pathwidth of directed graphs with small vertex cover
Y Kobayashi
Information Processing Letters 115 (2), 310-312, 2015
62015
Subgraph isomorphism on graph classes that exclude a substructure
HL Bodlaender, T Hanaka, Y Kobayashi, Y Kobayashi, Y Okamoto, ...
Algorithmica 82 (12), 3566-3587, 2020
52020
Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with cardinality constraints
Y Kobayashi, K Kurita, K Wasa
CoRR, abs/2009.08830, 2020
42020
Algorithms and hardness results for the maximum balanced connected subgraph problem
Y Kobayashi, K Kojima, N Matsubara, T Sone, A Yamamoto
International Conference on Combinatorial Optimization and Applications, 303-315, 2019
42019
Exploring the gap between treedepth and vertex cover through vertex integrity
T Gima, T Hanaka, M Kiyomi, Y Kobayashi, Y Otachi
Theoretical Computer Science 918, 60-76, 2022
32022
Parameterized complexity of graph burning
Y Kobayashi, Y Otachi
Algorithmica, 1-15, 2022
32022
Efficient enumerations for minimal multicuts and multiway cuts
K Kurita, Y Kobayashi
arXiv preprint arXiv:2006.16222, 2020
32020
Metric learning for ordered labeled trees with pq-grams
H Shindo, M Nishino, Y Kobayashi, A Yamamoto
arXiv preprint arXiv:2003.03960, 2020
32020
An improved fixed-parameter algorithm for Max-Cut parameterized by crossing number
Y Kobayashi, Y Kobayashi, S Miyazaki, S Tamaki
International Workshop on Combinatorial Algorithms, 327-338, 2019
32019
An improved fixed-parameter algorithm for one-page crossing minimization
Y Kobayashi, H Ohtsuka, H Tamaki
12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018
32018
The system can't perform the operation now. Try again later.
Articles 1–20