Print edition: ISSN 0913-5685
Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2005-1
A fast algorithm for calculating an upper bound of the weight of the maximum weighted clique
Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.)
pp. 1 - 4
COMP2005-2
Exact Algorithms for the Two-Dimensional Strip Packing Problem with Rotations
Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi (Kyoto Univ.)
pp. 5 - 14
COMP2005-3
Branch-and-Bound Algorithms for MAX-2-SAT
Yuichi Koga, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi (Kyoto Univ.), Toshihide Ibaraki (Kwansei Gakuin Univ.)
pp. 15 - 24
COMP2005-4
On time and space complexity of functions
Kenya Ueno (Univ. of Tokyo)
pp. 25 - 30
COMP2005-5
Quantum Algorithms for the Hidden Subgroup Problem over Semidirect Product Groups of Cyclic Groups
Yoshifumi Inui, Francois Le Gall (Univ. of Tokyo/JST)
pp. 31 - 38
COMP2005-6
Truthful Auctions with Limited Ranges of Bids
Daisuke Sumita, Takashi Horiyama, Kazuo Iwama (Kyoto Univ.)
pp. 39 - 47
COMP2005-7
On the Complexity of Inferring a Graph from Path Frequency
Tatsuya Akutsu, Daiji Fukagawa (Kyoto Univ.)
pp. 49 - 55
COMP2005-8
Lowering Eccentricity of a Tree by Node-Upgrading
Toshihide Ibaraki (Kwansei Gakuin Univ.), Xiao-Guang Yang (CAS)
pp. 57 - 65