default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAsahi Takaoka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Asahi Takaoka
:
Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words. Discret. Appl. Math. 358: 285-301 (2024)- [j17]Asahi Takaoka:
Graph classes equivalent to 12-representable graphs. Discuss. Math. Graph Theory 44(3): 1023 (2024) - [i10]Asahi Takaoka:
A characterization of uniquely representable two-directional orthogonal ray graphs. CoRR abs/2406.06077 (2024) - 2023
- [j16]Asahi Takaoka:
Decomposition of P6-Free Chordal Bipartite Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(11): 1436-1439 (2023) - [i9]Asahi Takaoka:
Computing shortest 12-representants of labeled graphs. CoRR abs/2304.07507 (2023) - [i8]Asahi Takaoka:
Forbidden patterns of graphs 12-representable by pattern-avoiding words. CoRR abs/2308.15904 (2023) - 2022
- [j15]Asahi Takaoka:
A Note on the Intersection of Alternately Orientable Graphs and Cocomparability Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1223-1227 (2022) - [i7]Asahi Takaoka:
Graph classes equivalent to 12-representable graphs. CoRR abs/2211.04871 (2022) - 2021
- [j14]Asahi Takaoka:
A recognition algorithm for adjusted interval digraphs. Discret. Appl. Math. 294: 253-256 (2021) - 2020
- [j13]Asahi Takaoka:
Recognizing simple-triangle graphs by restricted 2-chain subgraph cover. Discret. Appl. Math. 279: 154-167 (2020) - [j12]Asahi Takaoka:
A recognition algorithm for simple-triangle graphs. Discret. Appl. Math. 282: 196-207 (2020)
2010 – 2019
- 2019
- [i6]Asahi Takaoka:
Linear-semiorders and their incomparability graphs. CoRR abs/1907.07845 (2019) - 2018
- [j11]Asahi Takaoka:
Complexity of Hamiltonian Cycle Reconfiguration. Algorithms 11(9): 140 (2018) - [j10]Asahi Takaoka:
A vertex ordering characterization of simple-triangle graphs. Discret. Math. 341(12): 3281-3287 (2018) - [i5]Asahi Takaoka:
A recognition algorithm for adjusted interval digraphs. CoRR abs/1810.06162 (2018) - 2017
- [c3]Asahi Takaoka:
Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover. WALCOM 2017: 177-189 - [i4]Asahi Takaoka:
A recognition algorithm for simple-triangle graphs. CoRR abs/1710.06559 (2017) - 2016
- [j9]Irina Mustata, Kousuke Nishikawa, Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
On orthogonal ray trees. Discret. Appl. Math. 201: 201-212 (2016) - [i3]Asahi Takaoka:
A Simpler Recognition Algorithm for Simple-Triangle Graphs. CoRR abs/1605.07322 (2016) - [i2]Asahi Takaoka:
A vertex ordering characterization of simple-triangle graphs. CoRR abs/1611.09003 (2016) - 2015
- [j8]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
OBDD Representation of Intersection Graphs. IEICE Trans. Inf. Syst. 98-D(4): 824-834 (2015) - [j7]Asahi Takaoka, Shuichi Ueno:
A Note on Irreversible 2-Conversion Sets in Subcubic Graphs. IEICE Trans. Inf. Syst. 98-D(8): 1589-1591 (2015) - [j6]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
Dominating Sets in Two-Directional Orthogonal Ray Graphs. IEICE Trans. Inf. Syst. 98-D(8): 1592-1595 (2015) - [j5]Asahi Takaoka:
Graph Isomorphism Completeness for Trapezoid Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(8): 1838-1840 (2015) - [j4]Asahi Takaoka, Shingo Okuma, Satoshi Tayu, Shuichi Ueno:
A Note on Harmonious Coloring of Caterpillars. IEICE Trans. Inf. Syst. 98-D(12): 2199-2206 (2015) - [i1]Asahi Takaoka:
Graph isomorphism completeness for trapezoid graphs. CoRR abs/1503.06929 (2015) - 2014
- [j3]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
Dominating Sets and Induced Matchings in Orthogonal Ray Graphs. IEICE Trans. Inf. Syst. 97-D(12): 3101-3109 (2014) - [c2]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
Weighted dominating sets and induced matchings in orthogonal ray graphs. CoDIT 2014: 69-73 - 2013
- [j2]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs. IEICE Trans. Inf. Syst. 96-D(11): 2327-2332 (2013) - 2012
- [c1]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
On Minimum Feedback Vertex Sets in Graphs. ICNC 2012: 429-434 - 2011
- [j1]Anish Man Singh Shrestha, Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
On Two Problems of Nano-PLA Design. IEICE Trans. Inf. Syst. 94-D(1): 35-41 (2011)
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-10-07 21:24 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:
