IEICE Technical Report

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

Theoretical Foundations of Computing

Workshop Date : 2016-10-21 / Issue Date : 2016-10-14

COMP2016-23
Random Popular Matchings with Incomplete Preference Lists
Suthee Ruangwises, Toshiya Itoh (Tokyo Tech.)
pp. 1 - 8

COMP2016-24
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems
Francois Le Gall (Kyoto Univ.)
pp. 9 - 15

COMP2016-25
A faster parameterized algorithm for Pseudoforest Deletion
Hans Bodlaender (Utrecht Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST)
pp. 17 - 21

COMP2016-26
Physical Bucket Sort with Two Kinds of Items
Atsuki Nagao, Shuhei Yoshizawa, Hiro Ito (UEC)
pp. 23 - 27

COMP2016-27
An Exact Algorithm for the Satisfiability of Depth-2 SYM-AND Circuits.
Kazuhisa Seto (Seikei Univ.), Suguru Tamaki (Kyoto Univ.), Junichi Teruyama (NII)
pp. 29 - 34

COMP2016-28
On lower bounds for the complexity of the Frobenius problem and its subproblems
Shunichi Matsubara (Aoyama Gakuin Univ.)
pp. 35 - 37

COMP2016-29
A Research of the Number of the Convex Configurations of Silhouette Puzzles
Hitoshi Iwai, Jungo Shibuya, Ryuhei Uehara (JAIST)
pp. 39 - 45

COMP2016-30
On label size maximization for rotating maps
Yusuke Yokosuka, Keiko Imai (Chuo Univ.)
pp. 47 - 52

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