| 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, IPSJ-AL | 2023-05-10 14:30 |
Hokkaido | Hokkaido University | [Invited Talk]
Reallocation Problems with Minimum Completion Time Toshimasa Ishii (Hokkaido Univ.), Jun Kawahara, Kazuhisa Makino (Kyoto Univ.), Hirotaka Ono (Nagoya Univ.)  COMP2023-1 |
Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logist... [more] | COMP2023-1 p.1 |
| ISEC, COMP | 2017-12-21 11:50 |
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 pp.25-31 |
| COMP | 2016-04-22 14:00 |
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] |
COMP2016-4 pp.23-28 |
|
| COMP | 2015-10-02 10:00 |
Tokyo | Upper and lower bounds and time complexities on the Frobenius problem obtained from analysing its additive structure Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2015-22 |
In this work, we investigate upper and lower bounds for the Frobenius problem, using some existing results in additive c... [more] | COMP2015-22 pp.1-5 |
|
| CAS, CS, SIP | 2012-03-09 14:45 |
Niigata | The University of Niigata | Performance Comparison of Heuristic Algorithms for the Graph Coloring Problem Yuta Koshin, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2011-145 SIP2011-165 CS2011-137 |
Graph coloring is an assignment of colors to vertices of a given undirected graph G=(V,E) such that any pair of adjacent... [more] | CAS2011-145 SIP2011-165 CS2011-137 pp.213-218 |
| COMP | 2010-01-25 10:05 |
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 pp.9-16 |
| COMP | 2004-10-15 10:30 |
Miyagi | Tohoku University | Tiling Problems with the Edge-Overwriting Rule Kazuo Iwama (Kyoto Univ.), Kousuke Izumi, Eiji Miyano (Kyushu Inst. Tech.), Hirotaka Ono (Kyushu Univ.) |
Ordinary tiling problems using 1x1 squares with colored edges (say Wang tiles) assume that if two tiles touch then the... [more] |
COMP2004-43 pp.1-5 |
[Return to Top Page]