IEICE Technical Report

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

Theoretical Foundations of Computing

Workshop Date : 2013-04-24 / Issue Date : 2013-04-17

COMP2013-1
Answering Reachability Queries by Extending Pruned BFSs to Paths
Yosuke Yano, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo)
pp. 1 - 8

COMP2013-2
Approximate Permuted Pattern Matching and Indexing Structure for Multi-Track Data
Hiroyuki Ota, Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.)
pp. 9 - 16

COMP2013-3
Analysis of the Maximum Sum of Exponents of Runs in Strings
Kazuhiko Kusano, Ryosuke Okuta, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.)
pp. 17 - 24

COMP2013-4
[Invited Talk] Introduction on JST ERATO Kawarabayashi Large Graph Project
Ken-ichi Kawarabayashi (NII)
p. 25

COMP2013-5
Space-efficient Polygon Reconstruction from Angle Information
Jinhee Chun, Ricardo Garcia, Takeshi Tokuyama (Tohoku Univ.)
pp. 27 - 31

COMP2013-6
Notes on Parametric Analysis of k-Route Flow
Hiroshi Imai, Jean-Francois Baffier, Hidefumi Hiraishi (Univ. of Tokyo)
pp. 33 - 34

COMP2013-7
An Algorithm for Finding an Orthogonal Drawing of a Hierarchical Graph
Tetsuya Araki, Sumio Masuda, Ikunori Matoba, Kazuaki Yamaguchi, Toshiki Saitoh (Kobe Univ.)
pp. 35 - 42

COMP2013-8
Computational complexity and an integer programming model of Shakashaka
Erik Demaine (Massachusetts Inst. of Tech.), Yoshio Okamoto (Univ. of Electro-Comm.), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Prefecture Univ.)
pp. 43 - 48

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