IEICE Technical Report

Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2010-04-22 / Issue Date : 2010-04-15

COMP2010-1
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs
Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Pref. Univ.)
pp. 1 - 8

COMP2010-2
Counting the number of dominating sets in graph classes
Shuji Kijima (Kyushu Univ), Yoshio Okamoto (Tokyo Inst. of Tech.), Takeaki Uno (NII)
pp. 9 - 15

COMP2010-3
Averaging Techniques for Competitive Auctions
Takayuki Ichiba (Nomura Research Institute), Kazuo Iwama (Kyoto Univ.)
pp. 17 - 24

COMP2010-4
Complete classification of small realizable oriented matroids
Hiroyuki Miyata, Sonoko Moriyama (Tokyo Univ.), Komei Fukuda (ETH Zurich)
pp. 25 - 31

COMP2010-5
Effect of Corner Information in Simultaneous Placement of k Rectangles and Tableaux
Shinya Anzai, Jinhee Chun, Ryosei Kasai (Tohoku Univ.), Matias Korman (Univ. Libre de Bruxelles), Takeshi Tokuyama (Tohoku Univ.)
pp. 33 - 38

COMP2010-6
Transposition Invariant Fully Compressed Pattern Matching Algorithm
Wataru Matsubara, Ayumi Shinohara (Tohoku Univ.)
pp. 39 - 45

COMP2010-7
Elementary Formal System with Nonterminal Symbols
Tomohiko Koide, Ayumi Shinohara (Tohoku Univ.)
pp. 47 - 54

COMP2010-8
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Takuro Fukunaga (Kyoto Univ.)
pp. 55 - 62

COMP2010-9
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
Hiroshi Hirai (Kyoto Univ.)
pp. 63 - 70

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan