|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2005-10-18 15:55 |
Miyagi |
Tohoku Univ. |
Convex Drawings of Plane Graphs of Minimum Outer Apices Kazuyuki Miura (Fukushima Univ.), Machiko Azuma, Takao Nishizeki (Tohoku Univ.) |
In a convex drawing of a plane graph $G$,
every facial cycle of $G$ is drawn as a convex polygon.
A polygon for the ou... [more] |
COMP2005-42 pp.45-51 |
COMP |
2005-03-18 14:10 |
Tokyo |
Tokyo Institute of Technology |
Algorithms for Finding Distance-Edge-Colorings of Graphs Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
For a given bounded nonnegative integer $\ell$, we wish to color all edges of a graph $G$ so that any two edges within d... [more] |
COMP2004-79 pp.49-55 |
COMP |
2005-01-28 13:30 |
Aichi |
Nagoya University |
Partitioning Graphs of Supply and Demand Takehiro Ito, Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
Assume that each vertex of a graph $G$ is either a supply vertex or a demand vertex and is assigned a positive integer, ... [more] |
COMP2004-66 pp.47-56 |
COMP |
2004-10-14 10:30 |
Miyagi |
Tohoku University |
Inner Rectangular Drawings of Plane Graphs Kazuyuki Miura, Hiroki Haga, Takao Nishizeki (Tohoku Univ) |
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical lin... [more] |
COMP2004-35 pp.1-8 |
COMP |
2004-10-14 11:00 |
Miyagi |
Tohoku University |
On the t-Safety of Key-sharing Graphs Yasuhito Asano, Takaaki Mizuki, Takao Nishizeki (Tohoku Univ.) |
[more] |
COMP2004-36 pp.9-16 |
|
|
|
[Return to Top Page]
[Return to IEICE Web Page]
|