Conferences in DBLP
Jin Akiyama , Atsushi Kaneko , Mikio Kano , Gisaku Nakamura , Eduardo Rivera-Campo , Shin-ichi Tokunaga , Jorge Urrutia Radial Perfect Partitions of Convex Sets in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Jin Akiyama , Gisaku Nakamura Dudeney Dissection of Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano Effective Use of Geometric Properties for Clustering. [Citation Graph (0, 0)][DBLP ] Conf ] David Avis Living with lrs . [Citation Graph (0, 0)][DBLP ] Conf ] David Avis , Kiyoshi Hosono , Masatsugu Urabe On the Existence of a Point Subset with 4 or 5 Interior Points. [Citation Graph (0, 0)][DBLP ] Conf ] Ala Eddine Barouni , Ali Jaoua , Nejib Zaguia Planar Drawing Algorithms of Survivable Telecommunication Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Jurek Czyzowicz , Evangelos Kranakis , Danny Krizanc , Anil Maheshwari Polygon Cutting: Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Jurek Czyzowicz , Evangelos Kranakis , Anil Maheshwari Algorithms for Packing Two Circles in a Convex Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Martin L. Demaine , Anna Lubiw Folding and Cutting Paper. [Citation Graph (0, 0)][DBLP ] Conf ] Hisamoto Hiyoshi , Kokichi Sugihara An Interpolant Based on Line Segment Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Hiro Ito , Hideyuki Uehara , Mitsuo Yokoyama 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces. [Citation Graph (0, 0)][DBLP ] Conf ] Hiro Ito , Hideyuki Uehara , Mitsuo Yokoyama NP-Completeness of Stage Illumination Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Atsushi Kaneko On the Maximum Degree of Bipartite Embeddings of Trees in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Evangelos Kranakis , Danny Krizanc , Jorge Urrutia Efficient Regular Polygon Dissections. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Maehara , Ai Oshiro On Soddy's Hexlet and a Linked 4-Pair. [Citation Graph (0, 0)][DBLP ] Conf ] Tomomi Matsui Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Nobuaki Mutoh , Gisaku Nakamura Visibility of Disks on the Lattice Points. [Citation Graph (0, 0)][DBLP ] Conf ] Takayuki Nagai , Seigo Yasutome , Nobuki Tokura Convex Hull Problem with Imprecise Input. [Citation Graph (0, 0)][DBLP ] Conf ] Tomoki Nakamigawa One-Dimensional Tilings with Congruent Copies of a 3-Point Set. [Citation Graph (0, 0)][DBLP ] Conf ] Manuela Neagu Polygonal Approximations for Curved Problems: An Application to Arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Nielsen Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph O'Rourke Folding and Unfolding in Computational Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] János Pach Crossing Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Eduardo Rivera-Campo A Note on the Existence of Plane Spanning Trees of Geometric Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Toshinori Sakai Embeddings of Equilateral Polygons in Unit Lattices. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Schmitt , Jean-Claude Spehner Order-k Voronoi Diagrams, k -Sections, and k -Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Kokichi Sugihara "Impossible Objects" Are Not Necessarily Impossible - Mathematical Study on Optical Illusion. [Citation Graph (0, 0)][DBLP ] Conf ] Xuehou Tan An Efficient Solution to the Corridor Search Problem. [Citation Graph (0, 0)][DBLP ] Conf ] 