| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2020)
Search Results: Keywords 'from:2020-12-04 to:2020-12-04'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2020-12-04 09:30 |
Online | Online | Counting Weave Diagrams Tomio Hirata (Nagoya Univ.), Isamu Matsuura (Aichi Center for Industry and Science Technology)  COMP2020-18 |
Usually, a woven fabric is constructed by repeating a small pattern unit up down and left right like tiling. We call suc... [more] | COMP2020-18 pp.1-7 |
| COMP | 2020-12-04 10:00 |
Online | Online | A Fast ZDD-Based Method for Enumerating All Solutions of Cost-Bounded Combinatorial Problems Shin-ichi Minato (Kyoto Univ.), Mutsunori Banbara (Nagoya Univ.), Takashi Horiyama (Hokkaido Univ.), Jun Kawahara (Kyoto Univ.), Ichigaku Takigawa (Hokkaido Univ.), Yutaro Yamaguchi (Kyushu Univ.) COMP2020-19 |
[more] | COMP2020-19 pp.8-15 |
| COMP | 2020-12-04 10:40 |
Online | Online | Efficient Construction of Cryptarithm Catalogues over DFA Koya Watanabe, Diptarama Hendrian, Ryo Yoshinaka (Tohoku Univ.), Takashi Horiyama (Hokkaido Univ.), Ayumi Shinohara (Tohoku Univ.) COMP2020-20 |
A cryptarithm is a mathematical puzzle where given an arithmetic equation written with letters rather than numerals, a p... [more] | COMP2020-20 pp.16-23 |
| COMP | 2020-12-04 11:10 |
Online | Online | Capacitated Network Design Games on a Generalized Fair Allocation Model Toshiyuki Hirose (Nagoya Univ.), Tesshu Hanaka (Chuo Univ.), Hirotaka Ono (Nagoya Univ.) COMP2020-21 |
The cost-sharing connection game is a variant of routing games on a network. In this model, given a directed graph with ... [more] | COMP2020-21 pp.24-27 |
| COMP | 2020-12-04 12:50 |
Online | Online | [Invited Talk]
A Blossom Algorithm for Maximum Edge-Disjoint T-Paths Satoru Iwata (Univ. of Tokyo), Yu Yokoi (NII) COMP2020-22 |
Let $G=(V,E)$ be a multigraph with a set $Tsubseteq V$ of terminals. A path in $G$ is called a $T$-path if its ends are ... [more] | COMP2020-22 p.28 |
| COMP | 2020-12-04 14:00 |
Online | Online | [Invited Talk]
How many vertices does a random walk miss in a network with moderately increasing the number of vertices? Shuji Kijima (Kyushu Univ.), Nobutaka Shimizu (The Univ. of Tokyo), Takeharu Shiraga (Chuo Univ.) COMP2020-23 |
Real networks are often dynamic. In response to it, analyses of algorithms on dynamic networks attract more and more att... [more] | COMP2020-23 p.29 |
| COMP | 2020-12-04 15:20 |
Online | Online | Fixed Parameter Algorithms for L(p,1)-labeling Kazuma Kawai (Nagoya Univ), Tesshu Hanaka (Chuo Univ), Hirotaka Ono (Nagoya Univ) COMP2020-24 |
Given a graph, an $L(p,1)$-labeling of the graph is an assignment $f$ from the vertex set to the set of nonnegative inte... [more] | COMP2020-24 pp.30-32 |
| COMP | 2020-12-04 15:50 |
Online | Online | An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion Yuuki Aoike (Yokohama City Univ.), Tatsuya Gima (Nagoya Univ.), Tesshu Hanaka (Chuo Univ.), Masashi Kiyomi (Yokohama City Univ.), Yasuaki Kobayashi, Yusuke Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Yota Otachi (Nagoya Univ.) COMP2020-25 |
[more] | COMP2020-25 pp.33-38 |
| COMP | 2020-12-04 16:30 |
Online | Online | Approximation algorithms for the maximum happy set problem Yuichi Asahiro (Kyushu Sangyo Univ), Hiroshi Eto (Kyushu Univ), Tesshu Hanaka (Chuo Univ), Guohui Lin (U. Alberta), Eiji Miyano, Ippei Terabaru (Kyutech) COMP2020-26 |
[more] | COMP2020-26 pp.39-43 |
| COMP | 2020-12-04 17:00 |
Online | Online | Quantum sampling verification with offline quantum communication Taiga Hiroka (Kyoto Univ), Yuki Takeuchi (NTT CS Lab.), Tomoyuki Morimae (Kyoto Univ) COMP2020-27 |
[more] | COMP2020-27 pp.44-50 |
[Return to Top Page]