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

Search Results: Keywords 'from:2011-06-30 to:2011-06-30'
[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 2011-06-30
10:30		 Hiroshima Hiroshima Univ. Convex Grid Drawings of Internally Triconnected Plane Graphs
Tomoya Hashimoto (Kwansei Gakuin Univ.), Kazuyuki Miura (Fukushima Univ.), Takao Nishizeki (Kwansei Gakuin Univ.) COMP2011-16		  [more] COMP2011-16
pp.1-8
COMP 2011-06-30
11:05		 Hiroshima Hiroshima Univ. Partitioning Trees with Supply, Demand and Edge-Capacity
Masaki Kawabata, Takao Nishizeki (Kwansei Gakuin Univ.) COMP2011-17		 Let T be a given tree. Each vertex of T is either a supply vertex or a demand vertex, and is assigned a positive number,... [more] COMP2011-17
pp.9-16
COMP 2011-06-30
13:00		 Hiroshima Hiroshima Univ. Absolutely Secure Message Transmission Using a Key Sharing Graph
Yoshihiro Indo (Kwansei Gakuin Univ.), Takaaki Mizuki (Tohoku Univ.), Takao Nishizeki (Kwansei Gakuin Univ.) COMP2011-18		 Assume that there are players and an eavesdropper of unlimited computational power and that several pairs of players hav... [more] COMP2011-18
pp.17-23
COMP 2011-06-30
13:35		 Hiroshima Hiroshima Univ. Improving the Cloud Revenue using a Failure-aware Server Management Model
Laiping Zhao, Kouichi Sakurai (Kyushu Univ.) COMP2011-19		  [more] COMP2011-19
pp.25-32
COMP 2011-06-30
14:40		 Hiroshima Hiroshima Univ. On the Constant Depth Circuit Complexity of Subgraph Isomorphism on Random Graphs
Koutarou Nakagawa (Tokyo Inst. of Tech.) COMP2011-20		 The AC$^0$ circuit complexity of $k$-clique on random graphs is already known. Rossman established the lower bound $n^{\... [more] COMP2011-20
pp.33-37
COMP 2011-06-30
15:15		 Hiroshima Hiroshima Univ. Complexity of Maximum r-Regular Induced Connected Subgraph Problems
Yuichi Asahiro (Kyushu Sangyo Univ), Hiroshi Eto, Eiji Miyano (Kyutech) COMP2011-21		  [more] COMP2011-21
pp.39-44
 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