IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 5 of 5  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2016-09-06
Toyama Toyama Prefectural University On the inapproximability of the Frobenius problem and its relationship with the covering radius problem
Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-16
Given coprime positive integers $a_1,cdots,a_n$, we call the problem that asks the maximum integer among all positive in... [more] COMP2016-16
COMP, IPSJ-AL 2016-06-25
Ishikawa   Computational Complexity of Sequential Token Swapping Problem
Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takashi Horiyama (Saitama Univ.), Akitoshi Kawamura (Univ. of Tokyo), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (UEC), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2016-13
We consider a puzzle consisting of colored tokens on an $n$-vertex graph, where each token has a distinct starting verte... [more] COMP2016-13
COMP 2015-04-23
Miyagi   Approximability of width parameters
Koichi Yamazaki (Gunma Univ.) COMP2015-2
Wu et al. showed that for several graph width parameters including treewidth, pathwidth, and cutwidth, there is no polyn... [more] COMP2015-2
COMP 2013-12-21
Okinawa Okinawa Industry Support Center On the minimum consistent DFA problem for prefix samples
Kaori Ueno (Tohokui Univ.), Shinichi Shimozono (Kyushu Inst. of Tech.), Kazuyuki Narisawa, Ayumi Shinohara (Tohokui Univ.) COMP2013-57
We study the computational complexity of nding the minimum deterministic nite automaton (DFA) that is consistent with ... [more] COMP2013-57
COMP 2010-12-03
Fukuoka Kyutech Plaza, Kyushu Institute of Technology Maximum Domination Problem
Eiji Miyano (Kyushu Inst. of Tech.), Hirotaka Ono (Kyushu Univ.) COMP2010-46
We consider new variants of the vertex/edge domination
problems on graphs. A vertex is said to {\em dominate} itself an... [more]
 Results 1 - 5 of 5  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan