Activities

Publications and Awards

  • ClusterSets: Optimizing planar clusters in categorical point data

    Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, Alexander Wolff
    Computer Graphics Forum, Vol. 40, pp. 471-481, 2021
  • A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number

    Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
    Theoretical Computer Science, Vol. 874, pp. 32-41, 2021
  • Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks

    Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase
    Theoretical Computer Science, Vol. 873, pp. 87-113, 2021
  • A (probably) optimal algorithm for bisection on bounded-treewidth graphs

    Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
    Theoretical Computer Science, Vol. 873, pp. 38-46, 2021
  • Finding diverse trees, paths, and more

    Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
    Proc. of the AAAI Conference on Artificial Intelligence (AAAI 2021), Vol. 35, pp. 3778-3786, 2021
    DOI: 
  • Algorithms for gerrymandering over graphs

    Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    Theoretical Computer Science, Vol. 868, pp. 30-45, 2021
  • A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \time 2$ submatrices

    Yuni Iwamasa
    Proc. of 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO 2021), Lecture Notes in Computer Science, Vol. 12707, pp. 119-133, 2021
  • Exploring the gap between treedepth and vertex cover through vertex integrity

    Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
    Proc. of 12th International Conference on Algorithms and Complexity (CIAC 2021), Lecture Notes in Computer Science, Vol. 12701, pp. 271-285, 2021
  • Finding a maximum minimal separator: Graph classes and fixed-parameter tractability

    Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
    Theoretical Computer Science, Vol. 865, pp. 131-140, 2021
  • Optimal reconfiguration of optimal ladder lotteries

    Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa
    Theoretical Computer Science, Vol. 859, pp. 57-69, 2021