Random generation of test instances with controlled attributes. - Yuichi Asahiro; Kazuo Iwama; Eiji Miyano (Cliques, Coloring, and Satisfiability, 1993)

Finding Dense Subgraphs. - Yuichi Asahiro; Kazuo Iwama (ISAAC, 1995)

Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time. - Yuichi Asahiro; Hajime Asama; Satoshi Fujita; Ichiro Suzuki; Masafumi Yamashita (Sensor Based Intelligent Robots, 1998)

Distributed Motion Generation for Two Omni-Directional Robots Carrying Ladder. - Yuichi Asahiro; Eric Chung-Hui Chang; Amol Dattatraya Mali; Syunsuke Nagafuji; Ichiro Suzuki; Masafumi Yamashita (DARS, 2000)

Greedily Finding a Dense Subgraph. - Yuichi Asahiro; Kazuo Iwama; Hisao Tamaki; Takeshi Tokuyama (J. Algorithms, 2000)

A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor. - Yuichi Asahiro; Eric Chung-Hui Chang; Amol Dattatraya Mali; Ichiro Suzuki; Masafumi Yamashita (ICRA, 2001)

Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order. - Limin Xiang; Kazuo Ushijima; Yuichi Asahiro (ITCC, 2002)

Complexity of finding dense subgraphs. - Yuichi Asahiro; Refael Hassin; Kazuo Iwama (Discret. Appl. Math., 2002)

Independentand cooperative parallel search methods for the generalized assignment problem. - Yuichi Asahiro; Masahiro Ishibashi; Masafumi Yamashita (Optim. Methods Softw., 2003)

Pickup and Delivery for Moving Objects on Broken Lines. - Yuichi Asahiro; Eiji Miyano; Shinichi Shimoirisa (ICTCS, 2005)

How to Pack Directed Acyclic Graphs into Small Blocks. - Yuichi Asahiro; Tetsuya Furukawa; Keiichi Ikegami; Eiji Miyano (CIAC, 2006)

How to collect balls moving in the Euclidean plane. - Yuichi Asahiro; Takashi Horiyama; Kazuhisa Makino; Hirotaka Ono 001; Toshinori Sakuma; Masafumi Yamashita (Discret. Appl. Math., 2006)

On Approximation of Bookmark Assignments. - Yuichi Asahiro; Eiji Miyano; Toshihide Murata; Hirotaka Ono 001 (MFCS, 2007)

Graph Orientation Algorithms to minimize the Maximum Outdegree. - Yuichi Asahiro; Eiji Miyano; Hirotaka Ono 001; Kouhei Zenmyo (Int. J. Found. Comput. Sci., 2007)

A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. - Yuichi Asahiro; Satoshi Fujita; Ichiro Suzuki; Masafumi Yamashita (OPODIS, 2008)

Grasp and Delivery for Moving Objects on Broken Lines. - Yuichi Asahiro; Eiji Miyano; Shinichi Shimoirisa (Theory Comput. Syst., 2008)

Approximating Maximum Diameter-Bounded Subgraphs. - Yuichi Asahiro; Eiji Miyano; Kazuaki Samizo (LATIN, 2010)

Weighted nearest neighbor algorithms for the graph exploration problem on cycles. - Yuichi Asahiro; Eiji Miyano; Shuichi Miyazaki; Takuro Yoshimuta (Inf. Process. Lett., 2010)

Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. - Yuichi Asahiro; Eiji Miyano; Hirotaka Ono 001 (Discret. Appl. Math., 2011)

Graph Orientation to Maximize the Minimum Weighted Outdegree. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Int. J. Found. Comput. Sci., 2011)

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001; Kouhei Zenmyo (J. Comb. Optim., 2011)

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (CATS, 2012)

NP-hardness of the sorting buffer problem on the uniform metric. - Yuichi Asahiro; Kenichi Kawahara; Eiji Miyano (Discret. Appl. Math., 2012)

Optimal approximability of bookmark assignments. - Yuichi Asahiro; Eiji Miyano; Toshihide Murata; Hirotaka Ono 001 (Discret. Appl. Math., 2013)

Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems. - Yuichi Asahiro; Hiroshi Eto; Eiji Miyano (IEICE Trans. Inf. Syst., 2013)

