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, IPSJ-AL 2023-05-10
14:30		 Hokkaido Hokkaido University [Invited Talk] Reallocation Problems with Minimum Completion Time
Toshimasa Ishii (Hokkaido Univ.), Jun Kawahara, Kazuhisa Makino (Kyoto Univ.), Hirotaka Ono (Nagoya Univ.) COMP2023-1		 Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logist... [more] COMP2023-1
p.1
COMP 2018-03-05
16:20		 Osaka Osaka Prefecture Univ. On Settlement Fund Circulation Problem
Hitoshi Hayakawa, Toshimasa Ishii (Hokkaido Univ.), Hirotaka Ono (Nagoya Univ.), Yushi Uno (Osaka Pref. Univ.) COMP2017-53		  [more] COMP2017-53
pp.51-58
COMP 2010-04-22
10:00		 Shiga Ritusmeikan University, Biwako-Kusatsu Campus A tight upper bound on the (2,1)-total labeling number of outerplanar graphs
Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Pref. Univ.) COMP2010-1		 A $(2,1)$-total labeling of a graph $G$ is an assignment $f$
from the vertex set $V(G)$ and the edge set $E(G)$
to t... [more]		 COMP2010-1
pp.1-8
COMP 2008-05-13
15:55		 Fukuoka Kyushu Sangyo University An O(n^{1.75})-time Algorithm for L(2,1)-labeling of Trees
Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. of Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Prefecture Univ.) COMP2008-14		 An $L(2,1)$-labeling of a graph $G$ is an assignment $f$
from the vertex set $V(G)$ to the set of nonnegative integers... [more]		 COMP2008-14
pp.43-50
COMP 2006-05-24
10:40		 Fukuoka Kyushu Institute of Technology Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs
Toshimasa Ishii (Otaru Univ. of Commerce) 		For a finite ground set $V$, we call a set-function $r: 2^V \rightarrow Z^+$ monotone, if $r(X')\geq r(X)$ holds for... [more] COMP2006-10
pp.1-8
 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