A Tentative Program

November 10, Tuesday

Registration desk is open during 18:00-20:00.

November 11, Wednesday

Session 1: Invited talk (9:50-10:40)

János Pach. Thrackles and Other Embeddings with Many Crossings [Abstract]

Session 2A: Geometric Algorithms on the Plane (11:00-12:20)

Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara and Perouz Taslakian. Matching Points with Things [2 page Abstract]
Asish Mukhopadhyay, Eugene Greene and Animesh Sarker. Approximate minimum spanning ellipse in the streaming model [2 page Abstract]
Sang Won Bae, Matias Korman and Yoshio Okamoto. On the Geodesic Diameter in Polygonal Domains [2 page Abstract]
Rajendra Lal, P S Sai Prasad and S V Suryanarayana. An Algorithm for Shortest Path in Ploygons with Disc Obstacles [2 page Abstract]

Session 2B: Combinatorial Geometry (11:00-12:20)

Toshinori Sakai and Jorge Urrutia. Convex Decompositions of Point Sets in the Plane [2 page Abstract]
Takayasu Kuwata and Hiroshi Maehara. On Plane Figures Satisfying the Steinhaus Condition [2 page Abstract]
Kiyoshi Hosono. On an empty triangle with the maximum area in planar point sets [2 page Abstract]
Takahisa Toda. Convex Sets in a Real Projective Space and Its Application to Computational Geometry [2 page Abstract]

Session 2C: Graph Theory (11:00-12:20)

Kiyoshi Ando. Wide-diameter of a k-connected graph with diameter d [2 page Abstract]
Vadim Levit and Eugen Mandrescu. Critical Independent Sets and König-Egerváry Graphs [2 page Abstract]
Avapa Chantasartrassmee and Narong Punnim. Regular Graphs with Maximum Forest Number [2 page Abstract]
Narong Punnim and Sermsri Thaithae. The Hamiltonian number of some classes of cubic graphs [2 page Abstract]

Session 3: Invited talk (13:50-14:40)

Mikio Kano. Discrete Geometry on Red and Blue Points on the Plane Lattice [Abstract]

Session 4A: Geometric Incidences (15:00-16:00)

Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa and Csaba Tóth. A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets [2 page Abstract]
Jin Akiyama, Hiro Ito, Midori Kobayashi and Gisaku Nakamura. Arrangements of n points whose incident-line-numbers are at most n/2 [2 page Abstract]
Jin Akiyama, Hiro Ito, Midori Kobayashi and Gisaku Nakamura. Arrangements of eleven points in the plane, each with five incident lines [2 page Abstract]

Session 4B: Combinatorial Design (15:00-16:00)

Narong Punnim. Graphs and their arboricities [2 page Abstract]
Nittiya Pabhapote and Narong Punnim. Group divisible designs with two associate classes and λ₁≥λ₂ [2 page Abstract]
Narong Punnim and Chariya Uiyyasathian. Group divisible designs with two associate classes [2 page Abstract]

Session 4C: Decompositions of Graphs (15:00-16:00)

Takahiro Tsuno and Yukio Shibata. Factorization of Generalized de Bruijn and Kautz Digraphs by Loop-Rooted Trees [2 page Abstract]
Shinya Fujita. Recent Progress on Balanced Decompositions in Vertex-Colored Graphs [2 page Abstract]
Kazuhiko Ushio. Balanced C₈-Bowtie Designs [2 page Abstract]

Session 5A: Tiling and Packing (16:20-18:00)

Hiroko Hayashi, Kazushi Komatsu and Fumihiko Nakano. Notes on vertex atlas of planar Danzer tiling [2 page Abstract]
Hiroshi Fukuda, Chiaki Kanomata, Nobuaki Mutoh, Gisaku Nakamura and Doris Schattschneider. Symmetry of Isohedral Tilings of Polyominoes and Polyiamonds as Fundamental Domains [2 page Abstract]
Hiroshi Koizumi and Kokichi Sugihara. Maximum Eigenvalue Problem for Escherlization [2 page Abstract]
Shuji Yamada, Jinko Kanno and Miki Miyauchi. Multi-Sized Sphere Packing [2 page Abstract]

Session 5B: Combinatorial Enumeration and Algorithms (16:20-18:00)

