IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

Technical Committee on Theoretical Foundations of Computing (COMP)  (Searched in: 2014)

Search Results: Keywords 'from:2014-06-13 to:2014-06-13'
[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 8 of 8  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP, IPSJ-AL 2014-06-13
13:55		 Ehime Matsuyama, Ehime The Independent Feedback Vertex Set Problem
Yuma Tamura, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2014-8		  [more] COMP2014-8
pp.13-18
COMP, IPSJ-AL 2014-06-13
15:00		 Ehime Matsuyama, Ehime Algorithmic construction of track layouts of graph subdivisions
Miki Miyauchi (NTT) COMP2014-9		 This paper studies the problem of track layout of bipartite graph subdivisions. Previously the author shows that for eve... [more] COMP2014-9
pp.27-32
COMP, IPSJ-AL 2014-06-13
16:55		 Ehime Matsuyama, Ehime 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.) COMP2014-10		  [more] COMP2014-10
pp.53-59
COMP, IPSJ-AL 2014-06-14
09:00		 Ehime Matsuyama, Ehime role of mixedness in MBQC
Tomoyuki Morimae (Gunma Univ.) 		 [more]
COMP, IPSJ-AL 2014-06-14
09:25		 Ehime Matsuyama, Ehime Computational Complexity of Irredundancy of Local Hamiltonian
Ryo Kawasaki, Harumichi Nishimura (Nagoya Univ.) COMP2014-11		 Gharibian and Kempe [ICALP2012] introduced a problem on irredundancy of local Hamiltonians, named as QIRR, which asks wh... [more] COMP2014-11
pp.69-76
COMP, IPSJ-AL 2014-06-14
10:30		 Ehime Matsuyama, Ehime On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity
Shuichi Hirahara, Akitoshi Kawamura (Univ. of Tokyo) COMP2014-12		 Allender, Friedman, and Gasarch recently proved an upper bound of PSPACE
for the class $DTTR_K$
of decidable language... [more]		 COMP2014-12
pp.77-83
COMP, IPSJ-AL 2014-06-14
10:55		 Ehime Matsuyama, Ehime 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) COMP2014-13		 This paper presents a further improved extended result for polynomial-time solvability of the maximum clique problem, th... [more] COMP2014-13
pp.85-92
COMP, IPSJ-AL 2014-06-14
13:55		 Ehime Matsuyama, Ehime Enumeration of Polyominoes for pmg Tiling
Jun Nishioka, Takashi Horiyama (Saitama Univ.) COMP2014-14		 Polyominoes are the two dimensional shapes made by connecting n equal-sized squares, joined along their edges. In this p... [more] COMP2014-14
pp.107-114
 Results 1 - 8 of 8  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan