|This lecture is aimed at understanding the basis of computer programing by practicing the various C programing.|
|This lecture is aimed at understanding the set theory, Combinatorics and graph theory.|
|Algorithms and Data structure|
|This lecture is aimed at understanding the fundamental algorithms and data structures.|
|Graph drawing algorithm|
|A graph consists of a set of vertices and a set of edges, each joining two vertices. Recently automatic aesthetic drawing has important applications in many areas, such as VLSI layout, computer network, software engineering, visual languages and so on. We study efficient algorithms to obtain such a "nice" drawing.|
|Main interests of the laboratory are developing and implementing graph drawing algorithms to obtain nice looking drawing of graphs.|
|1.||Kazuyuki Miura, Hiroki Haga and Takao Nishizeki,
``Inner Rectangular Drawings of Plane Graphs,''
International Journal of Computational Geometry and Applications, Vol. 16, No. 2-3 pp.249--270 (2006).
|2.||Kazuyuki Miura, Shin-ichi Nakano and Takao Nishizeki,
``Convex Grid Drawings of Four-connected Plane Graphs,''
International Journal of Foundations of Computer Science, Vol.17, No.5, pp.1031--1060 (2006).
|3.||Kazuyuki Miura, Machiko Azuma and Takao Nishizeki,
``Convex Drawings of Plane Graphs of Minimum Outer Apices,''
International Journal of Foundations of Computer Science, Vol.17, No.5, pp.1115--1127 (2006).