15. ISAAC 2004:
HongKong,
China
Rudolf Fleischer, Gerhard Trippen (Eds.):
Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings.
Lecture Notes in Computer Science 3341 Springer 2004, ISBN 3-540-24131-0 BibTeX
- Erik D. Demaine:
Puzzles, Art, and Magic with Algorithms.
1
Electronic Edition (link) BibTeX
- David M. Mount:
The ABCs of AVDs: Geometric Retrieval Made Simple.
2
Electronic Edition (link) BibTeX
- David J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn:
Pareto Optimality in House Allocation Problems.
3-15
Electronic Edition (link) BibTeX
- Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Property-Preserving Data Reconstruction.
16-27
Electronic Edition (link) BibTeX
- Kazuyuki Amano, Akira Maruoka:
On the Monotone Circuit Complexity of Quadratic Boolean Functions.
28-40
Electronic Edition (link) BibTeX
- Amihood Amir, Igor Nor:
Generalized Function Matching.
41-52
Electronic Edition (link) BibTeX
- Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Approximate Distance Oracles for Graphs with Dense Clusters.
53-64
Electronic Edition (link) BibTeX
- Amitai Armon, Uri Zwick:
Multicriteria Global Minimum Cuts.
65-76
Electronic Edition (link) BibTeX
- Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama:
Polyline Fitting of Planar Points Under Min-sum Criteria.
77-88
Electronic Edition (link) BibTeX
- Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno:
A Generalization of Magic Squares with Applications to Digital Halftoning.
89-100
Electronic Edition (link) BibTeX
- Sang Won Bae, Kyung-Yong Chwa:
Voronoi Diagrams with a Transportation Network on the Euclidean Plane.
101-112
Electronic Edition (link) BibTeX
- Markus Bauer, Gunnar W. Klau:
Structural Alignment of Two RNA Sequences with Lagrangian Relaxation.
113-123
Electronic Edition (link) BibTeX
- Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos:
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation.
124-136
Electronic Edition (link) BibTeX
- Fredrik Bengtsson, Jingsen Chen:
Efficient Algorithms for k Maximum Sums.
137-148
Electronic Edition (link) BibTeX
- Sergey Bereg:
Equipartitions of Measures by 2-Fans.
149-158
Electronic Edition (link) BibTeX
- Davide Bilò, Guido Proietti:
Augmenting the Edge-Connectivity of a Spider Tree.
159-171
Electronic Edition (link) BibTeX
- Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks.
172-183
Electronic Edition (link) BibTeX
- Ulrik Brandes, Jürgen Lerner:
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment).
184-195
Electronic Edition (link) BibTeX
- Marcus Brazil, Pawel Winter, Martin Zachariasen:
Flexibility of Steiner Trees in Uniform Orientation Metrics.
196-208
Electronic Edition (link) BibTeX
- Jin-yi Cai, Osamu Watanabe:
Random Access to Advice Strings and Collapsing Results.
209-220
Electronic Edition (link) BibTeX
- Gruia Calinescu:
Bounding the Payment of Approximate Truthful Mechanisms.
221-233
Electronic Edition (link) BibTeX
- Gruia Calinescu, Alexander Zelikovsky:
The Polymatroid Steiner Problems.
234-245
Electronic Edition (link) BibTeX
- Timothy M. Chan, Bashir S. Sadjad:
Geometric Optimization Problems Over Sliding Windows.
246-258
Electronic Edition (link) BibTeX
- Wun-Tat Chan, Prudence W. H. Wong:
On-Line Windows Scheduling of Temporary Items.
259-270
Electronic Edition (link) BibTeX
- Danny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Shahid A. Naqvi, Chao Wang, Cedric X. Yu:
Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy.
271-281
Electronic Edition (link) BibTeX
- Hsin-Fu Chen, Maw-Shang Chang:
An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem.
282-293
Electronic Edition (link) BibTeX
- Kuan-Yu Chen, Kun-Mao Chao:
On the Range Maximum-Sum Segment Query Problem.
294-305
Electronic Edition (link) BibTeX
- Xujin Chen, Wenan Zang:
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.
306-317
Electronic Edition (link) BibTeX
- Zhenming Chen, Vikas Singh, Jinhui Xu:
Efficient Job Scheduling Algorithms with Multi-type Contentions.
318-329
Electronic Edition (link) BibTeX
- Chao Chen, Ho-Lun Cheng:
Superimposing Voronoi Complexes for Shape Deformation.
330-341
Electronic Edition (link) BibTeX
- Qi Cheng, Ming-Deh A. Huang:
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem.
342-351
Electronic Edition (link) BibTeX
- Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin:
Guarding Art Galleries by Guarding Witnesses.
352-363
Electronic Edition (link) BibTeX
- Ho-Kwok Dai, Hung-Chi Su:
On p-Norm Based Locality Measures of Space-Filling Curves.
364-376
Electronic Edition (link) BibTeX
- Zhe Dang, Oscar H. Ibarra, Jianwen Su:
Composability of Infinite-State Activity Automata.
377-388
Electronic Edition (link) BibTeX
- Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Error Compensation in Leaf Root Problems.
389-401
Electronic Edition (link) BibTeX
- Feodor F. Dragan, Irina Lomonosov:
On Compact and Efficient Routing in Certain Graph Classes.
402-414
Electronic Edition (link) BibTeX
- Amalia Duch:
Randomized Insertion and Deletion in Point Quad Trees.
415-426
Electronic Edition (link) BibTeX
- Bin Fu, Richard Beigel:
Diagnosis in the Presence of Intermittent Faults.
427-441
Electronic Edition (link) BibTeX
- Satoshi Fujita, Toru Araki:
Three-Round Adaptive Diagnosis in Binary n-Cubes.
442-451
Electronic Edition (link) BibTeX
- Daiji Fukagawa, Tatsuya Akutsu:
Fast Algorithms for Comparison of Similar Unordered Trees.
452-463
Electronic Edition (link) BibTeX
- Joachim von zur Gathen, Igor Shparlinski:
GCD of Random Linear Forms.
464-469
Electronic Edition (link) BibTeX
- Andreas Goerdt, André Lanka:
On the Hardness and Easiness of Random 4-SAT Formulas.
470-483
Electronic Edition (link) BibTeX
- Avraham Goldstein, Petr Kolman, Jie Zheng:
Minimum Common String Partition Problem: Hardness and Approximations.
484-495
Electronic Edition (link) BibTeX
- Darin Goldstein, Kojiro Kobayashi:
On the Complexity of Network Synchronization.
496-507
Electronic Edition (link) BibTeX
- Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang:
Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs.
508-521
Electronic Edition (link) BibTeX
- John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Adaptive Spatial Partitioning for Multidimensional Data Streams.
522-533
Electronic Edition (link) BibTeX
- Peter Hui, Marcus Schaefer:
Paired Pointset Traversal.
534-544
Electronic Edition (link) BibTeX
- Kazuo Iwama, Akinori Kawachi:
Approximated Two Choices in Randomized Load Balancing.
545-557
Electronic Edition (link) BibTeX
- Joseph JáJá, Christian Worm Mortensen, Qingmin Shi:
Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting.
558-568
Electronic Edition (link) BibTeX
- Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung:
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs.
569-580
Electronic Edition (link) BibTeX
- Jesper Jansson, Wing-Kin Sung:
The Maximum Agreement of Two Nested Phylogenetic Networks.
581-593
Electronic Edition (link) BibTeX
- Jerzy W. Jaromczyk, Zbigniew Lonc:
Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations.
594-605
Electronic Edition (link) BibTeX
- Minghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu:
New Bounds on Map Labeling with Circular Labels.
606-617
Electronic Edition (link) BibTeX
- Jae-Hoon Kim:
Optimal Buffer Management via Resource Augmentation.
618-628
Electronic Edition (link) BibTeX
- Egon Wanke, Rolf Kötter:
Oriented Paths in Mixed Graphs.
629-643
Electronic Edition (link) BibTeX
- Dariusz R. Kowalski, Andrzej Pelc:
Polynomial Deterministic Rendezvous in Arbitrary Graphs.
644-656
Electronic Edition (link) BibTeX
- Hanno Lefmann:
Distributions of Points and Large Quadrangles.
657-668
Electronic Edition (link) BibTeX
- Ovidiu Daescu, Jun Luo:
Cutting Out Polygons with Lines and Rays.
669-680
Electronic Edition (link) BibTeX
- Veli Mäkinen, Gonzalo Navarro, Kunihiko Sadakane:
Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays.
681-692
Electronic Edition (link) BibTeX
- Kazuyuki Miura, Hiroki Haga, Takao Nishizeki:
Inner Rectangular Drawings of Plane Graphs.
693-704
Electronic Edition (link) BibTeX
- Hiroshi Nagamochi, Taizo Kawada:
Approximating the Minmax Subtree Cover Problem in a Cactus.
705-716
Electronic Edition (link) BibTeX
- Richard J. Nowakowski, Norbert Zeh:
Boundary-Optimal Triangulation Flooding.
717-728
Electronic Edition (link) BibTeX
- Timo von Oertzen:
Exact Computation of Polynomial Zeros Expressible by Square Roots.
729-741
Electronic Edition (link) BibTeX
- Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim:
Many-to-many Disjoint Path Covers in a Graph with Faulty Elements.
742-753
Electronic Edition (link) BibTeX
- Zeshan Peng, Hing-Fung Ting:
An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees.
754-765
Electronic Edition (link) BibTeX
- Artur Alves Pessoa:
Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks.
766-777
Electronic Edition (link) BibTeX
- Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza:
Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search.
778-792
Electronic Edition (link) BibTeX
- Marcus Raitner:
Dynamic Tree Cross Products.
793-804
Electronic Edition (link) BibTeX
- Christian Schindelhauer, Klaus Volbert, Martin Ziegler:
Spanners, Weak Spanners, and Power Spanners for Wireless Networks.
805-821
Electronic Edition (link) BibTeX
- Qingmin Shi, Joseph JáJá:
Techniques for Indexing and Querying Temporal Observations for a Collection of Objects.
822-834
Electronic Edition (link) BibTeX
- Jinsong Tan, Louxin Zhang:
Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices.
835-846
Electronic Edition (link) BibTeX
- Xuehou Tan:
The Two-Guard Problem Revisited and Its Generalization.
847-858
Electronic Edition (link) BibTeX
- Ryuhei Uehara:
Canonical Data Structure for Interval Probe Graphs.
859-870
Electronic Edition (link) BibTeX
- Ryuhei Uehara, Yushi Uno:
Efficient Algorithms for the Longest Path Problem.
871-883
Electronic Edition (link) BibTeX
- Lusheng Wang, Liang Dong, Hui Fan:
Randomized Algorithms for Motif Detection.
884-895
Electronic Edition (link) BibTeX
- Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier:
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.
896-907
Electronic Edition (link) BibTeX
- Boting Yang, Danny Dyer, Brian Alspach:
Sweeping Graphs with Large Clique Number.
908-920
Electronic Edition (link) BibTeX
- Uri Zwick:
A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths.
921-932
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:24:48 2009
by Michael Ley (ley@uni-trier.de)
