Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2007-18
A Computaional Complexity for finding a Maximum Clique in a Graph with Maximum Degree 4
Hiroaki Nakanishi, Etsuji Tomita (UEC)
pp. 1 - 7
COMP2007-19
Linear Time Enumeration of Isolated Bicliques with Part Size Proportion Bounded by Constants
Hiromitsu Miyagawa, Hiro Ito, Kazuo Iwama (Kyoto Univ.)
pp. 9 - 16
COMP2007-20
Testing k-Edge-Connectivity of Digraphs
Yuichi Yoshida, Hiro Ito (Kyoto Univ.)
pp. 17 - 23
COMP2007-21
Towards closing a gap between worst-case and average-case NP hardness
Akinori Kawachi, Osamu Watanabe (Tokyo Inst. of Tech.)
pp. 25 - 32
COMP2007-22
Deductive Inference for the Interiors and Exteriors of Horn Theories
Kazuhisa Makino (Univ. of Tokyo), Hirotaka Ono (Kyushu Univ.)
pp. 33 - 39
COMP2007-23
Weighted Random Popular Matchings
Toshiya Itoh, Osamu Watanabe (Tokyo Inst. of Tech.)
pp. 41 - 48
COMP2007-24
Simple efficient algorithm for MPQ-tree of an interval graph
Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara (JAIST)
pp. 49 - 54
COMP2007-25
On the complexity of planar n/k-coloring problems
Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.)
pp. 55 - 62
COMP2007-26
A Tight Upper Bound on Online Buffer Management for Two-port Shared-Memory Switches
Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.)
pp. 63 - 70
COMP2007-27
A Difference-Optimal Algorithm for Gathering Autonomous Mobile Robots with Dynamic Compasses
Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (Nagoya Inst.of Tech.)
pp. 71 - 78
COMP2007-28
The Firing Squad Synchronization Problems for Number Patterns on 7-Segment Display
Kazuya Yamashita (Univ. Toyama), Eigo Takemasa (Univ. Toyama/Nihon Softech), Mitsuru Sakai, Sadaki Hirose (Univ. Toyama)
pp. 79 - 84
COMP2007-29
On an Efficient Implementation of a DFA-based Algorithm for the Exetended Regular Expression Membership and Search Problems
Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano NCT)
pp. 85 - 92
COMP2007-30
Linear-Time Recognition of Tree Structures by Deterministic Linear Pushdown Tree Automata
Akio Fujiyoshi (Ibaraki Univ.)
pp. 93 - 99
COMP2007-31
Succinct Array Structure for Patricia Trie
Susumu Yata, Kazuhiro Morita, Masao Fuketa, Jun-ichi Aoe (Tokushima Univ.)
pp. 101 - 106
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.