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