Print edition: ISSN 0913-5685
Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2005-28
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
Yosuke Kikuchi (JST), Toru Araki (Iwate Univ.)
pp. 1 - 7
COMP2005-29
A construction method of synchronous reversible cellular automata using simple asynchronous logic elements
Jin-Shan Qi, Kenichi Morita (Hiroshima Univ.)
pp. 9 - 16
COMP2005-30
Laminar Structure of Ptolemaic Graphs and Its Applications
Ryuhei Uehara (JAIST), Yushi Uno (Osaka Pref. Univ.)
pp. 17 - 24
COMP2005-31
The q-gram distance for ordered unlabeled trees
Nobuhito Ohkura, Kouichi Hirata (Kyushu Inst. Tech.), Tetsuji Kuboyama (Univ. Tokyo), Masateru Harao (Kyushu Inst. Tech.)
pp. 25 - 29
COMP2005-32
A Polynomial Space Polynomial Delay Algorithm for Enumerating Maximal Motifs in a Sequence
Hiroki Arimura (Hokkaido Univ.), Takeaki Uno (NII)
pp. 31 - 38
COMP2005-33
An algorithm for generating vertex sequences to extract maximum weight cliques quickly
Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.)
pp. 39 - 42
COMP2005-34
A Weakly-Adaptive Condition-Based Consensus Algorithm in Asynchronous Distributed Systems
Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.)
pp. 43 - 48
COMP2005-35
How Easy to Learn Linear Ranking Functions
Atsuyoshi Nakamura (Hokkaido Univ.)
pp. 49 - 53