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 - 8 of 8  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2012-03-16
13:35		 Tokyo Univ. of Tokyo Parameterized complexity of coloring comparability-ke graphs
Atsuhsi Saito, Yasuhiko Takenaga (UEC) COMP2011-51		 $\mathcal{F}-ke$ graphs is a class of graphs obtained by deleting at most $k$ edges from a graph in graph class $\mathca... [more] COMP2011-51
pp.31-38
COMP 2010-03-12
09:05		 Tokyo National Institute of Informatics NP-Completeness and Enumeration of Number Link Puzzle
Kouichi Kotsuma, Yasuhiko Takenaga (Univ. of Electro-Comm.) COMP2009-49		  [more] COMP2009-49
pp.1-7
COMP 2008-03-10
16:20		 Kanagawa   Implicit OBDD Representation of Multivariate Threshold Functions
Masamitsu Nakayama, Yasuhiko Takenaga (UEC) COMP2007-65		 An Ordered Binary Decision Diagram (OBDD) is a graph representation of a Boolean function.
An implicit OBDD representa... [more]		 COMP2007-65
pp.67-73
COMP 2007-03-05
10:45		 Tokyo The University of Electro-Communications Vertex coloring of chordal+k_1e-k_2e graphs
Yusuke Miura, Yasuhiko Takenaga (UEC) 		 [more] COMP2006-53
pp.21-27
COMP 2006-03-23
14:30		 Tokyo The University of Electro-Communications Recognition of Tree-Shellable Boolean Functions with several Restrictions
Nao Katougi, Yasuhiko Takenaga, Takashi Ishibashi (UEC) 		A tree-shellable function is a positive Boolean function which can be represented by a binary decision tree whose number... [more] COMP2005-67
pp.31-37
COMP 2005-05-20
13:30		 Fukuoka Kyushu Univ. Recognition of Tree-Shellable Boolean Functions with Restrictions to the Number of the Same Literal
Nao Katougi, Yasuhiko Takenaga (UEC) 		A tree-shellable function is a positive Boolean function which can be representation by a binary decision tree such that... [more] COMP2005-12
pp.25-30
COMP 2005-03-18
15:25		 Tokyo Tokyo Institute of Technology Complexity of coloring comparability + ke graphs
Kenichi Higashide, Yasuhiko Takenaga (UEC) 		A comparability+ke graph is a graph that can be obtained from a comparability graph by adding at most k edges. In this r... [more] COMP2004-82
pp.71-77
COMP 2005-03-18
16:50		 Tokyo Tokyo Institute of Technology NP-completeness of maximum chain problem on generalized Puyopuyo
Teruhisa Matsukane, Yasuhiko Takenaga (UEC) 		Recently, complexity of the puzzles like Tetris draw our attention. In this report, we deal with Puyopuyo; it is a compu... [more] COMP2004-85
pp.95-103
 Results 1 - 8 of 8  /   
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