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 - 6 of 6  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2020-03-01
11:30		 Tokyo The University of Electro-Communications
(Cancelled but technical report was issued)		 [Invited Talk] Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs
Takuro Fukunaga (Chuo Univ.) COMP2019-48		 The problem of finding a minimum-weight connected dominating set (CDS) of a given undirected graph has been studied acti... [more] COMP2019-48
p.23
COMP 2012-12-10
10:55		 Fukuoka Kyushu University Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
Takuro Fukunaga (Kyoto Univ.) COMP2012-45		 We consider the problem of finding a minimum edge cost subgraph of an undirected or a directed graph satisfying given co... [more] COMP2012-45
pp.15-22
COMP 2011-04-22
13:20		 Kyoto Kyoto University Approximation algorithms for the source location problem with local vertex-connectivity demands
Takuro Fukunaga (Kyoto Univ.) COMP2011-5		 The source location problem is a problem of computing a minimum cost source set in an undirected graph so that the conne... [more] COMP2011-5
pp.33-39
COMP 2011-03-09
15:30		 Tokyo Chuo Univ. Algorithms for Covering Digraphs by Length-Bounded Paths
Kenji Sejima, Takuro Fukunaga, Hiroshi Nagamochi (Kyoto Univ.) COMP2010-53		 In the length-bounded path cover problem, a digraph $D=(V,A)$ with a source $s\in V$, a sink $t\in V$, a non-negative ar... [more] COMP2010-53
pp.45-51
COMP 2010-04-22
15:55		 Shiga Ritusmeikan University, Biwako-Kusatsu Campus Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Takuro Fukunaga (Kyoto Univ.) COMP2010-8		 Hypergraph k-cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hype... [more] COMP2010-8
pp.55-62
COMP 2009-04-17
10:20		 Kyoto Kyoto Univ. Algorithms for submodular systems Partition Problem
Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi (Kyoto Univ.) COMP2009-2		 A submodular system $(V,f)$ is a pair of a finite set $V$ and a submodular
function $f$ on $V$. The $k$-partition prob... [more]		 COMP2009-2
pp.7-14
 Results 1 - 6 of 6  /   
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