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  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 6 of 6  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP, IPSJ-AL 2016-06-25
15:05		 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
pp.115-121
COMP 2014-04-24
10:55		 Miyagi Tohoku University Swapping Labeled Tokens on Graphs
Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takehiro Ito (Tohoku Univ.), Jun Kawahara (NAIST), Masashi Kiyomi (Yokohama City Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Kei Uchizawa (Yamagata Univ.), Takeaki Uno (NII) COMP2014-2		  [more] COMP2014-2
pp.5-12
COMP 2013-12-20
09:55		 Okinawa Okinawa Industry Support Center Algorithms for Independent Set Reconfiguration Problem on Graphs
Erik D. Demaine, Martin L. Demaine (Massachusetts Inst. of Tech.), Takehiro Ito (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Ryuhei Uehara (JAIST) COMP2013-39		 Suppose that we are given two independent sets Ib and Ir of a graph such that |Ibj| = |Ir|, and imagine that a token is ... [more] COMP2013-39
pp.7-14
COMP, IPSJ-AL 2011-09-06
10:25		 Hokkaido Hakodate City Central Library A PTAS for the Subset Sum Reconfiguration Problem
Takehiro Ito (Tohoku Univ.), Erik D. Demaine (MIT) COMP2011-22		  [more] COMP2011-22
pp.7-14
COMP 2009-06-29
10:35		 Hokkaido Hokkaido University Reconfiguration of List Edge-Colorings in a Graph
Takehiro Ito (Tohoku Univ.), Marcin Kaminski (Univ. Libre de Bruxelles), Erik D. Demaine (MIT) COMP2009-19		  [more] COMP2009-19
pp.9-16
COMP 2008-10-10
10:00		 Miyagi Tohoku Univ. On the Complexity of Reconfiguration Problems
Takehiro Ito (Tohoku Univ.), Erik D. Demaine, Nicholas J. A. Harvey (MIT), Christos H. Papadimitriou (UC Berkeley), Martha Sideri (AUEB), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Prefecture Univ.) COMP2008-36		 Reconfiguration problems arise when we wish to find a step-by-step transformation between two feasible solutions of a pr... [more] COMP2008-36
pp.17-24
 Results 1 - 6 of 6  /   
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