Information and Systems-Image Engineering(Date:2022/03/06)

Presentation
Enumerating Labeled Graphs Under Given Constraints Using Answer Set Programming

Yu Nakahata(NAIST),  

[Date]2022-03-06
[Paper #]COMP2021-36
Collective Human Intelligence Genome

Kumon Tokumaru(Writer),  

[Date]2022-03-06
[Paper #]COMP2021-39
An Ambiguity Hierarchy of Weighted Context-free Grammars

Yusuke Inoue(Nagoya Univ.),  Kenji Hashimoto(Nagoya Univ.),  Hiroyuki Seki(Nagoya Univ.),  

[Date]2022-03-06
[Paper #]COMP2021-31
Fixed-parameter tractability of linear extension diameter

Tesshu Hanaka(Nagoya Univ),  Yasuaki Kobayashi(Kyoto Univ),  

[Date]2022-03-06
[Paper #]COMP2021-37
On properties of Kirkman schedules applied the partial team swap

Yusuke Kashiwagi(Seikei Univ),  

[Date]2022-03-06
[Paper #]COMP2021-33
On Approximation of Power Bounded Degree Deletion

Kento Mukae(TUT),  Toshihiro Fujito(TUT),  

[Date]2022-03-06
[Paper #]COMP2021-38
EXPTIME-Completeness of Generalized Tsume-Chushogi

Akihiro Uejima(Osaka Electro-Communication Univ.),  Yuya Kiba(Osaka Electro-Communication Univ.),  Junichi Omori(Osaka Electro-Communication Univ.),  Masaaki Sato(Osaka Electro-Communication Univ.),  

[Date]2022-03-06
[Paper #]COMP2021-32
[Invited Talk] Monotone edge flips to an orientation of maximum edge-connectivity `a la Nash-Williams

Takehiro Ito(Tohoku Univ.),  Yuni Iwamasa(Kyoto Univ.),  Naonori Kakimura(Keio Univ.),  Naoyuki Kamiyama(Kyushu Univ.),  Yusuke Kobayashi(Kyoto Univ.),  Shun-ichi Maezawa(UEC),  Yuta Nozaki(Hiroshima Univ.),  Yoshio Okamoto(UEC),  Kenta Ozeki(YNU),  

[Date]2022-03-06
[Paper #]COMP2021-34
[Invited Talk] Is There a Strongest Die in a Set of Dice with the Same Mean Pips?

Shang Lu(Kyushu Univ.),  Shuji Kijima(Kyushu Univ.),  

[Date]2022-03-06
[Paper #]COMP2021-35