| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2018)
Search Results: Keywords 'from:2018-12-12 to:2018-12-12'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2018-12-12 10:00 |
Miyagi | Tohoku University | Max-Min Dispersion Problems Takashi Horiyama (Saitama Univ.), Shin-ichi Nakano (Gunma Univ.), Toshiki Saitoh (KIT), Koki Suetsugu (Kyoto Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno, Kunihiro Wasa (NII)  COMP2018-31 |
[more] | COMP2018-31 pp.1-6 |
| COMP | 2018-12-12 10:25 |
Miyagi | Tohoku University | Linear-Time Algorithms for the Generalized Coloring Reconfiguration Problem Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2018-32 |
{sc Coloring reconfiguration} is one of the most well-studied reconfiguration problems. In the problem, we are given two... [more] | COMP2018-32 pp.7-14 |
| COMP | 2018-12-12 10:50 |
Miyagi | Tohoku University | Minimization of an M-convex Function under L1-distance Constraint Akiyoshi Shioura (Tokyo Inst. Tech.) COMP2018-33 |
In this paper we consider a new problem of minimizing an M-convex function under L1-distance constraint (MML1); the cons... [more] | COMP2018-33 pp.15-20 |
| COMP | 2018-12-12 11:30 |
Miyagi | Tohoku University | [Invited Talk]
A weighted linear matroid parity algorithm Satoru Iwata (Univ. Tokyo), Yusuke Kobayashi (Kyoto Univ.) COMP2018-34 |
[more] | COMP2018-34 p.21 |
| COMP | 2018-12-12 13:30 |
Miyagi | Tohoku University | [Invited Talk]
0/1/all CSPs, Half-Integral A-path Packing, and Linear-Time FPT Algorithms Yoichi Iwata (NII), Yutaro Yamaguchi (Osaka Univ.), Yuichi Yoshida (NII) COMP2018-35 |
0/1/all CSPs can be solved in linear time by a simple DFS called a unit propagation. We consider an optimization varian... [more] |
COMP2018-35 p.23 |
| COMP | 2018-12-12 14:45 |
Miyagi | Tohoku University | Unpopularity Factor in the Marriage and Roommates Problems Suthee Ruangwises, Toshiya Itoh (TokyoTech) COMP2018-36 |
[more] | COMP2018-36 pp.25-30 |
| COMP | 2018-12-12 15:10 |
Miyagi | Tohoku University | AND Protocols Using Only Uniform Shuffles Suthee Ruangwises, Toshiya Itoh (TokyoTech) COMP2018-37 |
[more] | COMP2018-37 pp.31-37 |
| COMP | 2018-12-12 15:35 |
Miyagi | Tohoku University | A Millionaire Protocol Using a Standard Deck of Cards Daiki Miyahara (Tohoku Univ./AIST), Takaaki Mizuki, Hideaki Sone (Tohoku Univ.) COMP2018-38 |
(To be available after the conference date) [more] | COMP2018-38 pp.39-45 |
| COMP | 2018-12-12 16:15 |
Miyagi | Tohoku University | Self-stabilizing exploration of a graph by a mobile agent Yuki Hara, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-39 |
The rotor-router is a self-stabilizing algorithm for graph exploration by a mobile agent, that is, it eventually allows,... [more] | COMP2018-39 pp.47-54 |
| COMP | 2018-12-12 16:40 |
Miyagi | Tohoku University | Enumerating Floorplans with Columns Katsuhisa Yamanaka (Iwate Univ.), Md.Saidur Rahman (BUET), Shin-ichi Nakano (Gunma Univ.) COMP2018-40 |
[more] | COMP2018-40 pp.55-59 |
| COMP | 2018-12-12 17:05 |
Miyagi | Tohoku University | Experimental evaluation of an approach based on de Bruijn graphs for Order/Degree problem Tamami Okada, Hiroki Kanda, Yosuke Kikuchi (NIT, Tsuyama College) COMP2018-41 |
In 1946, de Bruijn digraphs was proposed by mathematician de Bruijn. This paper describes the smallest diameter graph c... [more] |
COMP2018-41 pp.61-67 |
| COMP | 2018-12-12 17:25 |
Miyagi | Tohoku University | Distance 2-domination number of Hypercubes Nana Kawamura, Yosuke Kikuchi (NIT, Tsuyama College) COMP2018-42 |
A dominating set is a subset of vertices of a graph such that any vertex is adjacent to a vertex in the dominating set o... [more] | COMP2018-42 pp.69-72 |
[Return to Top Page]