IEICE Technical Report

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

Theoretical Foundations of Computing

Workshop Date : 2009-10-16 / Issue Date : 2009-10-09

COMP2009-32
On simultaneous optimal segmentation of digital objects
Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama (Tohoku Univ.)
pp. 1 - 8

COMP2009-33
Small Grid Drawings of Planar Graphs with Balanced Bipartition
Xiao Zhou, Takashi Hikino, Takao Nishizeki (Tohoku Univ.)
pp. 9 - 15

COMP2009-34
Reformulation of the scheme for computing tree-width and minimum fill-in
Masanobu Furuse, Yota Otachi, Koichi Yamazaki (Gunma Univ.)
pp. 17 - 24

COMP2009-35
[Invited Talk] Algorithms for Conflict Resolution
Dao-Zhi Zeng (Tohoku Univ.)
p. 25

COMP2009-36
Algorithm for Finding Minimum Reaction Cut of Metabolic Network
Takeyuki Tamura (Kyoto Univ.), Kazuhiro Takemoto (Univ. of Tokyo.), Tatsuya Akutsu (Kyoto Univ.)
pp. 27 - 34

COMP2009-37
An Improved Approximation Lower Bound for Maximum Cardinality Almost Stable Matching Problem
Koki Hamada, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.)
pp. 35 - 40

COMP2009-38
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds
Kenya Ueno (Univ. of Tokyo)
pp. 41 - 48

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