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: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 5 of 5  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2021-10-23
16:30		 Online Online Computing the Longest Path Length Distribution Function of DAGs with Small Treewidth and Random Edge Lengths
Ei Ando (Senshu Univ.) COMP2021-20		 Consider the problem of computing the longest path length
in directed acyclic graphs (DAGs).
It is well known that... [more]		 COMP2021-20
pp.39-46
COMP, IPSJ-AL 2019-05-10
15:40		 Kumamoto Kumamoto University On the Complexity of Lattice Puzzle:
Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki (Kyoto Univ), Ryuhei Uehara (JAIST) COMP2019-2		 In this paper, we investigate the computational complexity of lattice puzzle, which is one of the traditional puzzles.
... [more]		 COMP2019-2
pp.15-22
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 2017-03-07
11:30		 Aichi Nanzan University Extension of the Vertex Cover Problem to the Size-t Cycle Cover Problems
Batchunag Dashdemberel, Osamu Watanabe (Tokyo Tech.) COMP2016-52		 We consider an extension of the Vertex Cover (VC) problem.
For a given graph,
its (edge) vertex cover (in short, VC) i... [more]		 COMP2016-52
pp.11-18
COMP 2006-10-17
10:25		 Miyagi Tohoku University Approximability of Partitioning Graphs with Supply and Demand
Takehiro Ito (Tohoku Univ.), Erik D.Demaine (MIT), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) 		Suppose that each vertex of a graph $G$ is either a supply vertex or a demand vertex and is assigned a positive real num... [more] COMP2006-33
pp.17-23
 Results 1 - 5 of 5  /   
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