Computational Geometry and Graphs Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected papers

Operators which Preserve Reversibility.- Colored Quadrangulations with Steiner Points.- On Universal Point Sets for Planar Graphs.- On Non 3-Choosable Bipartite Graphs.- Edge-disjoint Decompositions of Complete Multipartite Graphs into Gregarious Long Cycles.- Affine Classes of 3-Dimensional Parallelohedra - Their Parametrization.- On Complexity of Flooding Games on Graphs with Interval Representations.- How to Generalize Janken – Rock-Paper-Scissors-King-Flea.- Spanning Caterpillars Having at Most k Leaves.- GDDs with Two Associate Classes and with Three Groups of Sizes 1, n, n and ?1 < ?2.- The Number of Diagonal Transformations in Quadrangulations on the Sphere.- Remarks on Schur’s Conjecture.- Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks.- A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian.- On Simplifying Deformation of Smooth Manifolds Defined by Large Weighted Point Sets.