OZEKI Kenta

Affiliation

Faculty of Environment and Information Sciences, Division of Social Environment and Information

Job Title

Associate Professor

Research Fields, Keywords

Discrete Mathematics, Graph Theory

Related SDGs




ORCID  https://orcid.org/0000-0003-3118-0086

Graduate School 【 display / non-display

  •  
    -
    2009.03

    Keio University  Graduate School, Division of Science and Engineering  Doctor Course  Completed

Degree 【 display / non-display

  • Doctor of Science -  Keio University

  • Master of Science -  Keio University

Campus Career 【 display / non-display

  • 2019.04
    -
    Now

    Duty   Yokohama National UniversityFaculty of Environment and Information Sciences   Division of Social Environment and Information   Associate Professor  

  • 2017.02
    -
    2019.03

    Duty   Yokohama National UniversityFaculty of Environment and Information Sciences   Division of Social Environment and Information   Specially Appointed Associate Professor  

  • 2021.04
    -
    Now

    Concurrently   Yokohama National UniversityInterfaculty Graduate School of Innovative and Practical Studies   Associate Professor  

  • 2019.04
    -
    Now

    Concurrently   Yokohama National UniversityGraduate School of Environment and Information Sciences   Department of Information Media and Environment Sciences   Associate Professor  

  • 2019.04
    -
    Now

    Concurrently   Yokohama National UniversityCollege of Engineering Science   Department of Mathematics, Physics, Electrical Engineering and Computer Science   Associate Professor  

display all >>

External Career 【 display / non-display

  • 2012.11
    -
    2017.01

    National Institute of Informatics  

 

Papers 【 display / non-display

  • A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs

    MATSUI Yasuko, OZEKI Kenta

    IEICE Transactions on Information and Systems ( 一般社団法人 電子情報通信学会 )  104 ( 3 )   389 - 391   2021

    Joint Work

     View Summary

    <p>This paper deals with the problem of enumerating 3-edge-connected spanning subgraphs of an input plane graph. In 2018, Yamanaka et al. proposed two enumeration algorithms for such a problem. Their algorithm generates each 2-edge-connected spanning subgraph of a given plane graph with <i>n</i> vertices in O(<i>n</i>) time, and another one generates each <i>k</i>-edge-connected spanning subgraph of a general graph with <i>m</i> edges in O(<i>mT</i>) time, where <i>T</i> is the running time to check the <i>k</i>-edge connectivity of a graph. This paper focuses on the case of the 3-edge-connectivity in a plane graph. We give an algorithm which generates each 3-edge-connected spanning subgraph of the input plane graph in <i>O</i>(<i>n</i><sup>2</sup>) time. This time complexity is the same as the algorithm by Yamanaka et al., but our algorithm is simpler than theirs.</p>

    DOI CiNii

  • Thomassen's conjecture for line graphs of 3-hypergraphs

    Li Binlong, Ozeki Kenta, Ryjacek Zdenek, Vrana Petr

    DISCRETE MATHEMATICS   343 ( 6 )   2020.06  [Refereed]

    Joint Work

    Web of Science DOI

  • Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers

    Furuya Michitaka, Maezawa Shun-ichi, Ozeki Kenta

    GRAPHS AND COMBINATORICS   36 ( 1 )   167 - 176   2020.01  [Refereed]

    Joint Work

    Web of Science DOI

  • A degree sum condition on the order, the connectivity and the independence number for hamiltonicity

    Chiba Shuya, Furuya Michitaka, Ozeki Kenta, Tsugaki Masao, Yamashita Tomoki

    ELECTRONIC JOURNAL OF COMBINATORICS   26 ( 4 )   2019.12  [Refereed]

    Joint Work

    Web of Science

  • On the minimum leaf number of cubic graphs

    Goedgebeur Jan, Ozeki Kenta, Van Cleemput Nico, Wiener Gabor

    DISCRETE MATHEMATICS   342 ( 11 )   3000 - 3005   2019.11  [Refereed]

    Joint Work

    Web of Science DOI

display all >>

Grant-in-Aid for Scientific Research 【 display / non-display

  • Grant-in-Aid for Scientific Research(C)

    Project Year: 2018.04  -  2021.03