Print edition: ISSN 0913-5685
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2006-17
Track layout of bipartite graph subdivisions
Miki Miyauchi (NTT)
pp. 1 - 5
COMP2006-18
On the Computational Complexity of Interview Timetabling Problems
Yuuki Kiyonari, Eiji Miyano (KIT), Shuichi Miyazaki (Kyoto Univ.)
pp. 7 - 14
COMP2006-19
Reductions for Monotone Boolean Circuits
Kazuo Iwama, Hiroki Morizumi (Kyoto Univ.)
pp. 15 - 19
COMP2006-20
Relationships between Data-Privacy and Key-Privacy
Ryotaro Hayashi, Keisuke Tanaka (Tokyo Inst. of Tech.)
pp. 21 - 27
COMP2006-21
Polynomial-Time Algorithm for Finding a Solution in the Core of a Multicommodity Flow Game
Kazuhiro Karasawa, Toshinori Yamada (Saitama Univ.)
pp. 29 - 34
COMP2006-22
Improvement of repeat search using factor oracles
Hisashi Iwasaki (Tokyo Inst. of Tech.)
pp. 35 - 42
COMP2006-23
Simple Rank/Select Dictionaries
Kunihiko Sadakane (Kyushu U)
pp. 43 - 48
COMP2006-24
Notes on Voronoi Diagrams for Pure Quantum States
Kimikazu Kato (Nihon Unisys/Univ. of Tokyo), Mayumi Oto (Toshiba), Hiroshi Imai (Univ. of Tokyo), Keiko Imai (Chuo Univ.)
pp. 49 - 55
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.