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 - 7 of 7  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2020-12-04
15:50		 Online Online An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
Yuuki Aoike (Yokohama City Univ.), Tatsuya Gima (Nagoya Univ.), Tesshu Hanaka (Chuo Univ.), Masashi Kiyomi (Yokohama City Univ.), Yasuaki Kobayashi, Yusuke Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Yota Otachi (Nagoya Univ.) COMP2020-25		  [more] COMP2020-25
pp.33-38
COMP 2018-03-05
13:20		 Osaka Osaka Prefecture Univ. [Invited Talk] Space-Efficient Algorithms for Longest Increasing Subsequence
Masashi Kiyomi (Yokohama City Univ.), Hirotaka Ono (Nagoya Univ.), Yota Otachi (Kumamoto Univ.), Pascal Schweitzer (TU Kaiserslautern), Jun Tarui (UEC) COMP2017-48		  [more] COMP2017-48
p.19
COMP 2016-09-06
10:30		 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
pp.1-5
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 2012-06-21
10:20		 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
pp.17-24
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 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
 Results 1 - 7 of 7  /   
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