Anita Das. A Combinatorial Approach to the Tanny Sequence [2 page Abstract]
Yusuke Watanabe and Kenji Fukumizu. New graph polynomials satisfying deletion-contraction relations [2 page Abstract]
Yosuke Kikuchi, Katsuhisa Yamanaka and Shin-Ichi Nakano. Enumerating All Graphical Sequences [2 page Abstract]
Katsuhisa Yamanaka and Shin-ichi Nakano. Efficient Enumeration of All Ladder Lotteries with k Bars [2 page Abstract]

Session 5C: Graph Coloring and Related Topics (16:20-18:00)

Wongsakorn Charoenpanitseri, Narong Punnim and Chariya Uiyyasathian. On (k,t)-choosability of graphs [2 page Abstract]
Timothy James Yusun, Mari-Jo Ruiz and Ian June Garces. Rainbow Colorings of Generalized Petersen Graphs [2 page Abstract]
Kishore Yadav, Satish Varagani, Kishore Kothapalli and V. Ch. Venkaiah Acyclic Vertex Coloring of Graphs of Maximum Degree 4 [2 page Abstract]
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno. Recent Advances on the L(2,1)-labeling Problem [2 page Abstract]

November 12, Thursday

Session 6A: Navigation and Visibility (9:20-10:40)

Tsunehiko Kameda, Ichiro Suzuki and John Zhang. Minimization of Distance Traveled in Surveillance of a Polygonal Region from the Boundary [2 page Abstract]
Alireza Davoodi, Pooyan Fazli, Philippe Pasquier and Alan K. Mackworth. On Multi-Robot Area Coverage [2 page Abstract]
Azadeh Tabatabaei and Ali Mohades. Clarity Watchman Route [2 page Abstract]
Saeed Aliakbarian, Fatemeh Panahi and Ali Mohades Khorasani. Visibility Area of a Point in Existence of Circular Obstacles [2 page Abstract]

Session 6B: Geometric Proximity (9:20-10:40)

Thomas Iwaszko, Mahmoud Melkemi and Lhassane Idoumghar. Regions of Empty Overlapping Circles [2 page Abstract]
Yvan Maillot, Bruno Adam and Mahmoud Melkemi. Locally Density Adaptative Alpha Shape [2 page Abstract]
Ahmad Biniaz. Circumcircular Range Searching in Higher Order Delaunay Triangulations [2 page Abstract]
Boris Aronov, Muriel Dulieu and Ferran Hurtado. Witness (Delaunay) Graphs [2 page Abstract]

Session 6C: Graph Classes (9:20-10:40)

Hazrul Iswadi, Edy Tri Baskoro, Hilda Assiyatun and M Salman. Metric dimension of antipodal and pendant-free block-cactus graphs [2 page Abstract]
Masanobu Furuse, Yota Otachi and Koichi Yamazaki. Reformulation of the scheme for computing tree-width and minimum fill-in [2 page Abstract]
Anish Man Singh Shrestha, Satoshi Tayu and Shuichi Ueno. On Two-Directional Orthogonal Ray Graphs [2 page Abstract]
L. Sunil Chandran, Mathew Francis and Rogers Mathew. Chordal Bipartite Graphs with High Boxicity [2 page Abstract]

Session 7A: Colorful Discrete and Computational Geometry (11:00-12:20)

Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky and Perouz Taslakian. Colorful Strips [2 page Abstract]
Boris Aronov, Delia Garijo, Yurai Núñez-Rodríguez, David Rappaport, Carlos Seara and Jorge Urrutia. Measuring the error of linear separators on linearly inseparable data [2 page Abstract]
Amr Elmasry and Madhusudan Manjunath. Enumerating Trichromatic Triangles Containing the Origin in Linear Time [2 page Abstract]
Bitner Steven, Yam Ki Cheung and Ovidiu Daescu. On the minimum color separation circle [2 page Abstract]

Session 7B: Physics-Motivated Geometry and Graph Theory (11:00-12:00)

Adán Cabello, Antonio J. López-Tárrida, Pilar Moreno and José Ra. Portillo. Classification of the entanglement propierties of eight-qubit graph states [2 page Abstract]
Hiroshi Ozaki, Hiroshi Fukuda and Toshiaki Fujiwara. Fixed Center of Mass Configurations of Three Points in Given Curves [2 page Abstract]
Takuya Hara and Kokichi Sugihara. Computer Aided Design of Pop-up Books with Two-dimensional V-fold Structures [2 page Abstract]

Session 7C: Ramsey Theory (11:00-12:00)

