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 - 20 of 21  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2019-09-02
Okayama Tsushima Campus, Okayama University Shortest Universal Sequences of Adjacent Transpositions
Takehiro Ito (Tohoku Univ.), Jun Kawahara, Shin-ichi Minato (Kyoto Univ.), Yota Otachi (Kumamoto Univ.), Toshiki Saitoh (Kyutech), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII), Katsuhisa Yamanaka (Iwate Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-10
Let $S = {s_1,s_2, ... , s_m}$ be a sequence of adjacent transpositions of $[n]={1,2,ldots ,n}$. We denote by $Comp(S) =... [more] COMP2019-10
COMP 2019-09-02
Okayama Tsushima Campus, Okayama University Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams
Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-16
This research proposes algorithms that construct compressed data
structures, called zero-suppressed binary decision dia... [more]
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-09-18
Fukuoka Kyusyu Institute of Technology Triangulation with Many/Few Triangles
Hiroshi Eto (Kyushu Univ), Tesshu Hanaka (Chuo Univ), Eiji Miyano, Ayumi Nishijima (Kyutech), Hirotaka Ono (Nagoya Univ), Yota Otachi (Kumamoto Univ), Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST), Tom C. van der Zanden (Utrecht Univ) COMP2018-19
 [more] COMP2018-19
ISEC, COMP 2017-12-21
Kochi Eikokuji Campus, Kochi University of Technology Space Efficient Algorithms for Maximum (Weight) Independent Set on Circular Arcs
Shohei Urakawa (Kobe Univ.), Tom C. van der Zanden (Utrecht Univ.), Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST) ISEC2017-74 COMP2017-28
Recently,due to increase of the capacity of storages,we require space efficient algorithms with a limited workspace for ... [more] ISEC2017-74 COMP2017-28
ISEC, COMP 2017-12-21
Kochi Eikokuji Campus, Kochi University of Technology Maximum k-path Vertex Cover Problem on Graph Classes
Tsuyoshi Yagita, Eiji Miyano, Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST), Tom C. van der Zanden (Utrecht U.) ISEC2017-76 COMP2017-30
This paper introduces the maximum version of the $k$-path vertex cover problem, called the textsc{Maximum $k$-Path Verte... [more] ISEC2017-76 COMP2017-30
ISEC, COMP 2017-12-21
Kochi Eikokuji Campus, Kochi University of Technology An optimal strategy of the second player for the 1-round voronoi game on trees
Akihiro Sugimoto (Kobe Univ.), Toshiki Saitoh (Kyushu Inst. of Tech.) ISEC2017-77 COMP2017-31
Voronoi game is an encampment game which is played on a plane. The game is expected to be applied to a model of competit... [more] ISEC2017-77 COMP2017-31
COMP 2016-09-06
Toyama Toyama Prefectural University Counting the number of solutions for peg solitaire
Itsuki Kanemoto, Toshiki Saitoh (Kobe Univ.), Masashi Kiyomi (Yokohama City Univ.), Ryuhei Uehara (JAIST) COMP2016-14
Peg solitaire is one of the most popular classic puzzles around the world. The problem is NP-complete in general, which ... [more] COMP2016-14
COMP, IPSJ-AL 2016-06-24
Ishikawa   Enumerating Letter Graphs by Zero-suppressed Decision Diagrams
Jun Kawahara (NAIST), Toshiki Saitoh (Kobe Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2016-8
A zero-suppressed binary decision diagram (ZDD) is a compact data structure that represents a family of sets. A framewor... [more] COMP2016-8
COMP, IPSJ-AL 2016-06-24
Ishikawa   Improving the lower bounds of the number of tilings for Ls in L and Sphinxes in Sphinx -- Enumerating tilings by frontier-based search --
Itsuki Kanemoto, Toshiki Saitoh (Kobe Univ.) COMP2016-9
We treat with puzzles which are filled by copies of a polygon in the polygon enlarged in a certain scale. We call ... [more] COMP2016-9
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 2016-04-22
Nara   Proposal of a Fast Heuristic for the Minimum Weight Vertex Cover Problem
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda (Kobe Univ.) COMP2016-4
Given an undirected graph with weight for each vertex, the minimum
weight vertex cover problem (MWVCP) is an NP-hard p... [more]
COMP 2014-04-24
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
COMP, IPSJ-AL 2013-05-17
Hokkaido Otaru University of Commerce Efficient Enumeration of Directed Binary Perfect Phylogenies using Dynamic Programming
Kazuki Morito (SEIBU CONSTRUCTION), Toshiki Saitoh, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) COMP2013-12
We consider an enumeration of directed binary perfect phylogenies from incomplete data. Recently, Kiyomi et al. proposed... [more] COMP2013-12
COMP 2013-04-24
Hyogo Kobe University An Algorithm for Finding an Orthogonal Drawing of a Hierarchical Graph
Tetsuya Araki, Sumio Masuda, Ikunori Matoba, Kazuaki Yamaguchi, Toshiki Saitoh (Kobe Univ.) COMP2013-7
In this article, we show an algorithm for finding an orthogonal drawing of a hierarchical graph. In an orthogonal drawin... [more] COMP2013-7
COMP 2013-03-18
Gifu Gifu University A New Exact Algorithm for the Maximum Weight Clique Problem Based on an Upper Bound Calculated by Dynamic Programming
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda (Kobe Univ.) COMP2012-59
Given a vertex-weighted undirected graph, the problem to find the clique of maximum weight is the maximum weight clique ... [more] COMP2012-59
COMP 2012-06-21
Hokkaido Hokkaido University Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
Masashi Kiyomi (Yokohama City Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Toshiki Saitoh (Kobe Univ) COMP2012-14
 [more] COMP2012-14
Hokkaido Hokkaido University Entwork Reliability Evaluation Using Efficient Path Enumeration ALgorithms
Toshiki Saitoh, Jun Kawahara, Ryo Yoshinaka, Takeru Inoue (JST), Shin-ichi Minato (Hokkaido Univ.) IN2011-55
Recently, novel algorithms that enumerate all possible paths on a graph have been proposed. They commonly take advantage... [more] IN2011-55
COMP, IPSJ-AL 2010-05-19
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]
COMP 2009-09-14
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]
 Results 1 - 20 of 21  /  [Next]  
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