| 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 | FCT | On the Complexity of Locally Rainbow Path. | Hiroshi Eto, Tesshu Hanaka, Eiji Miyano, Shuya Yoshida |
| 2025 | IWOCA | Covering Vertices by 4 | Mingyang Gong, Guangting Chen, Guohui Lin, Eiji Miyano, Abbinash Ranjitkar |
| 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 |
| 2024 | IWOCA | Directed Path Partition Problem on Directed Acyclic Graphs. | Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir |
| 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 | FCT | On Computing a Center Persistence Diagram. | Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu |
| 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 |
| 2022 | MFCS | Approximation Algorithms for Covering Vertices by Long Paths. | Mingyang Gong, Jing Fan, Guohui Lin, Eiji Miyano |
| 2022 | WALCOM | Happy Set Problem on Subclasses of Co-comparability Graphs. | Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura |
| 2022 | WALCOM | Path Cover Problems with Length Cost. | Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita |
| 2020 | COCOON | Graph Classes and Approximability of the Happy Set Problem. | Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru |
| 2020 | TAMC | Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles. | Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang |
| 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 |
| 2018 | WALCOM | Complexity of the Maximum k-Path Vertex Cover Problem. | Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden |
| 2017 | WALCOM | Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. | Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano |
| 2016 | COCOA | Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. | Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano |
| 2016 | FAW | A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan. | Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin |
| 2015 | COCOA | Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. | Yuichi Asahiro, Yuya Doi, Eiji Miyano, Hirotaka Shimizu |
| 2014 | AAIM | Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. | Daiki Hoshika, Eiji Miyano |
| 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 |
| 2012 | COCOA | Distance-d Independent Set Problems for Bipartite and Chordal Graphs. | Hiroshi Eto, Fengrui Guo, Eiji Miyano |
| 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 |
| 2007 | AAIM | Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
| 2007 | FUN | Drawing Borders Efficiently. | Kazuo Iwama, Eiji Miyano, Hirotaka Ono |
| 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 |
| 2000 | SPAA | A (2.954 epsilon)n oblivious routing algorithm on 2D meshes. | Kazuo Iwama, Eiji Miyano |
| 1999 | ESA | Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. | Kazuo Iwama, Eiji Miyano |
| 1999 | SODA | An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. | Kazuo Iwama, Eiji Miyano |
| 1998 | COCOON | Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. | Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki |
| 1998 | ESA | New Bounds for Oblivious Mesh Routing. | Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano |
| 1997 | ESA | Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing. | Kazuo Iwama, Eiji Miyano |
| 1992 | ISAAC | Routing Problems on the Mesh of Buses. | Kazuo Iwama, Eiji Miyano |