IEICE Technical Committee Submission System
Advance Program
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top  Go Back   / [HTML] / [HTML(simple)] / [TEXT]  [Japanese] / [English] 


Technical Committee on Theoretical Foundations of Computing (COMP) [schedule] [select]
Chair Hiroo Itoh (Univ. of Electro-Comm.)
Vice Chair Yuushi Uno (Osaka Pref. Univ.)
Secretary Kazuhisa Seto (Seikei Univ.), Toshiki Saito (Kobe Univ.)

Conference Date Tue, Mar 7, 2017 10:30 - 15:50
Topics  
Conference Place  
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

Tue, Mar 7 AM 
10:30 - 12:00
(1) 10:30-11:00 Development of Peg Solitaire Font COMP2016-50 Taishi Oikawa (Ichinoseki National College of Tech.), Kazuaki Yamazaki, Tomoko Taniguchi, Ryuhei Uehara (JAIST)
(2) 11:00-11:30 Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover COMP2016-51 Asahi Takaoka (Kanagawa Univ.)
(3) 11:30-12:00 Extension of the Vertex Cover Problem to the Size-t Cycle Cover Problems COMP2016-52 Batchunag Dashdemberel, Osamu Watanabe (Tokyo Tech.)
  12:00-13:30 Lunch Break ( 90 min. )
Tue, Mar 7 PM 
13:30 - 14:30
(4) 13:30-14:30 [Invited Talk]
Beating Brute Force for Systems of Polynomial Equations over Finite Fields COMP2016-53
Daniel Lokshtanov (U. Bergen), Ramamohan Paturi (UC San Diego), Suguru Tamaki (Kyoto U.), Ryan Williams (MIT), Huacheng Yu (Stanford U.)
  14:30-14:50 Break ( 20 min. )
Tue, Mar 7 PM 
14:50 - 15:50
(5) 14:50-15:20 An Optimal Online Graph Search Algorithm in terms of the Number of Searchers COMP2016-54 Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.)
(6) 15:20-15:50 Improved Analysis of Greedy Algorithm for Sorting k-Sets in Bins COMP2016-55 Kento Shimizu, Tatsuya Mitsuhashi, Kazuhisa Seto (Seikei Univ.)

Announcement for Speakers
General TalkEach speech will have 25 minutes for presentation and 5 minutes for discussion.

Contact Address and Latest Schedule Information
COMP Technical Committee on Theoretical Foundations of Computing (COMP)   [Latest Schedule]
Contact Address Toshiki Saitoh
Graduate School of Engineering, Kobe University.
Address: 1-1 Rokkodai, Nada, Kobe, 657-8501, Japan.
E--mail: iheedeptbe-u 


Last modified: 2017-01-26 14:37:48


Notification: Mail addresses are partially hidden against SPAM.

[Download Paper's Information (in Japanese)] <-- Press download button after click here.
 
[Cover and Index of IEICE Technical Report by Issue]
 

[Presentation and Participation FAQ] (in Japanese)
 

[Return to COMP Schedule Page]   /  
 
 Go Top  Go Back   / [HTML] / [HTML(simple)] / [TEXT]  [Japanese] / [English] 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan