IEICE Technical Report

Print edition: ISSN 0913-5685      Online edition: ISSN 2432-6380

Volume 111, Number 113

Theoretical Foundations of Computing

Workshop Date : 2011-06-30 / Issue Date : 2011-06-23

[PREV] [NEXT]

[TOP] | [2008] | [2009] | [2010] | [2011] | [2012] | [2013] | [2014] | [Japanese] / [English]

[PROGRAM] [BULK PDF DOWNLOAD]


Table of contents

COMP2011-16
Convex Grid Drawings of Internally Triconnected Plane Graphs
Tomoya Hashimoto (Kwansei Gakuin Univ.), Kazuyuki Miura (Fukushima Univ.), Takao Nishizeki (Kwansei Gakuin Univ.)
pp. 1 - 8

COMP2011-17
Partitioning Trees with Supply, Demand and Edge-Capacity
Masaki Kawabata, Takao Nishizeki (Kwansei Gakuin Univ.)
pp. 9 - 16

COMP2011-18
Absolutely Secure Message Transmission Using a Key Sharing Graph
Yoshihiro Indo (Kwansei Gakuin Univ.), Takaaki Mizuki (Tohoku Univ.), Takao Nishizeki (Kwansei Gakuin Univ.)
pp. 17 - 23

COMP2011-19
Improving the Cloud Revenue using a Failure-aware Server Management Model
Laiping Zhao, Kouichi Sakurai (Kyushu Univ.)
pp. 25 - 32

COMP2011-20
On the Constant Depth Circuit Complexity of Subgraph Isomorphism on Random Graphs
Koutarou Nakagawa (Tokyo Inst. of Tech.)
pp. 33 - 37

COMP2011-21
Complexity of Maximum r-Regular Induced Connected Subgraph Problems
Yuichi Asahiro (Kyushu Sangyo Univ), Hiroshi Eto, Eiji Miyano (Kyutech)
pp. 39 - 44

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.


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