Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2008-23
Polygons Folding to Plural Incongruent Orthogonal Boxes
Jun Mitani (Univ. of Tsukuba/JST), Ryuhei Uehara (JAIST)
pp. 1 - 8
COMP2008-24
Counting Connected Spanning Subgraphs with at Most p+q+1 Edges in a Complete Bipartite Graph Kp,q
Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Technology)
pp. 9 - 16
COMP2008-25
Average-case Analysis of Spectral Method for Clustering
Ryo Sakaguchi (Tokyo Inst.Tech.)
pp. 17 - 22
COMP2008-26
Analysis of a spectral method for random satisfiable 3CNF formulas
Tomonri Ando (Tokyo Inst. Tech.)
pp. 23 - 28
COMP2008-27
On presortedness measures of inputs for block sorting
Shin'ichi Nakayama, Kojiro Kobayashi (Soka Univ.)
pp. 29 - 36
COMP2008-28
[Invited Talk]
On the hardness of reoptimization of NP-hard problems
Juraj Hromkovic (ETH Zurich)
pp. 37 - 38
COMP2008-29
Convergence problem of Mobile Robots with Uniformly-Inaccurate Sensors
Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT)
pp. 39 - 46
COMP2008-30
On Gathering Problem in a Ring for 2n Autonomous Mobile Robots
Kotaro Haba, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT)
pp. 47 - 54
COMP2008-31
On Circle Formation by Four Autonomous Mobile Robots
Keita Hashimoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT)
pp. 55 - 62
COMP2008-32
An analysis of a generalized multi-organization scheduling on unrelated parallel machines
Fukuhito Ooshita (Osaka Univ.), Tomoko Izumi, Taisuke Izumi (Nagoya Inst. of Tech.)
pp. 63 - 70
COMP2008-33
Improved Competitive Ratios of Online Buffer Management Algorithms for Multi-Queue Switches in QoS Networks
Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.)
pp. 71 - 78
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.