We stand with Ukraine  

Asahi Takaoka

Orcid: 0000-0002-0194-7138

According to our database1, Asahi Takaoka authored at least 25 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Graph classes equivalent to 12-representable graphs.
[BibTeX]
[DOI]
Asahi Takaoka
Discuss. Math. Graph Theory, 2024

Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words.
[BibTeX]
[DOI]
Asahi Takaoka
Discret. Appl. Math., 2024

A characterization of uniquely representable two-directional orthogonal ray graphs.
[BibTeX]
[DOI]
Asahi Takaoka
CoRR, 2024

2023
Decomposition of <i>P</i><sub>6</sub>-Free Chordal Bipartite Graphs.
[BibTeX]
[DOI]
Asahi Takaoka
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., November, 2023

Forbidden patterns of graphs 12-representable by pattern-avoiding words.
[BibTeX]
[DOI]
Asahi Takaoka
CoRR, 2023

Computing shortest 12-representants of labeled graphs.
[BibTeX]
[DOI]
Asahi Takaoka
CoRR, 2023

2022
A Note on the Intersection of Alternately Orientable Graphs and Cocomparability Graphs.
[BibTeX]
[DOI]
Asahi Takaoka
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2022

2021
A recognition algorithm for adjusted interval digraphs.
[BibTeX]
[DOI]
Asahi Takaoka
Discret. Appl. Math., 2021

2020
A recognition algorithm for simple-triangle graphs.
[BibTeX]
[DOI]
Asahi Takaoka
Discret. Appl. Math., 2020

Recognizing simple-triangle graphs by restricted 2-chain subgraph cover.
[BibTeX]
[DOI]
Asahi Takaoka
Discret. Appl. Math., 2020

2019
Linear-semiorders and their incomparability graphs.
[BibTeX]
[DOI]
Asahi Takaoka
CoRR, 2019

2018
A vertex ordering characterization of simple-triangle graphs.
[BibTeX]
[DOI]
Asahi Takaoka
Discret. Math., 2018

Complexity of Hamiltonian Cycle Reconfiguration.
[BibTeX]
[DOI]
Asahi Takaoka
Algorithms, 2018

2016
On orthogonal ray trees.
[BibTeX]
[DOI]
Irina Mustata
,
Kousuke Nishikawa
,
Asahi Takaoka
,
Satoshi Tayu
,
Shuichi Ueno
Discret. Appl. Math., 2016

A Simpler Recognition Algorithm for Simple-Triangle Graphs.
[BibTeX]
[DOI]
Asahi Takaoka
CoRR, 2016

2015
A Note on Irreversible 2-Conversion Sets in Subcubic Graphs.
[BibTeX]
[DOI]
Asahi Takaoka
,
Shuichi Ueno
IEICE Trans. Inf. Syst., 2015

Dominating Sets in Two-Directional Orthogonal Ray Graphs.
[BibTeX]
[DOI]
Asahi Takaoka
,
Satoshi Tayu
,
Shuichi Ueno
IEICE Trans. Inf. Syst., 2015

OBDD Representation of Intersection Graphs.
[BibTeX]
[DOI]
Asahi Takaoka
,
Satoshi Tayu
,
Shuichi Ueno
IEICE Trans. Inf. Syst., 2015

A Note on Harmonious Coloring of Caterpillars.
[BibTeX]
[DOI]
Asahi Takaoka
,
Shingo Okuma
,
Satoshi Tayu
,
Shuichi Ueno
IEICE Trans. Inf. Syst., 2015

Graph Isomorphism Completeness for Trapezoid Graphs.
[BibTeX]
[DOI]
Asahi Takaoka
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

2014
Dominating Sets and Induced Matchings in Orthogonal Ray Graphs.
[BibTeX]
[DOI]
Asahi Takaoka
,
Satoshi Tayu
,
Shuichi Ueno
IEICE Trans. Inf. Syst., 2014

Weighted dominating sets and induced matchings in orthogonal ray graphs.
[BibTeX]
[DOI]
Asahi Takaoka
,
Satoshi Tayu
,
Shuichi Ueno
Proceedings of the International Conference on Control, 2014

2013
On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs.
[BibTeX]
[DOI]
Asahi Takaoka
,
Satoshi Tayu
,
Shuichi Ueno
IEICE Trans. Inf. Syst., 2013

2012
On Minimum Feedback Vertex Sets in Graphs.
[BibTeX]
[DOI]
Asahi Takaoka
,
Satoshi Tayu
,
Shuichi Ueno
Proceedings of the Third International Conference on Networking and Computing, 2012

2011
On Two Problems of Nano-PLA Design.
[BibTeX]
[DOI]
Anish Man Singh Shrestha
,
Asahi Takaoka
,
Satoshi Tayu
,
Shuichi Ueno
IEICE Trans. Inf. Syst., 2011


  Loading...