Conferences in DBLP

Japanese Conference on Discrete and Computational Geometry (JCDCG) (jcdcg)
2004 (conf/jcdcg/2004)

1. Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia
   Matching Points with Circles and Squares. [Citation Graph (0, 0)][DBLP]
   JCDCG, 2004, pp:1-15 [Conf]
   
2. Marc Benkert, Alexander Wolff, Florian Widmann
   The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. [Citation Graph (0, 0)][DBLP]
   JCDCG, 2004, pp:16-28 [Conf]
   
3. Sergey Bereg
   Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
   JCDCG, 2004, pp:29-36 [Conf]
   
4. Sergey Bereg, Adrian Dumitrescu, János Pach
   Sliding Disks in the Plane. [Citation Graph (0, 0)][DBLP]
   JCDCG, 2004, pp:37-47 [Conf]
   
5. Prosenjit Bose, Stefan Langerman
   Weighted Ham-Sandwich Cuts. [Citation Graph (0, 0)][DBLP]
   JCDCG, 2004, pp:48-53 [Conf]
   
6. Hervé Brönnimann
   Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane. [Citation Graph (0, 0)][DBLP]
   JCDCG, 2004, pp:54-61 [Conf]
   
7. Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
   Farthest-Point Queries with Geometric and Combinatorial Constraints. [Citation Graph (0, 0)][DBLP]
   JCDCG, 2004, pp:62-75 [Conf]
   
8. Erik D. Demaine, John Iacono, Stefan Langerman
   Grid Vertex-Unfolding Orthostacks. [Citation Graph (0, 0)][DBLP]
   JCDCG, 2004, pp:76-82 [Conf]
   
9. Magdalene Grantson, Christos Levcopoulos
   A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem. [Citation Graph (0, 0)][DBLP]
   JCDCG, 2004, pp:83-94 [Conf]
   
10. Magdalene Grantson, Christos Levcopoulos
    Tight Time Bounds for the Minimum Local Convex Partition Problem. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:95-105 [Conf]
    
11. Joachim Gudmundsson, Jan Vahrenhold
    I/O-Efficiently Pruning Dense Spanners. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:106-116 [Conf]
    
12. Kiyoshi Hosono, Masatsugu Urabe
    On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:117-122 [Conf]
    
13. Hiro Ito
    Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:123-130 [Conf]
    
14. Jonathan Lenchner
    Wedges in Euclidean Arrangements. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:131-142 [Conf]
    
15. Yoichi Maeda
    Visual Pascal Configuration and Quartic Surface. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:143-150 [Conf]
    
16. Jirí Matousek
    Nonexistence of 2-Reptile Simplices. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:151-160 [Conf]
    
17. Ileana Streinu, Walter Whiteley
    Single-Vertex Origami and Spherical Expansive Motions. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:161-173 [Conf]
    
18. Xuehou Tan
    An Optimal Algorithm for the 1-Searchability of Polygonal Rooms. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:174-183 [Conf]
    
19. Gábor Tardos, Géza Tóth
    Crossing Stars in Topological Graphs. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:184-197 [Conf]
    
20. Godfried T. Toussaint
    The Geometry of Musical Rhythm. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:198-212 [Conf]