|
|
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, IPSJ-AL |
2019-05-11 16:40 |
Kumamoto |
Kumamoto University |
Subgraph Isomorphism on Graph Classes that Exclude a Substructure Hans L. Bodlaender (Utrecht Univ.), Tesshu Hanaka (Chuo Univ.), Yasuaki Kobayashi, Yusuke Kobayashi (Kyoto Univ.), Yoshio Okamoto (UEC), Yota Otachi (Kumamoto Univ.), Tom C. van der Zanden (Utrecht Univ.) COMP2019-9 |
[more] |
COMP2019-9 pp.103-104 |
ISEC, COMP |
2017-12-21 11:00 |
Kochi |
Eikokuji Campus, Kochi University of Technology |
Space Efficient Algorithms for Maximum (Weight) Independent Set on Circular Arcs Shohei Urakawa (Kobe Univ.), Tom C. van der Zanden (Utrecht Univ.), Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST) ISEC2017-74 COMP2017-28 |
Recently,due to increase of the capacity of storages,we require space efficient algorithms with a limited workspace for ... [more] |
ISEC2017-74 COMP2017-28 pp.11-18 |
COMP |
2016-10-21 11:00 |
Miyagi |
Tohoku University |
A faster parameterized algorithm for Pseudoforest Deletion Hans Bodlaender (Utrecht Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST) COMP2016-25 |
[more] |
COMP2016-25 pp.17-21 |
COMP, IPSJ-AL |
2010-05-19 16:30 |
Ishikawa |
Japan Advanced Institute of Science and Technology |
Spanning tree congestion of k-outerplanar graphs Hans L. Bodlaender (Utrecht Univ.), Kyohei Kozawa (J-POWER), Takayoshi Matsushima (Gunma Univ.), Yota Otachi (Tohoku Univ.) COMP2010-14 |
In 1987, Simonson [Math. Syst. Theory 20 (1987) 235-252] conjectured that every k-outerplanar graph of the maximum degre... [more] |
COMP2010-14 pp.43-46 |
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 |
SS |
2007-08-03 10:00 |
Hokkaido |
Hokkaido Univ. |
An Evaluation of Computerized Tools for Method Construction Inge van de Weerd (Utrecht Univ.), Motoshi Saeki (Tokyo Inst. of Tech.) SS2007-26 |
Computer-Aided Method Engineering (CAME) tools support the process of constructing methods for information system develo... [more] |
SS2007-26 pp.59-63 |
PRMU |
2004-11-19 14:15 |
Fukui |
|
Unknown Chisato Yoshida, Miyuki Kamachi (ATR), Frans Verstraten (Utrecht Univ.), Harold Hill (ATR) |
[more] |
PRMU2004-119 pp.83-88 |
|
|
|
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]
|