ISAAC B

79 papers

YearTitle / Authors
2004A Generalization of Magic Squares with Applications to Digital Halftoning.
Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
2004A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths.
Uri Zwick
2004Adaptive Spatial Partitioning for Multidimensional Data Streams.
John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
2004Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays.
Veli Mäkinen, Gonzalo Navarro, Kunihiko Sadakane
2004Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings
Rudolf Fleischer, Gerhard Trippen
2004An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.
Xujin Chen, Wenan Zang
2004An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem.
Hsin-Fu Chen, Maw-Shang Chang
2004An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees.
Zeshan Peng, Hing-Fung Ting
2004Approximate Distance Oracles for Graphs with Dense Clusters.
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2004Approximated Two Choices in Randomized Load Balancing.
Kazuo Iwama, Akinori Kawachi
2004Approximating the Minmax Subtree Cover Problem in a Cactus.
Hiroshi Nagamochi, Taizo Kawada
2004Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices.
Jinsong Tan, Louxin Zhang
2004Augmenting the Edge-Connectivity of a Spider Tree.
Davide Bilò, Guido Proietti
2004Boundary-Optimal Triangulation Flooding.
Richard J. Nowakowski, Norbert Zeh
2004Bounding the Payment of Approximate Truthful Mechanisms.
Gruia Calinescu
2004Canonical Data Structure for Interval Probe Graphs.
Ryuhei Uehara
2004Composability of Infinite-State Activity Automata.
Zhe Dang, Oscar H. Ibarra, Jianwen Su
2004Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs.
Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang
2004Cutting Out Polygons with Lines and Rays.
Ovidiu Daescu, Jun Luo
2004Diagnosis in the Presence of Intermittent Faults.
Bin Fu, Richard Beigel
2004Distributions of Points and Large Quadrangles.
Hanno Lefmann
2004Dynamic Tree Cross Products.
Marcus Raitner
2004Efficient Algorithms for k Maximum Sums.
Fredrik Bengtsson, Jingsen Chen
2004Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search.
Artur Alves Pessoa, Eduardo Sany Laber, Críston P. de Souza
2004Efficient Algorithms for the Longest Path Problem.
Ryuhei Uehara, Yushi Uno
2004Efficient Job Scheduling Algorithms with Multi-type Contentions.
Zhenming Chen, Vikas Singh, Jinhui Xu
2004Equipartitions of Measures by 2-Fans.
Sergey Bereg
2004Error Compensation in Leaf Root Problems.
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
2004Exact Computation of Polynomial Zeros Expressible by Square Roots.
Timo von Oertzen
2004Fast Algorithms for Comparison of Similar Unordered Trees.
Daiji Fukagawa, Tatsuya Akutsu
2004Flexibility of Steiner Trees in Uniform Orientation Metrics.
Marcus Brazil, Pawel Winter, Martin Zachariasen
2004GCD of Random Linear Forms.
Joachim von zur Gathen, Igor E. Shparlinski
2004Generalized Function Matching.
Amihood Amir, Igor Nor
2004Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy.
Danny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Shahid A. Naqvi, Chao Wang, Cedric X. Yu
2004Geometric Optimization Problems Over Sliding Windows.
Timothy M. Chan, Bashir S. Sadjad
2004Guarding Art Galleries by Guarding Witnesses.
Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin
2004Inner Rectangular Drawings of Plane Graphs.
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
2004Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs.
Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
2004Many-to-many Disjoint Path Covers in a Graph with Faulty Elements.
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
2004Minimum Common String Partition Problem: Hardness and Approximations.
Avraham Goldstein, Petr Kolman, Jie Zheng
2004Multicriteria Global Minimum Cuts.
Amitai Armon, Uri Zwick
2004New Bounds on Map Labeling with Circular Labels.
Minghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu
2004On Compact and Efficient Routing in Certain Graph Classes.
Feodor F. Dragan, Irina Lomonosov
2004On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks.
Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli
2004On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem.
Qi Cheng, Ming-Deh A. Huang
2004On p-Norm Based Locality Measures of Space-Filling Curves.
H. K. Dai, Hung-Chi Su
2004On the Complexity of Network Synchronization.
Darin Goldstein, Kojiro Kobayashi
2004On the Hardness and Easiness of Random 4-SAT Formulas.
Andreas Goerdt, André Lanka
2004On the Monotone Circuit Complexity of Quadratic Boolean Functions.
Kazuyuki Amano, Akira Maruoka
2004On the Range Maximum-Sum Segment Query Problem.
Kuan-Yu Chen, Kun-Mao Chao
2004On-Line Windows Scheduling of Temporary Items.
Wun-Tat Chan, Prudence W. H. Wong
2004Optimal Buffer Management via Resource Augmentation.
Jae-Hoon Kim
2004Oriented Paths in Mixed Graphs.
Egon Wanke, Rolf Kötter
2004Paired Pointset Traversal.
Peter Hui, Marcus Schaefer
2004Pareto Optimality in House Allocation Problems.
David J. Abraham, Katarína Cechlárová, David F. Manlove, Kurt Mehlhorn
2004Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks.
Artur Alves Pessoa
2004Poly-APX- and PTAS-Completeness in Standard and Differential Approximation.
Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
2004Polyline Fitting of Planar Points Under Min-sum Criteria.
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
2004Polynomial Deterministic Rendezvous in Arbitrary Graphs.
Dariusz R. Kowalski, Andrzej Pelc
2004Property-Preserving Data Reconstruction.
Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
2004Puzzles, Art, and Magic with Algorithms.
Erik D. Demaine
2004Random Access to Advice Strings and Collapsing Results.
Jin-Yi Cai, Osamu Watanabe
2004Randomized Algorithms for Motif Detection.
Lusheng Wang, Liang Dong, Hui Fan
2004Randomized Insertion and Deletion in Point Quad Trees.
Amalia Duch
2004Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations.
Jerzy W. Jaromczyk, Zbigniew Lonc
2004Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting.
Joseph F. JáJá, Christian Worm Mortensen, Qingmin Shi
2004Spanners, Weak Spanners, and Power Spanners for Wireless Networks.
Christian Schindelhauer, Klaus Volbert, Martin Ziegler
2004Structural Alignment of Two RNA Sequences with Lagrangian Relaxation.
Markus Bauer, Gunnar W. Klau
2004Structural Similarity in Graphs (A Relaxation Approach for Role Assignment).
Ulrik Brandes, Jürgen Lerner
2004Superimposing Voronoi Complexes for Shape Deformation.
Chao Chen, Ho-Lun Cheng
2004Sweeping Graphs with Large Clique Number.
Boting Yang, Danny Dyer, Brian Alspach
2004Techniques for Indexing and Querying Temporal Observations for a Collection of Objects.
Qingmin Shi, Joseph F. JáJá
2004The ABCs of AVDs: Geometric Retrieval Made Simple.
David M. Mount
2004The Maximum Agreement of Two Nested Phylogenetic Networks.
Jesper Jansson, Wing-Kin Sung
2004The Polymatroid Steiner Problems.
Gruia Calinescu, Alexander Zelikovsky
2004The Two-Guard Problem Revisited and Its Generalization.
Xuehou Tan
2004Three-Round Adaptive Diagnosis in Binary n-Cubes.
Satoshi Fujita, Toru Araki
2004Voronoi Diagrams with a Transportation Network on the Euclidean Plane.
Sang Won Bae, Kyung-Yong Chwa
2004Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.
Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier