Skip to main content
SpringerLink
Log in

Algorithms and Computation

17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Tetsuo Asano

    1. Japan Advanced Institute of Science and Technology, Japan

    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 4288)

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

Included in the following conference series:

Conference proceedings info: ISAAC 2006.

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

Access this book

Log in via an institution
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 (75 papers)

  1. Session 5A: Combinatorial Optimization and Computational Biology

    1. Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications

      • George Tsaggouris, Christos Zaroliagis
      Pages 389-398

    2. Algorithms for Computing Variants of the Longest Common Subsequence Problem

      • M. Sohel Rahman, Costas S. Iliopoulos
      Pages 399-408

  2. Session 5B: Graphs

    1. Constructing Labeling Schemes Through Universal Matrices

      • Amos Korman, David Peleg, Yoav Rodeh
      Pages 409-418

    2. Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions

      • Pinar Heggernes, Federico Mancini, Charis Papadopoulos
      Pages 419-428

    3. Analyzing Disturbed Diffusion on Networks

      • Henning Meyerhenke, Thomas Sauerwald
      Pages 429-438

    4. Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs

      • Chunmei Liu, Yinglei Song
      Pages 439-448

    5. On Isomorphism and Canonization of Tournaments and Hypertournaments

      • V. Arvind, Bireswar Das, Partha Mukhopadhyay
      Pages 449-459

  3. Session 6A: Algorithms and Data Structures

    1. Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem

      • Tien-Ching Lin, D. T. Lee
      Pages 460-473

    2. Deterministic Random Walks on the Two-Dimensional Grid

      • Benjamin Doerr, Tobias Friedrich
      Pages 474-483

    3. Improving Time and Space Complexity for Compressed Pattern Matching

      • Shirou Maruyama, Hiromitsu Miyagawa, Hiroshi Sakamoto
      Pages 484-493

    4. Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems

      • Yunhong Zhou
      Pages 494-506

  4. Session 6B: Graphs

    1. A Simple Message Passing Algorithm for Graph Partitioning Problems

      • Mikael Onsjö, Osamu Watanabe
      Pages 507-516

    2. Minimal Interval Completion Through Graph Exploration

      • Karol Suchan, Ioan Todinca
      Pages 517-526

    3. Balanced Cut Approximation in Random Geometric Graphs

      • Josep Diaz, Fabrizio Grandoni, Alberto Marchetti Spaccamela
      Pages 527-536

    4. Improved Algorithms for the Minmax-Regret 1-Center Problem

      • Tzu-Chin Lin, Hung-I Yu, Biing-Feng Wang
      Pages 537-546

  5. Session 7A: Approximation Algorithms

    1. On Approximating the Maximum Simple Sharing Problem

      • Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu
      Pages 547-556

    2. Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures

      • Łukasz Kowalik
      Pages 557-566

    3. Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems

      • Mingen Lin, Yang Yang, Jinhui Xu
      Pages 567-577

  6. Session 7B: Graphs

    1. Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii

      • Guido Proietti, Peter Widmayer
      Pages 578-587

    2. Efficient Prüfer-Like Coding and Counting Labelled Hypertrees

      • Saswata Shannigrahi, Sudebkumar Prasant Pal
      Pages 588-597
Back to top

Other volumes

  1. Algorithms and Computation

Editors and Affiliations

  • Japan Advanced Institute of Science and Technology, Japan

    Tetsuo Asano

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation