Print edition: ISSN 0913-5685
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2006-31
Convex Grid Drawings of Plane Graphs with Rectangular Contours
Akira Kamada (Tohoku Univ.), Kazuyuki Miura (Fukushima Univ.), Takao Nishizeki (Tohoku Univ.)
pp. 1 - 8
COMP2006-32
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs
Kazuyuki Miura (Fukushima Univ.), Tetsuya Matsuno, Takao Nishizeki (Tohoku Univ.)
pp. 9 - 15
COMP2006-33
Approximability of Partitioning Graphs with Supply and Demand
Takehiro Ito (Tohoku Univ.), Erik D.Demaine (MIT), Xiao Zhou, Takao Nishizeki (Tohoku Univ.)
pp. 17 - 23
COMP2006-34
Efficient Algorithms for Airline problem
Ryuhei Uehara (JAIST)
pp. 25 - 31
COMP2006-35
Byzantine Agreement on the Order of Processing Received Requests is Solvable Deterministically in Asynchronous Systems
Junya Nakamura (Toyohashi Univ. of Tech.), Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.)
pp. 33 - 40
COMP2006-36
On the Generative Power of Multiple Context-Free Grammars and Macro Grammars
Hiroyuki Seki, Yuki Kato (NAIST)
pp. 41 - 48
COMP2006-37
The Number of Possible Weave Patterns in Case of Using Long-Eye Heald
Isamu Matsuura, Masayoshi Andoh (AITEC), Tomio Hirata (Nagoya Univ.)
pp. 49 - 56
COMP2006-38
A Randomness Based Analysis on the Data Size Needed for Generating Reliable Rules
Kazuya Haraguchi (Kyoto Univ.), Mutsunori Yagiura (Nagoya Univ.), Endre Boros (Rutgers Univ.), Toshihide Ibaraki (Kwansei Gakuin Univ.)
pp. 57 - 64
COMP2006-39
On the Computer-Assisted Proof of Linear Lower Bounds on Circuit Size
Kazuyuki Amano (Gunma Univ.)
pp. 65 - 70
COMP2006-40
An Exponentioal Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity
Kei Uchizawa, Eiji Takimoto (Tohoku Univ.)
pp. 71 - 76
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.