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  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 25  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2015-03-09
Kyoto Ritsumeikan University Maximum Supply Rate and Minimum Supply Increase Rate of Supply and Demand Networks
Hironori Yoshihara, Takao Nishizeki (KGU) COMP2014-47
Assume that a graph $G$ has $l$ sources, each assigned a non-negative integer
called a supply, that all the vertices ot... [more]
COMP 2015-03-09
Kyoto Ritsumeikan University Efficient Algorithms for Parametric Supply-Demand Tree Networks
Naoki Takahashi, Takao Nishizeki (Kwansei Gakuin Univ) COMP2014-48
 [more] COMP2014-48
COMP 2013-09-03
Tottori   Approximation Algorithms for Bandwidth Consective Multicolorings
Yuji Obata, Takao Nishizeki (Kwansei Gakuin Univ.) COMP2013-30
 [more] COMP2013-30
COMP 2011-12-16
Aichi Nagoya Univ. Algorithms for Bandwidth Consecutive Multicolorings of Graphs
Kazuhide Nishikawa, Takao Nishizeki (Kwansei Gakuin Univ.), Xiao Zhou (Tohoku Univ.) COMP2011-38
 [more] COMP2011-38
COMP 2011-06-30
Hiroshima Hiroshima Univ. Convex Grid Drawings of Internally Triconnected Plane Graphs
Tomoya Hashimoto (Kwansei Gakuin Univ.), Kazuyuki Miura (Fukushima Univ.), Takao Nishizeki (Kwansei Gakuin Univ.) COMP2011-16
 [more] COMP2011-16
COMP 2011-06-30
Hiroshima Hiroshima Univ. Partitioning Trees with Supply, Demand and Edge-Capacity
Masaki Kawabata, Takao Nishizeki (Kwansei Gakuin Univ.) COMP2011-17
Let T be a given tree. Each vertex of T is either a supply vertex or a demand vertex, and is assigned a positive number,... [more] COMP2011-17
COMP 2011-06-30
Hiroshima Hiroshima Univ. Absolutely Secure Message Transmission Using a Key Sharing Graph
Yoshihiro Indo (Kwansei Gakuin Univ.), Takaaki Mizuki (Tohoku Univ.), Takao Nishizeki (Kwansei Gakuin Univ.) COMP2011-18
Assume that there are players and an eavesdropper of unlimited computational power and that several pairs of players hav... [more] COMP2011-18
COMP 2010-12-03
Fukuoka Kyutech Plaza, Kyushu Institute of Technology Minimum Cost Partitions of Trees with Supply and Demand
Takehiro Ito, Takuya Hara, Xiao Zhou (Tohoku Univ.), Takao Nishizeki (Kwansei Gakuin Univ.) COMP2010-44
 [more] COMP2010-44
COMP 2010-09-29
Niigata Nagaoka Univ. of Tech. Minimum Cost Edge-Colorings of Trees Can be Reduced to Matchings
Takehiro Ito, Naoki Sakamoto, Xiao Zhou (Tohoku Univ.), Takao Nishizeki (Kwansei Gakuin Univ.) COMP2010-25
 [more] COMP2010-25
COMP 2010-01-25
Fukuoka Nishijin Plaza, Kyushu University Size-Energy Tradeoff of Unate Circuits Computing Symmetric Functions
Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Takao Nishizeki (Tohoku Univ.) COMP2009-47
A unate gate is a logical gate computing a unate Boolean function.
Examples of unate gates are
AND-gates, OR-gates, NO... [more]
COMP 2009-10-16
Miyagi Tohoku University Small Grid Drawings of Planar Graphs with Balanced Bipartition
Xiao Zhou, Takashi Hikino, Takao Nishizeki (Tohoku Univ.) COMP2009-33
In a grid drawing of a planar graph, every vertex is located at a grid point, and every edge is drawn as a straight-line... [more] COMP2009-33
COMP 2009-04-17
Kyoto Kyoto Univ. Energy Complexity and Depth of Threshold Circuits
Kei Uchizawa, Takao Nishizeki (Tohoku Univ.) COMP2009-4
Suppose that a Boolean function $f$
can be computed by a threshold circuit $C$ of energy complexity $e$.
Thus, at most... [more]
COMP 2008-10-10
Miyagi Tohoku Univ. Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
Takehiro Ito (Tohoku Univ.), Takeaki Uno (NII), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) COMP2008-41
Assume that each vertex of a graph $G$ is assigned a nonnegative integer weight and that $l$ and $u$ are integers such t... [more] COMP2008-41
COMP 2008-10-10
Miyagi Tohoku Univ. Size-Energy Tradeoff for Threshold Logic Circuits Computing MOD Functions
Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Takao Nishizeki (Tohoku Univ.) COMP2008-42
A threshold logic circuit $C$ computing a Boolean function MOD$_m: \{ 0,1\}^n \to \{0, 1\}$ outputs ``0'' if the number ... [more] COMP2008-42
CS, SIP, CAS 2008-03-07
Yamaguchi Yamaguchi University On the Minimization of AND-EXOR Expressions for Multiple-Valued Two-Input Logical Functions
Hitoshi Tsubata, Takaaki Mizuki, Takao Nishizeki (Tohoku Univ.) CAS2007-135 SIP2007-210 CS2007-100
There are a lot of algorithms to simplify or minimize
AND-EXOR expressions,
called ESOP (Exclusive-OR Sum-of-Products)... [more]
CAS2007-135 SIP2007-210 CS2007-100
COMP 2006-10-17
Miyagi Tohoku University Convex Grid Drawings of Plane Graphs with Rectangular Contours
Akira Kamada (Tohoku Univ.), Kazuyuki Miura (Fukushima Univ.), Takao Nishizeki (Tohoku Univ.)
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and al... [more] COMP2006-31
COMP 2006-10-17
Miyagi Tohoku University Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs
Kazuyuki Miura (Fukushima Univ.), Tetsuya Matsuno, Takao Nishizeki (Tohoku Univ.)
 [more] COMP2006-32
COMP 2006-10-17
Miyagi Tohoku University Approximability of Partitioning Graphs with Supply and Demand
Takehiro Ito (Tohoku Univ.), Erik D.Demaine (MIT), Xiao Zhou, Takao Nishizeki (Tohoku Univ.)
Suppose that each vertex of a graph $G$ is either a supply vertex or a demand vertex and is assigned a positive real num... [more] COMP2006-33
COMP 2006-03-22
Tokyo The University of Electro-Communications HITS on Today's Web
Yu Tezuka, Yasuhito Asano, Takao Nishizeki (Tohoku Univ.)
 [more] COMP2005-62
COMP 2005-10-18
Miyagi Tohoku Univ. Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
Xiao Zhou, Takao Nishizeki (Touhoku Univ.)
 [more] COMP2005-37
 Results 1 - 20 of 25  /  [Next]  
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