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 21 - 40 of 40 [Previous]  /   
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 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 2013-04-24
16:45
Hyogo Kobe University Computational complexity and an integer programming model of Shakashaka
Erik Demaine (Massachusetts Inst. of Tech.), Yoshio Okamoto (Univ. of Electro-Comm.), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Prefecture Univ.) COMP2013-8
The puzzle Shakashaka is popularized by Japanese publisher Nikoli, along with its more famous sibling Sudoku, and severa... [more] COMP2013-8
pp.43-48
COMP 2012-10-31
15:35
Miyagi Tohoku University On the Complexity of Packing Trominoes
Takashi Horiyama (Saitama Univ.), Takehiro Ito (Tohoku Univ.), Keita Nakatsuka (Saitama Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST) COMP2012-40
 [more] COMP2012-40
pp.37-43
COMP 2012-06-21
16:45
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
pp.95-101
COMP 2012-04-27
14:45
Osaka Osaka Prefecture University On the Base-Line Location Problem for the Maximum Weight Region Decomposable into Base-Monotone Shapes
Takashi Horiyama (Saitama Univ.), Takehiro Ito, Natsuda Kaothanthong (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST), Takeshi Tokuyama (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2012-6
 [more] COMP2012-6
pp.37-43
COMP 2010-10-15
14:40
Miyagi Tohoku Univ. Bipartite powers of interval bigraphs
Yoshio Okamoto (Tokyo Inst. of Tech.), Yota Otachi (Tohoku Univ.), Ryuhei Uehara (JAIST) COMP2010-36
The notion of graph powers is a well-studied topic in graph theory and its applications. In this paper, we investigate a... [more] COMP2010-36
pp.35-39
COMP, IPSJ-AL 2010-05-19
10:00
Ishikawa Japan Advanced Institute of Science and Technology Voronoi Game on a Path
Masashi Kiyomi (JAIST), Toshiki Saitoh (JST), Ryuhei Uehara (JAIST) COMP2010-10
The Voronoi game is a two-person perfect information game modeling a
competitive facility location. The original versio... [more]
COMP2010-10
pp.1-5
COMP 2009-09-14
15:05
Tottori Tottori University of Environmental Studies Random Generation and Enumeration of Bipartite Permutation Graphs
Toshiki Saitoh (JAIST), Yota Otachi (Gunma Univ.), Katsuhisa Yamanaka (Univ. of Electro-Comm), Ryuhei Uehara (JAIST) COMP2009-30
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite
... [more]
COMP2009-30
pp.35-42
COMP 2009-06-29
15:25
Hokkaido Hokkaido University Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
Yoshio Okamoto (Tokyo Inst. of Tech.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2009-24
 [more] COMP2009-24
pp.45-52
COMP 2009-03-02
10:35
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
pp.17-23
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
COMP 2008-09-11
09:00
Aichi Nagoya Inst. of Tech. Polygons Folding to Plural Incongruent Orthogonal Boxes
Jun Mitani (Univ. of Tsukuba/JST), Ryuhei Uehara (JAIST) COMP2008-23
We investigate the problem of finding orthogonal polygons that fold to plural in
congruent orthogonal boxes.
There are... [more]
COMP2008-23
pp.1-8
COMP 2008-06-16
15:00
Ishikawa JAIST Simulation of a certain Voting Game
Ryuhei Uehara (JAIST), Yasuyuki Kawamura (Ehime Univ.), Hiromitsu Matsunaga, Mitsuo Motoki (JAIST) COMP2008-20
 [more] COMP2008-20
pp.37-42
COMP 2008-04-18
11:10
Osaka Osaka Prefecture University Enumeration of Perfect Sequences of Chordal Graph
Yasuko Matsui (Tokai Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2008-3
A graph is chordal if and only if it has no chordless cycle of length more than three.
The set of maximal cliques in a ... [more]
COMP2008-3
pp.15-22
COMP 2007-09-20
13:50
Aichi   Bandwidth of Bipartite Permutation Graphs
Ryuhei Uehara (JAIST) COMP2007-36
The bandwidth problem is to find a linear layout of vertices in a graph
in such way that minimizes the maximum distance... [more]
COMP2007-36
pp.29-34
COMP 2007-06-29
14:15
Hokkaido Hokkaido University Simple efficient algorithm for MPQ-tree of an interval graph
Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara (JAIST) COMP2007-24
An MPQ-tree is an informative data structure for an interval graph. We propose a simple algorithm that constructs an MPQ... [more] COMP2007-24
pp.49-54
COMP 2006-10-17
11:00
Miyagi Tohoku University Efficient Algorithms for Airline problem
Ryuhei Uehara (JAIST)
It is known that the airlines in the real world form small-world network.
This fact implies that they are constructed w... [more]
COMP2006-34
pp.25-31
COMP 2006-03-22
16:00
Tokyo The University of Electro-Communications Canonical Tree Representation of Distance Hereditary Graphs with Applications
Ryuhei Uehara (JAIST), Takeaki Uno (NII)
The class of distance hereditary graphs consists of
the isometric graphs.
That is, for each pair of vertices,
its d... [more]
COMP2005-61
pp.31-36
COMP 2005-09-15
10:50
Osaka Osaka Univ., Toyonaka Campus Laminar Structure of Ptolemaic Graphs and Its Applications
Ryuhei Uehara (JAIST), Yushi Uno (Osaka Pref. Univ.)
Ptolemaic graphs are graphs that satisfy the Ptolemaic inequality for any four vertices.
The graph class coincides with... [more]
COMP2005-30
pp.17-24
 Results 21 - 40 of 40 [Previous]  /   
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