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: Recent 10 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 2019-10-25
10:50		 Hokkaido Sapporo Campus, Hokkaido University Simple Fold and Cut Problem for Line Segments
Guoxin Hu (JAIST), Shin-ichi Nakano (Gunma University), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2019-20		 We investigate a natural variant of the fold-and-cut problem. We are given a long paper strip P and n line segments draw... [more] COMP2019-20
pp.19-25
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
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-10-26
14:30		 Kyoto Kyoto University An Approximation Algorithm for the 2-Dispersion Problem
Kazuyuki Amano, Shin-ichi Nakano (Gunma Univ.) COMP2018-26		 Let $P$ be a set of points on the plane,
and $d(p,q)$ be the distance between a pair of points $p,q$ in $P$.
For a poi... [more]		 COMP2018-26
pp.41-43
COMP 2018-09-18
11:05		 Fukuoka Kyusyu Institute of Technology Max-Min Dispersion on a Line
Tetsuya Araki (Tokyo Metropolitan Univ), Shin-ichi Nakano (Gunma Univ) COMP2018-11		 Given a set P of n locations on which facilities can be placed and an integer k, we want to place k facilities on some l... [more] COMP2018-11
pp.17-21
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
 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