Yasuaki Kobayashi
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
43
Venues
22
Active years
2010–2026
Best venue rank
A*
Where they publish
Papers
43 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Finding One Local Optimum Is Easy - but What About Two? | Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi |
| 2026 | KR | SRIP: A SAT-based System for Independent Set Reconfiguration. | Takehide Soh, Akifumi Kuwahara, Mutsunori Banbara, Naoyuki Tamura, Yasuaki Kobayashi, Yuta Nozaki, Takehiro Ito |
| 2026 | WALCOM | Forcing a Unique Minimum Spanning Tree and a Unique Shortest Path. | Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Takumi Sato |
| 2026 | WALCOM | Finding Order-Preserving Subgraphs. | Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden |
| 2025 | GD | Structural Parameterizations of k-Planarity. | Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada |
| 2025 | MFCS | Broadcasting Under Structural Restrictions. | Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2024 | AAAI | 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 |
| 2024 | CPM | Finding Diverse Strings and Longest Common Subsequences in a Graph. | Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura |
| 2024 | ISAAC | Basis Sequence Reconfiguration in the Union of Matroids. | Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito |
| 2024 | IWOCA | Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. | Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono |
| 2024 | WALCOM | Structural Parameterizations of Vertex Integrity. | Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi |
| 2024 | WALCOM | 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 |
| 2023 | AAAI | 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 |
| 2023 | COMPSAC | A Process Reduction Method for Spatial Information in Real-Time AR Snow Visualization Systems. | Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi |
| 2023 | MFCS | Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. | Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 2023 | SPIRE | Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. | Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue |
| 2023 | WADS | Reconfiguration of Time-Respecting Arborescences. | Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki |
| 2022 | AAAI | Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. | Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi |
| 2022 | ESA | Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. | Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi |
| 2022 | GLOBECOM | 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 |
| 2022 | MFCS | 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 |
| 2022 | MFCS | Independent Set Reconfiguration on Directed Graphs. | Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa |
| 2022 | PODS | Linear-Delay Enumeration for Minimal Steiner Problems. | Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 2022 | WALCOM | Reconfiguration of Regular Induced Subgraphs. | Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa |
| 2022 | WG | Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. | Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 2021 | AAAI | Finding Diverse Trees, Paths, and More. | Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi |
| 2021 | CIAC | Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. | Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi |
| 2021 | COCOON | Reconfiguring Directed Trees in a Digraph. | Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa |
| 2021 | COMPSAC | How Do Avatar Appearances Affect Communication from Others? | Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi, Shinji Shimojo |
| 2021 | SERA | 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 |
| 2020 | ECAI | Metric Learning for Ordered Labeled Trees with pq-grams. | Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi, Akihiro Yamamoto |
| 2020 | FAW | An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. | Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone |
| 2020 | IWOCA | Parameterized Complexity of (A, ℓ )-Path Packing. | Rmy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2020 | MFCS | Efficient Enumerations for Minimal Multicuts and Multiway Cuts. | Kazuhiro Kurita, Yasuaki Kobayashi |
| 2019 | COCOA | Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem. | Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto |
| 2019 | IJCNN | Automatic Source Code Summarization with Extended Tree-LSTM. | Yusuke Shido, Yasuaki Kobayashi, Akihiro Yamamoto, Atsushi Miyamoto, Tadayuki Matsumura |
| 2019 | ISAAC | On the Complexity of Lattice Puzzles. | Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara |
| 2019 | IWOCA | An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. | Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki |
| 2017 | COCOA | Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming. | Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto |
| 2015 | ESA | On the Pathwidth of Almost Semicomplete Digraphs. | Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki |
| 2013 | COCOON | A Linear Edge Kernel for Two-Layer Crossing Minimization. | Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki |
| 2012 | ESA | A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. | Yasuaki Kobayashi, Hisao Tamaki |
| 2010 | ISAAC | Untitled record | Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki |