IEICE Technical Report

Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2020-10-23 / Issue Date : 2020-10-16

COMP2020-11
On a Complete Visibility for Autonomous Mobile Robots with Lights in Asynchronous scheduler on a Grid Plane
Yuno Ishida, Yonghwan Kim, Yoshiaki Katayama (NIT)
pp. 1 - 8

COMP2020-12
[Invited Talk] Index reduction for differential-algebraic equations with mixed matrices
Satoru Iwata, Taihei Oki (The Univ. of Tokyo), Mizuyo Takamatsu (Chuo Univ.)
p. 9

COMP2020-13
Mathematical Characterization and Computational Complexity of Anti-Slide Puzzles
Ko Minamisawa, Ryuhei Uehara (JAIST), Masao Hara (Tokai Univ.)
pp. 10 - 17

COMP2020-14
The odd depth tree problem
Hiroshi Nishiyama (Kyushu Univ.)
pp. 18 - 25

COMP2020-15
Optimal online packet scheduling for 2-bounded delay buffer management with lookahead
Koji M. Kobayashi (UT)
pp. 26 - 32

COMP2020-16
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs
Kazuaki Yamazaki, Qian Mengze, Ryuhei Uehara (JAIST)
pp. 33 - 38

COMP2020-17
Polynomial Delay Enumeration for Steiner Problems
Yasuaki Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Kunihiro Wasa (Toyohashi Tech)
pp. 39 - 46

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