Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [2013] | [Japanese] / [English]
COMP2010-10
Voronoi Game on a Path
Masashi Kiyomi (JAIST), Toshiki Saitoh (JST), Ryuhei Uehara (JAIST)
pp. 1 - 5
COMP2010-11
Efficient Pattern Matching for Acyclic Regular Expressions
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura (Hokkaido Univ.)
pp. 23 - 29
COMP2010-12
Binary Image Processing with Limited Storage
Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas, USA), Lilian Buzer (Univ. Paris-Est/LABINFO-IGM), David Kirkpatrick (Univ. of British Columbia)
pp. 31 - 38
COMP2010-13
On the t-pebbling number of weighted graphs
Michael Hoffmann (Inst. of Theoretical Computer Sci, ETH Zurich), Jiri Matousek (Charles Univ.), Yoshio Okamoto (Tokyo Inst. of Tech.), Philipp Zumstein (Inst. of Theoretical Computer Sci, ETH Zurich)
pp. 39 - 41
COMP2010-14
Spanning tree congestion of k-outerplanar graphs
Hans L. Bodlaender (Utrecht Univ.), Kyohei Kozawa (J-POWER), Takayoshi Matsushima (Gunma Univ.), Yota Otachi (Tohoku Univ.)
pp. 43 - 46
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.