skip to content
Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings Preview this item
ClosePreview this item
Checking...

Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings

Author: Takeshi Tokuyama
Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
Series: Lecture notes in computer science, 4835.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
ISAAC 2007, the 18th International Symposium on Algorithms and Compu- tion took place in Sendai, Japan, December 17-19, 2007. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Daejeon (1998), Ch- nai (1999),Taipei (2000),Christchurch(2001), Vancouver(2002),Kyoto (2003), Hong Kong (2004), Hainan (2005), and  Read more...
Rating:

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

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

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

Details

Additional Physical Format: Printed edition:
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Takeshi Tokuyama
ISBN: 9783540771203 3540771204 9783540771180 3540771182
OCLC Number: 1111011941
Description: 1 online resource (XVII, 929 p. :) online resource.
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.
Responsibility: edited by Takeshi Tokuyama.

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/1111011941> # Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings
    a schema:CreativeWork, schema:Book, schema:MediaObject ;
    library:oclcnum "1111011941" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/906167920#Place/berlin_heidelberg> ; # Berlin, Heidelberg
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/computer_graphics> ; # Computer graphics
    schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/computational_complexity> ; # Computational complexity
    schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/numeric_computing> ; # Numeric Computing
    schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/computer_science> ; # Computer Science
    schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/discrete_mathematics_in_computer_science> ; # Discrete Mathematics in Computer Science
    schema:about <http://dewey.info/class/005.1/e23/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/computer_software> ; # Computer software
    schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/computer_communication_networks> ; # Computer Communication Networks
    schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/algorithms> ; # Algorithms
    schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/algorithm_analysis_and_problem_complexity> ; # Algorithm Analysis and Problem Complexity
    schema:about <http://experiment.worldcat.org/entity/work/data/906167920#Topic/electronic_data_processing> ; # Electronic data processing
    schema:bookFormat schema:EBook ;
    schema:creator <http://experiment.worldcat.org/entity/work/data/906167920#Person/tokuyama_takeshi> ; # Takeshi Tokuyama
    schema:datePublished "2007" ;
    schema:description "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"@en ;
    schema:description "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"@en ;
    schema:description "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:description "ISAAC 2007, the 18th International Symposium on Algorithms and Compu- tion took place in Sendai, Japan, December 17-19, 2007. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Daejeon (1998), Ch- nai (1999),Taipei (2000),Christchurch(2001), Vancouver(2002),Kyoto (2003), Hong Kong (2004), Hainan (2005), and Kolkata(2006). The symposium provided a forum for researchers working in algorithms and the theory of computation from all over the world. In response to our call for papers we received 220 submissions from 40 countries. The task of selecting the papers in this volume was done by our Program Committee and many other external reviewers. After a thorough review process, the Committee selected 77 papers. We hope all accepted papers will eventually appear in scienti?c journals in a more polished form. Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications,with selected papers from ISAAC 2007 are in preparation. The best paper awardwasgivenfor “IntegerRepresentationandCounting in the Bit Probe Model” to Mohammad Rhaman and Ian Munro. Selected from 27 submissionsauthoredbyonlystudents,thebeststudentpaperawardsweregiven for “On Mixing and Edge Expansion Properties in Randomized Broadcasting” to Thomas Sauerwald and for “Faster Combinatorial Algorithms for Deter- nant and Pfa?an” to Anna Urbanska. Two eminent invited speakers, Pankaj K. Agarwal, Duke University, USA, and Robin Thomas, Georgia Institute of Technology, USA, also contributed to this volume."@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"@en ;
    schema:description "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"@en ;
    schema:description "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"@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/906167920> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
    schema:isSimilarTo <http://worldcat.org/entity/work/data/906167920#CreativeWork/> ;
    schema:name "Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings"@en ;
    schema:numberOfPages "929" ;
    schema:productID "1111011941" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/1111011941#PublicationEvent/berlin_heidelberg_springer_berlin_heidelberg_2007> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/906167920#Agent/springer_berlin_heidelberg> ; # Springer Berlin Heidelberg
    schema:url <https://login.ezproxy.brunel.ac.uk/login?url=http://dx.doi.org/10.1007/978-3-540-77120-3> ;
    schema:url <http://libproxy.dundee.ac.uk/login?url=http://dx.doi.org/10.1007/978-3-540-77120-3> ;
    schema:url <https://link.springer.com/10.1007/978-3-540-77120-3> ;
    schema:url <https://link.springer.com/openurl?genre=book&isbn=978-3-540-77118-0> ;
    schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-540-77118-0> ;
    schema:url <http://resolver.scholarsportal.info/isbn/9783540771203> ;
    schema:url <http://dx.doi.org/10.1007/978-3-540-77120-3> ;
    schema:url <https://doi.org/10.1007/978-3-540-77120-3> ;
    schema:url <http://link.springer.com/10.1007/978-3-540-77120-3> ;
    schema:workExample <http://worldcat.org/isbn/9783540771180> ;
    schema:workExample <http://dx.doi.org/10.1007/978-3-540-77120-3> ;
    schema:workExample <http://worldcat.org/isbn/9783540771203> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/1111011941> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/906167920#Agent/springer_berlin_heidelberg> # Springer Berlin Heidelberg
    a bgn:Agent ;
    schema:name "Springer Berlin Heidelberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Person/tokuyama_takeshi> # Takeshi Tokuyama
    a schema:Person ;
    schema:familyName "Tokuyama" ;
    schema:givenName "Takeshi" ;
    schema:name "Takeshi Tokuyama" ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Place/berlin_heidelberg> # Berlin, Heidelberg
    a schema:Place ;
    schema:name "Berlin, Heidelberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Topic/algorithm_analysis_and_problem_complexity> # Algorithm Analysis and Problem Complexity
    a schema:Intangible ;
    schema:name "Algorithm Analysis and Problem Complexity"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Topic/computational_complexity> # Computational complexity
    a schema:Intangible ;
    schema:name "Computational complexity"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Topic/computer_communication_networks> # Computer Communication Networks
    a schema:Intangible ;
    schema:name "Computer Communication Networks"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Topic/computer_graphics> # Computer graphics
    a schema:Intangible ;
    schema:name "Computer graphics"@en ;
    schema:name "Computer Graphics"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Topic/computer_science> # Computer Science
    a schema:Intangible ;
    schema:name "Computer Science"@en ;
    schema:name "Computer science"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Topic/computer_software> # Computer software
    a schema:Intangible ;
    schema:name "Computer software"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Topic/discrete_mathematics_in_computer_science> # Discrete Mathematics in Computer Science
    a schema:Intangible ;
    schema:name "Discrete Mathematics in Computer Science"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Topic/electronic_data_processing> # Electronic data processing
    a schema:Intangible ;
    schema:name "Electronic data processing"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/906167920#Topic/numeric_computing> # Numeric Computing
    a schema:Intangible ;
    schema:name "Numeric Computing"@en ;
    .

<http://libproxy.dundee.ac.uk/login?url=http://dx.doi.org/10.1007/978-3-540-77120-3>
    rdfs:comment "An electronic book accessible through the World Wide Web; click to view." ;
    .

<http://worldcat.org/entity/work/data/906167920#CreativeWork/>
    a schema:CreativeWork ;
    schema:description "Printed edition:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/1111011941> ; # Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings
    .

<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/1111011941> ; # 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/title/-/oclc/1111011941>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/1111011941> ; # Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings
    schema:dateModified "2019-08-08" ;
    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.