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: 2016)

Search Results: Keywords 'from:2017-03-07 to:2017-03-07'
[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 6 of 6  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2017-03-07
10:30		 Aichi Nanzan University Development of Peg Solitaire Font
Taishi Oikawa (Ichinoseki National College of Tech.), Kazuaki Yamazaki, Tomoko Taniguchi, Ryuhei Uehara (JAIST) COMP2016-50		  [more] COMP2016-50
pp.1-4
COMP 2017-03-07
11:00		 Aichi Nanzan University Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover
Asahi Takaoka (Kanagawa Univ.) COMP2016-51		 A simple-triangle graph (also known as a PI graph) is the intersection graph of a family of triangles defined by a point... [more] COMP2016-51
pp.5-9
COMP 2017-03-07
11:30		 Aichi Nanzan University Extension of the Vertex Cover Problem to the Size-t Cycle Cover Problems
Batchunag Dashdemberel, Osamu Watanabe (Tokyo Tech.) COMP2016-52		 We consider an extension of the Vertex Cover (VC) problem.
For a given graph,
its (edge) vertex cover (in short, VC) i... [more]		 COMP2016-52
pp.11-18
COMP 2017-03-07
13:30		 Aichi Nanzan University [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.) COMP2016-53		 Solving systems of multivariate polynomial equations over finite fields is a fundamental problem in mathematics, science... [more] COMP2016-53
p.19
COMP 2017-03-07
14:50		 Aichi Nanzan University An Optimal Online Graph Search Algorithm in terms of the Number of Searchers
Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.) COMP2016-54		 The graph search problem is the problem of searching for a mobile evader in a graph by mobile searchers.The edge search ... [more] COMP2016-54
pp.21-28
COMP 2017-03-07
15:20		 Aichi Nanzan University Improved Analysis of Greedy Algorithm for Sorting k-Sets in Bins
Kento Shimizu, Tatsuya Mitsuhashi, Kazuhisa Seto (Seikei Univ.) COMP2016-55		 (To be available after the conference date) [more] COMP2016-55
pp.29-32
 Results 1 - 6 of 6  /   
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