Print edition: ISSN 0913-5685
Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2005-18
Objective Function Adjustment Algorithm for Combinatorial Optimization Problems
Hiroki Tamura, Zheng Tang, Masahiro Ishii (Toyama Univ.)
pp. 1 - 4
COMP2005-19
Similar Pattern Generation of Complex Snow Crystals Grown under Changing Environment
Kazuya Yamashita, Sadaki Hirose (Toyama Univ.), Yasuhiro Ogoshi (Fukui Univ.), Haruhiko Kimura (Kanazawa Univ.)
pp. 5 - 8
COMP2005-20
A Method to Predict Computational Complexity of Adaptive Mesh Refinement by Fractal Analysis
Yasuhiro Kawasaki, Fumihiko Ino, Kenichi Hagihara (Osaka Univ.)
pp. 9 - 15
COMP2005-21
Improving competitive ratios of online buffer management for shared-memory switches
Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.)
pp. 17 - 22
COMP2005-22
The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages
Satoshi Okawa (The Univ. of Aizu), Sadaki Hirose (Toyama Univ.)
pp. 23 - 30
COMP2005-23
Online and Dynamic Detection of Squares in Strings
Jesper Jansson (Kyushu Univ./The Univ. of Hong Kong/Kyoto Univ.), Zeshan Peng (The Univ. of Hong Kong)
pp. 31 - 36
COMP2005-24
Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are Of Small Size
Seinosuke Toda (Nihon Univ.)
pp. 37 - 42
COMP2005-25
Approximation Algorithms for Source Location Problems with Flow Requirements
Mariko Sakashita (Kyoto Univ.), Kazuhisa Makino (Osaka Univ.), Satoru Fujishige (Kyoto Univ.)
pp. 43 - 50
COMP2005-26
A Deterministic Algorithm for Finding All Minimum k-Way Cuts
Yoko Kamidoi, Noriyoshi Yoshida (Hiroshima City Univ.), Hiroshi Nagamochi (Kyoto Univ.)
pp. 51 - 58
COMP2005-27
On Computational Power of Insertion-Deletion Systems without Using Contexts
Sadaki Hirose (Toyama Univ.), Satoshi Okawa (The Univ. of Aizu)
pp. 59 - 62