Computational Geometry and Graph Theory

International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers

  • Hiro Ito
  • Mikio Kano
  • Naoki Katoh
  • Yushi Uno

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

Table of contents

  1. Front Matter
  2. Jin Akiyama, Midori Kobayashi, Gisaku Nakamura
    Pages 1-13
  3. Jin Akiyama, Chie Nara
    Pages 14-24
  4. Sergey Bereg, Hiro Ito
    Pages 25-32
  5. Avapa Chantasartrassmee, Narong Punnim
    Pages 33-40
  6. Ovidiu Daescu, Jun Luo
    Pages 41-55
  7. Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael Soss, Diane L. Souvaine et al.
    Pages 56-67
  8. Hiroshi Fukuda, Nobuaki Mutoh, Gisaku Nakamura, Doris Schattschneider
    Pages 68-78
  9. Severino V. Gervacio, Yvette F. Lim, Leonor A. Ruivivar
    Pages 79-84
  10. Hasmawati, H. Assiyatun, E. T. Baskoro, A. N. M. Salman
    Pages 85-89
  11. William S. Kennedy, Bruce Reed
    Pages 101-107
  12. Guizhen Liu
    Pages 108-118
  13. Hirobumi Mizuno, Iwao Sato
    Pages 132-143
  14. A. A. G. Ngurah, E. T. Baskoro, R. Simanjuntak, S. Uttunggadewa
    Pages 144-154
  15. Yoshiaki Oda, Mamoru Watanabe
    Pages 155-165
  16. Wael El Oraiby, Dominique Schmitt
    Pages 166-177
  17. János Pach, Gábor Tardos
    Pages 178-185

About these proceedings

Introduction

This book constitutes the thoroughly refereed post-conference proceedings of the Kyoto Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007, held in Kyoto, Japan, in June 2007, in honor of Jin Akiyama and Vašek Chvátal, on the occasion of their 60th birthdays.

The 19 revised full papers, presented together with 5 invited papers, were carefully selected during two rounds of reviewing and improvement from more than 60 talks at the conference. All aspects of Computational Geometry and Graph Theory are covered, including tilings, polygons, impossible objects, coloring of graphs, Hamilton cycles, and factors of graphs.

Keywords

Graph Graph theory Sim algorithmic geometry approximation combinatorial mathematics computational geometry computational graph theory convex geometry convex polygons discrete geometry geometric algorithms graph coloring graph computations graph transfor

Editors and affiliations

  • Hiro Ito
    • 1
  • Mikio Kano
    • 2
  • Naoki Katoh
    • 3
  • Yushi Uno
    • 4
  1. 1.School of InformaticsKyoto University, Yosida-HonmatiKyotoJapan
  2. 2.Ibaraki University, Nakanarusawa, HitachiIbarakiJapan
  3. 3.Department of Architecture and Architectural EngineeringKyoto University, Nishikyo-kuKyotoJapan
  4. 4.Graduate School of Science, Department of Mathematics and Information SciencesOsaka Prefecture UniversitySakaiJapan

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-89550-3
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-89549-7
  • Online ISBN 978-3-540-89550-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book