Παρακολούθηση
Yasuaki Kobayashi
Yasuaki Kobayashi
Hokkaido University
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα ist.hokudai.ac.jp - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
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
1182019
Computing Directed Pathwidth in O(1.89 n ) Time
K Kitsunai, Y Kobayashi, K Komuro, H Tamaki, T Tano
Parameterized and Exact Computation: 7th International Symposium, IPEC 2012 …, 2012
43*2012
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
372022
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
342021
Computing diverse shortest paths efficiently: A theoretical and experimental study
T Hanaka, Y Kobayashi, K Kurita, SW Lee, Y Otachi
Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3758-3766, 2022
272022
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
Y Kobayashi, H Tamaki
Algorithmica 72 (3), 778-790, 2015
242015
A framework to design approximation algorithms for finding diverse solutions in combinatorial problems
T Hanaka, M Kiyomi, Y Kobayashi, Y Kobayashi, K Kurita, Y Otachi
Proceedings of the AAAI Conference on Artificial Intelligence 37 (4), 3968-3976, 2023
222023
Parameterized algorithms for maximum cut with connectivity constraints
H Eto, T Hanaka, Y Kobayashi, Y Kobayashi
arXiv preprint arXiv:1908.03389, 2019
222019
Treedepth parameterized by vertex cover number
Y Kobayashi, H Tamaki
11th International Symposium on Parameterized and Exact Computation (IPEC …, 2017
212017
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
172020
Parameterized complexity of graph burning
Y Kobayashi, Y Otachi
Algorithmica 84 (8), 2379-2393, 2022
152022
Computing the largest bond and the maximum connected cut of a graph
GL Duarte, H Eto, T Hanaka, Y Kobayashi, Y Kobayashi, D Lokshtanov, ...
Algorithmica 83, 1421-1458, 2021
152021
On the pathwidth of almost semicomplete digraphs
K Kitsunai, Y Kobayashi, H Tamaki
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
112015
A linear edge kernel for two-layer crossing minimization
Y Kobayashi, H Maruta, Y Nakae, H Tamaki
Theoretical Computer Science 554, 74-81, 2014
112014
Improved methods for computing distances between unordered trees using integer programming
E Hong, Y Kobayashi, A Yamamoto
Combinatorial Optimization and Applications: 11th International Conference …, 2017
102017
Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
Y Kobayashi, K Kurita, K Wasa
Discrete Applied Mathematics 361, 258-275, 2025
8*2025
Parameterized Complexity of -Path Packing
R Belmonte, T Hanaka, M Kanzaki, M Kiyomi, Y Kobayashi, Y Kobayashi, ...
Algorithmica, 1-25, 2021
8*2021
Computing the pathwidth of directed graphs with small vertex cover
Y Kobayashi
Information Processing Letters 115 (2), 310-312, 2015
82015
Polynomial-delay and polynomial-space enumeration of large maximal matchings
Y Kobayashi, K Kurita, K Wasa
International Workshop on Graph-Theoretic Concepts in Computer Science, 342-355, 2022
7*2022
Linear-delay enumeration for minimal steiner problems
Y Kobayashi, K Kurita, K Wasa
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022
7*2022
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20