Kashif Ali. On the Ramsey numbers for linear forest versus some graphs [2 page Abstract]
I Wayan Sudarsana, Edy Tri Baskoro, Hilda Assiyatun and Saladin Uttunggadewa. On the Ramsey numbers for the union of graphs [2 page Abstract]
Lyra Yulianti, Edy Tri Baskoro, Hilda Assiyatun and Saladin Uttunggadewa. On Ramsey (K_1,2, P₄)-minimal Graphs [2 page Abstract]

Session 49: 49er's Special Session (13:50-18:00)

D. T. Lee Multi-Party k-Means Clustering with Privacy Consideration [Abstract]
Shuji Tsukiyama Statistical Static Timing Analysis ---What We Have Ever Seen--- [Abstract]
Kurt Mehlhorn Cycles Bases of Graphs Properties, Algorithms, Hardness, Open Problems [Abstract]
Tomio Hirata A textile design and related graph problems [Abstract]
David Kirkpatrick Bounded Curvature path planning revisited [Abstract]
Tetsuo Asano The Most Favorite Ten Papers of My Own [Abstract]

Banquet (18:30-20:30)

Banquet place is the Ballroom in Kanazawa Excel Hotel Tokyu.

November 13, Friday

Session 8: Invited talk (9:20-10:10)

Erik D. Demaine Algorithms Meet Art, Puzzles, and Magic [Abstract]

Session 9A: Convex Polyhedra (10:30-11:30)

Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman and Joseph O'Rourke. Continuous Blooming of Convex Polyhedra [2 page Abstract]
Hiroshi Maehara. Classification of the congruent embeddings of a tetrhedron into a triangular prism [2 page Abstract]
Syed Ishtiaque Ahmed, Masud Hasan and Md. Ariful Islam. Cutting a Convex Polyhedron Out of a Sphere [2 page Abstract]

Session 9B: Graph Drawing and Embedding (10:30-11:30)

Gek Ling Chia and Chan Lye Lee. Crossing Numbers and Skewness of Some 5-Regular Graphs [2 page Abstract]
Emilio Di Giacomo, Francesco Giordano and Giuseppe Liotta. Upward Topological Book Embeddings of DAGs [2 page Abstract]
Kazuaki Kobayashi and Takako Kodate. Minimal Embedding of Complete Bipartite Graphs on Surfaces [2 page Abstract]

Session 9C: Optimization (10:30-11:30)

Richard Schmied and Claus Viehmann. On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs [2 page Abstract]
Celine Engelbeen, Samuel Fiorini and Antje Kiesel. A closest vector problem arising in radiation therapy planning [2 page Abstract]
Fatemeh Panahi, Ali Mohades Khorasani and Saeed Aliakbarian. Computing Minimum-Cost Limited-Capacity Many-To-Many Point Matching [2 page Abstract]

Session 10A: Folding and Unfolding (11:40-12:40)

Erik D. Demaine, Martin L. Demaine, Vi Hart, Gregory N. Price and Tomohiro Tachi. (Non)existence of Pleated Folds: How Paper Folds Between Creases [2 page Abstract]
Jean Cardinal, Erik Demaine, Martin Demaine, Shinji Imahori, Stefan Langerman and Ryuhei Uehara. Algorithmic Folding Complexity [2 page Abstract]
Chie Nara and Jin-ichi Itoh. Minimal Surface Area of Polyhedral Unfoldings [2 page Abstract]

Session 10B: Topology-Related Discrete and Computational Geometry (11:40-12:40)

Shoichi Tsuchiya and Atsuhiro Nakamoto. Geometric realization of a triangulation on the Klein bottle with one face removed [2 page Abstract]
Ho-Lun Cheng. Topological Ball Decomposition of Growing Macromolecules for Fast Visualization by Flow Complexes [2 page Abstract]
Michael Kerber and Michael Sagraloff. How Complex are Real Algebraic Objects? [2 page Abstract]

Session 10C: Trees (11:40-12:40)

Camino Balbuena, Mucuy-kak Guevara, José Ra. Portillo and Pedro Reyes. Advances in the Erdős-Sós conjecture for spiders [2 page Abstract]
Akio Fujiyoshi and Masakazu Suzuki. Minimum Spanning Tree Problem with Label Selection and Its Application to Mathematical OCR [2 page Abstract]
Hiroo Kishimoto and Mikio Kano. A closure concept for spanning k-tree of graphs [2 page Abstract]

Last modified: Wed Feb 10 06:09:40 JST 2010
by Ryuhei Uehara (uehara@jaist.ac.jp)