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, 1994)

k-cyclic Orientations of Graphs. - Yasuaki Kobayashi; Yuichiro Miyamoto; Hisao Tamaki (ISAAC (2), 2010)

Computing Directed Pathwidth in O(1.89 n ) Time. - Kenta Kitsunai; Yasuaki Kobayashi; Keita Komuro; Hisao Tamaki; Toshihiro Tano (IPEC, 2012)

Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study. - Yasuaki Kobayashi; Keita Komuro; Hisao Tamaki (SEA, 2014)

A linear edge kernel for two-layer crossing minimization. - Yasuaki Kobayashi; Hirokazu Maruta; Yusuke Nakae; Hisao Tamaki (Theor. Comput. Sci., 2014)

On the Pathwidth of Almost Semicomplete Digraphs. - Kenta Kitsunai; Yasuaki Kobayashi; Hisao Tamaki (ESA, 2015)

A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. - Yasuaki Kobayashi; Hisao Tamaki (Algorithmica, 2015)

Computing the pathwidth of directed graphs with small vertex cover. - Yasuaki Kobayashi (Inf. Process. Lett., 2015)

Treedepth Parameterized by Vertex Cover Number. - Yasuaki Kobayashi; Hisao Tamaki (IPEC, 2016)

Computing Directed Pathwidth in O(1.89n) Time. - Kenta Kitsunai; Yasuaki Kobayashi; Keita Komuro; Hisao Tamaki; Toshihiro Tano (Algorithmica, 2016)

A faster fixed parameter algorithm for two-layer crossing minimization. - Yasuaki Kobayashi; Hisao Tamaki (Inf. Process. Lett., 2016)

Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming. - Eunpyeong Hong; Yasuaki Kobayashi; Akihiro Yamamoto (COCOA (2), 2017)

An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. - Yasuaki Kobayashi; Hiromu Ohtsuka; Hisao Tamaki (IPEC, 2017)

On Structural Parameterizations of Node Kayles. - Yasuaki Kobayashi (JCDCGGG, 2018)

Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem. - Yasuaki Kobayashi; Kensuke Kojima; Norihide Matsubara; Taiga Sone; Akihiro Yamamoto (COCOA, 2019)

Automatic Source Code Summarization with Extended Tree-LSTM. - Yusuke Shido; Yasuaki Kobayashi; Akihiro Yamamoto; Atsushi Miyamoto; Tadayuki Matsumura (IJCNN, 2019)

On the Complexity of Lattice Puzzles. - Yasuaki Kobayashi; Koki Suetsugu; Hideki Tsuiki; Ryuhei Uehara (ISAAC, 2019)

An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. - Yasuaki Kobayashi; Yusuke Kobayashi 001; Shuichi Miyazaki; Suguru Tamaki (IWOCA, 2019)

Parameterized Algorithms for Maximum Cut with Connectivity Constraints. - Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001 (IPEC, 2019)

A Framework for Secure and Trustworthy Data Management in Supply Chain. - Shinsaku Kiyomoto; Yuto Nakano; Atsushi Waseda; Toru Nakamura; Masahito Ishizaka; Yasuaki Kobayashi (MobiWIS, 2019)

An FPT Algorithm for Max-Cut Parameterized by Crossing Number. - Yasuaki Kobayashi; Yusuke Kobayashi 001; Shuichi Miyazaki; Suguru Tamaki (CoRR, 2019)

