| 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:2021-03-08 to:2021-03-08'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2021-03-08 09:45 |
Online | Online | On an Algorithm for minimizing the number of routers in Grid Networks among Three Points Yusuke Sawada, Yonghwan Kim, Yoshiaki Katayama (Nitech)  COMP2020-28 |
In this paper, we consider a route optimizing problem in grid networks. A grid network is an overlay-network which can b... [more] | COMP2020-28 pp.1-8 |
| COMP | 2021-03-08 10:15 |
Online | Online | On the gathering problem for fat robots on a grid with agreement on the origin and one-axis Kazuki Takahashi, Yonghwan Kim, Yoshiaki Katayama (Nitech) COMP2020-29 |
In this paper，we propose an algorithm solving a gathering problem for fat robots on a grid without the global coordinate... [more] | COMP2020-29 pp.9-16 |
| COMP | 2021-03-08 10:45 |
Online | Online | Team Assembling Problem by Kilobots Tang Run, Yamauchi Yukiko (Kyushu Univ.), Sebastien Tixeuil (Sorbonne Univ.) COMP2020-30 |
We consider the team assembling problem for a swarm of simple robots called Kilobots. The team assembling problem requir... [more] | COMP2020-30 pp.17-23 |
| COMP | 2021-03-08 11:30 |
Online | Online | [Invited Talk]
Tight Distributed Listing of Cliques Keren Censor-Hillel (Technion), Yi-Jun Chang (ETH), François Le Gall (Nagoya Univ.), Dean Leitersdorf (Technion) COMP2020-31 |
Much progress has recently been made in understanding the complexity landscape of subgraph finding problems in the CONGE... [more] | COMP2020-31 p.24 |
| COMP | 2021-03-08 13:30 |
Online | Online | [Invited Talk]
Sample-efficient Hamiltonian learning of quantum many-body systems Anurag Anshu (UC Berkley), Srinivasan Arunachalam (IBM), Tomotaka Kuwahara (RIKEN AIP), Mehdi Soleimanifar (MIT) COMP2020-32 |
[more] | COMP2020-32 p.25 |
| COMP | 2021-03-08 14:45 |
Online | Online | Classically Simulating Quantum Circuits with Local Depolarizing Noise Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani (NTT) COMP2020-33 |
We study the effect of noise on the classical simulatability of quantum circuits defined by computationally tractable (C... [more] | COMP2020-33 pp.26-29 |
| COMP | 2021-03-08 15:15 |
Online | Online | A hyper-heuristic for the maximum clique problem Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC) COMP2020-34 |
The maximum clique problem (MCP) is one of the most important combinatorial optimization problems that has many practica... [more] | COMP2020-34 pp.30-37 |
| COMP | 2021-03-08 15:45 |
Online | Online | A further improved MCT algorithm for finding a maximum clique Jiro Yanagisawa, Etsuji Tomita (UEC), Kengo Katayama, Kanahara Kazuho (OUS), Takahisa Toda, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2020-35 |
We improve further the MCT algorithm for finding a maximum clique （FAW 2016, LNCS 9711, pp.215-226, 2016). First, we em... [more] | COMP2020-35 pp.38-45 |
| COMP | 2021-03-08 16:30 |
Online | Online | On the Existence of 4-regular Uniquely Hamiltonian Graphs Ryota Sakamoto (UEC Tokyo) COMP2020-36 |
In 1946, Smith showed that a Hamiltonian cubic graph contains at least three Hamiltonian cycles. Then, a lot of research... [more] | COMP2020-36 pp.46-50 |
| COMP | 2021-03-08 17:00 |
Online | Online | A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem Takumi Tatematsu, Toshihiro Fujito (TUT) COMP2020-37 |
[more] | COMP2020-37 pp.51-58 |
| COMP | 2021-03-08 17:30 |
Online | Online | On generative capacity of controlled right linear grammars with unknown behaviors Daihei Ise, Satoshi Kobayashi (UEC) COMP2020-38 |
In the design of DNA computers, it has been anticipated to develop a method to implement DNA computers which can select ... [more] | COMP2020-38 pp.59-66 |
[Return to Top Page]