Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2003

Computing and Combinatorics

9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings

Editors:

  1. Tandy Warnow

    1. Department of Computer Science, University of Texas at Austin, Austin, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Binhai Zhu

    1. Department of Computer Science, Montana State University, Bozeman, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Conference series link(s): COCOON: International Computing and Combinatorics Conference

Conference proceedings info: COCOON 2003.

Sections

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (55 papers)

  1. Front Matter

    Pages I-XIII
    PDF

  2. Invited Lecture

    1. LIAR!

      • Joel Spencer
      Pages 1-2

  3. Computational Geometry I

    1. Cylindrical Hierarchy for Deforming Necklaces

      • Sergei Bespamyatnikh
      Pages 20-29

    3. Traveling Salesman Problem of Segments

      • Jinhui Xu, Yang Yang, Zhiyong Lin
      Pages 40-49

  4. Computational Biology I

    1. A Space Efficient Algorithm for Sequence Alignment with Inversions

      • Yong Gao, Junfeng Wu, Robert Niewiadomski, Yang Wang, Zhi-Zhong Chen, Guohui Lin
      Pages 57-67

    3. On All-Substrings Alignment Problems

      • Wei Fu, Wing-Kai Hon, Wing-Kin Sung
      Pages 80-89

  5. Computational/Complexity Theory I

    1. The Specker-Blatter Theorem Revisited

      • E. Fischer, J. A. Makowsky
      Pages 90-101

  6. Graph Theory/Algorithms I

    1. On the Full and Bottleneck Full Steiner Tree Problems

      • Yen Hung Chen, Chin Lung Lu, Chuan Yi Tang
      Pages 122-129

    2. The Structure and Number of Global Roundings of a Graph

      • Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
      Pages 130-138

    3. On Even Triangulations of 2-Connected Embedded Graphs

      • Huaming Zhang, Xin He
      Pages 139-148

  7. Automata/Petri Net Theory

    1. Petri Nets with Simple Circuits

      • Hsu-Chun Yen, Lien-Po Yu
      Pages 149-158

    2. Automatic Verification of Multi-queue Discrete Timed Automata

      • Pierluigi San Pietro, Zhe Dang
      Pages 159-171

  8. Graph Theory/Algorithms II

    1. List Total Colorings of Series-Parallel Graphs

      • Xiao Zhou, Yuki Matsuo, Takao Nishizeki
      Pages 172-181
Back to top

Other Volumes

  1. Computing and Combinatorics

Back to top

Keywords

Back to top

Editors and Affiliations

  • Department of Computer Science, University of Texas at Austin, Austin, USA

    Tandy Warnow

  • Department of Computer Science, Montana State University, Bozeman, USA

    Binhai Zhu

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation