skip to content
Algorithms and computation : 18th international symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007 : proceedings Preview this item
ClosePreview this item

Algorithms and computation : 18th international symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007 : proceedings

Author: Takeshi Tokuyama
Publisher: Berlin ; New York : Springer, ©2007.
Series: Lecture notes in computer science, 4835.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Edition/Format:   eBook : Document : Conference publication : EnglishView all editions and formats
Summary:
Annotation
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Conference papers and proceedings
Congresses
Additional Physical Format: Print version:
ISAAC (Conference) (18th : 2007 : Sendai-shi, Miyagi-ken, Japan).
Algorithms and computation.
Berlin ; New York : Springer, ©2007
(DLC) 2007940402
(OCoLC)183257716
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Takeshi Tokuyama
ISBN: 9783540771203 3540771204 9783540771180 3540771182
OCLC Number: 232363520
Description: 1 online resource (xvii, 929 pages) : illustrations.
Contents: Invited Talk --
Modeling and Analyzing Massive Terrain Data Sets --
Coloring Triangle-Free Graphs on Surfaces --
Best Paper Award Presentation --
Integer Representation and Counting in the Bit Probe Model --
1A Graph Algorithms I --
Minimum Degree Orderings --
Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs --
Dynamic Distance Hereditary Graphs Using Split Decomposition --
Unifying Two Graph Decompositions with Modular Decomposition --
1B Computational Geometry I --
Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem --
Geometric Spanner of Segments --
Dilation-Optimal Edge Deletion in Polygonal Cycles --
2A Complexity I --
Unbounded-Error Classical and Quantum Communication Complexity --
A Spectral Method for MAX2SAT in the Planted Solution Model --
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices --
The 1-Versus-2 Queries Problem Revisited --
2B Graph Drawing --
Approximating the Crossing Number of Toroidal Graphs --
Width-Optimal Visibility Representations of Plane Graphs --
Computing Upward Topological Book Embeddings of Upward Planar Digraphs --
Algorithms for the Hypergraph and the Minor Crossing Number Problems --
3A Distributed Algorithms --
On Mixing and Edge Expansion Properties in Randomized Broadcasting --
Linear Reconfiguration of Cube-Style Modular Robots --
Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks --
Sensor Network Gossiping or How to Break the Broadcast Lower Bound --
On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem --
3B Optimization I --
Capacitated Domination Problem --
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number --
New Bounds for the Nearly Equitable Edge Coloring Problem --
Approximation to the Minimum Cost Edge Installation Problem --
Approximability of Packing Disjoint Cycles --
4A Data Structure I --
Succinct Representation of Labeled Graphs --
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding --
Kinetic Maintenance of Mobile k-Centres on Trees --
Checking Value-Sensitive Data Structures in Sublinear Space --
4B Game Theory --
Manipulation in Games --
Using Nash Implementation to Achieve Better Frugality Ratios --
The Price of Nash Equilibria in Multicast Transmissions Games --
5A Database Applications --
An Efficient Algorithm for Enumerating Pseudo Cliques --
Fast Adaptive Diagnosis with a Minimum Number of Tests --
Dynamic Structures for Top-k Queries on Uncertain Data --
Separating Populations with Wide Data: A Spectral Analysis --
5B Online Algorithms --
A Constant-Competitive Algorithm for Online OVSF Code Assignment --
Average-Case Analysis of Online Topological Ordering --
Energy Efficient Deadline Scheduling in Two Processor Systems --
On the Relative Dominance of Paging Algorithms --
6A I/O Algorithms --
I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions --
Geometric Streaming Algorithms with a Sorting Primitive --
External Memory Range Reporting on a Grid --
Approximate Range Searching in External Memory --
6B Networks --
Faster Treasure Hunt and Better Strongly Universal Exploration Sequences --
Hardness and Approximation of Traffic Grooming --
Depth of Field and Cautious-Greedy Routing in Social Networks --
Locating Facilities on a Network to Minimize Their Average Service Radius --
7A Optimization II --
Faster Combinatorial Algorithms for Determinant and Pfaffian --
A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization --
The Parameterized Complexity of the Unique Coverage Problem --
Bounded Tree-Width and CSP-Related Problems --
7B Computational Geometry II --
Covering Points by Unit Disks of Fixed Location --
Geodesic Disks and Clustering in a Simple Polygon --
An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane --
Optimal Triangulation with Steiner Points --
8A Geometric Applications --
New Algorithm for Field Splitting in Radiation Therapy --
In-Place Algorithm for Image Rotation --
Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction --
8B Data Structures II --
Distributed Relationship Schemes for Trees --
Fast Evaluation of Union-Intersection Expressions --
A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem --
9A Computational Geometry III --
Compressing Spatio-temporal Trajectories --
Finding Popular Places --
Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations --
9B Complexity II --
The Monomial Ideal Membership Problem and Polynomial Identity Testing --
On the Fault Testing for Reversible Circuits --
The Space Complexity of k-Tree Isomorphism --
10A String --
Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis --
Space Efficient Indexes for String Matching with Don't Cares --
2-Stage Fault Tolerant Interval Group Testing --
Approximate String Matching with Swap and Mismatch --
10B Graph Algorithms II --
Minimum Fill-In and Treewidth of Split+?ke and Split+?kv Graphs --
Weighted Treewidth Algorithmic Techniques and Results --
Spanning Trees with Many Leaves in Regular Bipartite Graphs --
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs.
Series Title: Lecture notes in computer science, 4835.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Other Titles: ISAAC 2007
Responsibility: Takeshi Tokuyama (ed.).

Abstract:

This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Computation, ISAAC 2007, held in Sendai, Japan, in December 2007.  Read more...

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/232363520> # Algorithms and computation : 18th international symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007 : proceedings
    a schema:Book, schema:CreativeWork, schema:MediaObject ;
   library:oclcnum "232363520" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
   library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/906167920#Place/berlin> ; # Berlin
   schema:about <http://dewey.info/class/005.1/e22/> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/informatique> ; # Informatique
   schema:about <http://id.worldcat.org/fast/1041288> ; # Numerical calculations
   schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/numerical_calculations> ; # Numerical calculations
   schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/computer_algorithms> ; # Computer algorithms
   schema:alternateName "ISAAC 2007" ;
   schema:bookFormat schema:EBook ;
   schema:contributor <http://viaf.org/viaf/260216073> ; # Takeshi Tokuyama
   schema:copyrightYear "2007" ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/906167920#Meeting/isaac_symposium_18th_2007_sendai_shi_miyagi_ken_japan> ; # ISAAC (Symposium) (18th : 2007 : Sendai-shi, Miyagi-ken, Japan)
   schema:datePublished "2007" ;
   schema:description "Annotation"@en ;
   schema:description "Invited Talk -- Modeling and Analyzing Massive Terrain Data Sets -- Coloring Triangle-Free Graphs on Surfaces -- Best Paper Award Presentation -- Integer Representation and Counting in the Bit Probe Model -- 1A Graph Algorithms I -- Minimum Degree Orderings -- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs -- Dynamic Distance Hereditary Graphs Using Split Decomposition -- Unifying Two Graph Decompositions with Modular Decomposition -- 1B Computational Geometry I -- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem -- Geometric Spanner of Segments -- Dilation-Optimal Edge Deletion in Polygonal Cycles -- 2A Complexity I -- Unbounded-Error Classical and Quantum Communication Complexity -- A Spectral Method for MAX2SAT in the Planted Solution Model -- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices -- The 1-Versus-2 Queries Problem Revisited -- 2B Graph Drawing -- Approximating the Crossing Number of Toroidal Graphs -- Width-Optimal Visibility Representations of Plane Graphs -- Computing Upward Topological Book Embeddings of Upward Planar Digraphs -- Algorithms for the Hypergraph and the Minor Crossing Number Problems -- 3A Distributed Algorithms -- On Mixing and Edge Expansion Properties in Randomized Broadcasting -- Linear Reconfiguration of Cube-Style Modular Robots -- Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks -- Sensor Network Gossiping or How to Break the Broadcast Lower Bound -- On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem -- 3B Optimization I -- Capacitated Domination Problem -- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number -- New Bounds for the Nearly Equitable Edge Coloring Problem -- Approximation to the Minimum Cost Edge Installation Problem -- Approximability of Packing Disjoint Cycles -- 4A Data Structure I -- Succinct Representation of Labeled Graphs -- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding -- Kinetic Maintenance of Mobile k-Centres on Trees -- Checking Value-Sensitive Data Structures in Sublinear Space -- 4B Game Theory -- Manipulation in Games -- Using Nash Implementation to Achieve Better Frugality Ratios -- The Price of Nash Equilibria in Multicast Transmissions Games -- 5A Database Applications -- An Efficient Algorithm for Enumerating Pseudo Cliques -- Fast Adaptive Diagnosis with a Minimum Number of Tests -- Dynamic Structures for Top-k Queries on Uncertain Data -- Separating Populations with Wide Data: A Spectral Analysis -- 5B Online Algorithms -- A Constant-Competitive Algorithm for Online OVSF Code Assignment -- Average-Case Analysis of Online Topological Ordering -- Energy Efficient Deadline Scheduling in Two Processor Systems -- On the Relative Dominance of Paging Algorithms -- 6A I/O Algorithms -- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions -- Geometric Streaming Algorithms with a Sorting Primitive -- External Memory Range Reporting on a Grid -- Approximate Range Searching in External Memory -- 6B Networks -- Faster Treasure Hunt and Better Strongly Universal Exploration Sequences -- Hardness and Approximation of Traffic Grooming -- Depth of Field and Cautious-Greedy Routing in Social Networks -- Locating Facilities on a Network to Minimize Their Average Service Radius -- 7A Optimization II -- Faster Combinatorial Algorithms for Determinant and Pfaffian -- A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization -- The Parameterized Complexity of the Unique Coverage Problem -- Bounded Tree-Width and CSP-Related Problems -- 7B Computational Geometry II -- Covering Points by Unit Disks of Fixed Location -- Geodesic Disks and Clustering in a Simple Polygon -- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane -- Optimal Triangulation with Steiner Points -- 8A Geometric Applications -- New Algorithm for Field Splitting in Radiation Therapy -- In-Place Algorithm for Image Rotation -- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction -- 8B Data Structures II -- Distributed Relationship Schemes for Trees -- Fast Evaluation of Union-Intersection Expressions -- A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem -- 9A Computational Geometry III -- Compressing Spatio-temporal Trajectories -- Finding Popular Places -- Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations -- 9B Complexity II -- The Monomial Ideal Membership Problem and Polynomial Identity Testing -- On the Fault Testing for Reversible Circuits -- The Space Complexity of k-Tree Isomorphism -- 10A String -- Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis -- Space Efficient Indexes for String Matching with Don't Cares -- 2-Stage Fault Tolerant Interval Group Testing -- Approximate String Matching with Swap and Mismatch -- 10B Graph Algorithms II -- Minimum Fill-In and Treewidth of Split+?ke and Split+?kv Graphs -- Weighted Treewidth Algorithmic Techniques and Results -- Spanning Trees with Many Leaves in Regular Bipartite Graphs -- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/906167920> ;
   schema:genre "Electronic books"@en ;
   schema:genre "Conference papers and proceedings"@en ;
   schema:genre "Conference publication"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/906167920#Series/lncs_sublibrary_sl_1_theoretical_computer_science_and_general_issues> ; # LNCS sublibrary. SL 1, Theoretical computer science and general issues
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/906167920#Series/lncs_sublibrary> ; # LNCS sublibrary.
   schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/183257716> ;
   schema:name "Algorithms and computation : 18th international symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007 : proceedings"@en ;
   schema:productID "232363520" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/232363520#PublicationEvent/berlin_new_york_springer_2007> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/906167920#Agent/springer> ; # Springer
   schema:url <http://gate.lib.buffalo.edu/login?url=https://link.springer.com/book/10.1007/978-3-540-77120-3> ;
   schema:url <http://www.springerlink.com/openurl.asp?genre=book&isbn=978-3-540-77118-0> ;
   schema:url <http://public.eblib.com/choice/publicfullrecord.aspx?p=337778> ;
   schema:url <http://swbplus.bsz-bw.de/bsz280566182cov.htm> ;
   schema:url <http://www.springerlink.com/content/q13147568214/?p=fbb3fc96cc2948a293bfe6a6e4a83ad4&pi=43> ;
   schema:url <http://dx.doi.org/10.1007/978-3-540-77120-3> ;
   schema:url <https://0-link-springer-com.pugwash.lib.warwick.ac.uk/book/10.1007/978-3-540-77120-3> ;
   schema:url <http://link.springer.com/10.1007/978-3-540-77120-3> ;
   schema:url <http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=4835> ;
   schema:url <http://www.myilibrary.com?id=134267> ;
   schema:url <http://rave.ohiolink.edu/ebooks/ebc/9783540771203> ;
   schema:workExample <http://worldcat.org/isbn/9783540771180> ;
   schema:workExample <http://worldcat.org/isbn/9783540771203> ;
   schema:workExample <http://dx.doi.org/10.1007/978-3-540-77120-3> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/232363520> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
   schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Meeting/isaac_symposium_18th_2007_sendai_shi_miyagi_ken_japan> # ISAAC (Symposium) (18th : 2007 : Sendai-shi, Miyagi-ken, Japan)
    a bgn:Meeting, schema:Event ;
   schema:location <http://experiment.worldcat.org/entity/work/data/906167920#Place/sendai_shi_miyagi_ken_japan> ; # Sendai-shi, Miyagi-ken, Japan)
   schema:name "ISAAC (Symposium) (18th : 2007 : Sendai-shi, Miyagi-ken, Japan)" ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Place/sendai_shi_miyagi_ken_japan> # Sendai-shi, Miyagi-ken, Japan)
    a schema:Place ;
   schema:name "Sendai-shi, Miyagi-ken, Japan)" ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Series/lncs_sublibrary> # LNCS sublibrary.
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/232363520> ; # Algorithms and computation : 18th international symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007 : proceedings
   schema:name "LNCS sublibrary." ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Series/lncs_sublibrary_sl_1_theoretical_computer_science_and_general_issues> # LNCS sublibrary. SL 1, Theoretical computer science and general issues
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/232363520> ; # Algorithms and computation : 18th international symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007 : proceedings
   schema:name "LNCS sublibrary. SL 1, Theoretical computer science and general issues" ;
    .

