Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2014] | [2015] | [2016] | [2017] | [2018] | [2019] | [2020] | [Japanese] / [English]
COMP2017-45
Relationship between Retweet and Structure of the Twitter Network
Tatsuya Fukushima (Waseda Univ.)
pp. 1 - 7
COMP2017-46
The Growth of Non-Giant Component in Preferentially-Attached Networks
Takahiro Shimomura, Hiroshi Toyoizumi (Waseda Univ.)
pp. 9 - 16
COMP2017-47
[Invited Talk]
Stochastic Packing Integer Programs with Few Queries
Takanori Maehara (RIKEN), Yutaro Yamaguchi (Osaka Univ./RIKEN)
p. 17
COMP2017-48
[Invited Talk]
Space-Efficient Algorithms for Longest Increasing Subsequence
Masashi Kiyomi (Yokohama City Univ.), Hirotaka Ono (Nagoya Univ.), Yota Otachi (Kumamoto Univ.), Pascal Schweitzer (TU Kaiserslautern), Jun Tarui (UEC)
p. 19
COMP2017-49
Analysis of Polynomial-time Learnability with Membership Queries
Mikito Nanashima (Tokyo Inst. of Tech.)
pp. 21 - 26
COMP2017-50
A recognition algorithm for simple-triangle graphs
Asahi Takaoka (Kanagawa Univ.)
pp. 27 - 34
COMP2017-51
Efficient Computation of Betweenness Centrality by Graph Decompositions and their Applications to Real-world Networks
Tatsuya Inoha (Osaka Pref. Univ.), Kunihiko Sadakane (Univ. of Tokyo), Yushi Uno (Osaka Pref. Univ.), Yuuma Yonebayashi (Univ. of Tokyo)
pp. 35 - 42
COMP2017-52
Implementation of global partition algorithm and verification of hyperfiniteness for property testing of real-world networks
Yutaro Honda (Osaka Pref. Univ.), Hiro Ito (UEC), Munehiko Sasajima (Univ. of Hyogo), Yushi Uno (Osaka Pref. Univ.)
pp. 43 - 50
COMP2017-53
On Settlement Fund Circulation Problem
Hitoshi Hayakawa, Toshimasa Ishii (Hokkaido Univ.), Hirotaka Ono (Nagoya Univ.), Yushi Uno (Osaka Pref. Univ.)
pp. 51 - 58
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.