Online edition: ISSN 2432-6380
[TOP] | [2016] | [2017] | [2018] | [2019] | [2020] | [2021] | [2022] | [Japanese] / [English]
COMP2019-10
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.)
pp. 1 - 5
COMP2019-11
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)
pp. 7 - 14
COMP2019-12
[Invited Talk]
New Polynomial Delay Bounds for Maximal Subgraph Enumeration by Proximity Search
Alessio Conte, Takeaki Uno (NII)
p. 15
COMP2019-13
Space efficient separator algorithms for planar graphs
Osamu Watanabe (Tokyo Inst. of Tech.)
pp. 17 - 24
COMP2019-14
Fine-grained quantum computational supremacy
Tomoyuki Morimae (Kyoto Univ.), Suguru Tamaki (Univ. Hyogo)
p. 25
COMP2019-15
On the number of complete k-ary trees of height h
Yosuke Kikuchi (NIT, Tsuyama College), Yume Ikeda (NTTEast-Minamikanto)
pp. 27 - 32
COMP2019-16
Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams
Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.)
p. 33
COMP2019-17
(See Japanese page.)
pp. 35 - 42
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.