Accepted Papers
- Vadim Levit and Eugen Mandrescu. Critical Independent Sets and Konig--Egervary Graphs
- Tsunehiko Kameda, Ichiro Suzuki and John Zhang. Minimization of Distance Traveled in Surveillance of a Polygonal Region from the Boundary
- asish mukhopadhyay, Eugene Greene and Animesh Sarker. Approximate minimum spanning ellipse in the streaming model
- Greg Aloupis, Jean Cardinal, Sebastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky and Perouz Taslakian. Colorful Strips
- Celine Engelbeen, Samuel Fiorini and Antje Kiesel. A closest vector problem arising in radiation therapy planning
- Avapa Chantasartrassmee and Narong Punnim. Regular Graphs with Maximum Forest Number
- Greg Aloupis, Jean Cardinal, Sebastien 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
- Kiyoshi Ando. Wide-diameter of a k-connected graph with diameter d
- Yvan Maillot, Bruno Adam and Mahmoud Melkemi. Locally Density Adaptative Alpha Shape
- Kazuhiko Ushio. Balanced $C_8$-Bowtie Designs
- Narong Punnim. Graphs and their arboricities
- Chie Nara and Jin-ichi Itoh. Minimal Surface Area of Polyhedral Unfoldings
- Nittiya Pabhapote and Narong Punnim. Group divisible designs with two associate classes and $\lambda_1\geq\lambda_2$
- kishore yadav, satish varagani, kishore kothapalli and Venkaiah V.Ch. Acyclic Vertex Coloring of Graphs of Maximum Degree 4
- Boris Aronov, Muriel Dulieu and Ferran Hurtado. Witness (Delaunay) Graphs
- Katsuhisa Yamanaka and Shin-ichi Nakano. Efficient Enumeration of All Ladder Lotteries with k Bars
- Narong Punnim and Sermsri Thaithae. The Hamiltonian number of some classes of cubic graphs
- Kashif Ali. On the Ramsey numbers for linear forest versus some graphs
- Toshinori Sakai and Jorge Urrutia. Convex Decompositions of Point Sets in the Plane
- Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa and Csaba Toth. A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets
- Camino Balbuena, Mucuy-kak Guevara, Jose Ra. Portillo and Pedro Reyes. Advances in the Erd\H{o}s-S\'os conjecture for spiders
- Adan Cabello, Antonio J. Lopez-Tarrida, Pilar Moreno and Jose Ra. Portillo. Classification of the entanglement propierties of eight-qubit graph states
- Ahmad Biniaz. Circumcircular Range Searching in Higher Order Delaunay Triangulations
- Anita Das. A Combinatorial Approach to the Tanny Sequence
- Kiyoshi Hosono. On an empty triangle with the maximum area in planar point sets
- TAKAYASU KUWATA and HIROSHI MAEHARA. On Plane Figures Satisfying the Steinhaus Condition
- Hiroshi Maehara. Classification of the congruent embeddings of a tetrhedron into a triangular prism
- Hiroko Hayashi, Kazushi Komatsu and Fumihiko nakano. Notes on vertex atlas of planar Danzer tiling
- L. Sunil Chandran, Mathew Francis and Rogers Mathew. Chordal Bipartite Graphs with High Boxicity
- Hazrul Iswadi, Edy Tri Baskoro, Hilda Assiyatun and M Salman. Metric dimension of antipodal and pendant-free block-cactus graphs
- I Wayan Sudarsana, Edy Tri Baskoro, Hilda Assiyatun and Saladin Uttunggadewa. On the Ramsey numbers for the union of graphs
- Yosuke Kikuchi, Katsuhisa Yamanaka and Shin-Ichi Nakano. Enumerating All Graphical Sequences (Extended Abstract)
- Syed Ishtiaque Ahmed, Masud Hasan and Md. Ariful Islam. Cutting a Convex Polyhedron Out of a Sphere
- Akio Fujiyoshi and Masakazu Suzuki. Minimum Spanning Tree Problem with Label Selection and Its Application to Mathematical OCR
- Gek Ling Chia and Chan Lye Lee. Crossing Numbers and Skewness of Some 5-Regular Graphs
- Emilio Di Giacomo, Francesco Giordano and Giuseppe Liotta. Upward Topological Book Embeddings of DAGs
- Masanobu Furuse, Yota Otachi and Koichi Yamazaki. Reformulation of the scheme for computing tree-width and minimum fill-in
- Lyra Yulianti, Edy Tri Baskoro, Hilda Assiyatun and Saladin Uttunggadewa. On Ramsey (K_(1,2), P_4)-minimal Graphs
- Jean Cardinal, Erik Demaine, Martin Demaine, Shinji Imahori, Stefan Langerman and Ryuhei Uehara. Algorithmic Folding Complexity
- Kazuaki Kobayashi and Takako Kodate. Minimal Embedding of Complete Bipartite Graphs on Surfaces
- Michael Kerber and Michael Sagraloff. How Complex are Real Algebraic Objects?
- Shinya Fujita. Recent Progress on Balanced Decompositions in Vertex-Colored Graphs
- Yusuke Watanabe and Kenji Fukumizu. New graph polynomials satisfying deletion-contraction relations
- Boris Aronov, Delia Garijo, Yurai Nunez-Rodriguez, David Rappaport, Carlos Seara and Jorge Urrutia. Measuring the error of linear separators on linearly inseparable data
- Azadeh Tabatabaei and Ali Mohades. Clarity Watchman Route
- Shuji Yamada, Jinko Kanno and Miki Miyauchi. Multi-Sized Sphere Packing
- Hiroo Kishimoto and Mikio Kano. A closure concept for spanning k-tree of graphs
- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno. Recent Advances on the $L(2,1)$-labeling Problem
- Takahiro Tsuno and Yukio Shibata. Factorization of Generalized de Bruijn and Kautz Digraphs by Loop-Rooted Trees
- Anish Man Singh Shrestha, Satoshi Tayu and Shuichi Ueno. On Two-Directional Orthogonal Ray Graphs
- Ho-Lun Cheng. Topological Ball Decomposition of Growing Macromolecules for Fast Visualization by Flow Complexes
- Sang Won Bae, Matias Korman and Yoshio Okamoto. On the Geodesic Diameter in Polygonal Domains
- Hiroshi KOIZUMI and Kokichi Sugihara. Maximum Eigenvalue Problem for Escherlization
- Jin Akiyama, Hiro Ito, Midori Kobayashi and Gisaku Nakamura. Arrangements of n points whose incident-line-numbers are at most n/2
- Jin Akiyama, Hiro Ito, Midori Kobayashi and Gisaku Nakamura. Arrangements of eleven points in the plane, each with five incident lines
- Hiroshi FUKUDA, Chiaki Kanomata, Nobuaki Mutoh, Gisaku Nakamura and Doris Schattschneider. Symmetry of Isohedral Tilings of Polyominoes and Polyiamonds as Fundamental Domains
- Hiroshi OZAKI, Hiroshi FUKUDA and Toshiaki Fujiwara. Fixed Center of Mass Configurations of Three Points in Given Curves
- Wongsakorn Charoenpanitseri, Narong Punnim and Chariya Uiyyasathian. On $(k,t)$-choosability of graphs
- Shoichi Tsuchiya and Atsuhiro Nakamoto. Geometric realization of a triangulation on the Klein bottle with one face removed
- Narong Punnim and Chariya Uiyyasathian. Group divisible designs with two associate classes
- Richard Schmied and Claus Viehmann. On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs
- Takahisa Toda. CONVEX SETS IN A REAL PROJECTIVE SPACE AND ITS APPLICATION TO COMPUTATIONAL GEOMETRY
- Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman and Joseph O'Rourke. Continuous Blooming of Convex Polyhedra
- Fatemeh Panahi, Ali Mohades Khorasani and Saeed Aliakbarian. Computing Minimum-Cost Limited-Capacity Many-To-Many Point Matching
- Saeed Aliakbarian, Fatemeh Panahi and Ali Mohades Khorasani. Visibility Area of a Point in Existence of Circular Obstacles
- Rajendra Lal, P S Sai Prasad and S V Suryanarayana. An Algorithm for Shortest Path in Ploygons with Disc Obstacles
- Takuya Hara and Kokichi Sugihara. Computer Aided Design of Pop-up Books with Two-dimensional V-fold Structures
- Thomas IWASZKO, Mahmoud MELKEMI and Lhassane IDOUMGHAR. Regions of Empty Overlapping Circles (Extended Abstract)
- Amr Elmasry and Madhusudan Manjunath. Enumerating Trichromatic Triangles Containing the Origin in Linear Time
- Erik D. Demaine, Martin L. Demaine, Vi Hart, Gregory N. Price and Tomohiro Tachi. (Non)existence of Pleated Folds: How Paper Folds Between Creases
- Bitner Steven, Yam Ki Cheung and Ovidiu Daescu. On the minimum color separation circle
- Alireza Davoodi, Pooyan Fazli, Philippe Pasquier and Alan K. Mackworth. Fault-Tolerant Multi-Robot Area Coverage with Limited Visibility
- Timothy James Yusun, Mari-Jo Ruiz and Ian June Garces. Rainbow Colorings of Generalized Petersen Graphs