Yasuaki Kobayashi

According to our database, Yasuaki Kobayashi authored at least 73 papers between 1994 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Structural parameterizations of vertex integrity.

Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi

Theor. Comput. Sci., 2025

2024

Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited.

Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi

Algorithmica, November, 2024

Finding a Reconfiguration Sequence between Longest Increasing Subsequences.

Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi

IEICE Trans. Inf. Syst., 2024

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size.

Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa

CoRR, 2024

Parameterized Complexity of Finding Dissimilar Shortest Paths.

Ryo Funayama, Yasuaki Kobayashi, Takeaki Uno

CoRR, 2024

On the Complexity of List H-Packing for Sparse Graph Classes.

Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou

Proceedings of the WALCOM: Algorithms and Computation, 2024

Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints.

Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Basis Sequence Reconfiguration in the Union of Matroids.

Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Finding Diverse Strings and Longest Common Subsequences in a Graph.

Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover.

Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Malware detection for IoT devices using hybrid system of whitelist and machine learning based on lightweight flow data.

Masataka Nakahara, Norihiro Okui, Yasuaki Kobayashi, Yutaka Miyake, Ayumu Kubota

Enterp. Inf. Syst., September, 2023

Reconfiguring (non-spanning) arborescences.

Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa

Theor. Comput. Sci., 2023

Finding a Minimum Spanning Tree with a Small Non-Terminal Set.

Tesshu Hanaka, Yasuaki Kobayashi

CoRR, 2023

Minimum Consistent Subset for Trees Revisited.

Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi

CoRR, 2023

Reconfiguration of Time-Respecting Arborescences.

Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph.

Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue

Proceedings of the String Processing and Information Retrieval, 2023

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

A Process Reduction Method for Spatial Information in Real-Time AR Snow Visualization Systems.

Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi

Proceedings of the 47th IEEE Annual Computers, Software, and Applications Conference, 2023

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems.

Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Exploring the gap between treedepth and vertex cover through vertex integrity.

Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi

Theor. Comput. Sci., 2022

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion.

Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi

Theory Comput. Syst., 2022

An <i>O</i>(<i>n</i>²)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position.

Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka

IEICE Trans. Inf. Syst., 2022

Finding shortest non-separating and non-disconnecting paths.

Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi

CoRR, 2022

Parameterized Complexity of Graph Burning.

Yasuaki Kobayashi, Yota Otachi

Algorithmica, 2022

Parameterized Complexity of (A, ℓ )-Path Packing.

Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi

Algorithmica, 2022

Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Reconfiguration of Regular Induced Subgraphs.

Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa

Proceedings of the WALCOM: Algorithms and Computation, 2022

Linear-Delay Enumeration for Minimal Steiner Problems.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Independent Set Reconfiguration on Directed Graphs.

Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets.

Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Anomaly Traffic Detection with Federated Learning toward Network-based Malware Detection in IoT.

Takayuki Nishio, Masataka Nakahara, Norihiro Okui, Ayumu Kubota, Yasuaki Kobayashi, Keizo Sugiyama, Ryoichi Shinkuma

Proceedings of the IEEE Global Communications Conference, 2022

A Real-Time AR Visualization System of Snow-Covered Situations.

Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi

Proceedings of the 11th IEEE Global Conference on Consumer Electronics, 2022

Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study.

Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

A (probably) optimal algorithm for Bisection on bounded-treewidth graphs.

Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone

Theor. Comput. Sci., 2021

Finding a maximum minimal separator: Graph classes and fixed-parameter tractability.

Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita

Theor. Comput. Sci., 2021

Polynomial-Delay Enumeration of Large Maximal Matchings.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

CoRR, 2021

Computing the Largest Bond and the Maximum Connected Cut of a Graph.

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

Algorithmica, 2021

Automatic Security Inspection Framework for Trustworthy Supply Chain.

Yuto Nakano, Toru Nakamura, Yasuaki Kobayashi, Takashi Ozu, Masahito Ishizaka, Masayuki Hashimoto, Hiroyuki Yokoyama, Yutaka Miyake, Shinsaku Kiyomoto

Proceedings of the 19th IEEE/ACIS International Conference on Software Engineering Research, 2021

Malware Detection for IoT Devices using Automatically Generated White List and Isolation Forest.

Masataka Nakahara, Norihiro Okui, Yasuaki Kobayashi, Yutaka Miyake

Proceedings of the 6th International Conference on Internet of Things, 2021

How Do Avatar Appearances Affect Communication from Others?

Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi, Shinji Shimojo

Proceedings of the IEEE 45th Annual Computers, Software, and Applications Conference, 2021

Reconfiguring Directed Trees in a Digraph.

Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Finding Diverse Trees, Paths, and More.

Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Polynomial Delay Enumeration for Minimal Steiner Problems.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

CoRR, 2020

A Note on Exponential-Time Algorithms for Linearwidth.

Yasuaki Kobayashi, Yu Nakahata

CoRR, 2020

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

CoRR, 2020

An optimal algorithm for Bisection for bounded-treewidth graphs.

Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone

CoRR, 2020

Subgraph Isomorphism on Graph Classes that Exclude a Substructure.

Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden

Algorithmica, 2020

Efficient Enumerations for Minimal Multicuts and Multiway Cuts.

Kazuhiro Kurita, Yasuaki Kobayashi

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Machine Learning based Malware Traffic Detection on IoT Devices using Summarized Packet Data.

Masataka Nakahara, Norihiro Okui, Yasuaki Kobayashi, Yutaka Miyake

Proceedings of the 5th International Conference on Internet of Things, 2020

An Optimal Algorithm for Bisection for Bounded-Treewidth Graph.

Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone

Proceedings of the Frontiers in Algorithmics - 14th International Workshop, 2020

Consideration on Data Conformance Toward Building Trust in Supply Chain.

Yuto Nakano, Toru Nakamura, Yasuaki Kobayashi, Masahito Ishizaka, Masayuki Hashimoto, Hiroyuki Yokoyama, Yutaka Miyake, Shinsaku Kiyomoto

Proceedings of the 2020 European Conference on Networks and Communications, 2020

Metric Learning for Ordered Labeled Trees with pq-grams.

Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi, Akihiro Yamamoto

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019

An FPT Algorithm for Max-Cut Parameterized by Crossing Number.

Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki

CoRR, 2019

A Framework for Secure and Trustworthy Data Management in Supply Chain.

Shinsaku Kiyomoto, Yuto Nakano, Atsushi Waseda, Toru Nakamura, Masahito Ishizaka, Yasuaki Kobayashi

Proceedings of the Mobile Web and Intelligent Information Systems, 2019

Parameterized Algorithms for Maximum Cut with Connectivity Constraints.

Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number.

Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

On the Complexity of Lattice Puzzles.

Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Automatic Source Code Summarization with Extended Tree-LSTM.

Yusuke Shido, Yasuaki Kobayashi, Akihiro Yamamoto, Atsushi Miyamoto, Tadayuki Matsumura

Proceedings of the International Joint Conference on Neural Networks, 2019

Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem.

Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

On Structural Parameterizations of Node Kayles.

Yasuaki Kobayashi

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

2017

An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization.

Yasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming.

Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

A faster fixed parameter algorithm for two-layer crossing minimization.

Yasuaki Kobayashi, Hisao Tamaki

Inf. Process. Lett., 2016

Computing Directed Pathwidth in O(1.89ⁿ) Time.

Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano

Algorithmica, 2016

Treedepth Parameterized by Vertex Cover Number.

Yasuaki Kobayashi, Hisao Tamaki

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

Computing the pathwidth of directed graphs with small vertex cover.

Yasuaki Kobayashi

Inf. Process. Lett., 2015

A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization.

Yasuaki Kobayashi, Hisao Tamaki

Algorithmica, 2015

On the Pathwidth of Almost Semicomplete Digraphs.

Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki

Proceedings of the Algorithms - ESA 2015, 2015

2014

A linear edge kernel for two-layer crossing minimization.

Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki

Theor. Comput. Sci., 2014

Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study.

Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

2012

Computing Directed Pathwidth in O(1.89 n ) Time.

Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2010

<i>k</i>-cyclic Orientations of Graphs.

Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

1994

250 Mbyte/s synchronous DRAM using a 3-stage-pipelined architecture.

Yasuhiro Takai, Mamoru Nagase, Mamoru Kitamura, Yasuji Koshikawa, Naoyuki Yoshida, Yasuaki Kobayashi, Takashi Obara, Yukio Fukuzo, Hiroshi Watanabe

IEEE J. Solid State Circuits, April, 1994