16. ISAAC 2005:
Sanya,
Hainan,
China
Xiaotie Deng, Ding-Zhu Du (Eds.):
Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings.
Lecture Notes in Computer Science 3827 Springer 2005, ISBN 3-540-30935-7 BibTeX
- F. Frances Yao:
Algorithmic Problems in Wireless Ad Hoc Networks.
1
Electronic Edition (link) BibTeX
- Kousha Etessami, Mihalis Yannakakis:
Probability and Recursion.
2-4
Electronic Edition (link) BibTeX
- Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas:
Embedding Point Sets into Plane Graphs of Small Dilation.
5-16
Electronic Edition (link) BibTeX
- Xiaodong Wu, Danny Z. Chen, Kang Li, Milan Sonka:
The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentation.
17-27
Electronic Edition (link) BibTeX
- Sariel Har-Peled, Vladlen Koltun:
Separability with Outliers.
28-39
Electronic Edition (link) BibTeX
- Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa:
Casting an Object with a Core.
40-49
Electronic Edition (link) BibTeX
- Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron:
Sparse Geometric Graphs with Small Dilation.
50-59
Electronic Edition (link) BibTeX
- Mirela Tanase, Remco C. Veltkamp, Herman J. Haverkort:
Multiple Polyline to Polygon Matching.
60-70
Electronic Edition (link) BibTeX
- Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige:
Minimizing a Monotone Concave Function with Laminar Covering Constraints.
71-81
Electronic Edition (link) BibTeX
- Mingen Lin, Zhiyong Lin, Jinhui Xu:
Almost Optimal Solutions for Bin Coloring Problems.
82-91
Electronic Edition (link) BibTeX
- Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue:
GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints.
92-105
Electronic Edition (link) BibTeX
- Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan:
Simultaneous Matchings.
106-115
Electronic Edition (link) BibTeX
- Tsunehiko Kameda, Yi Sun, Luis A. Goddyn:
An Optimization Problem Related to VoD Broadcasting.
116-125
Electronic Edition (link) BibTeX
- Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets.
126-135
Electronic Edition (link) BibTeX
- Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang:
Average Case Analysis for Tree Labelling Schemes.
136-145
Electronic Edition (link) BibTeX
- Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul:
Revisiting T. Uno and M. Yagiura's Algorithm .
146-155
Electronic Edition (link) BibTeX
- Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.
156-165
Electronic Edition (link) BibTeX
- Xiao Zhou, Takao Nishizeki:
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends.
166-175
Electronic Edition (link) BibTeX
- Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi:
Bisecting a Four-Connected Graph with Three Resource Sets.
176-185
Electronic Edition (link) BibTeX
- Ryuhei Uehara, Yushi Uno:
Laminar Structure of Ptolemaic Graphs and Its Applications.
186-195
Electronic Edition (link) BibTeX
- Zdenek Dvorak, Vít Jelínek:
On the Complexity of the G-Reconstruction Problem.
196-205
Electronic Edition (link) BibTeX
- Edith Elkind, Helger Lipmaa:
Hybrid Voting Protocols and Hardness of Manipulation.
206-215
Electronic Edition (link) BibTeX
- Zhixiang Chen, Bin Fu:
On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm.
216-225
Electronic Edition (link) BibTeX
- Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang:
Correlation Clustering and Consensus Clustering.
226-235
Electronic Edition (link) BibTeX
- Klaus Jansen, Hu Zhang:
An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints.
236-245
Electronic Edition (link) BibTeX
- Sebastian Seibert, Walter Unger:
A 1.5-Approximation of the Minimal Manhattan Network Problem.
246-255
Electronic Edition (link) BibTeX
- Matthias Müller-Hannemann, Anna Schulze:
Hardness and Approximation of Octilinear Steiner Trees.
256-265
Electronic Edition (link) BibTeX
- Akiko Suzuki, Takeshi Tokuyama:
Dense Subgraph Problems with Output-Density Conditions.
266-276
Electronic Edition (link) BibTeX
- Yvo Desmedt, Yongge Wang, Mike Burmester:
A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback.
277-287
Electronic Edition (link) BibTeX
- Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis:
Network Game with Attacker and Protector Entities.
288-297
Electronic Edition (link) BibTeX
- Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi:
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data.
298-307
Electronic Edition (link) BibTeX
- Peter Høyer:
The Phase Matrix.
308-317
Electronic Edition (link) BibTeX
- Alexis C. Kaporis, Christos Makris, George Mavritsakis, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis:
ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour.
318-327
Electronic Edition (link) BibTeX
- Lars Arge, Laura Toma:
External Data Structures for Shortest Path Queries on Planar Digraphs.
328-338
Electronic Edition (link) BibTeX
- Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong:
Improved Approximate String Matching Using Compressed Suffix Data Structures.
339-348
Electronic Edition (link) BibTeX
- Pankaj K. Agarwal, Junyi Xie, Jun Yang, Hai Yu:
Monitoring Continuous Band-Join Queries over Dynamic Data.
349-359
Electronic Edition (link) BibTeX
- Ying Kit Lai, Chung Keung Poon, Benyun Shi:
Approximate Colored Range Queries.
360-369
Electronic Edition (link) BibTeX
- Lan Liu, Xi Chen, Jing Xiao, Tao Jiang:
Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem.
370-379
Electronic Edition (link) BibTeX
- Lusheng Wang, Kaizhong Zhang:
Space Efficient Algorithms for Ordered Tree Comparison.
380-391
Electronic Edition (link) BibTeX
- Yun Cui, Lusheng Wang, Daming Zhu:
A 1.75-Approximation Algorithm for Unsigned Translocation Distance.
392-401
Electronic Edition (link) BibTeX
- Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung:
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks.
402-411
Electronic Edition (link) BibTeX
- Hao Yuan, Linji Yang, Erdong Chen:
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem.
412-421
Electronic Edition (link) BibTeX
- Yong He, Yiwei Jiang:
Preemptive Semi-online Scheduling on Parallel Machines with Inexact Partial Information.
422-432
Electronic Edition (link) BibTeX
- Marc Demange, Bernard Kouakou, Éric Soutif:
On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems.
433-442
Electronic Edition (link) BibTeX
- Lean Yu, Shouyang Wang, Kin Keung Lai:
A Novel Adaptive Learning Algorithm for Stock Market Prediction.
443-452
Electronic Edition (link) BibTeX
- Lei Yang:
Uniformization of Discrete Data.
453-462
Electronic Edition (link) BibTeX
- Li-Sha Huang:
A Practical Algorithm for the Computation of Market Equilibrium with Logarithmic Utility Functions.
463-472
Electronic Edition (link) BibTeX
- Joachim Giesen, Dieter Mitsche:
Boosting Spectral Partitioning by Sampling and Iteration.
473-482
Electronic Edition (link) BibTeX
- Bodo Manthey, Rüdiger Reischuk:
Smoothed Analysis of Binary Search Trees.
483-492
Electronic Edition (link) BibTeX
- Christoforos Raptopoulos, Paul G. Spirakis:
Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs.
493-504
Electronic Edition (link) BibTeX
- Sumit Ganguly:
Counting Distinct Items over Update Streams.
505-514
Electronic Edition (link) BibTeX
- Tien-Ching Lin, D. T. Lee:
Randomized Algorithm for the Sum Selection Problem.
515-523
Electronic Edition (link) BibTeX
- Martin Nehéz, Daniel Olejár:
An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques.
524-532
Electronic Edition (link) BibTeX
- Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis:
Basic Computations in Wireless Networks.
533-542
Electronic Edition (link) BibTeX
- Sanguthevar Rajasekaran, Sandeep Sen:
A Simple Optimal Randomized Algorithm for Sorting on the PDM.
543-552
Electronic Edition (link) BibTeX
- Yan Wang, Deqiang Wang, Wei Liu, Baoyu Tian:
Efficient Parallel Algorithms for Constructing a k-Tree Center and a k-Tree Core of a Tree Network.
553-562
Electronic Edition (link) BibTeX
- Satoshi Fujita:
A Tight Bound on the Number of Mobile Servers to Guarantee the Mutual Transferability Among Dominating Configurations.
563-572
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov:
Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach.
573-582
Electronic Edition (link) BibTeX
- Feodor F. Dragan, Chenyu Yan:
Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width.
583-592
Electronic Edition (link) BibTeX
- Manuel Bodirsky, Clemens Gröpl, Mihyun Kang:
Sampling Unlabeled Biconnected Planar Graphs.
593-603
Electronic Edition (link) BibTeX
- Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff:
Configurations with Few Crossings in Topological Graphs.
604-613
Electronic Edition (link) BibTeX
- Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
On Bounded Load Routings for Modeling k-Regular Connection Topologies.
614-623
Electronic Edition (link) BibTeX
- Cristina Bazgan, Marek Karpinski:
On the Complexity of Global Constraint Satisfaction.
624-633
Electronic Edition (link) BibTeX
- Carme Àlvarez, Joaquim Gabarró, Maria J. Serna:
Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, .
634-643
Electronic Edition (link) BibTeX
- Masaki Yamamoto:
An Improved O(1.234m)-Time Deterministic Algorithm for SAT.
644-653
Electronic Edition (link) BibTeX
- Stefan Porschen:
Solving Minimum Weight Exact Satisfiability in Time O(20.2441n).
654-664
Electronic Edition (link) BibTeX
- Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu:
Efficient Algorithms for Finding a Longest Common Increasing Subsequence.
665-674
Electronic Edition (link) BibTeX
- Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking:
Decision Making Based on Approximate and Smoothed Pareto Curves.
675-684
Electronic Edition (link) BibTeX
- Federico Della Croce, Vangelis Th. Paschos:
Computing Optimal Solutions for the min 3-set covering Problem.
685-692
Electronic Edition (link) BibTeX
- Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi:
Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph.
693-703
Electronic Edition (link) BibTeX
- Zeshan Peng:
Algorithms for Local Forest Similarity.
704-713
Electronic Edition (link) BibTeX
- Anders Bergkvist, Peter Damaschke:
Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities.
714-723
Electronic Edition (link) BibTeX
- Hiroki Arimura, Takeaki Uno:
A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence.
724-737
Electronic Edition (link) BibTeX
- William Kennedy, Guohui Lin:
5-th Phylogenetic Root Construction for Strictly Chordal Graphs.
738-747
Electronic Edition (link) BibTeX
- Kenya Ueno:
Recursion Theoretic Operators for Function Complexity Classes.
748-756
Electronic Edition (link) BibTeX
- Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes:
From Balls and Bins to Points and Vertices.
757-766
Electronic Edition (link) BibTeX
- Pinyan Lu, Jialin Zhang, Chung Keung Poon, Jin-yi Cai:
Simulating Undirected st-Connectivity Algorithms on Uniform JAGs and NNJAGs.
767-776
Electronic Edition (link) BibTeX
- Damien Woods:
Upper Bounds on the Computational Power of an Optical Model of Computation.
777-788
Electronic Edition (link) BibTeX
- Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Complexity of the Min-Max (Regret) Versions of Cut Problems.
789-798
Electronic Edition (link) BibTeX
- Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao:
Improved Algorithms for the k Maximum-Sums Problems.
799-808
Electronic Edition (link) BibTeX
- Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis:
Network Load Games.
809-818
Electronic Edition (link) BibTeX
- Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Coloring.
819-828
Electronic Edition (link) BibTeX
- Vilhelm Dahllöf:
Algorithms for Max Hamming Exact Satisfiability.
829-838
Electronic Edition (link) BibTeX
- Spyros C. Kontogiannis, Paul G. Spirakis:
Counting Stable Strategies in Random Evolutionary Games.
839-848
Electronic Edition (link) BibTeX
- Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid:
Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles.
849-858
Electronic Edition (link) BibTeX
- Chris Worman, Boting Yang:
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons.
859-868
Electronic Edition (link) BibTeX
- Joel Fenwick, Vladimir Estivill-Castro:
Optimal Paths for Mutually Visible Agents.
869-881
Electronic Edition (link) BibTeX
- Hee-Kap Ahn, Otfried Cheong:
Stacking and Bundling Two Convex Polygons.
882-891
Electronic Edition (link) BibTeX
- Prosenjit Gupta:
Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation Operations.
892-901
Electronic Edition (link) BibTeX
- Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi:
A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem.
902-914
Electronic Edition (link) BibTeX
- Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem.
915-924
Electronic Edition (link) BibTeX
- Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao:
Scheduling to Minimize Makespan with Time-Dependent Processing Times.
925-933
Electronic Edition (link) BibTeX
- Jérôme Monnot:
On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems.
934-943
Electronic Edition (link) BibTeX
- Sun-Yuan Hsieh, Ting-Yu Chou:
Finding a Weight-Constrained Maximum-Density Subtree in a Tree.
944-953
Electronic Edition (link) BibTeX
- Bing Yang, S. Q. Zheng, Enyue Lu:
Finding Two Disjoint Paths in a Network with Normalized alpha+-MIN-SUM Objective Function.
954-963
Electronic Edition (link) BibTeX
- Seth Pettie:
Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time.
964-973
Electronic Edition (link) BibTeX
- Qingbo Cai, Vincenzo Liberatore:
Approximation Algorithms for Layered Multicast Scheduling.
974-983
Electronic Edition (link) BibTeX
- Magdalene Grantson, Christian Borgelt, Christos Levcopoulos:
Minimum Weight Triangulation by Cutting Out Triangles.
984-994
Electronic Edition (link) BibTeX
- Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu:
Multi-directional Width-Bounded Geometric Separator and Protein Folding.
995-1006
Electronic Edition (link) BibTeX
- Sang Won Bae, Kyung-Yong Chwa:
Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances.
1007-1018
Electronic Edition (link) BibTeX
- Oliver Klein, Remco C. Veltkamp:
Approximation Algorithms for Computing the Earth Mover's Distance Under Transformations.
1019-1028
Electronic Edition (link) BibTeX
- Mingjun Song, Sanguthevar Rajasekaran:
Fast k-Means Algorithms with Constant Approximation.
1029-1038
Electronic Edition (link) BibTeX
- Aleksei V. Fishkin, Olga Gerber, Klaus Jansen:
On Efficient Weighted Rectangle Packing with Large Resources.
1039-1050
Electronic Edition (link) BibTeX
- Tamás Terlaky, Anthony Vannelli, Hu Zhang:
On Routing in VLSI Design and Communication Networks.
1051-1060
Electronic Edition (link) BibTeX
- Andrew Lim, Fan Wang, Zhou Xu:
The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree.
1061-1070
Electronic Edition (link) BibTeX
- Cyril Gavoille, Olivier Ly:
Distance Labeling in Hyperbolic Graphs.
1071-1079
Electronic Edition (link) BibTeX
- Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios:
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics.
1080-1089
Electronic Edition (link) BibTeX
- Jianxi Fan, Xiaola Lin, Xiaohua Jia, Rynson W. H. Lau:
Edge-Pancyclicity of Twisted Cubes.
1090-1099
Electronic Edition (link) BibTeX
- Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke:
Combinatorial Network Abstraction by Trees and Distances.
1100-1109
Electronic Edition (link) BibTeX
- Christian Bachmaier, Ulrik Brandes, Barbara Schlieper:
Drawing Phylogenetic Trees.
1110-1121
Electronic Edition (link) BibTeX
- Fabrice Bazzaro, Cyril Gavoille:
Localized and Compact Data-Structure for Comparability Graphs.
1122-1131
Electronic Edition (link) BibTeX
- Robin Nunkesser, Philipp Woelfel:
Representation of Graphs by OBDDs.
1132-1142
Electronic Edition (link) BibTeX
- Diego Arroyuelo, Gonzalo Navarro:
Space-Efficient Construction of LZ-Index.
1143-1152
Electronic Edition (link) BibTeX
- Erdong Chen, Hao Yuan, Linji Yang:
Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition.
1153-1162
Electronic Edition (link) BibTeX
Errata from ISAAC 2004 (LNCS 3341)
Copyright © Sat May 16 23:24:48 2009
by Michael Ley (ley@uni-trier.de)
