Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2010] | [2011] | [2012] | [2013] | [2014] | [2015] | [2016] | [Japanese] / [English]
COMP2013-9
Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Five Terminals
Daiki Hoshika, Eiji Miyano (Kyushu Inst. of Tech.)
pp. 7 - 12
COMP2013-10
A New Subclass of P-matrix Linear Complementarity Problems
Komei Fukuda (ETH Zurich), Lorenz Klaus (NII/JST), Hiroyuki Miyata (Tohoku Univ.)
pp. 25 - 32
COMP2013-11
Query Complexity of Witness Finding
Akinori Kawachi (Tokyo Inst. of Tech.), Benjamin Rossman (NII), Osamu Watanabe (Tokyo Inst. of Tech.)
pp. 39 - 46
COMP2013-12
Efficient Enumeration of Directed Binary Perfect Phylogenies using Dynamic Programming
Kazuki Morito (SEIBU CONSTRUCTION), Toshiki Saitoh, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.)
pp. 63 - 70
COMP2013-13
On Complexities of Parallel Sort Algorithms on AGPU model
Atsushi Koike, Kunihiko Sadakane, Hoa Vu (NII)
pp. 75 - 80
COMP2013-14
Complexity of Counting Output Patterns of Logic Circuits
Kei Uchizawa (Yamagata Univ.), Zhenghong Wang (Tohoku Univ.), Hiroki Morizumi (Shimane Univ.), Xiao Zhou (Tohoku Univ.)
pp. 97 - 102
COMP2013-15
Testing Subdivision-Freeness
-- Property Testing Meets Structural Graph Theory --
Ken-ichi Kawarabayashi (NII), Yuichi Yoshida (NII/PFI)
pp. 117 - 121
COMP2013-16
A New Framework for Connected Components Labeling of Binary Images
Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas)
pp. 127 - 134
COMP2013-17
On parallel complexity of MapReduce computation
Koichi Wada (Hosei Univ.), Taisuke Izumi (Nagoya Inst. of Tech.)
pp. 143 - 147
COMP2013-18
Label Size Maximization for Rotating Maps
Yusuke Yokosuka, Keiko Imai (Chuo Univ.)
pp. 157 - 162
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.