default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuichi Asahiro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]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: 44-64 (2024)- 2023
- [j29]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: 114114 (2023) - [c39]Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue:
Independent Set Under a Change Constraint from an Initial Solution. CIAC 2023: 37-51 - [c38]Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov:
Shortest Longest-Path Graph Orientations. COCOON (1) 2023: 141-154 - [c37]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: 2:1-2:12 - [c36]Yuichi Asahiro, Masafumi Yamashita:
Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract). SIROCCO 2023: 149-164 - [c35]Yuichi Asahiro, Masafumi Yamashita:
Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract). SSS 2023: 312-327 - [i2]Yuichi Asahiro, Masafumi Yamashita:
Compatibility of convergence algorithms for autonomous mobile robots. CoRR abs/2301.10949 (2023) - [i1]Yuichi Asahiro, Masafumi Yamashita:
Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots. CoRR abs/2304.02212 (2023) - 2022
- [j28]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Upper and lower degree-constrained graph orientation with minimum penalty. Theor. Comput. Sci. 900: 53-78 (2022) - [j27]Yuichi Asahiro, Ichiro Suzuki, Masafumi Yamashita:
Monotonic self-stabilization and its application to robust and adaptive pattern formation. Theor. Comput. Sci. 934: 21-46 (2022) - [c34]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: 15:1-15:17 - 2021
- [j26]Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano, Tsuyoshi Yagita:
How to pack directed acyclic graphs into small blocks. Discret. Appl. Math. 288: 91-113 (2021) - [j25]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Parameterized algorithms for the Happy Set problem. Discret. Appl. Math. 304: 32-44 (2021) - [j24]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. 32(2): 209-233 (2021) - [j23]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Complexity and approximability of the happy set problem. Theor. Comput. Sci. 866: 123-144 (2021) - 2020
- [j22]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: 238-249 (2020) - [j21]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono:
Graph orientation with splits. Theor. Comput. Sci. 844: 16-25 (2020) - [c33]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Graph Classes and Approximability of the Happy Set Problem. COCOON 2020: 335-346 - [c32]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Parameterized Algorithms for the Happy Set Problem. WALCOM 2020: 323-328
2010 – 2019
- 2019
- [j20]Yuichi Asahiro, Guohui Lin, Zhilong Liu, Eiji Miyano:
An Approximation Algorithm for the Maximum Induced Matching Problem on C5-Free Regular Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1142-1149 (2019) - [j19]Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano:
Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems. Rev. Socionetwork Strateg. 13(2): 143-161 (2019) - [c31]Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA 2019: 1-12 - [c30]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.:
Graph Orientation with Edge Modifications. FAW 2019: 38-50 - 2018
- [j18]Yuichi Asahiro, Yuya Doi, Eiji Miyano, Kazuaki Samizo, Hirotaka Shimizu:
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. Algorithmica 80(6): 1834-1856 (2018) - [c29]Yuichi Asahiro, Eiji Miyano, Tsuyoshi Yagita:
Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks. ICCSA (2) 2018: 607-623 - [c28]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono:
Graph Orientation with Splits. ISCO 2018: 52-63 - 2016
- [j17]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. 58(1): 60-93 (2016) - [c27]Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano:
Experimental Evaluation of Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. SCIS&ISIS 2016: 892-897 - 2015
- [j16]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. 19(1): 441-465 (2015) - [c26]Yuichi Asahiro, Yuya Doi, Eiji Miyano, Hirotaka Shimizu:
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. COCOA 2015: 586-600 - [c25]Kaede Utsunomiya, Yuichi Asahiro:
An Improvement of the Greedy Algorithm for the (n^2-1) -Puzzle. ICCSA (2) 2015: 457-473 - 2014
- [j15]Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano:
Complexity of finding maximum regular induced subgraphs with prescribed degree. Theor. Comput. Sci. 550: 21-35 (2014) - 2013
- [j14]Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono:
Optimal approximability of bookmark assignments. Discret. Appl. Math. 161(16-17): 2361-2366 (2013) - [j13]Yuichi Asahiro, Hiroshi Eto, Eiji Miyano:
Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems. IEICE Trans. Inf. Syst. 96-D(3): 443-449 (2013) - [j12]Yuichi Asahiro, Kenta Kanmera, Eiji Miyano:
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation. J. Comb. Optim. 26(4): 687-708 (2013) - [c24]Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano:
Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. FCT 2013: 28-39 - [c23]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. WAOA 2013: 24-36 - 2012
- [j11]Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano:
NP-hardness of the sorting buffer problem on the uniform metric. Discret. Appl. Math. 160(10-11): 1453-1464 (2012) - [c22]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS 2012: 139-146 - [c21]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO 2012: 332-343 - 2011
- [j10]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): 498-508 (2011) - [j9]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. 22(3): 583-601 (2011) - [j8]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): 78-96 (2011) - [c20]Yuichi Asahiro, Kenta Kanmera, Eiji Miyano:
(1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. COCOON 2011: 259-270 - 2010
- [j7]Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta:
Weighted nearest neighbor algorithms for the graph exploration problem on cycles. Inf. Process. Lett. 110(3): 93-98 (2010) - [c19]Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo:
Approximating Maximum Diameter-Bounded Subgraphs. LATIN 2010: 615-626
2000 – 2009
- 2009
- [c18]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph orientation to maximize the minimum weighted outdegree. IPDPS 2009: 1-8 - 2008
- [j6]Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa:
Grasp and Delivery for Moving Objects on Broken Lines. Theory Comput. Syst. 42(3): 289-305 (2008) - [c17]Yuichi Asahiro, Eiji Miyano, Hirotaka Ono:
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. CATS 2008: 97-106 - [c16]Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano:
NP-Hardness of the Sorting Buffer Problem on the Uniform Metric. FCS 2008: 137-143 - [c15]Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita:
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. OPODIS 2008: 125-144 - 2007
- [j5]Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Graph Orientation Algorithms to minimize the Maximum Outdegree. Int. J. Found. Comput. Sci. 18(2): 197-215 (2007) - [c14]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM 2007: 167-177 - [c13]Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono:
On Approximation of Bookmark Assignments. MFCS 2007: 115-124 - [c12]Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta:
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. SOFSEM (1) 2007: 164-175 - 2006
- [j4]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): 2247-2262 (2006) - [c11]Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Graph Orientation Algorithms to Minimize the Maximum Outdegree. CATS 2006: 11-20 - [c10]Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano:
How to Pack Directed Acyclic Graphs into Small Blocks. CIAC 2006: 272-283 - 2005
- [c9]Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa:
Pickup and Delivery for Moving Objects on Broken Lines. ICTCS 2005: 36-50 - 2004
- [c8]Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita:
How to Collect Balls Moving in the Euclidean Plane. CATS 2004: 229-245 - 2003
- [j3]Yuichi Asahiro, Masahiro Ishibashi, Masafumi Yamashita:
Independentand cooperative parallel search methods for the generalized assignment problem. Optim. Methods Softw. 18(2): 129-141 (2003) - 2002
- [j2]Yuichi Asahiro, Refael Hassin, Kazuo Iwama:
Complexity of finding dense subgraphs. Discret. Appl. Math. 121(1-3): 15-26 (2002) - [c7]Limin Xiang, Kazuo Ushijima, Yuichi Asahiro:
Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order. ITCC 2002: 396-403 - 2001
- [c6]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: 3016-3021 - 2000
- [j1]Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama:
Greedily Finding a Dense Subgraph. J. Algorithms 34(2): 203-221 (2000) - [c5]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: 427-436
1990 – 1999
- 1998
- [c4]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: 240-254 - 1996
- [c3]Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama:
Greedily Finding a Dense Subgraph. SWAT 1996: 136-148 - 1995
- [c2]Yuichi Asahiro, Kazuo Iwama:
Finding Dense Subgraphs. ISAAC 1995: 102-111 - 1993
- [c1]Yuichi Asahiro, Kazuo Iwama, Eiji Miyano:
Random generation of test instances with controlled attributes. Cliques, Coloring, and Satisfiability 1993: 377-393
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
