Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Yasuaki
    Last name: Kobayashi
    DBLP: 58/8821
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 10 of 15  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto.
    Improved Methods for Computing Distances between Unordered Trees Using Integer Programming.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto.
    Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming.
    Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II 2017 (0) 2017
    Journal article
    Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano.
    Computing Directed Pathwidth in O(1.89
    Algorithmica 2016, Volume 75 (0) 2016
    Conference paper
    Yasuaki Kobayashi, Hisao Tamaki.
    A faster fixed parameter algorithm for two-layer crossing minimization.
    Inf. Process. Lett. 2016, Volume 116 (0) 2016
    Conference paper
    Yasuaki Kobayashi, Hisao Tamaki.
    Treedepth Parameterized by Vertex Cover Number.
    11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark 2017 (0) 2016
    Conference paper
    Yasuaki Kobayashi.
    Computing the pathwidth of directed graphs with small vertex cover.
    Inf. Process. Lett. 2015, Volume 115 (0) 2015
    Conference paper
    Yasuaki Kobayashi, Hisao Tamaki.
    A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization.
    Algorithmica 2015, Volume 72 (0) 2015
    Conference paper
    Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki.
    On the pathwidth of almost semicomplete digraphs.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki.
    On the Pathwidth of Almost Semicomplete Digraphs.
    Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings 2015 (0) 2015
    Conference paper
    Yasuaki Kobayashi, Hisao Tamaki.
    A faster fixed parameter algorithm for two-layer crossing minimization.
    CoRR 2015, Volume 0 (0) 2015
    Show item 1 to 10 of 15  

    Your query returned 15 matches in the database.