| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2022-12-06 16:30 |
Ehime | Ehime Univ. Media Hall (Ehime) | Sequentially Swapping Tokens: Further on Graph Classes Hironori Kiya (Kyushu Univ.), Yuto Okada, Hirotaka Ono, Yota Otachi (Nagoya Univ.)  COMP2022-31 |
[more] | COMP2022-31 pp.49-50 |
| COMP | 2021-12-03 10:30 |
Ishikawa | Kanazawa Chamber of Commerce and Industry (Ishikawa, Online) (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 pp.9-10 |
| COMP | 2021-12-03 11:10 |
Ishikawa | Kanazawa Chamber of Commerce and Industry (Ishikawa, Online) (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 pp.11-18 |
| COMP | 2021-10-23 15:55 |
Online | 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 pp.36-38 |
| COMP | 2020-12-04 15:50 |
Online | 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 | 2019-09-02 10:50 |
Okayama | Tsushima Campus, Okayama University (Okayama) | 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 pp.1-5 |
| COMP, IPSJ-AL | 2019-05-11 16:40 |
Kumamoto | Kumamoto University (Kumamoto) | 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 pp.103-104 |
| COMP | 2018-09-18 16:25 |
Fukuoka | Kyusyu Institute of Technology (Fukuoka) | 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 pp.69-76 |
| COMP | 2018-03-05 13:20 |
Osaka | Osaka Prefecture Univ. (Osaka) | [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-10-21 11:00 |
Miyagi | Tohoku University (Miyagi) | A faster parameterized algorithm for Pseudoforest Deletion Hans Bodlaender (Utrecht Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST) COMP2016-25 |
[more] | COMP2016-25 pp.17-21 |
| COMP | 2014-04-24 10:20 |
Miyagi | Tohoku University (Miyagi) | 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 pp.1-4 |
| COMP | 2012-10-31 14:05 |
Miyagi | Tohoku University (Miyagi) | 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 pp.25-32 |
| COMP | 2012-06-21 16:45 |
Hokkaido | Hokkaido University (Hokkaido) | 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 (Osaka) | 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 | 2011-04-22 14:30 |
Kyoto | Kyoto University (Kyoto) | 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] |
COMP2011-7 pp.49-54 |
| COMP | 2011-03-09 13:35 |
Tokyo | Chuo Univ. (Tokyo) | 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] |
COMP2010-50 pp.25-28 |
| COMP | 2010-10-15 14:40 |
Miyagi | Tohoku Univ. (Miyagi) | 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 16:30 |
Ishikawa | Japan Advanced Institute of Science and Technology (Ishikawa) | 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 pp.43-46 |
| COMP | 2010-01-25 10:05 |
Fukuoka | Nishijin Plaza, Kyushu University (Fukuoka) | 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 pp.9-16 |
| COMP | 2009-10-16 11:10 |
Miyagi | Tohoku University (Miyagi) | 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 pp.17-24 |
[Return to Top Page]