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 2023-12-22
10:00		 Miyazaki Miyazaki Univ. Machinaka Campus Approximation Algorithms for Generalizations of Strong Connectivity Augmentation Problem
Ryoma Norose, Yutaro Yamaguchi (Osaka Univ.) COMP2023-16		 A directed graph G is said to be strongly connected if there exists a directed path between any pair of vertices in G. S... [more] COMP2023-16
pp.1-5
COMP 2023-12-22
11:25		 Miyazaki Miyazaki Univ. Machinaka Campus [Invited Talk] Fast Algorithms for Maximum Matching Problem
Yutaro Yamaguchi (Osaka Univ.) COMP2023-19		 Initiated by Edmonds' blossom algorithm (1965), a variety of algorithms for finding a maximum matching in general graphs... [more] COMP2023-19
p.20
COMP 2020-12-04
10:00		 Online Online A Fast ZDD-Based Method for Enumerating All Solutions of Cost-Bounded Combinatorial Problems
Shin-ichi Minato (Kyoto Univ.), Mutsunori Banbara (Nagoya Univ.), Takashi Horiyama (Hokkaido Univ.), Jun Kawahara (Kyoto Univ.), Ichigaku Takigawa (Hokkaido Univ.), Yutaro Yamaguchi (Kyushu Univ.) COMP2020-19		  [more] COMP2020-19
pp.8-15
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 2018-03-05
11:00		 Osaka Osaka Prefecture Univ. [Invited Talk] Stochastic Packing Integer Programs with Few Queries
Takanori Maehara (RIKEN), Yutaro Yamaguchi (Osaka Univ./RIKEN) COMP2017-47		 We consider a stochastic variant of the packing-type integer linear programming problem, which contains random variables... [more] COMP2017-47
p.17
 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