IEICE Technical Report

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

Volume 114, Number 509

Theoretical Foundations of Computing

Workshop Date : 2015-03-09 / Issue Date : 2015-03-02

[PREV] [NEXT]

[TOP] | [2011] | [2012] | [2013] | [2014] | [2015] | [2016] | [2017] | [Japanese] / [English]

[PROGRAM] [BULK PDF DOWNLOAD]


Table of contents

COMP2014-42
On a Gathering Problem for Large size Fat Robots in a Grid
Yoshinobu Ito, Yoshiaki Katayama (NIT), Koichi Wada (Hosei)
pp. 1 - 8

COMP2014-43
A Note on Irreversible 2-Conversion Sets in Subcubic Graphs
Asahi Takaoka, Shuichi Ueno (Tokyo Tech)
pp. 9 - 11

COMP2014-44
Node Overlap Removal with Basis Nodes
Noboru Abe, Hiroaki Oh, Kouhei Inoue (Osaka Electro-Communication Univ.)
pp. 13 - 17

COMP2014-45
ZDD Construction for Maximal Independent Set Enumeration on Hypergraph
Teruji Sugaya (OUJ), Takahisa Toda (UEC), Shin-ichi Minato (HU)
pp. 19 - 27

COMP2014-46
[Invited Talk] Algorithms in natural computing : a parallel Exhaustive search and an optimization technique using biological behaviors
Akihiro Fujiwara (Kyutech)
p. 29

COMP2014-47
Maximum Supply Rate and Minimum Supply Increase Rate of Supply and Demand Networks
Hironori Yoshihara, Takao Nishizeki (KGU)
pp. 31 - 37

COMP2014-48
Efficient Algorithms for Parametric Supply-Demand Tree Networks
Naoki Takahashi, Takao Nishizeki (Kwansei Gakuin Univ)
pp. 39 - 46

COMP2014-49
NP-hardness of Finding Minimum Test Set for Detecting Stuck-at and/or Bridging Faults in a Reversible Circuit
Hibiki Takakura, Toshinori Yamada (Saitama Univ.)
pp. 47 - 51

COMP2014-50
On a 2-approximation Self-stabilizing Algorithm for the Maximum Leaf Spanning Tree
Keisuke Okamoto, Yoshiaki Katayama (NIT)
pp. 53 - 60

COMP2014-51
Tangle and ideal
Koichi Yamazaki (Gunma Univ.)
pp. 61 - 64

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