| 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 # | |
| ET | 2021-01-23 14:50 |
Online | Online | Development and practice of ICT teaching materials to support children's understanding
-- How to support to learn elapsed time -- Yuki Nakano, Tetsuya Shimizu, Koichi Yamazaki (Gunma Univ.)  ET2020-50 |
In elementary schools, education using ICT teaching materials is required to develop Information and Computer Literacy. ... [more] | ET2020-50 pp.23-28 |
| ET | 2020-01-25 13:25 |
Wakayama | Wakayama JA Building | Development and Practice of Software to Support Subjects in Lower Grades of Elementary School Tetsuya Shimizu, Koichi Yamazaki (Gunma Univ.) ET2019-73 |
With the spread of information and communication technology (ICT for short), the use of ICT in course instruction has be... [more] | ET2019-73 pp.21-26 |
| COMP | 2017-10-27 14:00 |
Tokyo | A Revised Version of "Games with a Single Pile of Stones and Number Theoretic Problems" Yoshihiro Tsukamura (former Sony), Yoshihide Igarashi, Takaaki Fujita, Yuta Urabe, Koichi Yamazaki (Gunma Univ.) COMP2017-22 |
The game MSP(m) discussed in this paper, is played alternately by two players, removing at least one stone and at most $... [more] | COMP2017-22 pp.13-20 |
|
| COMP | 2017-10-27 14:30 |
Tokyo | Linear width and Single ideal Takaaki Fujita, Koichi Yamazaki (Gunma Univ.) COMP2017-23 |
Branch-width is a well studied graph parameter, and it was extended into parameter on a connectivity system. Linear-widt... [more] | COMP2017-23 pp.21-27 |
|
| COMP | 2016-09-06 13:30 |
Toyama | Toyama Prefectural University | Games with a Single Pile of Stones and Number Theoretic Problems Yoshihiro Tsukamura (SONY), Yoshihide Igarashi, Yuta Urabe, Koichi Yamazaki (Gunma Univ.) COMP2016-17 |
The game discussed in this paper is played alternately by two players, removing at least one and at most m stones from t... [more] | COMP2016-17 pp.17-24 |
| COMP | 2016-09-06 14:00 |
Toyama | Toyama Prefectural University | COMP2016-18 |
In this paper, we revisit the concept textit{tangle} that is the dual concept of the well-known graph parameter branch-w... [more] | COMP2016-18 pp.25-28 |
| COMP | 2015-04-23 13:40 |
Miyagi | Approximability of width parameters Koichi Yamazaki (Gunma Univ.) COMP2015-2 |
Wu et al. showed that for several graph width parameters including treewidth, pathwidth, and cutwidth, there is no polyn... [more] | COMP2015-2 pp.9-13 |
|
| COMP | 2015-03-09 16:30 |
Kyoto | Ritsumeikan University | Tangle and ideal Koichi Yamazaki (Gunma Univ.) COMP2014-51 |
In this article, we revisit "tangle" defined on a symmetric submodular function of a set $X$ from the viewpoint of idea... [more] | COMP2014-51 pp.61-64 |
| COMP | 2014-04-24 10:20 |
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 pp.1-4 |
| COMP | 2012-10-31 14:40 |
Miyagi | Tohoku University | On 1 + $\epsilon$ strip graphs Takashi Hayashi (Gunma Univ.), Hidehiro Shinohara (Tohoku Univ.), Koichi Yamazaki (Gunma Univ.) COMP2012-39 |
A unit disk graph $G$ is called an $\varepsilon$-strip graph, if all center points of the disks lie in a parallel stri... [more] |
COMP2012-39 pp.33-36 |
| COMP | 2011-03-09 13:35 |
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] |
COMP2010-50 pp.25-28 |
| COMP | 2009-10-16 11:10 |
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 pp.17-24 |
| COMP | 2009-04-17 10:55 |
Kyoto | Kyoto Univ. | Pathwidth of 3-dimensional grids Ryohei Suda, Yota Otachi, Koichi Yamazaki (Gunma Univ.) COMP2009-3 |
The notion of pathwidth of graphs has been introduced by Robertson and Seymour.Pathwidth, which has relations to bandwid... [more] | COMP2009-3 pp.15-19 |
| COMP | 2008-12-03 09:30 |
Gunma | Gunma Univ. | A lower bound for tree-width of Cartesian product graphs Kyohei Kozawa, Yota Otachi, Koichi Yamazaki (Gunma Univ.) COMP2008-46 |
In this paper, we give a lower bound for tree-width of Cartesian product graphs. To be more precise, we show that ... [more] |
COMP2008-46 pp.1-5 |
| COMP | 2008-10-10 15:45 |
Miyagi | Tohoku Univ. | The carving-width of even grids Masanobu Furuse, Kyohei Kozawa, Yota Otachi, Koichi Yamazaki (Gunma Univ.) COMP2008-43 |
In [Call routing and the ratcatcher. Combinatorica 14(2) (1994) 217--241], Seymour and Thomas introduced the concept of... [more] |
COMP2008-43 pp.71-75 |
| COMP | 2008-03-10 15:55 |
Kanagawa | Security number for outerplanar graphs Kyohei Kozawa, Yota Otachi, Koichi Yamazaki (Gunma Univ.) COMP2007-64 |
Let $G=(V,E)$ be a graph and $S = \{s_1,s_2,\ldots,s_k\}$ be a subset of $V$. An \textit{attack} on $S$ is any $k$ m... [more] |
COMP2007-64 pp.63-65 |
|
| COMP | 2006-03-22 15:05 |
Tokyo | The University of Electro-Communications | Experimental analyses of approximation algorithms for the maximum weighted independent set problem on d-claw free graphs Yota Otachi, Koichi Yamazaki (Gunma Univ.) |
A $d$-claw is an induced subgraph isomorphic to $K_{1,d}$. A graph is $d$-claw free if it has no $d$-claws. Several appr... [more] | COMP2005-60 pp.25-30 |
| COMP | 2005-12-22 14:25 |
Tokushima | The University of Tokushima | Genetic Algorithms for bandwidth reduction problem Kazumasa Aoki, Yota Otachi, Koichi Yamazaki (Gunma Univ.) |
(To be available after the conference date) [more] | COMP2005-53 pp.29-36 |
| COMP | 2005-03-18 14:35 |
Tokyo | Tokyo Institute of Technology | A lower bound for the vertex isoperimetric number of the complete k-ary tree Yota Otachi, Kaori Umezawa, Koichi Yamazaki (Gunma Univ.) |
The vertex isoperimetric number problem (for short VINP) is to determine the value of vi(G)= max_{1 \le k \le |V|} min_{... [more] | COMP2004-80 pp.57-60 |
| COMP | 2004-12-10 14:30 |
Chiba | Toho University | Interval bigraphs are unit grid intersection graphs Yota Otachi, Koichi Yamazaki (Gunma Univ.) |
An interval bigraph is the intersection graph of two families of intervals on the real line such that vertices are adjac... [more] | COMP2004-56 pp.21-23 |
[Return to Top Page]