Print edition: ISSN 0913-5685
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2006-10
Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs
Toshimasa Ishii (Otaru Univ. of Commerce)
pp. 1 - 8
COMP2006-11
Embedding of a Qualitative Representation Language on a Two-Dimensional Plane
Kazuko Takahashi, Takao Sumitomo (Kwansei Gakuin Univ.), Izumi Takeuti (AIST)
pp. 9 - 15
COMP2006-12
Approximating Tree Edit Distance Through String Edit Distance
Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII)
pp. 17 - 24
COMP2006-13
Average-case Analysis for the MAX-2SAT Problem
Osamu Watanabe, Masaki Yamamoto (Tokyo Inst. of Tech.)
pp. 25 - 32
COMP2006-14
(4,1)-Quantum Random Access Coding Does Not Exist
Masahito Hayashi (JST), Kazuo Iwama (Kyoto Univ.), Harumichi Nishimura (Osaka Prefecture Univ.), Rudy Raymond (Kyoto Univ.), Shigeru Yamashita (NAIST)
pp. 33 - 38
COMP2006-15
DNA Sequence Design Using Hidden Markov Models
Kazuya Maemura, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.)
pp. 39 - 46
COMP2006-16
DNA Sequence Design by Dynamic Neighborhood Searches
Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.)
pp. 47 - 54
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.