|
|
All Technical Committee Conferences (Searched in: 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 # |
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, IPSJ-AL |
2013-05-17 15:05 |
Hokkaido |
Otaru University of Commerce |
Efficient Enumeration of Directed Binary Perfect Phylogenies using Dynamic Programming Kazuki Morito (SEIBU CONSTRUCTION), Toshiki Saitoh, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) COMP2013-12 |
We consider an enumeration of directed binary perfect phylogenies from incomplete data. Recently, Kiyomi et al. proposed... [more] |
COMP2013-12 pp.63-70 |
COMP |
2013-04-24 16:10 |
Hyogo |
Kobe University |
An Algorithm for Finding an Orthogonal Drawing of a Hierarchical Graph Tetsuya Araki, Sumio Masuda, Ikunori Matoba, Kazuaki Yamaguchi, Toshiki Saitoh (Kobe Univ.) COMP2013-7 |
In this article, we show an algorithm for finding an orthogonal drawing of a hierarchical graph. In an orthogonal drawin... [more] |
COMP2013-7 pp.35-42 |
COMP |
2013-03-18 15:15 |
Gifu |
Gifu University |
A New Exact Algorithm for the Maximum Weight Clique Problem Based on an Upper Bound Calculated by Dynamic Programming Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda (Kobe Univ.) COMP2012-59 |
Given a vertex-weighted undirected graph, the problem to find the clique of maximum weight is the maximum weight clique ... [more] |
COMP2012-59 pp.47-53 |
MoNA, IN (Joint) |
2011-11-18 11:35 |
Fukuoka |
|
Studying of the authentication platform for Non-PC terminals Kenichiro Kitayama, Kazuaki Yamaguchi, Tetsuya Yamaguchi (NTTW) IN2011-99 |
Due to the fact that Non-PC terminals(e.g. smartphones and tablet terminals) that can connect the Internet have been rap... [more] |
IN2011-99 pp.37-42 |
COMP |
2006-04-26 16:20 |
Kyoto |
Kyoto University |
An exact algorithm for the label placement problem Yuichi Inoue, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
Given sites on a map and their labels with specified size, the label placement problem is to find an appropriate placeme... [more] |
COMP2006-9 pp.63-67 |
COMP |
2005-09-15 15:10 |
Osaka |
Osaka Univ., Toyonaka Campus |
An algorithm for generating vertex sequences to extract maximum weight cliques quickly Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
Given an undirected graph with weight for each vertex, the maximum
weight clique problem is to find the clique of the ... [more] |
COMP2005-33 pp.39-42 |
COMP |
2005-04-18 10:00 |
Hyogo |
Kwansei Gakuin Univ. |
A fast algorithm for calculating an upper bound of the weight of the maximum weighted clique Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
We deal with the optimization problem that requies the maximum weighted
clique of undirected graphs. Some exact algori... [more] |
COMP2005-1 pp.1-4 |
COMP |
2005-03-18 16:25 |
Tokyo |
Tokyo Institute of Technology |
Algorithms for Map Labeling with Leader Lines Kazuki Omori, Sumio Masuda, Kazuaki Yamaguchi (Kobe Univ.) |
[more] |
COMP2004-84 pp.87-93 |
|
|
|
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]
|