Yasuaki Kobayashi

Graduate School of Informatics, Kyoto University

Journal Paper
  • Yasuaki Kobayashi, Hisao Tamaki: A faster fixed parameter algorithm for two-layer crossing minimization, Information Processing Letters 116(9), 547-549, 2016. [Arxiv]
  • Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano: Computing directed pathwidth in O(1.89n) time, Algorithmica, 75(1), 138-157, 2016.
  • Yasuaki Kobayashi, Hisao Tamaki: A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization. Algorithmica 72(3), 778-790, 2015.
  • Yasuaki Kobayashi: Computing the pathwidth of directed graphs with small vertex cover. Information Processing Letters 115(2), 310-312, 2015.
  • Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae Hisao Tamaki: A linear edge kernel for two-layer crossing minimization. Theoretical Computer Science 554, 74-81, 2014.

Conference Paper
  • Yasuaki Kobayashi, Hisao Tamaki: Treedepth parameterized by vertex cover number, In Proc. of IPEC, LIPICS, vol. 63, 18:1-18:11, 2016.
  • Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki: On the pathwidth of almost semicomplete digraphs, In Proc. of ESA, LNCS, vol. 9294, pp.816-827, 2015. [Arxiv]
  • Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki: Search space reduction through commitments in pathwidth computation: an experimental study. In Proc. of SEA2014, LNCS, vol. 8504, pp. 388-399, 2014. 
  • Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki: A linear edge kernel for two-layer crossing minimization. In Proc. of COCOON2013, LNCS, vol. 7936, pp. 458-468, 2013.
  • Yasuaki Kobayashi, Hisao Tamaki: A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization. In Proc. of ESA2012, LNCS, vol. 7501, pp.683-694, 2012.
  • Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano: Computing directed pathwidth in O(1.89n) time. In Proc. of IPEC2012, LNCS, vol. 7535, pp. 182-193, 2012.
  • Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki: k-cyclic orientations of graphs. In Proc. of ISAAC2010, LNCS, vol. 6507(2), pp.73-84, 2010.