Online edition: ISSN 2432-6380
[TOP] | [2015] | [2016] | [2017] | [2018] | [2019] | [2020] | [2021] | [Japanese] / [English]
COMP2018-31
Max-Min Dispersion Problems
Takashi Horiyama (Saitama Univ.), Shin-ichi Nakano (Gunma Univ.), Toshiki Saitoh (KIT), Koki Suetsugu (Kyoto Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno, Kunihiro Wasa (NII)
pp. 1 - 6
COMP2018-32
Linear-Time Algorithms for the Generalized Coloring Reconfiguration Problem
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou (Tohoku Univ.)
pp. 7 - 14
COMP2018-33
Minimization of an M-convex Function under L1-distance Constraint
Akiyoshi Shioura (Tokyo Inst. Tech.)
pp. 15 - 20
COMP2018-34
[Invited Talk]
A weighted linear matroid parity algorithm
Satoru Iwata (Univ. Tokyo), Yusuke Kobayashi (Kyoto Univ.)
p. 21
COMP2018-35
[Invited Talk]
0/1/all CSPs, Half-Integral A-path Packing, and Linear-Time FPT Algorithms
Yoichi Iwata (NII), Yutaro Yamaguchi (Osaka Univ.), Yuichi Yoshida (NII)
p. 23
COMP2018-36
Unpopularity Factor in the Marriage and Roommates Problems
Suthee Ruangwises, Toshiya Itoh (TokyoTech)
pp. 25 - 30
COMP2018-37
AND Protocols Using Only Uniform Shuffles
Suthee Ruangwises, Toshiya Itoh (TokyoTech)
pp. 31 - 37
COMP2018-38
A Millionaire Protocol Using a Standard Deck of Cards
Daiki Miyahara (Tohoku Univ./AIST), Takaaki Mizuki, Hideaki Sone (Tohoku Univ.)
pp. 39 - 45
COMP2018-39
Self-stabilizing exploration of a graph by a mobile agent
Yuki Hara, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.)
pp. 47 - 54
COMP2018-40
Enumerating Floorplans with Columns
Katsuhisa Yamanaka (Iwate Univ.), Md.Saidur Rahman (BUET), Shin-ichi Nakano (Gunma Univ.)
pp. 55 - 59
COMP2018-41
Experimental evaluation of an approach based on de Bruijn graphs for Order/Degree problem
Tamami Okada, Hiroki Kanda, Yosuke Kikuchi (NIT, Tsuyama College)
pp. 61 - 67
COMP2018-42
Distance 2-domination number of Hypercubes
Nana Kawamura, Yosuke Kikuchi (NIT, Tsuyama College)
pp. 69 - 72
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.