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 - 12 of 12  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2019-10-25
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
COMP 2018-12-12
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
COMP 2018-12-12
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
COMP 2018-10-26
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]
COMP 2018-09-18
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
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 2012-06-21
Hokkaido Hokkaido University Approximation for the Geometric Unique Coverage Problem on Unit Squares
Takehiro Ito (Tohoku Univ.), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Yota Otachi, Ryuhei Uehara (JAIST), Takeaki Uno (NII), Yushi Uno (Osaka Prefecture Univ.) COMP2012-24
 [more] COMP2012-24
COMP 2009-05-26
Saitama Saitama Univ. Listing All st-Orientation
Andry Setiawan, Shin-ichi Nakano (Gunma Univ.) COMP2009-16
In this paper we give a simple algorithm to generate
all st-orientations of a given biconnected plane graph G
with des... [more]
COMP 2009-03-02
Tokyo Tokyo Institute of Technology Efficient Enumeration of All Ladder Lotteries
Katsuhisa Yamanaka (Univ. of Electro-Comm.), Shin-ichi Nakano (Gunma Univ.), Yasuko Matsui (Tokai Univ.), Ryuhei Uehara (JAIST), Kento Nakada (Kyoto Univ.) COMP2008-56
A ladder lottery, known as the "Amidakuji" in Japan, is a common way to choose a random permutation. Given a permutation... [more] COMP2008-56
COMP 2008-12-03
Gunma Gunma Univ. A Simple Generation of Multi-dimensional Partitions
Yosuke Kikuchi (Tsuyama National Coll. Tech.), Katsuhisa Yamanaka (The University of Electro-Communications), Shin-ichi Nakano (Gunma Univ.) COMP2008-49
This paper gives a simple algorithm to generate all multi-dimensional partitions of a positive integer N. The problem is... [more] COMP2008-49
COMP 2005-05-20
Fukuoka Kyushu Univ. Constant Time Generation of Linear Extensions
Akimitsu Ono, Shin-ichi Nakano (Gunma Univ.)
Given a poset P,
several algorithms have been proposed
for generating all linear extensions of P.
The fastest known a... [more]
COMP 2004-06-25
Kanagawa NTT CSLab Atsugi Constant Time Generation of Set Partitions
Shin-ichiro Kawano, Shin-ichi Nakano (Gunma Univ.)
In this paper we give a simple algorithm to generate all partitions of {1,2,...,n} into $k$ non-empty subsets. The numbe... [more] COMP2004-19
 Results 1 - 12 of 12  /   
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