Information and Systems-Theoretical Foundations of Computing(Date:2022/10/26)

Presentation
A Moderately Exponential Time Satisfiability Algorithm for Linear-Sized Deterministic Width-2 Branching Programs

Tomu Makita(Seikei Univ.),  Atsuki Nagao(Ochanomizu Univ.),  Tatsuki Okada(Seikei Univ.),  Kazuhisa Seto(Hokkaido Univ.),  Junichi Teruyama(Univ. of Hyogo),  

[Date]2022-10-26
[Paper #]COMP2022-14
Enumeration of Transversal Edge-Partitions

Koki Shinraku(Iwate Univ.),  Yazhou He(Iwate Univ.),  Katsuhisa Yamanaka(Iwate Univ.),  Takashi Hirayama(Iwate Univ.),  

[Date]2022-10-26
[Paper #]COMP2022-16
Evacuation problems on grid networks with uniform transit time and uniform capacity

Yuki Tokuni(Uoh),  Naoki Katoh(Uoh),  Junichi Teruyama(Uoh),  Yuya Higashikawa(Uoh),  

[Date]2022-10-26
[Paper #]COMP2022-15
Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints

Yasuaki Kobayashi(Hokkaido Univ.),  Kazuhiro Kurita(Nagoya Univ.),  Kunihiro Wasa(Hosei Univ.),  

[Date]2022-10-26
[Paper #]COMP2022-17
A number that has an elementary trace function and no elementary sum approximation

Keita Hiroshima(Kyoto Univ.),  Akitoshi Kawamura(Kyoto Univ.),  

[Date]2022-10-26
[Paper #]COMP2022-19
Computational Complexity of List Constructing

Takashi Harada(Kochi Univ. of Tech.),  Takashi Fuchino(Kanagawa Univ.),  Ken Tanaka(Kanagawa Univ.),  Kenji Mikawa(MIT),  

[Date]2022-10-26
[Paper #]COMP2022-20
[Invited Talk] Hedonic Games and Treewidth Revisited

Tesshu Hanaka(Kyushu Univ.),  Michael Lampis(LAMSADE),  

[Date]2022-10-26
[Paper #]COMP2022-18
[Invited Talk] Graph Search Parallelization and Applications

Kazuki Yoshizoe(Kyushu Univ.),  

[Date]2022-10-26
[Paper #]COMP2022-13