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 29  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2022-12-06
Ehime Ehime Univ. Media Hall Sequentially Swapping Tokens: Further on Graph Classes
Hironori Kiya (Kyushu Univ.), Yuto Okada, Hirotaka Ono, Yota Otachi (Nagoya Univ.) COMP2022-31
 [more] COMP2022-31
COMP 2021-12-03
Ishikawa Kanazawa Chamber of Commerce and Industry
(Primary: On-site, Secondary: Online)
Complexity of reconfiguration of regular induced subgraphs
Hiroshi Eto, Takehiro Ito (Tohoku Univ), Yasuaki Kobayashi (Kyoto Univ), Yota Otachi (Nagoya Univ), Kunihiro Wasa (Toyohashi Tech) COMP2021-22
 [more] COMP2021-22
COMP 2021-12-03
Ishikawa Kanazawa Chamber of Commerce and Industry
(Primary: On-site, Secondary: Online)
Token Sliding on Directed Graphs
Takehiro Ito (Tohoku Univ), Yuni Iwamasa, Yasuaki Kobayashi (Kyoto Univ), Yu Nakahata (NAIST), Masahiro Takahashi (Kyoto Univ), Yota Otachi (Nagoya Univ), Kunihiro Wasa (Toyohashi Tech) COMP2021-23
given a directed graph and two sets of pairwise nonadjacent vertices, whether one can reach from one set to the other by... [more] COMP2021-23
COMP 2021-10-23
Online Online Sequentially Swapping Colored Tokens on King's Graphs
Yuto Okada, Hironori Kiya, Yota Otachi, Hirotaka Ono (Nagoya Univ.) COMP2021-19
 [more] COMP2021-19
COMP 2020-12-04
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
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, IPSJ-AL 2019-05-11
Kumamoto Kumamoto University Subgraph Isomorphism on Graph Classes that Exclude a Substructure
Hans L. Bodlaender (Utrecht Univ.), Tesshu Hanaka (Chuo Univ.), Yasuaki Kobayashi, Yusuke Kobayashi (Kyoto Univ.), Yoshio Okamoto (UEC), Yota Otachi (Kumamoto Univ.), Tom C. van der Zanden (Utrecht Univ.) COMP2019-9
 [more] COMP2019-9
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
COMP 2018-03-05
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
COMP 2016-10-21
Miyagi Tohoku University A faster parameterized algorithm for Pseudoforest Deletion
Hans Bodlaender (Utrecht Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST) COMP2016-25
 [more] COMP2016-25
COMP 2014-04-24
Miyagi Tohoku University Thin strip graphs
Yota Otachi (JAIST), Akitoshi Kawamura (Univ. of Tokyo), Hidehiro Shinohara (Tohoku Univ.), Takashi Hayashi, Koichi Yamazaki (Gunma Univ.) COMP2014-1
A unit disk graph is a emph{$c$-strip graph} if it has a unit disk representation in which all centers of the unit disks... [more] COMP2014-1
COMP 2012-10-31
Miyagi Tohoku University On computing the nucleolus and the Shapley value of facility location games
Takanori Namikawa (JAIST), Yoshio Okamoto (UEC), Yota Otachi (JAIST) COMP2012-38
 [more] COMP2012-38
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 2012-04-27
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
COMP 2011-04-22
Kyoto Kyoto University Reconstructing sets from distances given by graphs
Meng Li, Yota Otachi, Takeshi Tokuyama (Tohoku Univ.) COMP2011-7
Given $n$ points in some Euclidean space, $\binom{n}{2}$ pairwise distances among the points can be easily calculated.
... [more]
COMP 2011-03-09
Tokyo Chuo Univ. Evaluation of metaheuristic algorithms for Spanning Tree Congestion
Daiki Maruta (Gunma Univ.), Yota Otachi (Tohoku Univ.), Koichi Yamazaki (Gunma Univ.) COMP2010-50
Spanning tree congestion (STC) is a graph parameter
which has been well studied recently.
This work is to compare the... [more]
COMP 2010-10-15
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
COMP, IPSJ-AL 2010-05-19
Ishikawa Japan Advanced Institute of Science and Technology Spanning tree congestion of k-outerplanar graphs
Hans L. Bodlaender (Utrecht Univ.), Kyohei Kozawa (J-POWER), Takayoshi Matsushima (Gunma Univ.), Yota Otachi (Tohoku Univ.) COMP2010-14
In 1987, Simonson [Math. Syst. Theory 20 (1987) 235-252] conjectured that every k-outerplanar graph of the maximum degre... [more] COMP2010-14
COMP 2010-01-25
Fukuoka Nishijin Plaza, Kyushu University Complexity results for the spanning tree congestion problem
Yota Otachi (Gunma Univ.), Hans L. Bodlaender (Utrecht Univ.) COMP2009-40
We study the computational complexity of determining the \emph{spanning tree congestion} of a graph. First, we show that... [more] COMP2009-40
COMP 2009-10-16
Miyagi Tohoku University Reformulation of the scheme for computing tree-width and minimum fill-in
Masanobu Furuse, Yota Otachi, Koichi Yamazaki (Gunma Univ.) COMP2009-34
Bouchitt´e and Todinca introduced a scheme, i.e., Dynamic Programming based on recursive formulas in terms of minimal se... [more] COMP2009-34
 Results 1 - 20 of 29  /  [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