Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2013-03-18 09:55 |
Gifu |
Gifu University |
On the eternal vertex cover number of trees composed of elementary bipartite graphs Shota Inoue, Hisashi Araki, Toshihiro Fujito (Toyohashi Univ. of Tech) COMP2012-52 |
Suppose, when some number of guards are placed on some vertices in graph $G$, one of its edges is attacked. If a guard i... [more] |
COMP2012-52 pp.1-4 |
COMP |
2013-03-18 10:20 |
Gifu |
Gifu University |
Reservoir sampling in stream using O(log log n) space Naoto Sonoda, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.) COMP2012-53 |
This paper presents a simple algorithm for uniform sampling of elements in a stream; that is for reservoir sampling uses... [more] |
COMP2012-53 pp.5-12 |
COMP |
2013-03-18 10:55 |
Gifu |
Gifu University |
[Tutorial Lecture]
Introduction to Computational Complexity Theory (2):Algorithmic Approaches to Lower Bounds of Computational Complexity Akinori Kawachi (Tokyo Inst. of Tech.) COMP2012-54 |
[more] |
COMP2012-54 p.13 |
COMP |
2013-03-18 13:20 |
Gifu |
Gifu University |
Auxiliary Skip Links for Quick Traversal of ZDDs to Manipulate Large-Scale Sparse Matrices Shin-ichi Minato (Hokkaido Univ.) COMP2012-55 |
ZDD (Zero-suppressed Binary Decision Diagram) is known as an efficient data structure for representing and manipulating ... [more] |
COMP2012-55 pp.15-22 |
COMP |
2013-03-18 13:45 |
Gifu |
Gifu University |
Compact and Fast Indices Based on Zero-Suppressed Binary Decision Diagrams Shuhei Denzumi (Hokkaido Univ.), Jun Kawahara (NAIST), Koji Tsuda (AIST/JST), Hiroki Arimura (Hokkaido Univ.), Shin-ichi Minato (Hokkaido Univ./JST), Kunihiko Sadakane (NII) COMP2012-56 |
In many real-life problems, we are often faced with manipulating families of sets. Manipulation of large-scale set famil... [more] |
COMP2012-56 pp.23-30 |
COMP |
2013-03-18 14:10 |
Gifu |
Gifu University |
A note on lower bounds of the girth of planar C_7-colorable graphs Tatsuo Asano, Akihiro Uejima (Osaka Electro-Comm. Univ.) COMP2012-57 |
This report considers the $C_{2k+1}$-coloring problem, which is a subproblem for the $n/k$-coloring problem,
where $n,... [more] |
COMP2012-57 pp.31-38 |
COMP |
2013-03-18 14:35 |
Gifu |
Gifu University |
Comparative evaluation of two constructions of Hamiltonian circuits for generating picturesque mazes with illusory images Fuhito Yanagitani, Akihiro Uejima (Osaka Electro-Comm. Univ.) COMP2012-58 |
This report proposes a new type of maze generation as a generalization of the {\it picturesque maze generation problem},... [more] |
COMP2012-58 pp.39-46 |
COMP |
2013-03-18 15:15 |
Gifu |
Gifu University |
A New Exact Algorithm for the Maximum Weight Clique Problem Based on an Upper Bound Calculated by Dynamic Programming Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda (Kobe Univ.) COMP2012-59 |
Given a vertex-weighted undirected graph, the problem to find the clique of maximum weight is the maximum weight clique ... [more] |
COMP2012-59 pp.47-53 |
COMP |
2013-03-18 15:40 |
Gifu |
Gifu University |
Schnorr and Kurtz randomness versions of Merkel's criterion Kenshi Miyabe (Kyoto Univ.) COMP2012-60 |
In the theory of algorithmic randomness,
Martin-L\"of randomness has been well studied
and we have known many characte... [more] |
COMP2012-60 pp.55-59 |
COMP |
2013-03-18 16:05 |
Gifu |
Gifu University |
An extension of code by introducing partial orders on codewords Etsuro Moriya (Waseda Univ.) COMP2012-61 |
A code is a language $X$, the set of codewords, such that any word in $X^+$ can be factorized uniquely as the concatenat... [more] |
COMP2012-61 pp.61-68 |
COMP |
2013-03-18 16:40 |
Gifu |
Gifu University |
[Fellow Memorial Lecture]
The significance and power of computation theory: The role in information society Takeshi Tokuyama (Tohoku Univ.) COMP2012-62 |
[more] |
COMP2012-62 p.69 |