| Conference Date |
Fri, Dec 22, 2023 10:00 - 16:50 |
| Topics |
Theoretical Computer Science, etc |
| Conference Place |
Machinaka campus, Miyazaki University |
| Address |
Muratake Bld., 3-4-6 Tachibanadori Higashi, Miyazaki-shi, Miyazaki-ken 880-0805 Japan |
| Transportation Guide |
https://www.miyazaki-u.ac.jp/facilities/related-facility/machinaka-campus.html |
Contact
Person |
Hosei University, Kunihiro Wasa |
| Registration Fee |
This workshop will be held as the IEICE workshop in fully electronic publishing. Registration fee will be necessary except the speakers and participants other than the participants to workshop(s) in non-electronic publishing. See the registration fee page. We request the registration fee or presentation fee to participants who will attend the workshop(s) on COMP. |
Fri, Dec 22 PM
10:00 - 16:50 |
| (1) |
10:00-10:25 |
Approximation Algorithms for Generalizations of Strong Connectivity Augmentation Problem |
Ryoma Norose, Yutaro Yamaguchi (Osaka Univ.) |
| (2) |
10:25-10:50 |
Algorithms for Optimally Shifting Intervals under Intersection Graph Models |
Honorato Droguett Nicolas, Kazuhiro Kurita (Nagoya Univ.), Tesshu Hanaka (Kyushu Univ.), Hirotaka Ono (Nagoya Univ.) |
| (3) |
10:50-11:15 |
On the minimization of quasi M^natural-convex functions |
Kazuo Murota (ISM, TMU), Akiyoshi Shioura (Tokyo Tech) |
| |
11:15-11:25 |
Break ( 10 min. ) |
| (4) |
11:25-12:15 |
[Invited Talk]
Fast Algorithms for Maximum Matching Problem |
Yutaro Yamaguchi (Osaka Univ.) |
| |
12:15-13:20 |
Lunch Break ( 65 min. ) |
| (5) |
13:20-13:45 |
A fixed-parameter algorithm for dissimilar shortest paths |
Ryo Funayama, Yasuaki Kobayashi (Hokkaido Univ.) |
| (6) |
13:45-14:10 |
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.) |
| (7) |
14:10-14:35 |
Efficient Enumeration of Quantum Circuits Realizing Boolean Functions by Toffoli Gate Count |
Shigeru Yamashita (Ritsumeikan Univ.), Takashi Horiyama (Hokkaido Univ.), Norihito Yasuda (NTT) |
| |
14:35-14:45 |
Break ( 10 min. ) |
| (8) |
14:45-15:00 |
[Short Paper]
Finding Diverse Longest Common Subsequences of a Set of Strings |
Yuto Shida, Hiroki Arimura, Yasuaki Kobayashi (Hokkaido Univ.) |
| (9) |
15:00-15:25 |
|
|
| (10) |
15:25-15:50 |
The ultimate signs of second-order holonomic sequences |
Akitoshi Kawamura, Fugen Hagihara (Kyoto Univ.) |
| |
15:50-16:00 |
Break ( 10 min. ) |
| (11) |
16:00-16:25 |
Uniform deployment of mobile robots with restricted views in path graphs |
Kazuki Hasegawa, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) |
| (12) |
16:25-16:50 |
On a Self-Stabilizing Algorithm for a 1-Minimal Minus Domination Based on Loop Composition |
Tota Yamada, Yonghwan Kim, Yoshiaki Katayama (NIT) |
: comp-
n
