論文・受賞| 組合せ遷移＠学術変革領域研究(B)

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

DOI: 10.1111/cgf.14322
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

DOI: 10.1016/j.tcs.2021.05.008
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

DOI: 10.1016/j.tcs.2021.05.003
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

DOI: 10.1016/j.tcs.2021.04.023
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

DOI: 10.1016/j.tcs.2021.03.037
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

DOI: 10.1007/978-3-030-73879-2_9
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

DOI: 10.1007/978-3-030-75242-2_19
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

DOI: 10.1016/j.tcs.2021.03.006
Optimal reconfiguration of optimal ladder lotteries

Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa

Theoretical Computer Science, Vol. 859, pp. 57-69, 2021

DOI: 10.1016/j.tcs.2021.01.009

論文・受賞

ClusterSets: Optimizing planar clusters in categorical point data

A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number

Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks

A (probably) optimal algorithm for bisection on bounded-treewidth graphs

Finding diverse trees, paths, and more

Algorithms for gerrymandering over graphs

A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \time 2$ submatrices

Exploring the gap between treedepth and vertex cover through vertex integrity

Finding a maximum minimal separator: Graph classes and fixed-parameter tractability

Optimal reconfiguration of optimal ladder lotteries