(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation. - Yuichi Asahiro; Kenta Kanmera; Eiji Miyano (J. Comb. Optim., 2013)

Complexity of finding maximum regular induced subgraphs with prescribed degree. - Yuichi Asahiro; Hiroshi Eto; Takehiro Ito; Eiji Miyano (Theor. Comput. Sci., 2014)

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. - Yuichi Asahiro; Yuya Doi; Eiji Miyano; Hirotaka Shimizu (COCOA, 2015)

An Improvement of the Greedy Algorithm for the (n^2-1) -Puzzle. - Kaede Utsunomiya; Yuichi Asahiro (ICCSA (2), 2015)

Graph Orientations Optimizing the Number of Light or Heavy Vertices. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (J. Graph Algorithms Appl., 2015)

Experimental Evaluation of Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. - Yuichi Asahiro; Tomohiro Kubo; Eiji Miyano (SCIS&ISIS, 2016)

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Theory Comput. Syst., 2016)

Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks. - Yuichi Asahiro; Eiji Miyano; Tsuyoshi Yagita (ICCSA (2), 2018)

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. - Yuichi Asahiro; Yuya Doi; Eiji Miyano; Kazuaki Samizo; Hirotaka Shimizu (Algorithmica, 2018)

Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (COCOA, 2019)

Graph Orientation with Edge Modifications. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001; Sandhya T. P. 001 (FAW, 2019)

An Approximation Algorithm for the Maximum Induced Matching Problem on C5-Free Regular Graphs. - Yuichi Asahiro; Guohui Lin; Zhilong Liu; Eiji Miyano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems. - Yuichi Asahiro; Tomohiro Kubo; Eiji Miyano (Rev. Socionetwork Strateg., 2019)

Graph Classes and Approximability of the Happy Set Problem. - Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru (COCOON, 2020)

Exact algorithms for the repetition-bounded longest common subsequence problem. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (Theor. Comput. Sci., 2020)

Graph orientation with splits. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hesam Nikpey; Hirotaka Ono 001 (Theor. Comput. Sci., 2020)

Parameterized algorithms for the Happy Set problem. - Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru (Discret. Appl. Math., 2021)

How to pack directed acyclic graphs into small blocks. - Yuichi Asahiro; Tetsuya Furukawa; Keiichi Ikegami; Eiji Miyano; Tsuyoshi Yagita (Discret. Appl. Math., 2021)

Graph Orientation with Edge Modifications. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Int. J. Found. Comput. Sci., 2021)

Complexity and approximability of the happy set problem. - Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru (Theor. Comput. Sci., 2021)

Upper and lower degree-constrained graph orientation with minimum penalty. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Theor. Comput. Sci., 2022)

Monotonic self-stabilization and its application to robust and adaptive pattern formation. - Yuichi Asahiro; Ichiro Suzuki; Masafumi Yamashita (Theor. Comput. Sci., 2022)

Independent Set Under a Change Constraint from an Initial Solution. - Yuichi Asahiro; Hiroshi Eto; Kana Korenaga; Guohui Lin; Eiji Miyano; Reo Nonoue (CIAC, 2023)

Shortest Longest-Path Graph Orientations. - Yuichi Asahiro; Jesper Jansson 001; Avraham A. Melkman; Eiji Miyano; Hirotaka Ono 001; Quan Xue; Shay Zakov (COCOON (1), 2023)

Approximation Algorithms for the Longest Run Subsequence Problem. - Yuichi Asahiro; Hiroshi Eto; Mingyang Gong; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Shunichi Tanaka (CPM, 2023)

Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract). - Yuichi Asahiro; Masafumi Yamashita (SIROCCO, 2023)

Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract). - Yuichi Asahiro; Masafumi Yamashita (SSS, 2023)

Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots. - Yuichi Asahiro; Masafumi Yamashita (CoRR, 2023)

Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]. - Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru (Theor. Comput. Sci., 2023)

Polynomial-time equivalences and refined algorithms for longest common subsequence variants. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (Discret. Appl. Math., 2024)

Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs. - Yuichi Asahiro; Hiroshi Eto; Guohui Lin; Eiji Miyano; Yudai Oka (CIAC (2), 2025)

Shortest Longest-Path Graph Orientations for Trees. - Yuichi Asahiro; Jesper Jansson 001; Avraham A. Melkman; Eiji Miyano; Hirotaka Ono 001; Quan Xue; Yoshichika Yano; Shay Zakov (SOFSEM (1), 2025)

Approximability of Longest Run Subsequence and Complementary Minimization Problems. - Yuichi Asahiro; Mingyang Gong; Jesper Jansson 001; Guohui Lin; Sichen Lu; Eiji Miyano; Hirotaka Ono 001; Toshiki Saitoh; Shunichi Tanaka (WABI, 2025)

Compatibility of convergence algorithms for autonomous mobile robots. - Yuichi Asahiro; Masafumi Yamashita (Theor. Comput. Sci., 2025)

Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots. - Yuichi Asahiro; Masafumi Yamashita (Theor. Comput. Sci., 2025)