Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2008-15
Online Uniformity of Integer Points on a Line
Tetsuo Asano (JAIST)
pp. 1 - 6
COMP2008-16
Design and Analysis of Geometric Routing Algorithms Using Random Local Neighbors
Kazushige Sato, Takeshi Tokuyama (Tohoku U.)
pp. 7 - 14
COMP2008-17
A Context Tree Weighting Algorithm with an Adaptive Window
Tomohiro I, Kohei Hatano, Hideo Bannai, Masayuki Takeda (Kyushu Univ.)
pp. 15 - 22
COMP2008-18
Efficient XPath Tree Pattern Matching Algorithm over XML Data Stream
Kazuhito Hagio, Takashi Ohgami, Masayuki Takeda (Kyushu Univ.)
pp. 23 - 30
COMP2008-19
Constant-Working-Space Image Scan with a Given Angle
Tetsuo Asano (JAIST)
pp. 31 - 36
COMP2008-20
Simulation of a certain Voting Game
Ryuhei Uehara (JAIST), Yasuyuki Kawamura (Ehime Univ.), Hiromitsu Matsunaga, Mitsuo Motoki (JAIST)
pp. 37 - 42
COMP2008-21
Formulas for Counting Connected Spanning Subgraphs with at Most $n+1$ Edges in Graphs $K_{n}-e$, $K_{n}\cdot e$
Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Tech)
pp. 43 - 48
COMP2008-22
Property Testing on k-Vertex-Connectivity of Graphs
Yuichi Yoshida, Hiro Ito (Kyoto Univ.)
pp. 49 - 55
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.