Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2009-18
Compressed Pattern Matching on VF Codes
Takuya Kida (Hokkaido Univ.)
pp. 1 - 8
COMP2009-19
Reconfiguration of List Edge-Colorings in a Graph
Takehiro Ito (Tohoku Univ.), Marcin Kaminski (Univ. Libre de Bruxelles), Erik D. Demaine (MIT)
pp. 9 - 16
COMP2009-20
The Longest Path Problem and Its Application to the Path Selection in JR Urban Areas
Takashi Horiyama, Kosuke Higuchi (Saitama Univ.)
pp. 17 - 21
COMP2009-21
Algorithms for optimal segmentation of regions decomposable into basic shapes
Ryosei Kasai, Jinhee Chun, Matias Korman, Takeshi Tokuyama (Tohoku Univ.)
pp. 23 - 30
COMP2009-22
Approximating Edit Distance of Unordered Trees of Bounded Height
Daiji Fukagawa (NII), Tatsuya Akutsu (Kyoto Univ.), Atsuhiro Takasu (NII)
pp. 31 - 36
COMP2009-23
A Polynomial-time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise
Masaki Yamamoto (Tokai Univ.), Shuji Kijima (Kyoto Univ.), Yasuko Matsui (Tokai Univ.)
pp. 37 - 44
COMP2009-24
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
Yoshio Okamoto (Tokyo Inst. of Tech.), Ryuhei Uehara (JAIST), Takeaki Uno (NII)
pp. 45 - 52
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.