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

===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
Chair: Koichi Wada (Hosei Univ.) Vice Chair: Toshimitsu Masuzawa (Osaka Univ.)
Secretary: Sayaka Kamei (Hiroshima Univ.), Hisashi Koga (Univ. of Electro-Comm.)

===============================================
Special Interest Group on Algorithms (IPSJ-AL)


DATE:
Fri, Jun 13, 2014 13:05 - 17:45
Sat, Jun 14, 2014 09:00 - 14:45

PLACE:


TOPICS:


----------------------------------------
Fri, Jun 13 PM (13:00 - 17:45)
----------------------------------------

(1) 13:05 - 13:30


(2) 13:30 - 13:55


(3)/COMP 13:55 - 14:20
The Independent Feedback Vertex Set Problem
Yuma Tamura, Takehiro Ito, Xiao Zhou (Tohoku Univ.)

----- Break ( 15 min. ) -----

(4) 14:35 - 15:00


(5)/COMP 15:00 - 15:25
Algorithmic construction of track layouts of graph subdivisions
Miki Miyauchi (NTT)

(6) 15:25 - 15:50


----- Break ( 15 min. ) -----

(7) 16:05 - 16:30


(8) 16:30 - 16:55


(9)/COMP 16:55 - 17:20
A Gathering Problem for Mobile Fat Robots in a Grid without the Global Coodinate System
Yoshinobu Ito, Yoshiaki Katayama (Nagoya Inst. of Tech.), Koichi Wada (hosei Univ.)

(10) 17:20 - 17:45


----------------------------------------
Sat, Jun 14 AM (09:00 - 14:45)
----------------------------------------

(11)/COMP 09:00 - 09:25
role of mixedness in MBQC
Tomoyuki Morimae (Gunma Univ.)

(12)/COMP 09:25 - 09:50
Computational Complexity of Irredundancy of Local Hamiltonian
Ryo Kawasaki, Harumichi Nishimura (Nagoya Univ.)

(13) 09:50 - 10:15


----- Break ( 15 min. ) -----

(14)/COMP 10:30 - 10:55
On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity
Shuichi Hirahara, Akitoshi Kawamura (Univ. of Tokyo)

(15)/COMP 10:55 - 11:20
A Further Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem
Hiroaki Nakanishi (Waseda Univ.), Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC)

(16) 11:20 - 11:45


(17) 11:45 - 12:10


----- Lunch ( 80 min. ) -----

(18) 13:30 - 13:55


(19)/COMP 13:55 - 14:20
Enumeration of Polyominoes for pmg Tiling
Jun Nishioka, Takashi Horiyama (Saitama Univ.)

(20) 14:20 - 14:45


# Information for speakers
General Talk will have 20 minutes for presentation and 5 minutes for discussion.


=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# FUTURE SCHEDULE:

Tue, Sep 2, 2014: Toyohashi University of Technology [Tue, Jun 10]

# SECRETARY:
Hisashi Koga
Graduate School of Information Systems,
University of Electro-Communications,
1-5-1 Chofugaoka, Chofu-si,
Tokyo 182-8585, Japan
E-mail: isc

=== Special Interest Group on Algorithms (IPSJ-AL) ===


Last modified: 2014-05-08 21:07:40


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]   /   [Return to IPSJ-AL Schedule Page]   /  
 
 Go Top  Go Back   Prev COMP Conf / Next COMP Conf [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