iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-3-540-77120-3
Algorithms and Computation: 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings | SpringerLink
Skip to main content
Springer Nature Link
Log in

Algorithms and Computation

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

  • Conference proceedings
  • © 2007

Overview

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)

Included in the following conference series:

Conference proceedings info: ISAAC 2007.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy 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

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (79 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talk

    1. Modeling and Analyzing Massive Terrain Data Sets

      • Pankaj K. Agarwal
      Pages 1-1

    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

    2. Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs

      • Toshimasa Ishii
      Pages 29-40

    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

    2. A Spectral Method for MAX2SAT in the Planted Solution Model

      • Masaki Yamamoto
      Pages 112-123

    3. On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices

      • Uffe Flarup, Pascal Koiran, Laurent Lyaudet
      Pages 124-136

    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

    1. On Mixing and Edge Expansion Properties in Randomized Broadcasting

      • Thomas Sauerwald
      Pages 196-207
Back to top

Other volumes

  1. Algorithms and Computation

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation