Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2008-46
A lower bound for tree-width of Cartesian product graphs
Kyohei Kozawa, Yota Otachi, Koichi Yamazaki (Gunma Univ.)
pp. 1 - 5
COMP2008-47
Game Theoretic Analysis of Malicious Faults Which are Undetectable by Local Checks
Jun Kiniwa, Kensaku Kikuta (Univ. Hyogo)
pp. 7 - 14
COMP2008-48
A Winning Strategy for the Achievement Game of a Certain Pentahex on Hexagonal Boards
Yuuki Nohara, Akihiro Matsuura (Tokyo Denki Univ.)
pp. 15 - 21
COMP2008-49
A Simple Generation of Multi-dimensional Partitions
Yosuke Kikuchi (Tsuyama National Coll. Tech.), Katsuhisa Yamanaka (The University of Electro-Communications), Shin-ichi Nakano (Gunma Univ.)
pp. 23 - 29
COMP2008-50
[Invited Talk]
On the Circuit Complexity of Subgraph Isomorphism
Kazuyuki Amano (Gunma Univ.)
p. 31
COMP2008-51
Improved Formula Size Lower Bounds for Monotone Self-Dual Boolean Functions
Kenya Ueno (Univ. of Tokyo)
pp. 33 - 40
COMP2008-52
A 4-competitive strategy for exploring unknown polygons
Xuehou Tan (Tokai Univ.)
pp. 41 - 48
COMP2008-53
[Invited Talk]
FOCS 2008 Report
Takashi Horiyama (Saitama Univ.)
p. 49
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.