Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2008] | [2009] | [2010] | [2011] | [2012] | [2013] | [2014] | [Japanese] / [English]
COMP2011-36
A compact DFA representation using dual position automata
Hiroaki Yamamoto, Shogo Nakamura (Shinshu Univ.)
pp. 1 - 7
COMP2011-37
Relationship Between Coding Theory and Counting Perfect Matchings
Taisuke Izumi, Tadashi Wadayama (NITech)
pp. 9 - 15
COMP2011-38
Algorithms for Bandwidth Consecutive Multicolorings of Graphs
Kazuhide Nishikawa, Takao Nishizeki (Kwansei Gakuin Univ.), Xiao Zhou (Tohoku Univ.)
pp. 17 - 24
COMP2011-39
Reconfiguration of Vertex Covers in Trees and Cacti
Hiroyuki Nooka, Takehiro Ito, Xiao Zhou (Tohoku Univ.)
pp. 25 - 32
COMP2011-40
How to guard a graph against tree movements
Takayoshi Sakamaki, Toshihiro Fujito (TUT)
pp. 33 - 36
COMP2011-41
Minimizing Penalty on Upper and Lower Degree Constrained Graph Orientation
Yuichi Asahiro (Kyushu Sangyo Univ.), Jesper Jansson (Ochanomizu Univ.), Eiji Miyano (Kyushu Inst. of Tech.), Hirotaka Ono (Kyushu Univ.)
pp. 37 - 44
COMP2011-42
Pattern Formation Algorithm with Reference-Robot-Assignment Function for Asynchronous, Anonymous, Oblivious Robots
Yasumasa Sujaku, Kiyoaki Yoshida, Tosiro Koga (Kurume I. T.)
pp. 45 - 52
COMP2011-43
Minimizing the Number of Heald Frames under the Constraint of Uniform Tension
Isamu Matsuura (AITEC), Tomio Hirata (Nagoya Univ.)
pp. 53 - 60
COMP2011-44
Image Segmentation Using Maximum Weight Region
Jinhee Chun, Natsuda Kaothanthong, Takeshi Tokuyama (Tohoku Univ.)
pp. 61 - 67
COMP2011-45
[Invited Talk]
HOPE-Japan: High-resolution Online-map Project for East-Japan
Shin Aida (TUT)
p. 69
COMP2011-46
[Invited Talk]
Research Story on Distance Trisector Curves: How was it born and developed?
Tetsuo Asano (JAIST), Takeshi Tokuyama (Tohoku Univ.), Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Tokyo)
p. 71
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.