Yuichi Asahiro

76 papers A* 1A 1B 10C 9Misc 3Journal 34Unranked 18

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