Yasuaki Kobayashi

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 95

Top Venues

Publications

Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Finding a Reconfiguration Sequence between Longest Increasing Subsequences. IEICE Trans. Inf. Syst. 107 (4) (2024)
Ryo Funayama, Yasuaki Kobayashi, Takeaki Uno
Parameterized Complexity of Finding Dissimilar Shortest Paths. CoRR (2024)
Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. IWOCA (2024)
Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
Finding Diverse Strings and Longest Common Subsequences in a Graph. CoRR (2024)
Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
Finding Diverse Strings and Longest Common Subsequences in a Graph. CPM (2024)
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
Structural Parameterizations of Vertex Integrity [Best Paper]. WALCOM (2024)
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM (2024)
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. AAAI (2024)
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR (2024)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. MFCS (2023)
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. CoRR (2023)
Masataka Nakahara, Norihiro Okui, Yasuaki Kobayashi, Yutaka Miyake, Ayumu Kubota
Malware detection for IoT devices using hybrid system of whitelist and machine learning based on lightweight flow data. Enterp. Inf. Syst. 17 (9) (2023)
Tesshu Hanaka, Yasuaki Kobayashi
Finding a Minimum Spanning Tree with a Small Non-Terminal Set. CoRR (2023)
Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi
A Process Reduction Method for Spatial Information in Real-Time AR Snow Visualization Systems. COMPSAC (2023)
Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. CoRR (2023)
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
Reconfiguration of Time-Respecting Arborescences. WADS (2023)
Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. SPIRE (2023)
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
On the complexity of list H-packing for sparse graph classes. CoRR (2023)
Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints. CoRR (2023)
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. AAAI (2023)
Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Finding a reconfiguration sequence between longest increasing subsequences. CoRR (2023)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. CoRR (2023)
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
Structural Parameterizations of Vertex Integrity. CoRR (2023)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. 943 (2023)
Yasuaki Kobayashi, Yota Otachi
Parameterized Complexity of Graph Burning. Algorithmica 84 (8) (2022)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
Independent set reconfiguration on directed graphs. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
Independent Set Reconfiguration on Directed Graphs. MFCS (2022)
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Exploring the gap between treedepth and vertex cover through vertex integrity. Theor. Comput. Sci. 918 (2022)
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Theory Comput. Syst. 66 (2) (2022)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Linear-Delay Enumeration for Minimal Steiner Problems. PODS (2022)
Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi
A Real-Time AR Visualization System of Snow-Covered Situations. GCCE (2022)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica 84 (4) (2022)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. WG (2022)
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. AAAI (2022)
Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi
Finding shortest non-separating and non-disconnecting paths. CoRR (2022)
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. MFCS (2022)
Takayuki Nishio, Masataka Nakahara, Norihiro Okui, Ayumu Kubota, Yasuaki Kobayashi, Keizo Sugiyama, Ryoichi Shinkuma
Anomaly Traffic Detection with Federated Learning toward Network-based Malware Detection in IoT. GLOBECOM (2022)
Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. IEICE Trans. Inf. Syst. (3) (2022)
Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. ESA (2022)
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
Reconfiguration of Regular Induced Subgraphs. WALCOM (2022)
Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. CoRR (2022)
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. CoRR (2022)
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
Reconfiguration of Regular Induced Subgraphs. CoRR (2021)
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
Finding Diverse Trees, Paths, and More. AAAI (2021)
Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi, Shinji Shimojo
How Do Avatar Appearances Affect Communication from Others? COMPSAC (2021)
Masataka Nakahara, Norihiro Okui, Yasuaki Kobayashi, Yutaka Miyake
Malware Detection for IoT Devices using Automatically Generated White List and Isolation Forest. IoTBDS (2021)
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CIAC (2021)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial-Delay Enumeration of Large Maximal Matchings. CoRR (2021)
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. Algorithmica 83 (5) (2021)
Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. Theor. Comput. Sci. 873 (2021)
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. CoRR (2021)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
Reconfiguring Directed Trees in a Digraph. CoRR (2021)
Yuto Nakano, Toru Nakamura, Yasuaki Kobayashi, Takashi Ozu, Masahito Ishizaka, Masayuki Hashimoto, Hiroyuki Yokoyama, Yutaka Miyake, Shinsaku Kiyomoto
Automatic Security Inspection Framework for Trustworthy Supply Chain. SERA (2021)
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. Theor. Comput. Sci. 865 (2021)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
Reconfiguring Directed Trees in a Digraph. COCOON (2021)
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CoRR (2021)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR (2020)
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. CoRR (2020)
Yasuaki Kobayashi, Yu Nakahata
A Note on Exponential-Time Algorithms for Linearwidth. CoRR (2020)
Kazuhiro Kurita, Yasuaki Kobayashi
Efficient Enumerations for Minimal Multicuts and Multiway Cuts. MFCS (2020)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA (2020)
Masataka Nakahara, Norihiro Okui, Yasuaki Kobayashi, Yutaka Miyake
Machine Learning based Malware Traffic Detection on IoT Devices using Summarized Packet Data. IoTBDS (2020)
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
Finding Diverse Trees, Paths, and More. CoRR (2020)
Yasuaki Kobayashi, Yota Otachi
Parameterized Complexity of Graph Burning. CoRR (2020)
Kazuhiro Kurita, Yasuaki Kobayashi
Efficient Enumerations for Minimal Multicuts and Multiway Cuts. CoRR (2020)
Yuto Nakano, Toru Nakamura, Yasuaki Kobayashi, Masahito Ishizaka, Masayuki Hashimoto, Hiroyuki Yokoyama, Yutaka Miyake, Shinsaku Kiyomoto
Consideration on Data Conformance Toward Building Trust in Supply Chain. EuCNC (2020)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints. CoRR (2020)
Yasuaki Kobayashi, Yota Otachi
Parameterized Complexity of Graph Burning. IPEC (2020)
Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi, Akihiro Yamamoto
Metric Learning for Ordered Labeled Trees with pq-grams. ECAI (2020)
Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. FAW (2020)
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability. CoRR (2020)
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. Algorithmica 82 (12) (2020)
Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi, Akihiro Yamamoto
Metric Learning for Ordered Labeled Trees with pq-grams. CoRR (2020)
Yasuaki Kobayashi
On Structural Parameterizations of Node Kayles. CoRR (2020)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial Delay Enumeration for Minimal Steiner Problems. CoRR (2020)
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. CoRR (2020)
Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
An optimal algorithm for Bisection for bounded-treewidth graphs. CoRR (2020)
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. IPEC (2019)
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. CoRR (2019)
Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto
Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem. COCOA (2019)
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. CoRR (2019)
Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto
Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem. CoRR (2019)
Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara
On the Complexity of Lattice Puzzles. ISAAC (2019)
Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki
An FPT Algorithm for Max-Cut Parameterized by Crossing Number. CoRR (2019)
Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. IWOCA (2019)
Yusuke Shido, Yasuaki Kobayashi, Akihiro Yamamoto, Atsushi Miyamoto, Tadayuki Matsumura
Automatic Source Code Summarization with Extended Tree-LSTM. CoRR (2019)
Yusuke Shido, Yasuaki Kobayashi, Akihiro Yamamoto, Atsushi Miyamoto, Tadayuki Matsumura
Automatic Source Code Summarization with Extended Tree-LSTM. IJCNN (2019)
Shinsaku Kiyomoto, Yuto Nakano, Atsushi Waseda, Toru Nakamura, Masahito Ishizaka, Yasuaki Kobayashi
A Framework for Secure and Trustworthy Data Management in Supply Chain. MobiWIS (2019)
Yasuaki Kobayashi
On Structural Parameterizations of Node Kayles. JCDCGGG (2018)
Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto
Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming. COCOA (2) (2017)
Yasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki
An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. IPEC (2017)
Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto
Improved Methods for Computing Distances between Unordered Trees Using Integer Programming. CoRR (2017)
Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
) Time. Algorithmica 75 (1) (2016)
Yasuaki Kobayashi, Hisao Tamaki
A faster fixed parameter algorithm for two-layer crossing minimization. Inf. Process. Lett. 116 (9) (2016)
Yasuaki Kobayashi, Hisao Tamaki
Treedepth Parameterized by Vertex Cover Number. IPEC (2016)
Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
On the Pathwidth of Almost Semicomplete Digraphs. ESA (2015)
Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
On the pathwidth of almost semicomplete digraphs. CoRR (2015)
Yasuaki Kobayashi
Computing the pathwidth of directed graphs with small vertex cover. Inf. Process. Lett. 115 (2) (2015)
Yasuaki Kobayashi, Hisao Tamaki
A faster fixed parameter algorithm for two-layer crossing minimization. CoRR (2015)
Yasuaki Kobayashi, Hisao Tamaki
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. Algorithmica 72 (3) (2015)

Yasuaki Kobayashi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yasuaki Kobayashi