Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2009-49
NP-Completeness and Enumeration of Number Link Puzzle
Kouichi Kotsuma, Yasuhiko Takenaga (Univ. of Electro-Comm.)
pp. 1 - 7
COMP2009-50
Bayesian Joint Optimization for Matrix Factorization and Clustering
Tikara Hosino (Nihon Unisys, Ltd.)
pp. 9 - 12
COMP2009-51
Note on Optimal Path for an Electric Vehicle
Kimikazu Kato (Nihon Unisys, Ltd.)
pp. 13 - 17
COMP2009-52
Deterministic Constant-Work-Space Algorithms for two dimensional Linear Programming
Tetsuo Asano (JAIST), Danny Chen (Univ. of Notre Dame), Takeshi Tokuyama (Tohoku Univ.)
pp. 19 - 24
COMP2009-53
On the Geodesic Diameter of Polygonal Domains
Sang Won Bae (POSTECH), Matias Korman (Universite Libre de Broxelles, Belgium), Yoshio Okamoto (Tokyo Inst. of Tech.)
pp. 25 - 32
COMP2009-54
On the standard local search for the independent set problem on d-claw free graphs
Kazuyuki Kitayama, Toshihiro Fujito (Toyohashi Univ. of Tech.)
pp. 33 - 38
COMP2009-55
Algorithm for detecting topological information in sensor network
Ryota Narita, Takeshi Tokuyama (Tohoku Univ)
pp. 39 - 45
COMP2009-56
[Invited Talk]
Inverse Rendering for Computer Graphics
Imari Sato (NII)
p. 47
COMP2009-57
Online graph exploration algorithms for cycles and trees by multiple number of searchers
Yuya Higashikawa, Naoki Katoh, Shin-ichi Tanigawa (Kyoto Univ.), Stefan Langerman (ULB)
pp. 49 - 56
COMP2009-58
Time and Space Efficient Graph Exploration by a Mobile Agent Using Whiteboard
Yuichi Sudo, Daisuke Baba, Junya Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.)
pp. 57 - 64
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.