|
|
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 |
2018-12-12 13:30 |
Miyagi |
Tohoku University |
[Invited Talk]
0/1/all CSPs, Half-Integral A-path Packing, and Linear-Time FPT Algorithms Yoichi Iwata (NII), Yutaro Yamaguchi (Osaka Univ.), Yuichi Yoshida (NII) COMP2018-35 |
0/1/all CSPs can be solved in linear time by a simple DFS called a unit propagation.
We consider an optimization varian... [more] |
COMP2018-35 p.23 |
COMP |
2013-06-24 10:35 |
Nara |
Nara Women's University |
Shortest Path Queries by Labeling for Paths with Pruning in Road Networks Yuki Kawata, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo) COMP2013-20 |
Shortest-Path problem is a fundamental problem in road networks and a lot of methods are proposed. In the labeling appro... [more] |
COMP2013-20 pp.7-15 |
COMP |
2013-04-24 10:00 |
Hyogo |
Kobe University |
Answering Reachability Queries by Extending Pruned BFSs to Paths Yosuke Yano, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo) COMP2013-1 |
The graph reachability is a fundamental problem, both theoretically and practically. However, it is still a challenging ... [more] |
COMP2013-1 pp.1-8 |
|
|
|
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]
|