Yuichi Asahiro

According to our database, Yuichi Asahiro authored at least 60 papers between 1993 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots.

Yuichi Asahiro, Masafumi Yamashita

Theor. Comput. Sci., 2025

Compatibility of convergence algorithms for autonomous mobile robots.

Yuichi Asahiro, Masafumi Yamashita

Theor. Comput. Sci., 2025

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

Proceedings of the 25th International Conference on Algorithms for Bioinformatics, 2025

Shortest Longest-Path Graph Orientations for Trees.

Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Yoshichika Yano, Shay Zakov

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs.

Yuichi Asahiro, Hiroshi Eto, Guohui Lin, Eiji Miyano, Yudai Oka

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

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., October, 2023

Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots.

Yuichi Asahiro, Masafumi Yamashita

CoRR, 2023

Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract).

Yuichi Asahiro, Masafumi Yamashita

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract).

Yuichi Asahiro, Masafumi Yamashita

Proceedings of the Structural Information and Communication Complexity, 2023

Approximation Algorithms for the Longest Run Subsequence Problem.

Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Shortest Longest-Path Graph Orientations.

Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Independent Set Under a Change Constraint from an Initial Solution.

Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022

Monotonic self-stabilization and its application to robust and adaptive pattern formation.

Yuichi Asahiro, Ichiro Suzuki, Masafumi Yamashita

Theor. Comput. Sci., 2022

Upper and lower degree-constrained graph orientation with minimum penalty.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Theor. Comput. Sci., 2022

Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants.

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

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

Graph Orientation with Edge Modifications.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Int. J. Found. Comput. Sci., 2021

How to pack directed acyclic graphs into small blocks.

Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano, Tsuyoshi Yagita

Discret. Appl. Math., 2021

2020

Exact algorithms for the repetition-bounded longest common subsequence problem.

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Theor. Comput. Sci., 2020

Parameterized Algorithms for the Happy Set Problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Graph Classes and Approximability of the Happy Set Problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems.

Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano

Rev. Socionetwork Strateg., 2019

An Approximation Algorithm for the Maximum Induced Matching Problem on <i>C</i>₅-Free Regular Graphs.

Yuichi Asahiro, Guohui Lin, Zhilong Liu, Eiji Miyano

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Graph Orientation with Edge Modifications.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem.

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems.

Yuichi Asahiro, Yuya Doi, Eiji Miyano, Kazuaki Samizo, Hirotaka Shimizu

Algorithmica, 2018

Graph Orientation with Splits.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks.

Yuichi Asahiro, Eiji Miyano, Tsuyoshi Yagita

Proceedings of the Computational Science and Its Applications - ICCSA 2018, 2018

2016

Experimental Evaluation of Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems.

Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano

Proceedings of the 2016 Joint 8th International Conference on Soft Computing and Intelligent Systems (SCIS) and 17th International Symposium on Advanced Intelligent Systems (ISIS), 2016

2015

An Improvement of the Greedy Algorithm for the (n^2-1) -Puzzle.

Kaede Utsunomiya, Yuichi Asahiro

Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems.

Yuichi Asahiro, Yuya Doi, Eiji Miyano, Hirotaka Shimizu

Proceedings of the Combinatorial Optimization and Applications, 2015

2013

Inapproximability of Maximum <i>r</i>-Regular Induced Connected Subgraph Problems.

Yuichi Asahiro, Hiroshi Eto, Eiji Miyano

IEICE Trans. Inf. Syst., 2013

Optimal approximability of bookmark assignments.

Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono

Discret. Appl. Math., 2013

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree.

Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012

Graph Orientations Optimizing the Number of Light or Heavy Vertices.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011

(1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation.

Yuichi Asahiro, Kenta Kanmera, Eiji Miyano

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

Approximating Maximum Diameter-Bounded Subgraphs.

Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Graph orientation to maximize the minimum weighted outdegree.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008

Grasp and Delivery for Moving Objects on Broken Lines.

Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa

Theory Comput. Syst., 2008

A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots.

Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

NP-Hardness of the Sorting Buffer Problem on the Uniform Metric.

Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano

Proceedings of the 2008 International Conference on Foundations of Computer Science, 2008

Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree.

Yuichi Asahiro, Eiji Miyano, Hirotaka Ono

Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

2007

Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles.

Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

On Approximation of Bookmark Assignments.

Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

How to collect balls moving in the Euclidean plane.

Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita

Discret. Appl. Math., 2006

How to Pack Directed Acyclic Graphs into Small Blocks.

Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

Graph Orientation Algorithms to Minimize the Maximum Outdegree.

Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo

Proceedings of the Theory of Computing 2006, 2006

2005

Pickup and Delivery for Moving Objects on Broken Lines.

Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2003

Independentand cooperative parallel search methods for the generalized assignment problem.

Yuichi Asahiro, Masahiro Ishibashi, Masafumi Yamashita

Optim. Methods Softw., 2003

2002

Complexity of finding dense subgraphs.

Yuichi Asahiro, Refael Hassin, Kazuo Iwama

Discret. Appl. Math., 2002

Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order.

Limin Xiang, Kazuo Ushijima, Yuichi Asahiro

Proceedings of the 2002 International Symposium on Information Technology (ITCC 2002), 2002

2001

A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor.

Yuichi Asahiro, Eric Chung-Hui Chang, Amol Dattatraya Mali, Ichiro Suzuki, Masafumi Yamashita

Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

2000

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

Proceedings of the Distributed Autonomous Robotic Systems 4, 2000

1998

Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time.

Yuichi Asahiro, Hajime Asama, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita

Proceedings of the Sensor Based Intelligent Robots, International Workshop, Dagstuhl Castle, Germany, September 28, 1998

1996

Greedily Finding a Dense Subgraph.

Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama

Proceedings of the Algorithm Theory, 1996

1995

Finding Dense Subgraphs.

Yuichi Asahiro, Kazuo Iwama

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1993

Random generation of test instances with controlled attributes.

Yuichi Asahiro, Kazuo Iwama, Eiji Miyano

Proceedings of the Cliques, 1993