Yasuaki Kobayashi

145 papers A* 7A 5B 27C 9Misc 3Journal 86Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Digital Twin-Based Security Function in the Space Domain. CCNC Masataka Nakahara, Keizo Sugiyama, Yasuaki Kobayashi, Ayumu Kubota
2026	A*	`conf`	Finding One Local Optimum Is Easy - but What About Two? AAAI Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi
2026	B	`conf`	Finding Order-Preserving Subgraphs. WALCOM Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden
2026	B	`conf`	Forcing a Unique Minimum Spanning Tree and a Unique Shortest Path. WALCOM Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Takumi Sato
2026	J	`jnl`	Independent Set Reconfiguration on Directed Graphs. SIAM J. Discret. Math. Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2026	J	`jnl`	Reconfiguration of Time-Respecting Arborescences. Algorithmica Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2025	J	`jnl`	2-Layer Fan-Planarity in Polynomial Time. CoRR Yasuaki Kobayashi, Yuto Okada
2025	B	`conf`	A Polynomial Delay Algorithm Generating All Potential Maximal Cliques in Triconnected Planar Graphs. IPEC Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki, Tom C. van der Zanden
2025	J	`jnl`	A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs. CoRR Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki, Tom C. van der Zanden
2025	B	`conf`	Broadcasting Under Structural Restrictions. MFCS Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025	J	`jnl`	Broadcasting under Structural Restrictions. CoRR Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025	J	`jnl`	Data Acquisition Framework for Micromobility Vehicles Toward Driving Risk Prediction Against Cyberphysical Security Attack. IEEE Secur. Priv. Shunsuke Sato, Ryoichi Shinkuma, Kensei Hirai, Masataka Nakahara, Norihiro Okui, Ayumu Kubota, Yasuaki Kobayashi, Keizo Sugiyama, Takayuki Nishio
2025	J	`jnl`	Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints. Discret. Appl. Math. Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2025	J	`jnl`	Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. Algorithmica Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
2025	J	`jnl`	Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. Algorithms Yasuaki Kobayashi, Kazuhiro Kurita, Kevin Mann, Yasuko Matsui, Hirotaka Ono
2025	—	`conf`	Enumeration of Ordered Trees with Leaf Restrictions. From Strings to Graphs, and Back Again Yasuaki Kobayashi, Dominik Köppl, Yasuko Matsui, Hirotaka Ono, Toshiki Saitoh, Yushi Uno
2025	J	`jnl`	Finding One Local Optimum Is Easy - But What about Two? CoRR Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi
2025	J	`jnl`	Finding Order-Preserving Subgraphs. CoRR Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden
2025	J	`jnl`	Finding a minimum spanning tree with a small non-terminal set. Theor. Comput. Sci. Tesshu Hanaka, Yasuaki Kobayashi
2025	J	`jnl`	Forcing a unique minimum spanning tree and a unique shortest path. CoRR Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Takumi Sato
2025	B	`conf`	Hitting Geodesic Intervals in Structurally Restricted Graphs. IPEC Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada, Yota Otachi, Hayato Takaike
2025	J	`jnl`	Hitting Geodesic Intervals in Structurally Restricted Graphs. CoRR Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada, Yota Otachi, Hayato Takaike
2025	J	`jnl`	On the complexity of list H-packing for sparse graph classes. Theor. Comput. Sci. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
2025	J	`jnl`	Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond. Inf. Comput. Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2025	A*	`conf`	Recognizing 2-Layer and Outer k-Planar Graphs. SoCG Yasuaki Kobayashi, Yuto Okada, Alexander Wolff
2025	J	`jnl`	Structural Parameterizations of CoRR Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada
2025	A	`conf`	Structural Parameterizations of k-Planarity. GD Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada
2025	J	`jnl`	Structural parameterizations of vertex integrity. Theor. Comput. Sci. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
2025	J	`jnl`	The Complexity of Maximal Common Subsequence Enumeration. CoRR Giovanni Buzzega, Alessio Conte, Yasuaki Kobayashi, Kazuhiro Kurita, Giulia Punzi
2025	J	`jnl`	The Complexity of Maximal Common Subsequence Enumeration. Proc. ACM Manag. Data Giovanni Buzzega, Alessio Conte, Yasuaki Kobayashi, Kazuhiro Kurita, Giulia Punzi
2025	—	`conf`	WIP: Cyber Security Measurement Taking Physical Circumstances. CCNC Masataka Nakahara, Keizo Sugiyama, Norihiro Okui, Yasuaki Kobayashi, Ayumu Kubota, Shinsaku Kiyomoto
2024	J	`jnl`	Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. Algorithmica Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
2024	B	`conf`	Basis Sequence Reconfiguration in the Union of Matroids. ISAAC Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito
2024	J	`jnl`	Basis sequence reconfiguration in the union of matroids. CoRR Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito
2024	J	`jnl`	Computing diverse pair of solutions for tractable SAT. CoRR Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi, Rin Saito
2024	J	`jnl`	Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
2024	C	`conf`	Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. IWOCA Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
2024	B	`conf`	Finding Diverse Strings and Longest Common Subsequences in a Graph. CPM Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
2024	J	`jnl`	Finding Diverse Strings and Longest Common Subsequences in a Graph. CoRR Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura
2024	J	`jnl`	Finding a Reconfiguration Sequence between Longest Increasing Subsequences. IEICE Trans. Inf. Syst. Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2024	B	`conf`	On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
2024	J	`jnl`	On the complexity of finding a spanning even tree in a graph. CoRR Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Atsuki Nagao, Hirotaka Ono, Kazuhisa Seto
2024	J	`jnl`	Parameterized Complexity of Finding Dissimilar Shortest Paths. CoRR Ryo Funayama, Yasuaki Kobayashi, Takeaki Uno
2024	J	`jnl`	Recognizing 2-Layer and Outer CoRR Yasuaki Kobayashi, Yuto Okada, Alexander Wolff
2024	B	`conf`	Structural Parameterizations of Vertex Integrity. WALCOM Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
2024	A*	`conf`	Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. AAAI Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
2023	A*	`conf`	A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. AAAI Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2023	B	`conf`	A Process Reduction Method for Spatial Information in Real-Time AR Snow Visualization Systems. COMPSAC Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi
2023	J	`jnl`	Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints. CoRR Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
2023	J	`jnl`	Finding a Minimum Spanning Tree with a Small Non-Terminal Set. CoRR Tesshu Hanaka, Yasuaki Kobayashi
2023	J	`jnl`	Finding a reconfiguration sequence between longest increasing subsequences. CoRR Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2023	J	`jnl`	Malware detection for IoT devices using hybrid system of whitelist and machine learning based on lightweight flow data. Enterp. Inf. Syst. Masataka Nakahara, Norihiro Okui, Yasuaki Kobayashi, Yutaka Miyake, Ayumu Kubota
2023	J	`jnl`	Minimum Consistent Subset for Trees Revisited. CoRR Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi
2023	J	`jnl`	On the complexity of list H-packing for sparse graph classes. CoRR Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
2023	C	`conf`	Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. SPIRE Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
2023	J	`jnl`	Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. CoRR Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
2023	B	`conf`	Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. MFCS Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2023	J	`jnl`	Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. CoRR Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2023	B	`conf`	Reconfiguration of Time-Respecting Arborescences. WADS Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2023	J	`jnl`	Reconfiguration of Time-Respecting Arborescences. CoRR Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2023	J	`jnl`	Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2023	J	`jnl`	Structural Parameterizations of Vertex Integrity. CoRR Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
2023	J	`jnl`	Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. CoRR Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
2022	J	`jnl`	A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. CoRR Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2022	—	`conf`	A Real-Time AR Visualization System of Snow-Covered Situations. GCCE Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi
2022	A	`conf`	Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. ESA Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
2022	J	`jnl`	Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. CoRR Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
2022	J	`jnl`	An IEICE Trans. Inf. Syst. Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
2022	J	`jnl`	An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Theory Comput. Syst. Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2022	B	`conf`	Anomaly Traffic Detection with Federated Learning toward Network-based Malware Detection in IoT. GLOBECOM Takayuki Nishio, Masataka Nakahara, Norihiro Okui, Ayumu Kubota, Yasuaki Kobayashi, Keizo Sugiyama, Ryoichi Shinkuma
2022	A*	`conf`	Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. AAAI Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
2022	J	`jnl`	Exploring the gap between treedepth and vertex cover through vertex integrity. Theor. Comput. Sci. Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2022	J	`jnl`	Finding shortest non-separating and non-disconnecting paths. CoRR Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi
2022	B	`conf`	Independent Set Reconfiguration on Directed Graphs. MFCS Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2022	J	`jnl`	Independent set reconfiguration on directed graphs. CoRR Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2022	A*	`conf`	Linear-Delay Enumeration for Minimal Steiner Problems. PODS Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2022	J	`jnl`	Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2022	J	`jnl`	Parameterized Complexity of Graph Burning. Algorithmica Yasuaki Kobayashi, Yota Otachi
2022	B	`conf`	Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. MFCS Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
2022	B	`conf`	Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. WG Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2022	B	`conf`	Reconfiguration of Regular Induced Subgraphs. WALCOM Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
2021	J	`jnl`	A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. Theor. Comput. Sci. Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
2021	C	`conf`	Automatic Security Inspection Framework for Trustworthy Supply Chain. SERA Yuto Nakano, Toru Nakamura, Yasuaki Kobayashi, Takashi Ozu, Masahito Ishizaka, Masayuki Hashimoto, Hiroyuki Yokoyama, Yutaka Miyake, Shinsaku Kiyomoto
2021	J	`jnl`	Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. CoRR Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
2021	J	`jnl`	Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 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
2021	C	`conf`	Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CIAC Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2021	J	`jnl`	Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CoRR Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2021	A*	`conf`	Finding Diverse Trees, Paths, and More. AAAI Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
2021	J	`jnl`	Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. Theor. Comput. Sci. Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
2021	B	`conf`	How Do Avatar Appearances Affect Communication from Others? COMPSAC Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi, Shinji Shimojo
2021	C	`conf`	Malware Detection for IoT Devices using Automatically Generated White List and Isolation Forest. IoTBDS Masataka Nakahara, Norihiro Okui, Yasuaki Kobayashi, Yutaka Miyake
2021	J	`jnl`	Polynomial-Delay Enumeration of Large Maximal Matchings. CoRR Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2021	J	`jnl`	Reconfiguration of Regular Induced Subgraphs. CoRR Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
2021	Misc	`conf`	Reconfiguring Directed Trees in a Digraph. COCOON Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2021	J	`jnl`	Reconfiguring Directed Trees in a Digraph. CoRR Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2020	J	`jnl`	A Note on Exponential-Time Algorithms for Linearwidth. CoRR Yasuaki Kobayashi, Yu Nakahata
2020	J	`jnl`	An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. CoRR Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2020	Misc	`conf`	An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. FAW Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
2020	J	`jnl`	An optimal algorithm for Bisection for bounded-treewidth graphs. CoRR Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
2020	J	`jnl`	Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR 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
2020	—	`conf`	Consideration on Data Conformance Toward Building Trust in Supply Chain. EuCNC Yuto Nakano, Toru Nakamura, Yasuaki Kobayashi, Masahito Ishizaka, Masayuki Hashimoto, Hiroyuki Yokoyama, Yutaka Miyake, Shinsaku Kiyomoto
2020	J	`jnl`	Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints. CoRR Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2020	B	`conf`	Efficient Enumerations for Minimal Multicuts and Multiway Cuts. MFCS Kazuhiro Kurita, Yasuaki Kobayashi
2020	J	`jnl`	Efficient Enumerations for Minimal Multicuts and Multiway Cuts. CoRR Kazuhiro Kurita, Yasuaki Kobayashi
2020	J	`jnl`	Finding Diverse Trees, Paths, and More. CoRR Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
2020	J	`jnl`	Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability. CoRR Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
2020	C	`conf`	Machine Learning based Malware Traffic Detection on IoT Devices using Summarized Packet Data. IoTBDS Masataka Nakahara, Norihiro Okui, Yasuaki Kobayashi, Yutaka Miyake
2020	A	`conf`	Metric Learning for Ordered Labeled Trees with pq-grams. ECAI Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi, Akihiro Yamamoto
2020	J	`jnl`	Metric Learning for Ordered Labeled Trees with pq-grams. CoRR Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi, Akihiro Yamamoto
2020	J	`jnl`	On Structural Parameterizations of Node Kayles. CoRR Yasuaki Kobayashi
2020	C	`conf`	Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2020	J	`jnl`	Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2020	B	`conf`	Parameterized Complexity of Graph Burning. IPEC Yasuaki Kobayashi, Yota Otachi
2020	J	`jnl`	Parameterized Complexity of Graph Burning. CoRR Yasuaki Kobayashi, Yota Otachi
2020	J	`jnl`	Polynomial Delay Enumeration for Minimal Steiner Problems. CoRR Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2020	J	`jnl`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019	—	`conf`	A Framework for Secure and Trustworthy Data Management in Supply Chain. MobiWIS Shinsaku Kiyomoto, Yuto Nakano, Atsushi Waseda, Toru Nakamura, Masahito Ishizaka, Yasuaki Kobayashi
2019	C	`conf`	Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem. COCOA Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto
2019	J	`jnl`	Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem. CoRR Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto
2019	J	`jnl`	An FPT Algorithm for Max-Cut Parameterized by Crossing Number. CoRR Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki
2019	C	`conf`	An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. IWOCA Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki
2019	B	`conf`	Automatic Source Code Summarization with Extended Tree-LSTM. IJCNN Yusuke Shido, Yasuaki Kobayashi, Akihiro Yamamoto, Atsushi Miyamoto, Tadayuki Matsumura
2019	J	`jnl`	Automatic Source Code Summarization with Extended Tree-LSTM. CoRR Yusuke Shido, Yasuaki Kobayashi, Akihiro Yamamoto, Atsushi Miyamoto, Tadayuki Matsumura
2019	B	`conf`	On the Complexity of Lattice Puzzles. ISAAC Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara
2019	B	`conf`	Parameterized Algorithms for Maximum Cut with Connectivity Constraints. IPEC Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
2019	J	`jnl`	Parameterized Algorithms for Maximum Cut with Connectivity Constraints. CoRR Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
2019	J	`jnl`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CoRR Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2018	—	`conf`	On Structural Parameterizations of Node Kayles. JCDCGGG Yasuaki Kobayashi
2017	B	`conf`	An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. IPEC Yasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki
2017	—	`conf`	Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming. COCOA (2) Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto
2017	J	`jnl`	Improved Methods for Computing Distances between Unordered Trees Using Integer Programming. CoRR Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto
2016	J	`jnl`	A faster fixed parameter algorithm for two-layer crossing minimization. Inf. Process. Lett. Yasuaki Kobayashi, Hisao Tamaki
2016	J	`jnl`	Computing Directed Pathwidth in O(1.89 Algorithmica Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
2016	B	`conf`	Treedepth Parameterized by Vertex Cover Number. IPEC Yasuaki Kobayashi, Hisao Tamaki
2015	J	`jnl`	A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. Algorithmica Yasuaki Kobayashi, Hisao Tamaki
2015	J	`jnl`	A faster fixed parameter algorithm for two-layer crossing minimization. CoRR Yasuaki Kobayashi, Hisao Tamaki
2015	J	`jnl`	Computing the pathwidth of directed graphs with small vertex cover. Inf. Process. Lett. Yasuaki Kobayashi
2015	A	`conf`	On the Pathwidth of Almost Semicomplete Digraphs. ESA Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
2015	J	`jnl`	On the pathwidth of almost semicomplete digraphs. CoRR Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
2014	J	`jnl`	A linear edge kernel for two-layer crossing minimization. Theor. Comput. Sci. Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki
2014	B	`conf`	Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study. SEA Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki
2013	Misc	`conf`	A Linear Edge Kernel for Two-Layer Crossing Minimization. COCOON Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki
2012	A	`conf`	A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. ESA Yasuaki Kobayashi, Hisao Tamaki
2012	B	`conf`	Computing Directed Pathwidth in O(1.89 n ) Time. IPEC Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
1994	J	`jnl`	250 Mbyte/s synchronous DRAM using a 3-stage-pipelined architecture. IEEE J. Solid State Circuits Yasuhiro Takai, Mamoru Nagase, Mamoru Kitamura, Yasuji Koshikawa, Naoyuki Yoshida, Yasuaki Kobayashi, Takashi Obara, Yukio Fukuzo, Hiroshi Watanabe