Yuichi Asahiro

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 29

Top Topics

Maximum Distance

Approximation Algorithms

Longest Common Subsequence

Directed Acyclic Graph

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Publications

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Polynomial-time equivalences and refined algorithms for longest common subsequence variants. Discret. Appl. Math. 353 (2024)
Yuichi Asahiro, Masafumi Yamashita
Compatibility of convergence algorithms for autonomous mobile robots. CoRR (2023)
Yuichi Asahiro, Masafumi Yamashita
Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots. CoRR (2023)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]. Theor. Comput. Sci. 975 (2023)
Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka
Approximation Algorithms for the Longest Run Subsequence Problem. CPM (2023)
Yuichi Asahiro, Masafumi Yamashita
Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract). SIROCCO (2023)
Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov
Shortest Longest-Path Graph Orientations. COCOON (1) (2023)
Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue
Independent Set Under a Change Constraint from an Initial Solution. CIAC (2023)
Yuichi Asahiro, Masafumi Yamashita
Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract). SSS (2023)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Upper and lower degree-constrained graph orientation with minimum penalty. Theor. Comput. Sci. 900 (2022)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM (2022)
Yuichi Asahiro, Ichiro Suzuki, Masafumi Yamashita
Monotonic self-stabilization and its application to robust and adaptive pattern formation. Theor. Comput. Sci. 934 (2022)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Parameterized algorithms for the Happy Set problem. Discret. Appl. Math. 304 (2021)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. 32 (2) (2021)
Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano, Tsuyoshi Yagita
How to pack directed acyclic graphs into small blocks. Discret. Appl. Math. 288 (2021)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Complexity and approximability of the happy set problem. Theor. Comput. Sci. 866 (2021)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Graph Classes and Approximability of the Happy Set Problem. COCOON (2020)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
Graph orientation with splits. Theor. Comput. Sci. 844 (2020)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Parameterized Algorithms for the Happy Set Problem. WALCOM (2020)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. 838 (2020)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA (2019)
Yuichi Asahiro, Guohui Lin, Zhilong Liu, Eiji Miyano
-Free Regular Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.
Graph Orientation with Edge Modifications. FAW (2019)
Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano
Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems. Rev. Socionetwork Strateg. 13 (2) (2019)
Yuichi Asahiro, Eiji Miyano, Tsuyoshi Yagita
Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks. ICCSA (2) (2018)
Yuichi Asahiro, Yuya Doi, Eiji Miyano, Kazuaki Samizo, Hirotaka Shimizu
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. Algorithmica 80 (6) (2018)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
Graph Orientation with Splits. ISCO (2018)
Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano
Experimental Evaluation of Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. SCIS&ISIS (2016)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. 58 (1) (2016)
Yuichi Asahiro, Yuya Doi, Eiji Miyano, Hirotaka Shimizu
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. COCOA (2015)
Kaede Utsunomiya, Yuichi Asahiro
An Improvement of the Greedy Algorithm for the (n^2-1) -Puzzle. ICCSA (2) (2015)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. 19 (1) (2015)
Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
Complexity of finding maximum regular induced subgraphs with prescribed degree. Theor. Comput. Sci. 550 (2014)
Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. FCT (2013)
Yuichi Asahiro, Hiroshi Eto, Eiji Miyano
-Regular Induced Connected Subgraph Problems. IEICE Trans. Inf. Syst. (3) (2013)
Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation. J. Comb. Optim. 26 (4) (2013)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. WAOA (2013)
Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
Optimal approximability of bookmark assignments. Discret. Appl. Math. 161 (16-17) (2013)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO (2012)
Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano
NP-hardness of the sorting buffer problem on the uniform metric. Discret. Appl. Math. 160 (10-11) (2012)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS (2012)
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discret. Appl. Math. 159 (7) (2011)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22 (1) (2011)
Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
(1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. COCOON (2011)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. 22 (3) (2011)
Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo
Approximating Maximum Diameter-Bounded Subgraphs. LATIN (2010)
Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta
Weighted nearest neighbor algorithms for the graph exploration problem on cycles. Inf. Process. Lett. 110 (3) (2010)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph orientation to maximize the minimum weighted outdegree. IPDPS (2009)
Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. OPODIS (2008)
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. CATS (2008)
Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa
Grasp and Delivery for Moving Objects on Broken Lines. Theory Comput. Syst. 42 (3) (2008)
Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano
NP-Hardness of the Sorting Buffer Problem on the Uniform Metric. FCS (2008)
Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
On Approximation of Bookmark Assignments. MFCS (2007)
Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. SOFSEM (1) (2007)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM (2007)
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
Graph Orientation Algorithms to minimize the Maximum Outdegree. Int. J. Found. Comput. Sci. 18 (2) (2007)
Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano
How to Pack Directed Acyclic Graphs into Small Blocks. CIAC (2006)
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
Graph Orientation Algorithms to Minimize the Maximum Outdegree. CATS (2006)
Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
How to collect balls moving in the Euclidean plane. Discret. Appl. Math. 154 (16) (2006)
Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa
Pickup and Delivery for Moving Objects on Broken Lines. ICTCS (2005)
Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
How to Collect Balls Moving in the Euclidean Plane. Electron. Notes Theor. Comput. Sci. 91 (2004)
Yuichi Asahiro, Masahiro Ishibashi, Masafumi Yamashita
Independentand cooperative parallel search methods for the generalized assignment problem. Optim. Methods Softw. 18 (2) (2003)
Yuichi Asahiro, Refael Hassin, Kazuo Iwama
Complexity of finding dense subgraphs. Discret. Appl. Math. 121 (1-3) (2002)
Limin Xiang, Kazuo Ushijima, Yuichi Asahiro
Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order. ITCC (2002)
Yuichi Asahiro, Eric Chung-Hui Chang, Amol Dattatraya Mali, Ichiro Suzuki, Masafumi Yamashita
A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor. ICRA (2001)
Yuichi Asahiro, Eric Chung-Hui Chang, Amol Dattatraya Mali, Syunsuke Nagafuji, Ichiro Suzuki, Masafumi Yamashita
Distributed Motion Generation for Two Omni-Directional Robots Carrying Ladder. DARS (2000)
Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
Greedily Finding a Dense Subgraph. J. Algorithms 34 (2) (2000)
Yuichi Asahiro, Hajime Asama, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita
Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time. Sensor Based Intelligent Robots (1998)
Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
Greedily Finding a Dense Subgraph. SWAT (1996)
Yuichi Asahiro, Kazuo Iwama
Finding Dense Subgraphs. ISAAC (1995)
Yuichi Asahiro, Kazuo Iwama, Eiji Miyano
Random generation of test instances with controlled attributes. Cliques, Coloring, and Satisfiability (1993)