Titlebook: Computational Geometry and Graphs; Thailand-Japan Joint Jin Akiyama,Mikio Kano,Toshinori Sakai Conference proceedings 2013 Springer-Verlag

包庇

On Non 3-Choosable Bipartite Graphs,roof of their result. These strategies are invented to claim a stronger result that every complete bipartite graph with fifteen vertices except . . is 3-choosable. We also show all 3-list assignments . such that . . is not .-colorable.

草率男

聽寫

過份好問

On Simplifying Deformation of Smooth Manifolds Defined by Large Weighted Point Sets,prove the complexity from .(....) to .(..?+?..) by proposing a simplified deformation process. This improvement greatly reduces the program running time and unnecessary topology changes. Moreover, it makes some impossible deformation with large input sets to become possible.

cornucopia

Real Algebraic Tools in Stochastic Games,y color among the . colors. In this paper, we show that if . satisfies some condition for colors of the points in the convex hull, then a .-colored quadrangulation of . can always be constructed using less than . Steiner points. Our upper bound improves the known upper bound for . = 3, and gives the first bounds for .?≥?4.

Carcinoma

Jean-Fran?ois Coeurjolly,Frédéric Lavancier studied. We investigate the one player flooding games on some graph classes characterized by interval representations. Our results state that the number of colors is a key parameter to determine the computational complexity of the flooding games.

Hemiparesis

Colored Quadrangulations with Steiner Points,y color among the . colors. In this paper, we show that if . satisfies some condition for colors of the points in the convex hull, then a .-colored quadrangulation of . can always be constructed using less than . Steiner points. Our upper bound improves the known upper bound for . = 3, and gives the first bounds for .?≥?4.

Obstreperous

On Complexity of Flooding Games on Graphs with Interval Representations, studied. We investigate the one player flooding games on some graph classes characterized by interval representations. Our results state that the number of colors is a key parameter to determine the computational complexity of the flooding games.