Discrete Geometry, Combinatorics and Graph Theory

7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi’an, China, November 22-24, 2005, Revised Selected Papers

  • Editors
  • Jin Akiyama
  • William Y. C. Chen
  • Mikio Kano
  • Xueliang Li
  • Qinglin Yu
Conference proceedings

DOI: 10.1007/978-3-540-70666-3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4381)

Table of contents

  1. Front Matter
  2. Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura
    Pages 1-9
  3. Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
    Pages 21-29
  4. V. M. Heredia, J. Urrutia
    Pages 38-46
  5. G. L. Lan, Z. M. Ma, S. S. Sun
    Pages 88-100
  6. Guizhen Liu, Changqing Xu
    Pages 101-108
  7. Guoyan Ma, Baoyindureng Wu
    Pages 109-119
  8. Yinghong Ma, Qinglin Yu
    Pages 120-129
  9. Aygul Mamut, Elkin Vumar
    Pages 130-134
  10. János Pach, Gábor Tardos, Géza Tóth
    Pages 135-148
  11. Narong Punnim
    Pages 149-161
  12. Songpu Shang, Xiaodong Hu, Tong Jing
    Pages 166-176
  13. Yong-Bing Shi, Yin-Cai Tang, Hua Tang, Ling-Liu Gong, Li Xu
    Pages 177-188

About these proceedings

Keywords

Graph Graph theory Sim algorithm algorithmic geometry algorithms combinatorial mathematics computational geometry computational graph theory convex geometry convex polygons discrete geometry graph transformations lattice vertices

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-70665-6
  • Online ISBN 978-3-540-70666-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349