Online edition: ISSN 2432-6380
[TOP] | [2018] | [2019] | [2020] | [2021] | [2022] | [2023] | [2024] | [Japanese] / [English]
COMP2023-16
Approximation Algorithms for Generalizations of Strong Connectivity Augmentation Problem
Ryoma Norose, Yutaro Yamaguchi (Osaka Univ.)
pp. 1 - 5
COMP2023-17
Algorithms for Optimally Shifting Intervals under Intersection Graph Models
Honorato Droguett Nicolas, Kazuhiro Kurita (Nagoya Univ.), Tesshu Hanaka (Kyushu Univ.), Hirotaka Ono (Nagoya Univ.)
pp. 6 - 11
COMP2023-18
On the minimization of quasi M^natural-convex functions
Kazuo Murota (ISM, TMU), Akiyoshi Shioura (Tokyo Tech)
pp. 12 - 19
COMP2023-19
[Invited Talk]
Fast Algorithms for Maximum Matching Problem
Yutaro Yamaguchi (Osaka Univ.)
p. 20
COMP2023-20
A fixed-parameter algorithm for dissimilar shortest paths
Ryo Funayama, Yasuaki Kobayashi (Hokkaido Univ.)
pp. 21 - 28
COMP2023-21
Polynomial-delay algorithms for enumerating maximal induced subgraphs for subclasses of chordal graphs
Rei Sato, Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.)
pp. 29 - 36
COMP2023-22
Efficient Enumeration of Quantum Circuits Realizing Boolean Functions by Toffoli Gate Count
Shigeru Yamashita (Ritsumeikan Univ.), Takashi Horiyama (Hokkaido Univ.), Norihito Yasuda (NTT)
pp. 37 - 44
COMP2023-23
[Short Paper]
Finding Diverse Longest Common Subsequences of a Set of Strings
Yuto Shida, Hiroki Arimura, Yasuaki Kobayashi (Hokkaido Univ.)
pp. 45 - 52
COMP2023-24
(See Japanese page.)
pp. 53 - 55
COMP2023-25
The ultimate signs of second-order holonomic sequences
Akitoshi Kawamura, Fugen Hagihara (Kyoto Univ.)
pp. 56 - 60
COMP2023-26
Uniform deployment of mobile robots with restricted views in path graphs
Kazuki Hasegawa, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.)
pp. 61 - 67
COMP2023-27
On a Self-Stabilizing Algorithm for a 1-Minimal Minus Domination Based on Loop Composition
Tota Yamada, Yonghwan Kim, Yoshiaki Katayama (NIT)
pp. 68 - 75
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.