Information and Systems-Theoretical Foundations of Computing(Date:2017/03/07)

Presentation
[Invited Talk] Beating Brute Force for Systems of Polynomial Equations over Finite Fields

Daniel Lokshtanov(U. Bergen),  Ramamohan Paturi(UC San Diego),  Suguru Tamaki(Kyoto U.),  Ryan Williams(MIT),  Huacheng Yu(Stanford U.),  

[Date]2017-03-07
[Paper #]COMP2016-53
Development of Peg Solitaire Font

Taishi Oikawa(Ichinoseki National College of Tech.),  Kazuaki Yamazaki(JAIST),  Tomoko Taniguchi(JAIST),  Ryuhei Uehara(JAIST),  

[Date]2017-03-07
[Paper #]COMP2016-50
Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover

Asahi Takaoka(Kanagawa Univ.),  

[Date]2017-03-07
[Paper #]COMP2016-51
An Optimal Online Graph Search Algorithm in terms of the Number of Searchers

Takahiro Yakami(Kyushu Univ.),  Yukiko Yamauchi(Kyushu Univ.),  Shuji Kijima(Kyushu Univ.),  Masafumi Yamashita(Kyushu Univ.),  

[Date]2017-03-07
[Paper #]COMP2016-54
Extension of the Vertex Cover Problem to the Size-t Cycle Cover Problems

Batchunag Dashdemberel(Tokyo Tech.),  Osamu Watanabe(Tokyo Tech.),  

[Date]2017-03-07
[Paper #]COMP2016-52
Improved Analysis of Greedy Algorithm for Sorting k-Sets in Bins

Kento Shimizu(Seikei Univ.),  Tatsuya Mitsuhashi(Seikei Univ.),  Kazuhisa Seto(Seikei Univ.),  

[Date]2017-03-07
[Paper #]COMP2016-55