Personnel Information

写真a

Takaoka Asahi


The department in charge

Department of Sciences and Informatics

Job title

Assistant Professor

E-mail Address

E-mail address

To the head of this page.▲

Research field 【 display / non-display 】

  • Informatics / Theory of informatics

  • Natural Science / Basic mathematics

To the head of this page.▲

Keywords for Research Field 【 display / non-display 】

  • Graph algorithms

  • Algorithmic graph theory

  • Graph classes

  • Graph theory

  • Algorithms

display all >>

To the head of this page.▲

Graduate school・Graduate course, etc. 【 display / non-display 】

  • Tokyo Institute of Technology

    2012.03，Master's Course，Graduate School, Division of Science and Engineering，Department of Communication and Integrated Systems，Completed，Japan

  • Tokyo Institute of Technology

    2015.03，Doctor's Course，Graduate School, Division of Science and Engineering，Department of Communication and Integrated Systems，Completed，Japan

To the head of this page.▲

Graduate school・major, etc. 【 display / non-display 】

  • Tokyo Institute of Technology

    2010.03，Faculty of Engineering，Department of Computer Science，Graduate，Japan

To the head of this page.▲

Degree 【 display / non-display 】

  • 博士（工学）

To the head of this page.▲

Career 【 display / non-display 】

  • JSPS Research Fellow (DC2)

    2014.04 ～ 2015.04

  • JSPS Research Fellow (PD)

    2015.04 ～ 2016.04

  • Kanagawa University Faculty of Engineering, Department of Information System Creation Assistant professor

    2016.04 ～ 2020.03

To the head of this page.▲

Academic Society 【 display / non-display 】

  • The Institute of Electronics, Information and Communication Engineers (IEICE)

  • The Institute of Electrical and Electronics Engineers (IEEE)

  • Society for Industrial and Applied Mathematics (SIAM)

  • Information Processing Society of Japan (IPSJ)

To the head of this page.▲

Academic prize 【 display / non-display 】

  • 電子情報通信学会学術奨励賞

    2015.03，The Institute of Electronics, Information and Communication Engineers (IEICE)

To the head of this page.▲
 
 

Books 【 display / non-display 】

  • 数理情報学入門―基礎知識からレポート作成まで―

    須藤 秀紹，高岡 旭，半田 久志，福本 誠，渡邉 真也，共立出版，第1章 情報数学，(p.220)，2021.03，9784320124707

To the head of this page.▲

Papers 【 display / non-display 】

  • Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words

    Asahi Takaoka，Discrete Applied Mathematics，vol.358，(p.285 ～ 301)，2024.12

  • Computing shortest 12-representants of labeled graphs

    Asahi Takaoka，Australasian Journal of Combinatorics，vol.90，(2)，(p.110 ～ 120)，2024.10

  • Graph classes equivalent to 12-representable graphs

    Asahi Takaoka，Discussiones Mathematicae Graph Theory，vol.44，(3)，(p.1023 ～ 1035)，2024

  • Decomposition of $P_6$-free chordal bipartite graphs

    Asahi Takaoka，IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences，vol.E106.A，(11)，(p.1436 ～ 1439)，2023.11

  • A Note on the Intersection of Alternately Orientable Graphs and Cocomparability Graphs

    Asahi Takaoka，IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences，vol.E105.A，(9)，(p.1223 ～ 1227)，2022.09

display all >>

To the head of this page.▲

International conference proceedings 【 display / non-display 】

  • Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover

    Asahi Takaoka，In Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017)，(p.177 ～ 189)，Springer，2017.03，Hsinchu, Taiwan

  • Weighted dominating sets and induced matchings in orthogonal ray graphs

    Asahi Takaoka, Satoshi Tayu, Shuichi Ueno，In Proceedings of the IEEE-2nd International Conference on Control, Decision and Information Technologies (CoDIT 2014)，(p.69 ～ 73)，2014.11，Metz, France

  • On Minimum Feedback Vertex Sets in Graphs

    Asahi Takaoka, Satoshi Tayu, Shuichi Ueno， In Proceedings of the 3rd International Conference on Networking and Computing (ICNC 2012)，(p.429 ～ 434)，2012.12，Okinawa, Japan

To the head of this page.▲

Editorial and Commentary 【 display / non-display 】

  • Simple-Triangle Graphs and Related Classes

    高岡 旭，IEICE ESS Fundamentals Review，vol.16，(1)，(p.17 ～ 23)，2022.07

To the head of this page.▲

Research reports 【 display / non-display 】

  • Min-orderableグラフの順序付き部分グラフ同型性判定問題

    佐藤 景大，高岡 旭，情報処理学会研究報告，vol.2024-AL-200，(12)，(p.1 ～ 8)，2024.11

  • A characterization of uniquely representable two-directional orthogonal ray graphs

    Asahi Takaoka，arXiv:2406.06077，2024.06

  • Forbidden patterns of graphs 12-representable by pattern-avoiding words

    Asahi Takaoka，arXiv:2308.15904，2023.08

  • Computing shortest 12-representants of labeled graphs

    Asahi Takaoka，arXiv:2304.07507，2023.04

  • Graph classes equivalent to 12-representable graphs

    Asahi Takaoka，arXiv:2211.04871，2022.11

display all >>

To the head of this page.▲

Presentaion at conference, meeting, etc. 【 display / non-display 】

  • いくつかのループ系パズルのASP完全性―Tメタセルによる証明―

    鈴木 亮太，高岡 旭，情報処理北海道シンポジウム2024，情報処理北海道シンポジウム2024 講演論文集，2024.12.01，北見，Japan

  • Forbidden patterns of graphs 12-representable by pattern-avoiding words (Extended Abstract)

    髙岡 旭，第195回アルゴリズム研究発表会，情報処理学会アルゴリズム研究会（SIGAL），IPSJ SIG Technical Report, Vol.2023-AL-195, No.3，(p.1-8)，2023.11.16，沖縄，Japan

  • Law Discovery from Sewage Treatment Data using Neural Networks

    笠川 舞夢，髙岡 旭，塩谷 浩之，第30回インテリジェント・システム・シンポジウム（FAN 2022），計測自動制御学会 システム・情報部門，第30回インテリジェント・システム・シンポジウム（FAN 2022）講演論文集，2022.09.21，神戸，Japan

  • 下水処理データの関係式発見に関する研究

    笠川 舞夢，佐藤利哉，髙岡 旭，塩谷 浩之，情報処理学会 第84回全国大会，情報処理学会，情報処理学会 第84回全国大会 講演論文集，2022.03.04，愛媛，Japan

  • Dimensionality reduction of spherical shell structure in diffractive imaging

    劉 源輝，髙岡 旭，塩谷 浩之，情報処理学会 第84回全国大会，情報処理学会，情報処理学会 第84回全国大会 講演論文集，2022.03.04，愛媛，Japan

display all >>

To the head of this page.▲
 

Class subject in charge 【 display / non-display 】

  • 基盤情報学演習

    2024，Department

  • プログラミング実践演習

    2024，Department

  • 情報学基礎演習A

    2024，Department

  • 情報学PBL演習

    2024，Department

  • 情報学ゼミナール

    2024，Department

display all >>

To the head of this page.▲