

All Technical Committee Conferences (All Years)


Search Results: Conference Papers 
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) 

Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
ISEC, COMP 
20171221 11:50 
Kochi 
Eikokuji Campus, Kochi University of Technology 
Maximum kpath Vertex Cover Problem on Graph Classes Tsuyoshi Yagita, Eiji Miyano, Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST), Tom C. van der Zanden (Utrecht U.) ISEC201776 COMP201730 
This paper introduces the maximum version of the $k$path vertex cover problem, called the textsc{Maximum $k$Path Verte... [more] 
ISEC201776 COMP201730 pp.2531 
COMP 
20160422 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.) COMP20164 
Given an undirected graph with weight for each vertex, the minimum
weight vertex cover problem (MWVCP) is an NPhard p... [more] 
COMP20164 pp.2328 
COMP 
20151002 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.) COMP201522 
In this work, we investigate upper and lower bounds for the Frobenius problem, using some existing results in additive c... [more] 
COMP201522 pp.15 
CAS, CS, SIP 
20120309 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.) CAS2011145 SIP2011165 CS2011137 
Graph coloring is an assignment of colors to vertices of a given undirected graph G=(V,E) such that any pair of adjacent... [more] 
CAS2011145 SIP2011165 CS2011137 pp.213218 
COMP 
20100125 10:05 
Fukuoka 
Nishijin Plaza, Kyushu University 
Complexity results for the spanning tree congestion problem Yota Otachi (Gunma Univ.), Hans L. Bodlaender (Utrecht Univ.) COMP200940 
We study the computational complexity of determining the \emph{spanning tree congestion} of a graph. First, we show that... [more] 
COMP200940 pp.916 
COMP 
20041015 10:30 
Miyagi 
Tohoku University 
Tiling Problems with the EdgeOverwriting 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] 
COMP200443 pp.15 



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]
