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

Algorithms and Computation

18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings

Editors:

  1. Takeshi Tokuyama
    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 4835)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ISAAC: International Symposium on Algorithms and Computation

Conference proceedings info: ISAAC 2007.

Sections

Buy it now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (79 papers)

  1. Front Matter

    PDF

  2. Invited Talk

    2. Coloring Triangle-Free Graphs on Surfaces

      • ZdenÄ›k Dvořák, Daniel Král’, Robin Thomas
      Pages 2-4

  3. Best Paper Award Presentation

    1. Integer Representation and Counting in the Bit Probe Model

      • M. Ziaur Rahman, J. Ian Munro
      Pages 5-16

  4. 1A Graph Algorithms I

    1. Minimum Degree Orderings

      • Hiroshi Nagamochi
      Pages 17-28

    3. Dynamic Distance Hereditary Graphs Using Split Decomposition

      • Emeric Gioan, Christophe Paul
      Pages 41-51

    4. Unifying Two Graph Decompositions with Modular Decomposition

      • Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
      Pages 52-64

  5. 1B Computational Geometry I

    1. Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem

      • Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin
      Pages 65-74

    2. Geometric Spanner of Segments

      • Yang Yang, Yongding Zhu, Jinhui Xu, Naoki Katoh
      Pages 75-87

    3. Dilation-Optimal Edge Deletion in Polygonal Cycles

      • Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel Smid, Yajun Wang
      Pages 88-99

  6. 2A Complexity I

    1. Unbounded-Error Classical and Quantum Communication Complexity

      • Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
      Pages 100-111

    4. The 1-Versus-2 Queries Problem Revisited

      • Rahul Tripathi
      Pages 137-147

  7. 2B Graph Drawing

    1. Approximating the Crossing Number of Toroidal Graphs

      • Petr HlinÄ›ný, Gelasio Salazar
      Pages 148-159

    2. Width-Optimal Visibility Representations of Plane Graphs

      • Jia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun Yen
      Pages 160-171

    3. Computing Upward Topological Book Embeddings of Upward Planar Digraphs

      • F. Giordano, G. Liotta, T. Mchedlidze, A. Symvonis
      Pages 172-183

    4. Algorithms for the Hypergraph and the Minor Crossing Number Problems

      • Markus Chimani, Carsten Gutwenger
      Pages 184-195

  8. 3A Distributed Algorithms

Back to top

Other Volumes

  1. Algorithms and Computation

Back to top

Keywords

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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