Skip to main content
SpringerLink
Log in

Computing and Combinatorics

15th Annual International Conference, COCOON 2009 Niagara Falls, NY, USA, July 13-15, 2009 Proceedings

  • Conference proceedings
  • © 2009

Overview

Editors:
  1. Hung Q. Ngo

    1. Computer Science and Engineering Department, State University of New York at Buffalo, Amherst, 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 5609)

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

Included in the following conference series:

Conference proceedings info: COCOON 2009.

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

Licence this eBook for your library

Institutional subscriptions

Table of contents (52 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talk

    1. Bidding on Configurations in Internet Ad Auctions

      • S. Muthukrishnan
      Pages 1-6

  3. Algorithmic Game Theory and Coding Theory

    1. An Attacker-Defender Game for Honeynets

      • Jin-Yi Cai, Vinod Yegneswaran, Chris Alfeld, Paul Barford
      Pages 7-16

    2. On the Performances of Nash Equilibria in Isolation Games

      • Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
      Pages 17-26

    3. Limits to List Decoding Random Codes

      • Atri Rudra
      Pages 27-36

  4. Algorithms and Data Structures

    1. Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem

      • Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
      Pages 37-46

    2. A (4n − 4)-Bit Representation of a Rectangular Drawing or Floorplan

      • Toshihiko Takahashi, Ryo Fujimaki, Youhei Inoue
      Pages 47-55

    3. Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem

      • Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada
      Pages 56-65

  5. GraphDrawing

    1. Coordinate Assignment for Cyclic Level Graphs

      • Christian Bachmaier, Franz J. Brandenburg, Wolfgang Brunner, Raymund Fülöp
      Pages 66-75

    2. Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs

      • Tamara Mchedlidze, Antonios Symvonis
      Pages 76-85

    3. Edge-Intersection Graphs of k-Bend Paths in Grids

      • Therese Biedl, Michal Stern
      Pages 86-95

  6. Algorithms and Data Structures

    1. Efficient Data Structures for the Orthogonal Range Successor Problem

      • Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang
      Pages 96-105

    2. Reconstruction of Interval Graphs

      • Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
      Pages 106-115

    3. A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions

      • Akiyoshi Shioura, Mutsunori Yagiura
      Pages 116-126

  7. Cryptography and Security

    1. Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model

      • Giovanni Di Crescenzo
      Pages 127-137

    2. Efficient Non-interactive Range Proof

      • Tsz Hon Yuen, Qiong Huang, Yi Mu, Willy Susilo, Duncan S. Wong, Guomin Yang
      Pages 138-147

    3. Approximation Algorithms for Key Management in Secure Multicast

      • Agnes Chan, Rajmohan Rajaraman, Zhifeng Sun, Feng Zhu
      Pages 148-157

  8. Algorithms

    1. On Smoothed Analysis of Quicksort and Hoare’s Find

      • Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi
      Pages 158-167

    2. On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis

      • Axel Simroth, Alexander Souza
      Pages 168-177

    3. Three New Algorithms for Regular Language Enumeration

      • Margareta Ackerman, Erkki Mäkinen
      Pages 178-191
Back to top

Other volumes

  1. Computing and Combinatorics

Keywords

Editors and Affiliations

  • Computer Science and Engineering Department, State University of New York at Buffalo, Amherst, USA

    Hung Q. Ngo

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation