default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuichi Asahiro
- > Home > Persons > Yuichi Asahiro
Publications
- 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
- [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 - 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) - [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
- [j24]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. 32(2): 209-233 (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) - 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
- [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) - 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) - 2013
- [c23]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. WAOA 2013: 24-36 - 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
- [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) - 2009
- [c18]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph orientation to maximize the minimum weighted outdegree. IPDPS 2009: 1-8 - 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
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:
