| 2026 | ICCSA | (In)approximability of the Maximum 2-Clique Problem for Chordal Graphs. | Yuichi Asahiro, Eiji Miyano, Shunta Nakamura |
| 2025 | CIAC | Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs. | Yuichi Asahiro, Hiroshi Eto, Guohui Lin, Eiji Miyano, Yudai Oka |
| 2025 | SOFSEM | Shortest Longest-Path Graph Orientations for Trees. | Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Yoshichika Yano, Shay Zakov |
| 2025 | WABI | Approximability of Longest Run Subsequence and Complementary Minimization Problems. | Yuichi Asahiro, Mingyang Gong, Jesper Jansson, Guohui Lin, Sichen Lu, Eiji Miyano, Hirotaka Ono, Toshiki Saitoh, Shunichi Tanaka |
| 2023 | CIAC | Independent Set Under a Change Constraint from an Initial Solution. | Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue |
| 2023 | COCOON | Shortest Longest-Path Graph Orientations. | Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov |
| 2023 | CPM | Approximation Algorithms for the Longest Run Subsequence Problem. | Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka |
| 2023 | SIROCCO | Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract). | Yuichi Asahiro, Masafumi Yamashita |
| 2023 | SSS | Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract). | Yuichi Asahiro, Masafumi Yamashita |
| 2022 | CPM | Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. | Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima |
| 2020 | COCOON | Graph Classes and Approximability of the Happy Set Problem. | Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru |
| 2020 | WALCOM | Parameterized Algorithms for the Happy Set Problem. | Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru |
| 2019 | COCOA | Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. | Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima |
| 2019 | FAW | Graph Orientation with Edge Modifications. | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P. |
| 2018 | ICCSA | Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks. | Yuichi Asahiro, Eiji Miyano, Tsuyoshi Yagita |
| 2015 | COCOA | Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. | Yuichi Asahiro, Yuya Doi, Eiji Miyano, Hirotaka Shimizu |
| 2015 | ICCSA | An Improvement of the Greedy Algorithm for the (n^2-1) -Puzzle. | Kaede Utsunomiya, Yuichi Asahiro |
| 2013 | FCT | Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. | Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano |
| 2013 | WAOA | Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono |
| 2011 | COCOON | (1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. | Yuichi Asahiro, Kenta Kanmera, Eiji Miyano |
| 2010 | LATIN | Approximating Maximum Diameter-Bounded Subgraphs. | Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo |
| 2008 | OPODIS | A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. | Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita |
| 2007 | AAIM | Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
| 2007 | MFCS | On Approximation of Bookmark Assignments. | Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono |
| 2007 | SOFSEM | Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. | Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta |
| 2006 | CIAC | How to Pack Directed Acyclic Graphs into Small Blocks. | Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano |
| 2001 | ICRA | A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor. | Yuichi Asahiro, Eric Chung-Hui Chang, Amol Dattatraya Mali, Ichiro Suzuki, Masafumi Yamashita |
| 1995 | ISAAC | Finding Dense Subgraphs. | Yuichi Asahiro, Kazuo Iwama |