Metric Learning for Ordered Labeled Trees with pq-grams. - Hikaru Shindo; Masaaki Nishino; Yasuaki Kobayashi; Akihiro Yamamoto (ECAI, 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 (EuCNC, 2020)

An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. - Tesshu Hanaka; Yasuaki Kobayashi; Taiga Sone (FAW, 2020)

Machine Learning based Malware Traffic Detection on IoT Devices using Summarized Packet Data. - Masataka Nakahara; Norihiro Okui; Yasuaki Kobayashi; Yutaka Miyake (IoTBDS, 2020)

Efficient Enumerations for Minimal Multicuts and Multiway Cuts. - Kazuhiro Kurita; Yasuaki Kobayashi (MFCS, 2020)

Subgraph Isomorphism on Graph Classes that Exclude a Substructure. - Hans L. Bodlaender; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Yoshio Okamoto; Yota Otachi; Tom C. van der Zanden (Algorithmica, 2020)

An optimal algorithm for Bisection for bounded-treewidth graphs. - Tesshu Hanaka; Yasuaki Kobayashi; Taiga Sone (CoRR, 2020)

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (CoRR, 2020)

A Note on Exponential-Time Algorithms for Linearwidth. - Yasuaki Kobayashi; Yu Nakahata (CoRR, 2020)

Polynomial Delay Enumeration for Minimal Steiner Problems. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (CoRR, 2020)

Finding Diverse Trees, Paths, and More. - Tesshu Hanaka; Yasuaki Kobayashi; Kazuhiro Kurita; Yota Otachi (AAAI, 2021)

Reconfiguring Directed Trees in a Digraph. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa (COCOON, 2021)

How Do Avatar Appearances Affect Communication from Others? - Yasuaki Kobayashi; Tomoya Kawakami; Satoru Matsumoto; Tomoki Yoshihisa; Yuuichi Teranishi; Shinji Shimojo (COMPSAC, 2021)

Malware Detection for IoT Devices using Automatically Generated White List and Isolation Forest. - Masataka Nakahara; Norihiro Okui; Yasuaki Kobayashi; Yutaka Miyake (IoTBDS, 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 (SERA, 2021)

Computing the Largest Bond and the Maximum Connected Cut of a Graph. - Gabriel L. Duarte; Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Daniel Lokshtanov; Lehilton L. C. Pedrosa; Rafael C. S. Schouery; Uéverton S. Souza (Algorithmica, 2021)

Polynomial-Delay Enumeration of Large Maximal Matchings. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (CoRR, 2021)

Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. - Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Tsuyoshi Yagita (Theor. Comput. Sci., 2021)

A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. - Tesshu Hanaka; Yasuaki Kobayashi; Taiga Sone (Theor. Comput. Sci., 2021)

Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. - Tesshu Hanaka; Yasuaki Kobayashi; Kazuhiro Kurita; See Woo Lee; Yota Otachi (AAAI, 2022)

A Real-Time AR Visualization System of Snow-Covered Situations. - Yasuaki Kobayashi; Tomoya Kawakami; Satoru Matsumoto; Tomoki Yoshihisa; Yuuichi Teranishi (GCCE, 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 (GLOBECOM, 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 001 (MFCS, 2022)

Independent Set Reconfiguration on Directed Graphs. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Masahiro Takahashi; Kunihiro Wasa (MFCS, 2022)

Linear-Delay Enumeration for Minimal Steiner Problems. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (PODS, 2022)

Reconfiguration of Regular Induced Subgraphs. - Hiroshi Eto; Takehiro Ito; Yasuaki Kobayashi; Yota Otachi; Kunihiro Wasa (WALCOM, 2022)

Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (WG, 2022)

Parameterized Complexity of (A, ℓ )-Path Packing. - Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2022)

Parameterized Complexity of Graph Burning. - Yasuaki Kobayashi; Yota Otachi (Algorithmica, 2022)

Finding shortest non-separating and non-disconnecting paths. - Yasuaki Kobayashi; Shunsuke Nagano; Yota Otachi (CoRR, 2022)

An O(n2)-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 001; Katsuhisa Yamanaka (IEICE Trans. Inf. Syst., 2022)

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. - Yuuki Aoike; Tatsuya Gima; Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Kazuhiro Kurita; Yota Otachi (Theory Comput. Syst., 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)

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. - Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Kazuhiro Kurita; Yota Otachi (AAAI, 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 (COMPSAC, 2023)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (MFCS, 2023)

Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. - Hiroki Arimura; Shunsuke Inenaga; Yasuaki Kobayashi; Yuto Nakashima 001; Mizuki Sue (SPIRE, 2023)

Reconfiguration of Time-Respecting Arborescences. - Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi; Yusuke Kobayashi 001; Shun-ichi Maezawa; Akira Suzuki 001 (WADS, 2023)

Minimum Consistent Subset for Trees Revisited. - Hiroki Arimura; Tatsuya Gima; Yasuaki Kobayashi; Hiroomi Nochide; Yota Otachi (CoRR, 2023)

Reconfiguring (non-spanning) arborescences. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa (Theor. Comput. Sci., 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., 2023)

Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. - Takashi Horiyama; Yasuaki Kobayashi; Hirotaka Ono 001; Kazuhisa Seto; Ryu Suzuki (AAAI, 2024)

Finding Diverse Strings and Longest Common Subsequences in a Graph. - Yuto Shida; Giulia Punzi; Yasuaki Kobayashi; Takeaki Uno; Hiroki Arimura (CPM, 2024)

Basis Sequence Reconfiguration in the Union of Matroids. - Tesshu Hanaka; Yuni Iwamasa; Yasuaki Kobayashi; Yuto Okada; Rin Saito (ISAAC, 2024)

Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. - Yasuaki Kobayashi; Kazuhiro Kurita; Yasuko Matsui; Hirotaka Ono 001 (IWOCA, 2024)

Parameterized Complexity of Finding Dissimilar Shortest Paths. - Ryo Funayama; Yasuaki Kobayashi; Takeaki Uno (CoRR, 2024)

Computing diverse pair of solutions for tractable SAT. - Tatsuya Gima; Yuni Iwamasa; Yasuaki Kobayashi; Kazuhiro Kurita; Yota Otachi; Rin Saito (CoRR, 2024)

Recognizing 2-Layer and Outer k-Planar Graphs. - Yasuaki Kobayashi; Yuto Okada; Alexander Wolff 001 (CoRR, 2024)

On the complexity of finding a spanning even tree in a graph. - Tesshu Hanaka; Yasuaki Kobayashi; Kazuhiro Kurita; Yasuko Matsui; Atsuki Nagao; Hirotaka Ono 001; Kazuhisa Seto (CoRR, 2024)

Finding a Reconfiguration Sequence between Longest Increasing Subsequences. - Yuuki Aoike; Masashi Kiyomi; Yasuaki Kobayashi; Yota Otachi (IEICE Trans. Inf. Syst., 2024)

Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. - Tatsuya Gima; Takehiro Ito; Yasuaki Kobayashi; Yota Otachi (Algorithmica, 2024)

Enumeration of Ordered Trees with Leaf Restrictions. - Yasuaki Kobayashi; Dominik Köppl; Yasuko Matsui; Hirotaka Ono 001; Toshiki Saitoh; Yushi Uno (From Strings to Graphs, and Back Again, 2025)

WIP: Cyber Security Measurement Taking Physical Circumstances. - Masataka Nakahara; Keizo Sugiyama; Norihiro Okui; Yasuaki Kobayashi; Ayumu Kubota; Shinsaku Kiyomoto (CCNC, 2025)

Recognizing 2-Layer and Outer k-Planar Graphs. - Yasuaki Kobayashi; Yuto Okada; Alexander Wolff 001 (SoCG, 2025)

Broadcasting Under Structural Restrictions. - Yudai Egami; Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Michael Lampis; Valia Mitsou; Edouard Nemery; Yota Otachi; Manolis Vasilakis; Daniel Vaz 001 (MFCS, 2025)

Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (Discret. Appl. Math., 2025)

Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (Inf. Comput., 2025)

Data Acquisition Framework for Micromobility Vehicles Toward Driving Risk Prediction Against Cyberphysical Security Attack. - Shunsuke Sato; Ryoichi Shinkuma; Kensei Hirai; Masataka Nakahara; Norihiro Okui; Ayumu Kubota; Yasuaki Kobayashi; Keizo Sugiyama; Takayuki Nishio (IEEE Secur. Priv., 2025)

Structural parameterizations of vertex integrity. - Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Ryota Murai; Hirotaka Ono 001; Yota Otachi (Theor. Comput. Sci., 2025)

On the complexity of list H-packing for sparse graph classes. - Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Yota Otachi; Tomohito Shirai; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (Theor. Comput. Sci., 2025)

Finding a minimum spanning tree with a small non-terminal set. - Tesshu Hanaka; Yasuaki Kobayashi (Theor. Comput. Sci., 2025)

The Complexity of Maximal Common Subsequence Enumeration. - Giovanni Buzzega; Alessio Conte; Yasuaki Kobayashi; Kazuhiro Kurita; Giulia Punzi (Proc. ACM Manag. Data, 2025)

Structural Parameterizations of k-Planarity. - Tatsuya Gima; Yasuaki Kobayashi; Yuto Okada (CoRR, 2025)

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs. - Alexander Grigoriev; Yasuaki Kobayashi; Hisao Tamaki; Tom C. van der Zanden (CoRR, 2025)

Finding One Local Optimum Is Easy - But What about Two? - Yasuaki Kobayashi; Kazuhiro Kurita; Yutaro Yamaguchi 001 (CoRR, 2025)

Finding Order-Preserving Subgraphs. - Haruya Imamura; Yasuaki Kobayashi; Yota Otachi; Toshiki Saitoh; Keita Sato; Asahi Takaoka; Ryo Yoshinaka; Tom C. van der Zanden (CoRR, 2025)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. - Alessio Conte; Roberto Grossi; Yasuaki Kobayashi; Kazuhiro Kurita; Davide Rucci; Takeaki Uno; Kunihiro Wasa (Algorithmica, 2025)