Researcher Information - MIURA Kazuyuki |

MIURA Kazuyuki

Department / Course Fukushima University Faculty of Symbiotic Systems Science Computer Science and Mathematics Course

Job Professor

Academic conference presentation
2022/09	Convex Grid Drawings of Internally Triconnected Plane Graphs with Pentagonal Contours (Forum on Information Technology (FIT2022))
2010/09	Sufficient Condition for Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs (Forum on Information Technology (FIT2010))
2007/03	Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs (Proceedings of 14th International Symposium on Graph Drawing (GD 2006))
2006/12	Convex Grid Drawings of Plane Graphs with Rectangular Contours (Proceedings of 17th Annual International Symposium on Algorithms and Computation (ISAAC 2006))
2005/09	Convex Drawings of Plane Graphs of Minimum Outer Apices (Proceedings of 13th International Symposium on Graph Drawing (GD 2005))
2005/01	Rectangle-of-influence drawings of four-connected plane graphs (Extended Abstract) (Proceedings of Asia-Pacific Symposium on Information Visualisation (APVIS 2005))
2004/12	Inner Rectangular Drawings of Plane Graphs (Extended Abstract) (Proceedings of 15th Annual International Symposium on Algorithms and Computation (ISAAC 2004))
2004/08	Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs (Extended Abstract) (Proceedings of 10th International Computing and Combinatorics Conference (COCOON 2004))
2004/06	Octagonal Drawings of Plane Graphs with Prescribed Face Areas (Extended Abstract) (Proceedings of 30th International Workshop on Graph-Theoretic Comcept in Computer Science (WG 2004))
2002/09	Algorithms for drawing plane graphs (Proc. 3rd Int. Conf. Parallel and Distributed Computing, Applications and Technologies (PDCAT 2002))
2000/12	Grid drawings of four-connected plane graphs (Proceedings of 7th International Symposium on Graph Drawing'99 (GD 99))
2000/09	Convex grid drawings of four-connected plane graphs (Technical Report of IPSJ)
1998/06	A linear-time algorithm to find four independent spanning trees in four-connected planar graphs (Proceedings of 24th International Workshop on Graph-Theoretic Comcept in Computer Science (WG 98))