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 2022-03-06
10:30		 Online Online EXPTIME-Completeness of Generalized Tsume-Chushogi
Akihiro Uejima, Yuya Kiba, Junichi Omori, Masaaki Sato (Osaka Electro-Communication Univ.) COMP2021-32		 We consider the `Tsume-ChuShogi' that restricted chushogi such that at every turn, the attack-side player (the first pla... [more] COMP2021-32
pp.8-15
COMP 2013-03-18
14:10		 Gifu Gifu University A note on lower bounds of the girth of planar C_7-colorable graphs
Tatsuo Asano, Akihiro Uejima (Osaka Electro-Comm. Univ.) COMP2012-57		 This report considers the $C_{2k+1}$-coloring problem, which is a subproblem for the $n/k$-coloring problem,
where $n,... [more]		 COMP2012-57
pp.31-38
COMP 2013-03-18
14:35		 Gifu Gifu University Comparative evaluation of two constructions of Hamiltonian circuits for generating picturesque mazes with illusory images
Fuhito Yanagitani, Akihiro Uejima (Osaka Electro-Comm. Univ.) COMP2012-58		 This report proposes a new type of maze generation as a generalization of the {\it picturesque maze generation problem},... [more] COMP2012-58
pp.39-46
COMP 2008-05-13
13:55		 Fukuoka Kyushu Sangyo University NP-Completeness of Planar n/k-Coloring Problems for n/k Between 3 and 4
Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) COMP2008-11		 This report considers the $n/k$-coloring problem, which is a subproblem for the $H$-coloring problem, where $H$ is a sim... [more] COMP2008-11
pp.25-32
CAS 2008-01-31
13:50		 Okinawa   The constitution method of planar graphs existing between hierarchy structure for n/k-colorings
Yuya Iguchi, Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) CAS2007-86		 The typical vertex n-colorings have trivial inclusion relations of classes of n-colorable graphs for the escalating numb... [more] CAS2007-86
pp.13-18
COMP 2007-06-29
14:40		 Hokkaido Hokkaido University On the complexity of planar n/k-coloring problems
Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) COMP2007-25		 This paper considers the {\it $n/k$-coloring problem} ({\it Circular Coloring}), which is a
subproblem of the $H$-color... [more]		 COMP2007-25
pp.55-62
 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