<http://id.worldcat.org/fast/1041288> # Numerical calculations
    a schema:Intangible ;
   schema:name "Numerical calculations"@en ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
   schema:name "Computer algorithms"@en ;
    .

<http://viaf.org/viaf/260216073> # Takeshi Tokuyama
    a schema:Person ;
   schema:familyName "Tokuyama" ;
   schema:givenName "Takeshi" ;
   schema:name "Takeshi Tokuyama" ;
    .

<http://worldcat.org/isbn/9783540771180>
    a schema:ProductModel ;
   schema:isbn "3540771182" ;
   schema:isbn "9783540771180" ;
    .

<http://worldcat.org/isbn/9783540771203>
    a schema:ProductModel ;
   schema:isbn "3540771204" ;
   schema:isbn "9783540771203" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/232363520> ; # Algorithms and computation : 18th international symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007 : proceedings
   schema:issn "0302-9743" ;
   schema:name "Lecture notes in computer science ;" ;
   schema:name "Lecture notes in computer science," ;
    .

<http://www.worldcat.org/oclc/183257716>
    a schema:CreativeWork ;
   rdfs:label "Algorithms and computation." ;
   schema:description "Print version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/232363520> ; # Algorithms and computation : 18th international symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007 : proceedings
    .

<http://www.worldcat.org/title/-/oclc/232363520>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/232363520> ; # Algorithms and computation : 18th international symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007 : proceedings
   schema:dateModified "2018-03-10" ;
   void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.