Algorithms and computation: 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2005
|
| Schriftenreihe: | Lecture notes in computer science
3827 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XX, 1190 S. Ill., graph. Darst. |
| ISBN: | 3540309357 9783540309352 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV021292765 | ||
| 003 | DE-604 | ||
| 005 | 20090325 | ||
| 007 | t| | ||
| 008 | 060116s2005 xx ad|| |||| 10||| eng d | ||
| 020 | |a 3540309357 |9 3-540-30935-7 | ||
| 020 | |a 9783540309352 |9 978-3-540-30935-2 | ||
| 035 | |a (OCoLC)62976068 | ||
| 035 | |a (DE-599)BVBBV021292765 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-91G |a DE-706 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA9.58 | |
| 082 | 0 | |a 004.015118 |2 22 | |
| 084 | |a DAT 530f |2 stub | ||
| 245 | 1 | 0 | |a Algorithms and computation |b 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings |c Xiaotie Deng ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2005 | |
| 300 | |a XX, 1190 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 3827 | |
| 650 | 4 | |a Algorithmes - Congrès | |
| 650 | 4 | |a Calculs numériques - Congrès | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Computer algorithms |v Congresses | |
| 650 | 4 | |a Numerical calculations |x Data processing |v Congresses | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2005 |z Sanya |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Deng, Xiaotie |e Sonstige |0 (DE-588)130633593 |4 oth | |
| 711 | 2 | |a ISAAC |n 16 |d 2005 |c Sanya |j Sonstige |0 (DE-588)16034833-X |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 3827 |w (DE-604)BV000000607 |9 3827 | |
| 856 | 4 | 2 | |m Digitalisierung UBPassau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014613593&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-014613593 | |
Datensatz im Suchindex
| _version_ | 1820874979406774272 |
|---|---|
| adam_text |
Table of Contents
Algorithmic Problems in Wireless Ad Hoc Networks
Frances F. Yao
Probability and Recursion
Kousha
Embedding Point Sets into Plane Graphs of Small Dilation
Annette Ebbers-Baumann, Ansgar
Rolf Klein, Christian Knauer, Andrzej Lingas
The Layered Net Surface Problems in Discrete Geometry and Medical
Image Segmentation
Xiaodong Wu, Danny Z. Chen, Kang Li, Milan Sonka
Separability with Outliers
Sariel Har-Peled, Vladlen Koltun
Casting an Object with a Core
Hee-Kap Ahn, Sang
Kyung- Yong Chwa
Sparse Geometric Graphs with Small Dilation
Boris Aronov, Mark
Joachim Gudmundsson, Herman Haverkort,
Multiple Polyline to Polygon Matching
Mirela
Minimizing a Monotone Concave Function with Laminar Covering
Constraints
Manko Sakashita,
Almost Optimal Solutions for Bin Coloring Problems
Mingen Lin, Zhiyong Lin, Jinhui Xu
GEN-LARAC: A Generalized Approach to the Constrained Shortest
Path Problem Under Multiple Additive Constraints
Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue
Simultaneous Matchings
Khaled Elbassioni, Iiit Katriel, Martin Kutz, Meena Mahajan
XII Table of Contents
An Optimization Problem Related to VoD Broadcasting
Tsunehiko Kameda, Yi Sun, Luis Goddyn
A Min-Max
Xuftn Chen, Guoli Ding, Xiaodong
Average Case Analysis for Tree Labelling Schemes
Ming- Yang Kao, Xiang- Yang Li, WeiZhao Wang
Revisiting T.
Binh-Minh Bui Xuan, Michel
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni,
Vladimir Gurvich, Kazuhisa Makino
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
Xiao Zhou, Takao Nishizeki
Bisecting a Pour-Connected Graph with Three Resource Sets
Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
Laminar Structure of Ptolemaic Graphs and Its Applications
Ryuhei Uehara, Yushi
On the Complexity of the G-Reconstruction Problem
Zdenëk Dvofdk, Vu Jelinek
Hybrid Voting Protocols and Hardness of Manipulation
Edith EMnd, Helger Lipmaa
On the Complexity of Rocchio's Similarity-Based Relevance Feedback
Algorithm
Zhixiang Chen, Bin
Correlation Clustering and Consensus Clustering
Paola Bonizzoni, Gianluca Della Vedova, Riccardo
Tao Jiang
An Approximation Algorithm for Scheduling Malleable Tasks Under
General Precedence Constraints
Klaus
A
Sebastian
Table of Contents XIII
Hardness and Approximation of Octilinear
Matthias
Dense Subgraph Problems with Output-Density Conditions
Akiko Suzuki, Takeshi Tokuyama
A Complete Characterization of Tolerable Adversary Structures for
Secure Point-to-Point Transmissions Without Feedback
Yvo Desmedt, Yongge Wang, Mike Burmester
Network Game with Attacker and Protector Entities
Marios Mavronicolas, Vicky Papadopoulou, Anna
Paul Spirakis
SMpTree: A Scalable Range-Queryable Distributed Data Structure for
Multidimensional Data
Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi
The Phase Matrix
Peter H0yer
ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour
Alexis Kaporis,
Spyros Sioutas, Athanasios Tsakalidis, Kostas Tsichlas,
Christos
External Data Structures for Shortest Path Queries on Planar Digraphs
Lars Arge,
Improved Approximate String Matching Using Compressed Suffix Data
Structures
Tak- Wah Lam, Wing-Kin Sung, Swee-Seong Wong
Monitoring Continuous Band-Join Queries over Dynamic Data
Pankaj K. Agarwal, Junyi Xie, Jun Yang,
Approximate Colored Range Queries
Ying Kit Lai, Chung Keung Poon, Benyun Shi
Complexity and Approximation of the Minimum Recombination
Haplotype Configuration Problem
Lan
Space Efficient Algorithms for Ordered Tree Comparison
Lusheng Wang, Kaizhong Zhang
XIV Table of Contents
A
Yun
Fast Algorithms for Computing the Tripartition-Based Distance
Between Phylogenetic Networks
Nguyen Bao Nguyen, Cam Thach Nguyen, Wing-Kin Sung
Improved Algorithms for Largest Cardinality 2-Interval Pattern
Problem
Hao Yuan, Linji Yang, Erdong Chen
Preemptive Semi-online Scheduling on Parallel Machines with Inexact
Partial Information
Yong He, Yiwei Jiang
On-line Computation and Maximum-Weighted Hereditary Subgraph
Problems
Marc Démange,
A
Lean Yu, Shouyang Wang, Kin Keung Lai
Uniformisation
Lei Yang
A Practical Algorithm for the Computation of Market Equilibrium
with Logarithmic
Li-Sha Huang
Boosting Spectral Partitioning by Sampling and Iteration
Joachim Giesen, Dieter Mitsche
Smoothed Analysis of Binary Search Trees
Bodo Manthey, Rüdiger Reischuk. 483
Simple and Efficient Greedy Algorithms for Hamilton Cycles in
Random Intersection Graphs
Christoforos Raptopoulos, Paul Spirakis
Counting Distinct Items over Update Streams
Sumit Ganguly
Randomized Algorithm for the Sum Selection Problem
Tien-Ching Lin, D.T. Lee
Table of Contents XV
Ab
on Dominating Cliques
tin
Basic Computations in Wireless Networks
Ioannis Caragiannis,
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Sanguthevar Rajasekaran, Sandeep Sen
Efficient Parallel Algorithms for Constructing a k-Tree Center and a
fc-Tree Core of a Tree Network
Yan Wang, Deqiang Wang, Wei Liu, Baoyu Tian
A Tight Bound on the Number of Mobile Servers to Guarantee the
Mutual Transferability Among Dominating Configurations
Satoshi Fufita
Bounding the Number of Minimal Dominating Sets: A Measure and
Conquer Approach
Fedor V. Fomin,
Alexey A. Stepanov
Collective Tree Spanners in Graphs with Bounded Genus, Chordality,
Tree-Width, or Clique-Width
Feodor F. Dragan, Chenyu Yan
Sampling Unlabeled Bieonnected Planar Graphs
Manuel Bodirsky, Clemens
Configurations with Few Crossings in Topological Graphs
Christian Knauer,
Alexander Wolff
On Bounded Load Routings for Modeling ^-Regular Connection
Topologies
Adrian Kosowski, Michal Maktfiejski,
Pawel Zylinski. 614
On the Complexity of Global Constraint Satisfaction
Cristina Bazgan, Marek KarpinsH
Polynomial Space Suffices for Deciding Nash Equilibria Properties for
Extensive Games with Large Trees
Carme
XVI Table of Contents
An Improved <5(1.234m)-Time Deterministic Algorithm for SAT
Masoki Yamamoto. 644
Solving Minimum Weight Exact Satisfiability in Time O(2°-2441n)
Stefan Porschen
Efficient Algorithms for Finding a Longest Common Increasing
Subsequence
Wun-Tat Chan, Yong Zhang, Stanley P.Y. Fung,
Deshi Ye, Hong Zhu
Decision Making Based on Approximate and Smoothed Pareto Curves
Heiner Ackermann, Alantha
Berthold Vöcking. 675
Computing Optimal Solutions
Federico Della Croce, Vangelis Th. Paschos
Efficient Algorithms for the Weighted 2-Center Problem in a Cactus
Graph
Boaz Ben-Moshe, Binay Bhattacharya, Qiaosheng Shi
Algorithms for Local Forest Similarity
Zeshan Peng
Fast Algorithms for Finding Disjoint Subsequences with Extremal
Densities
Anders Bergkvist, Peter Damaschke
A Polynomial Space and Polynomial Delay Algorithm for Enumeration
of Maximal Motifs in a Sequence
HiroM Arimura, TakeaM
5-th Phylogenetic Root Construction for Strictly Chorda! Graphs
William Kennedy, Guohui Lin
Recursion Theoretic Operators for Function Complexity Classes
Kenya Ueno
From Balls and Bins to Points and Vertices
Ralf Klasing,
Simulating Undirected st-Connectivity Algorithms on Uniform JAGs
and NNJAGs
Pinyan
Table of Contents XVII
Upper Bounds on the Computational Power of an Optical Model of
Computation
Damien Woods
Complexity of the
Hassene
Improved Algorithms for the k Maximum-Sums Problems
Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien,
Kun-Mao Chao
Network Load Games
Ioannis Caragiannis,
Minimum Entropy Coloring
Jean Cardinal, Samuel
Algorithms for
Vühelm DaUlöf. 829
Counting Stable Strategies in Random Evolutionary Games
Spyros Kontogiannis, Paul Spirakis
Exact and Approximation Algorithms for Computing the Dilation
Spectrum of Paths, Trees, and Cycles
Rolf Klein, Christian Knauer,
Michiel Smid
On the Computation of Colored Domino Tilings of Simple and
Non-simple Orthogonal Polygons
Chris Woman, Boting Yang
Optimal Paths for Mutually Visible Agents
Joel Fenwick, Vlad Estivill-Castro
Stacking and Bundling Two Convex Polygons
Hee-Kap Ahn,
Algorithms for Range-Aggregate Query Problems Involving Geometric
Aggregation operations
Prosenjit Gupta
A
Problem
Kazuo
XVIII Table of
Approximating the Traffic Grooming Problem
Michele
Shmuel Zaks
Scheduling to Minimize
Times
L.Y. Kang, T.C.E. Cheng, C.T. Ng, M. Zhao
On Complexity and Approximability of the Labeled Maximum/Perfect
Matching Problems
Jérôme Monnot
Finding a Weight-Constrained Maximum-Density Subtree in a Tree
Sun-Yuan Esieh, Ting-Yu
Finding Two Disjoint Paths in a Network with Normalized
a+-MIN-SUM Objective Function
Bing Yang, S. Q. Zheng, Enyue
Sensitivity Analysis of Minimum Spanning Trees in
Sub-inverse-
Seth Pettie
Approximation Algorithms for Layered Multicast Scheduling
Qingbo
Minimum Weight
Magdalene Grantson, Christian
Multi-directional Width-Bounded Geometric Separator and Protein
Folding
Bin
Shortest Paths and Voronoi Diagrams with Transportation Networks
Under General Distances
Sang Won Bae, Kyung-Yong Chwa
Approximation Algorithms for Computing the Earth Mover's Distance
Under Transformations
Oliver Klein, Remco C. Veltkamp
Fast k-Means Algorithms with Constant Approximation
Mingjun Song, Sanguthevar Rajasekaran
On Efficient Weighted Rectangle Packing with Large Resources
Aleksei V. Fishkin,
Table of Contents XIX
On Routing in VLSI Design and
Tamds Terlaky, Anthony Vannelli, Hu Zhang
The Capacitated Traveling Salesman Problem with Pickups and
Deliveries on a Tree
Andrew
Distance Labeling in Hyperbolic Graphs
Cyril
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics
Paraskevi Fragopoulou, Stavros D. Nikolopoulos,
Leonidas Polios
Edge-Pancyclicity of Twisted Cubes
Jianxi Fan, Xiaola Lin, Xiaohua Jia, Rynson W.H.
Combinatorial Network Abstraction by Trees and Distances
Stefan
Sebastian Wernicke.1100
Drawing Phylogenetic Trees
Christian Bachmaier, Ulrik Brandes,
Barbara Schlieper.1110
Localized and Compact Data-Structure for Comparability Graphs
Fabrice Bazzaro,
Representation of Graphs by OBDDs
Robin Nunkesser,
Space-Efficient Construction of LZ-Index
Diego Arroyuelo, Gonzalo Navarro
Longest Increasing Subsequences in Windows Based on Canonical
Antichain Partition
Erdong Chen, Hao Yuan, Linji Yang
Errata from ISAAC
Parete Optimality
David J. Abraham,
Kurt Mehlhorn
XX Table of Confcemts
Generalized Geometric Approaches for Leaf Sequencing Problems in
Radiation Therapy
Danny Z. Chen, Xiaobo S. Hu, Shuang Luan, Shahid A. Naqvi,
Chao Wang, Cedric X. Yu
Author Index |
| adam_txt |
Table of Contents
Algorithmic Problems in Wireless Ad Hoc Networks
Frances F. Yao
Probability and Recursion
Kousha
Embedding Point Sets into Plane Graphs of Small Dilation
Annette Ebbers-Baumann, Ansgar
Rolf Klein, Christian Knauer, Andrzej Lingas
The Layered Net Surface Problems in Discrete Geometry and Medical
Image Segmentation
Xiaodong Wu, Danny Z. Chen, Kang Li, Milan Sonka
Separability with Outliers
Sariel Har-Peled, Vladlen Koltun
Casting an Object with a Core
Hee-Kap Ahn, Sang
Kyung- Yong Chwa
Sparse Geometric Graphs with Small Dilation
Boris Aronov, Mark
Joachim Gudmundsson, Herman Haverkort,
Multiple Polyline to Polygon Matching
Mirela
Minimizing a Monotone Concave Function with Laminar Covering
Constraints
Manko Sakashita,
Almost Optimal Solutions for Bin Coloring Problems
Mingen Lin, Zhiyong Lin, Jinhui Xu
GEN-LARAC: A Generalized Approach to the Constrained Shortest
Path Problem Under Multiple Additive Constraints
Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue
Simultaneous Matchings
Khaled Elbassioni, Iiit Katriel, Martin Kutz, Meena Mahajan
XII Table of Contents
An Optimization Problem Related to VoD Broadcasting
Tsunehiko Kameda, Yi Sun, Luis Goddyn
A Min-Max
Xuftn Chen, Guoli Ding, Xiaodong
Average Case Analysis for Tree Labelling Schemes
Ming- Yang Kao, Xiang- Yang Li, WeiZhao Wang
Revisiting T.
Binh-Minh Bui Xuan, Michel
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni,
Vladimir Gurvich, Kazuhisa Makino
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
Xiao Zhou, Takao Nishizeki
Bisecting a Pour-Connected Graph with Three Resource Sets
Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
Laminar Structure of Ptolemaic Graphs and Its Applications
Ryuhei Uehara, Yushi
On the Complexity of the G-Reconstruction Problem
Zdenëk Dvofdk, Vu Jelinek
Hybrid Voting Protocols and Hardness of Manipulation
Edith EMnd, Helger Lipmaa
On the Complexity of Rocchio's Similarity-Based Relevance Feedback
Algorithm
Zhixiang Chen, Bin
Correlation Clustering and Consensus Clustering
Paola Bonizzoni, Gianluca Della Vedova, Riccardo
Tao Jiang
An Approximation Algorithm for Scheduling Malleable Tasks Under
General Precedence Constraints
Klaus
A
Sebastian
Table of Contents XIII
Hardness and Approximation of Octilinear
Matthias
Dense Subgraph Problems with Output-Density Conditions
Akiko Suzuki, Takeshi Tokuyama
A Complete Characterization of Tolerable Adversary Structures for
Secure Point-to-Point Transmissions Without Feedback
Yvo Desmedt, Yongge Wang, Mike Burmester
Network Game with Attacker and Protector Entities
Marios Mavronicolas, Vicky Papadopoulou, Anna
Paul Spirakis
SMpTree: A Scalable Range-Queryable Distributed Data Structure for
Multidimensional Data
Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi
The Phase Matrix
Peter H0yer
ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour
Alexis Kaporis,
Spyros Sioutas, Athanasios Tsakalidis, Kostas Tsichlas,
Christos
External Data Structures for Shortest Path Queries on Planar Digraphs
Lars Arge,
Improved Approximate String Matching Using Compressed Suffix Data
Structures
Tak- Wah Lam, Wing-Kin Sung, Swee-Seong Wong
Monitoring Continuous Band-Join Queries over Dynamic Data
Pankaj K. Agarwal, Junyi Xie, Jun Yang,
Approximate Colored Range Queries
Ying Kit Lai, Chung Keung Poon, Benyun Shi
Complexity and Approximation of the Minimum Recombination
Haplotype Configuration Problem
Lan
Space Efficient Algorithms for Ordered Tree Comparison
Lusheng Wang, Kaizhong Zhang
XIV Table of Contents
A
Yun
Fast Algorithms for Computing the Tripartition-Based Distance
Between Phylogenetic Networks
Nguyen Bao Nguyen, Cam Thach Nguyen, Wing-Kin Sung
Improved Algorithms for Largest Cardinality 2-Interval Pattern
Problem
Hao Yuan, Linji Yang, Erdong Chen
Preemptive Semi-online Scheduling on Parallel Machines with Inexact
Partial Information
Yong He, Yiwei Jiang
On-line Computation and Maximum-Weighted Hereditary Subgraph
Problems
Marc Démange,
A
Lean Yu, Shouyang Wang, Kin Keung Lai
Uniformisation
Lei Yang
A Practical Algorithm for the Computation of Market Equilibrium
with Logarithmic
Li-Sha Huang
Boosting Spectral Partitioning by Sampling and Iteration
Joachim Giesen, Dieter Mitsche
Smoothed Analysis of Binary Search Trees
Bodo Manthey, Rüdiger Reischuk. 483
Simple and Efficient Greedy Algorithms for Hamilton Cycles in
Random Intersection Graphs
Christoforos Raptopoulos, Paul Spirakis
Counting Distinct Items over Update Streams
Sumit Ganguly
Randomized Algorithm for the Sum Selection Problem
Tien-Ching Lin, D.T. Lee
Table of Contents XV
Ab
on Dominating Cliques
tin
Basic Computations in Wireless Networks
Ioannis Caragiannis,
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Sanguthevar Rajasekaran, Sandeep Sen
Efficient Parallel Algorithms for Constructing a k-Tree Center and a
fc-Tree Core of a Tree Network
Yan Wang, Deqiang Wang, Wei Liu, Baoyu Tian
A Tight Bound on the Number of Mobile Servers to Guarantee the
Mutual Transferability Among Dominating Configurations
Satoshi Fufita
Bounding the Number of Minimal Dominating Sets: A Measure and
Conquer Approach
Fedor V. Fomin,
Alexey A. Stepanov
Collective Tree Spanners in Graphs with Bounded Genus, Chordality,
Tree-Width, or Clique-Width
Feodor F. Dragan, Chenyu Yan
Sampling Unlabeled Bieonnected Planar Graphs
Manuel Bodirsky, Clemens
Configurations with Few Crossings in Topological Graphs
Christian Knauer,
Alexander Wolff
On Bounded Load Routings for Modeling ^-Regular Connection
Topologies
Adrian Kosowski, Michal Maktfiejski,
Pawel Zylinski. 614
On the Complexity of Global Constraint Satisfaction
Cristina Bazgan, Marek KarpinsH
Polynomial Space Suffices for Deciding Nash Equilibria Properties for
Extensive Games with Large Trees
Carme
XVI Table of Contents
An Improved <5(1.234m)-Time Deterministic Algorithm for SAT
Masoki Yamamoto. 644
Solving Minimum Weight Exact Satisfiability in Time O(2°-2441n)
Stefan Porschen
Efficient Algorithms for Finding a Longest Common Increasing
Subsequence
Wun-Tat Chan, Yong Zhang, Stanley P.Y. Fung,
Deshi Ye, Hong Zhu
Decision Making Based on Approximate and Smoothed Pareto Curves
Heiner Ackermann, Alantha
Berthold Vöcking. 675
Computing Optimal Solutions
Federico Della Croce, Vangelis Th. Paschos
Efficient Algorithms for the Weighted 2-Center Problem in a Cactus
Graph
Boaz Ben-Moshe, Binay Bhattacharya, Qiaosheng Shi
Algorithms for Local Forest Similarity
Zeshan Peng
Fast Algorithms for Finding Disjoint Subsequences with Extremal
Densities
Anders Bergkvist, Peter Damaschke
A Polynomial Space and Polynomial Delay Algorithm for Enumeration
of Maximal Motifs in a Sequence
HiroM Arimura, TakeaM
5-th Phylogenetic Root Construction for Strictly Chorda! Graphs
William Kennedy, Guohui Lin
Recursion Theoretic Operators for Function Complexity Classes
Kenya Ueno
From Balls and Bins to Points and Vertices
Ralf Klasing,
Simulating Undirected st-Connectivity Algorithms on Uniform JAGs
and NNJAGs
Pinyan
Table of Contents XVII
Upper Bounds on the Computational Power of an Optical Model of
Computation
Damien Woods
Complexity of the
Hassene
Improved Algorithms for the k Maximum-Sums Problems
Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien,
Kun-Mao Chao
Network Load Games
Ioannis Caragiannis,
Minimum Entropy Coloring
Jean Cardinal, Samuel
Algorithms for
Vühelm DaUlöf. 829
Counting Stable Strategies in Random Evolutionary Games
Spyros Kontogiannis, Paul Spirakis
Exact and Approximation Algorithms for Computing the Dilation
Spectrum of Paths, Trees, and Cycles
Rolf Klein, Christian Knauer,
Michiel Smid
On the Computation of Colored Domino Tilings of Simple and
Non-simple Orthogonal Polygons
Chris Woman, Boting Yang
Optimal Paths for Mutually Visible Agents
Joel Fenwick, Vlad Estivill-Castro
Stacking and Bundling Two Convex Polygons
Hee-Kap Ahn,
Algorithms for Range-Aggregate Query Problems Involving Geometric
Aggregation operations
Prosenjit Gupta
A
Problem
Kazuo
XVIII Table of
Approximating the Traffic Grooming Problem
Michele
Shmuel Zaks
Scheduling to Minimize
Times
L.Y. Kang, T.C.E. Cheng, C.T. Ng, M. Zhao
On Complexity and Approximability of the Labeled Maximum/Perfect
Matching Problems
Jérôme Monnot
Finding a Weight-Constrained Maximum-Density Subtree in a Tree
Sun-Yuan Esieh, Ting-Yu
Finding Two Disjoint Paths in a Network with Normalized
a+-MIN-SUM Objective Function
Bing Yang, S. Q. Zheng, Enyue
Sensitivity Analysis of Minimum Spanning Trees in
Sub-inverse-
Seth Pettie
Approximation Algorithms for Layered Multicast Scheduling
Qingbo
Minimum Weight
Magdalene Grantson, Christian
Multi-directional Width-Bounded Geometric Separator and Protein
Folding
Bin
Shortest Paths and Voronoi Diagrams with Transportation Networks
Under General Distances
Sang Won Bae, Kyung-Yong Chwa
Approximation Algorithms for Computing the Earth Mover's Distance
Under Transformations
Oliver Klein, Remco C. Veltkamp
Fast k-Means Algorithms with Constant Approximation
Mingjun Song, Sanguthevar Rajasekaran
On Efficient Weighted Rectangle Packing with Large Resources
Aleksei V. Fishkin,
Table of Contents XIX
On Routing in VLSI Design and
Tamds Terlaky, Anthony Vannelli, Hu Zhang
The Capacitated Traveling Salesman Problem with Pickups and
Deliveries on a Tree
Andrew
Distance Labeling in Hyperbolic Graphs
Cyril
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics
Paraskevi Fragopoulou, Stavros D. Nikolopoulos,
Leonidas Polios
Edge-Pancyclicity of Twisted Cubes
Jianxi Fan, Xiaola Lin, Xiaohua Jia, Rynson W.H.
Combinatorial Network Abstraction by Trees and Distances
Stefan
Sebastian Wernicke.1100
Drawing Phylogenetic Trees
Christian Bachmaier, Ulrik Brandes,
Barbara Schlieper.1110
Localized and Compact Data-Structure for Comparability Graphs
Fabrice Bazzaro,
Representation of Graphs by OBDDs
Robin Nunkesser,
Space-Efficient Construction of LZ-Index
Diego Arroyuelo, Gonzalo Navarro
Longest Increasing Subsequences in Windows Based on Canonical
Antichain Partition
Erdong Chen, Hao Yuan, Linji Yang
Errata from ISAAC
Parete Optimality
David J. Abraham,
Kurt Mehlhorn
XX Table of Confcemts
Generalized Geometric Approaches for Leaf Sequencing Problems in
Radiation Therapy
Danny Z. Chen, Xiaobo S. Hu, Shuang Luan, Shahid A. Naqvi,
Chao Wang, Cedric X. Yu
Author Index |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author_GND | (DE-588)130633593 |
| building | Verbundindex |
| bvnumber | BV021292765 |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.58 |
| callnumber-search | QA9.58 |
| callnumber-sort | QA 19.58 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 4800 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)62976068 (DE-599)BVBBV021292765 |
| dewey-full | 004.015118 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.015118 |
| dewey-search | 004.015118 |
| dewey-sort | 14.015118 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV021292765</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090325</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">060116s2005 xx ad|| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540309357</subfield><subfield code="9">3-540-30935-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540309352</subfield><subfield code="9">978-3-540-30935-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)62976068</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021292765</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.58</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.015118</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and computation</subfield><subfield code="b">16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings</subfield><subfield code="c">Xiaotie Deng ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XX, 1190 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">3827</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Calculs numériques - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Numerical calculations</subfield><subfield code="x">Data processing</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2005</subfield><subfield code="z">Sanya</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Deng, Xiaotie</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)130633593</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">ISAAC</subfield><subfield code="n">16</subfield><subfield code="d">2005</subfield><subfield code="c">Sanya</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16034833-X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">3827</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">3827</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UBPassau</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014613593&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-014613593</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2005 Sanya gnd-content |
| genre_facet | Konferenzschrift 2005 Sanya |
| id | DE-604.BV021292765 |
| illustrated | Illustrated |
| index_date | 2024-07-02T13:50:20Z |
| indexdate | 2025-01-10T15:08:20Z |
| institution | BVB |
| institution_GND | (DE-588)16034833-X |
| isbn | 3540309357 9783540309352 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-014613593 |
| oclc_num | 62976068 |
| open_access_boolean | |
| owner | DE-739 DE-91G DE-BY-TUM DE-706 DE-11 DE-188 |
| owner_facet | DE-739 DE-91G DE-BY-TUM DE-706 DE-11 DE-188 |
| physical | XX, 1190 S. Ill., graph. Darst. |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Algorithms and computation 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings Xiaotie Deng ... (eds.) Berlin [u.a.] Springer 2005 XX, 1190 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 3827 Algorithmes - Congrès Calculs numériques - Congrès Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2005 Sanya gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Deng, Xiaotie Sonstige (DE-588)130633593 oth ISAAC 16 2005 Sanya Sonstige (DE-588)16034833-X oth Lecture notes in computer science 3827 (DE-604)BV000000607 3827 Digitalisierung UBPassau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014613593&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Algorithms and computation 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings Lecture notes in computer science Algorithmes - Congrès Calculs numériques - Congrès Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)1071861417 |
| title | Algorithms and computation 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings |
| title_auth | Algorithms and computation 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings |
| title_exact_search | Algorithms and computation 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings |
| title_exact_search_txtP | Algorithms and computation 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings |
| title_full | Algorithms and computation 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings Xiaotie Deng ... (eds.) |
| title_fullStr | Algorithms and computation 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings Xiaotie Deng ... (eds.) |
| title_full_unstemmed | Algorithms and computation 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings Xiaotie Deng ... (eds.) |
| title_short | Algorithms and computation |
| title_sort | algorithms and computation 16th international symposium isaac 2005 sanya hainan china december 19 21 2005 proceedings |
| title_sub | 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19 - 21, 2005 ; proceedings |
| topic | Algorithmes - Congrès Calculs numériques - Congrès Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmes - Congrès Calculs numériques - Congrès Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Algorithmus Konferenzschrift 2005 Sanya |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014613593&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT dengxiaotie algorithmsandcomputation16thinternationalsymposiumisaac2005sanyahainanchinadecember19212005proceedings AT isaacsanya algorithmsandcomputation16thinternationalsymposiumisaac2005sanyahainanchinadecember19212005proceedings |