IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: Recent 10 Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 7 of 7  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
CAS, MSS, IPSJ-AL [detail] 2017-11-16
11:20
Tokyo   (Tokyo) [Invited Talk] On the Recognition of Unit Grid Intersection Graphs
Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2017-44 MSS2017-28
We show that the recognition problem for unit grid intersection graphs is NP-complete. [more] CAS2017-44 MSS2017-28
pp.15-20
MSS, CAS, IPSJ-AL [detail] 2016-11-25
09:25
Hyogo Kobe Institute of Computing (Hyogo) A Note on the Spanning Subgraph Isomorphism Problem
Satoshi Tayu, Kenji Ichikawa, Shuichi Ueno (Tokyo Tech) CAS2016-69 MSS2016-49
We consider the subgraph isomorphism problem of two graphs which is to decide if a pattern graph is isomorphic to a subg... [more] CAS2016-69 MSS2016-49
pp.83-88
MSS, CAS, IPSJ-AL [detail] 2016-11-25
09:50
Hyogo Kobe Institute of Computing (Hyogo) On the Complexity of Finding a Largest Common Subtree of Trees
Hiroki Katsumata, Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2016-70 MSS2016-50
The largest common subtree problem (LCST) is to find a tree with the maximum number of edges that is a subtree of all th... [more] CAS2016-70 MSS2016-50
pp.89-92
MSS, CAS, IPSJ-AL [detail] 2016-11-25
10:15
Hyogo Kobe Institute of Computing (Hyogo) A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs
Yuta Inaba, Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2016-71 MSS2016-51
(To be available after the conference date) [more] CAS2016-71 MSS2016-51
pp.93-96
MSS, CAS, IPSJ-AL [detail] 2015-11-20
16:20
Kagoshima Ibusuki CityHall (Kagoshima) On Evasion Games on Graphs
Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2015-52 MSS2015-26
We consider an evasion game on a connected simple graph. We first show that the pursuit number of a graph G, the smalles... [more] CAS2015-52 MSS2015-26
pp.59-64
MSS, CAS, SIP, VLD 2015-06-17
13:20
Hokkaido Otaru University of Commerce (Hokkaido) On the Complexity of Mining Maximal Frequent Subgraphs
Satoshi Tayu, Shuni Go, Shuichi Ueno (Tokyo Tech) CAS2015-7 VLD2015-14 SIP2015-38 MSS2015-7
 [more] CAS2015-7 VLD2015-14 SIP2015-38 MSS2015-7
pp.37-42
COMP 2015-03-09
10:10
Kyoto Ritsumeikan University (Kyoto) A Note on Irreversible 2-Conversion Sets in Subcubic Graphs
Asahi Takaoka, Shuichi Ueno (Tokyo Tech) COMP2014-43
Irreversible $k$-conversion set is introduced in connection with the mathematical modeling of the spread of diseases or ... [more] COMP2014-43
pp.9-11
 Results 1 - 7 of 7  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan