Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2007-11
On Approximation of Bookmark Assignments
Yuichi Asahiro (Kyushu Sangyo Univ.), Eiji Miyano (Kyushu Inst of Tech), Hirotaka Ono (Kyushu Univ.), Toshihide Murata (Kyushu Inst of Tech)
pp. 1 - 6
COMP2007-12
On noise-reduction effect of filters for Boolean functions
Masashi Karasaki, Eiji Takimoto (Tohoku Univ.)
pp. 7 - 12
COMP2007-13
An O(1.787^n)-time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
Takeyuki Tamura, Tatsuya Akutsu (Kyoto Univ.)
pp. 13 - 18
COMP2007-14
Optimal Highway Location Problem
Matias Korman, Takeshi Tokuyama (Tohoku Univ.)
pp. 19 - 24
COMP2007-15
Fixed-Parameter Tractability for Non-Crossing Spanning Trees
Magnus Halldorsson (Univ. of Iceland), Christian Knauer (Freie U.), Andreas Spillner (U. East Anglia), Takeshi Tokuyama (Tohoku U)
pp. 25 - 30
COMP2007-16
A dynamic programming algorithm for computing automorphism group of a giveｎ set of matrices
Seinosuke Toda (Nihon Univ.)
pp. 31 - 36
COMP2007-17
Optimality and Algorithms for the Balanced Edge Cover Problem
Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.)
pp. 37 - 42
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.