| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2019)
Search Results: Keywords 'from:2019-09-02 to:2019-09-02'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2019-09-02 10:50 |
Okayama | Tsushima Campus, Okayama University | Shortest Universal Sequences of Adjacent Transpositions Takehiro Ito (Tohoku Univ.), Jun Kawahara, Shin-ichi Minato (Kyoto Univ.), Yota Otachi (Kumamoto Univ.), Toshiki Saitoh (Kyutech), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII), Katsuhisa Yamanaka (Iwate Univ.), Ryo Yoshinaka (Tohoku Univ.)  COMP2019-10 |
Let $S = {s_1,s_2, ... , s_m}$ be a sequence of adjacent transpositions of $[n]={1,2,ldots ,n}$. We denote by $Comp(S) =... [more] | COMP2019-10 pp.1-5 |
| COMP | 2019-09-02 11:25 |
Okayama | Tsushima Campus, Okayama University | Speeding-up of Construction Algorithms for the Graph Coloring Problem Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC), Takeshi Okano, Takahumi Miyake, Noritaka Nishihara (OUS) COMP2019-11 |
DSATUR and RLF are well known as typical solution construction algorithms for the graph coloring problem, GCP, where GCP... [more] | COMP2019-11 pp.7-14 |
| COMP | 2019-09-02 13:00 |
Okayama | Tsushima Campus, Okayama University | [Invited Talk]
New Polynomial Delay Bounds for Maximal Subgraph Enumeration by Proximity Search Alessio Conte, Takeaki Uno (NII) COMP2019-12 |
[more] | COMP2019-12 p.15 |
| COMP | 2019-09-02 14:15 |
Okayama | Tsushima Campus, Okayama University | Space efficient separator algorithms for planar graphs Osamu Watanabe (Tokyo Inst. of Tech.) COMP2019-13 |
The Separator Theorem states that any planar graph G with n vertices has a separator of size O(n^{1/2}), that is, a set ... [more] | COMP2019-13 pp.17-24 |
| COMP | 2019-09-02 14:50 |
Okayama | Tsushima Campus, Okayama University | Fine-grained quantum computational supremacy Tomoyuki Morimae (Kyoto Univ.), Suguru Tamaki (Univ. Hyogo) COMP2019-14 |
It is known that probability distributions generated by quantum circuits cannot be approximately sampled by efficient cl... [more] | COMP2019-14 p.25 |
| COMP | 2019-09-02 15:25 |
Okayama | Tsushima Campus, Okayama University | On the number of complete k-ary trees of height h Yosuke Kikuchi (NIT, Tsuyama College), Yume Ikeda (NTTEast-Minamikanto) COMP2019-15 |
We give the number of complete $k$-ary trees of height $h$. It is known that the number of complete binary trees of hei... [more] |
COMP2019-15 pp.27-32 |
| COMP | 2019-09-02 16:00 |
Okayama | Tsushima Campus, Okayama University | Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-16 |
This research proposes algorithms that construct compressed data structures, called zero-suppressed binary decision dia... [more] |
COMP2019-16 p.33 |
| COMP | 2019-09-02 16:35 |
Okayama | Tsushima Campus, Okayama University | COMP2019-17 |
[more] | COMP2019-17 pp.35-42 |
[Return to Top Page]