Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2009] | [2010] | [2011] | [2012] | [2013] | [2014] | [2015] | [Japanese] / [English]
COMP2012-43
Analysis of Alternative Rumor Spreading on Scale-Free Networks
-- For Simple Two Type Degree Networks --
Hiroki Yamaguchi, Osamu Watanabe (Tokyo Tech)
pp. 1 - 5
COMP2012-44
Constructing Position Heaps for Various Pattern Matching
Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.)
pp. 7 - 14
COMP2012-45
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
Takuro Fukunaga (Kyoto Univ.)
pp. 15 - 22
COMP2012-46
Hamiltonicity of 4-connected projective-planar graphs
Ken-ichi Kawarabayashi, Kenta Ozeki (NII)
p. 23
COMP2012-47
[Tutorial Lecture]
Introduction to Computational Complexity Theory (1): Basics and Average-Case Computational Complexity
Osamu Watanabe (Tokyo Tech)
p. 25
COMP2012-48
A Lower Bound of Minimum Energy Broadcast on Two Dimensional Triangular Grid Wireless Networks
Youhei Kouchi, Akira Matsubayashi (Kanazawa Univ.)
pp. 27 - 31
COMP2012-49
Reconfiguration of List L(2,1)-Labelings in a Graph
Takehiro Ito, Kazuto Kawamura (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Xiao Zhou (Tohoku Univ.)
pp. 33 - 40
COMP2012-50
Enumeration of PLCP-orientations on the 4-cube
Komei Fukuda, Lorenz Klaus (ETH Zurich), Hiroyuki Miyata (Tohoku Univ.)
pp. 41 - 48
COMP2012-51
Comparison of Worst-case Polytopes for the Simplex Method
-- Klee-Minty Cubes Are Also Goldfarb Cubes --
Bernd G aertner, Christian Helbling (ETH Zurich), Yoshiki Ota, Takeru Takahashi (Tohoku Univ.)
pp. 49 - 53
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.