Information and Systems-Theoretical Foundations of Computing(Date:2009/06/22)

Presentation
表紙

,  

[Date]2009/6/22
[Paper #]
目次

,  

[Date]2009/6/22
[Paper #]
Compressed Pattern Matching on VF Codes

Takuya KIDA,  

[Date]2009/6/22
[Paper #]COMP2009-18
Reconfiguration of List Edge-Colorings in a Graph

Takehiro ITO,  Marcin KAMINSKI,  Erik D. DEMAINE,  

[Date]2009/6/22
[Paper #]COMP2009-19
The Longest Path Problem and Its Application to the Path Selection in JR Urban Areas

Takashi HORIYAMA,  Kosuke HIGUCHI,  

[Date]2009/6/22
[Paper #]COMP2009-20
Algorithms for optimal segmentation of regions decomposable into basic shapes

Ryosei KASAI,  Jinhee CHUN,  Matias KORMAN,  Takeshi TOKUYAMA,  

[Date]2009/6/22
[Paper #]COMP2009-21
Approximating Edit Distance of Unordered Trees of Bounded Height

Daiji FUKAGAWA,  Tatsuya AKUTSU,  Atsuhiro TAKASU,  

[Date]2009/6/22
[Paper #]COMP2009-22
A Polynomial-time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise

Masaki YAMAMOTO,  Shuji KIJIMA,  Yasuko MATSUI,  

[Date]2009/6/22
[Paper #]COMP2009-23
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes

Yoshio OKAMOTO,  Ryuhei UEHARA,  Takeaki UNO,  

[Date]2009/6/22
[Paper #]COMP2009-24
コンピュテーション研究専門委員会からのお知らせ

,  

[Date]2009/6/22
[Paper #]
複写される方へ

,  

[Date]2009/6/22
[Paper #]
Notice for Photocopying

,  

[Date]2009/6/22
[Paper #]
奥付

,  

[Date]2009/6/22
[Paper #]