ISAAC B

58 papers

YearTitle / Authors
1993A 2or3-Approximation of the Matroid Matching Problem.
Toshihiro Fujito
1993A Framework for Constructing Heap-Like Structures In-Place.
Jingsen Chen
1993A Graph Coloring Result and Its Consequences for Some Guarding Problems.
Frank Hoffmann, Klaus Kriegel
1993A Probabilistic Selection Network with Butterfly Networks.
Takahiro Ikeda
1993A Simple Balanced Search Tree with O(1) Worst-Case Update Time.
Rudolf Fleischer
1993Adaptive and Oblivious Algorithms for D-Cube Permutation Routing.
Miltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang
1993Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings
Kam-Wing Ng, Prabhakar Raghavan, N. V. Balasubramanian, Francis Y. L. Chin
1993An Improved Algorithm for the Traveler's Problem.
Alok Aggarwal, Takeshi Tokuyama
1993An Introduction to Perpetual Gossiping.
Arthur L. Liestman, Dana S. Richards
1993Coloring Random Graphs in Polynomial Expected Time.
Martin Fürer, C. R. Subramanian, C. E. Veni Madhavan
1993Consecutive Interval Query and Dynamic Programming on Intervals.
Alok Aggarwal, Takeshi Tokuyama
1993Constructing Degree-3 Spanners with Other Sparseness Properties.
Gautam Das, Paul J. Heffernan
1993Constructing Shortest Watchman Routes by Divide-and-Conquer.
Xuehou Tan, Tomio Hirata
1993Double-Ended Binomial Queues.
C. M. Khoong, H. W. Leong
1993Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem.
Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky
1993Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions.
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
1993Finding the Shortest Watchman Route in a Simple Polygon.
Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
1993Graphical Degree Sequence Problems with Connectivity Requirements.
Takao Asano
1993How to Treat Delete Requests in Semi-Online Problems.
Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh
1993Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs.
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
1993Mapping Dynamic Data and Algorithm Structures into Product Networks.
Sabine R. Öhring, Sajal K. Das
1993Memory Paging for Connectivity and Path Problems in Graphs.
Esteban Feuerstein, Alberto Marchetti-Spaccamela
1993Multicommodity Flows in Even, Planar Networks.
Karsten Weihe
1993Multicommodity Flows: A Survey of Recent Research.
Baruch Awerbuch, Frank Thomson Leighton
1993New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction.
Susanne E. Hambrusch, Hung-Yi Tu
1993Number Theory Helps Line Detection in Digital Images.
Tetsuo Asano, Naoki Katoh
1993On Horn Envelopes and Hypergraph Transversals.
Dimitris J. Kavvadias, Christos H. Papadimitriou, Martha Sideri
1993On Quadratic Lattice Approximations.
Anand Srivastav, Peter Stangier
1993On the Power of Reading and Writing Simultaneously in Parallel Computation.
Rolf Niedermeier, Peter Rossmanith
1993On the Relationship among Cryptographic Physical Assumptions.
Tatsuaki Okamoto
1993Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model.
Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
1993Optimal Linear Broadcast Routing with Capacity Limitations.
Sara Bitan, Shmuel Zaks
1993Optimal Rectilinear Steiner Tree for Extremal Point Sets.
Siu-Wing Cheng, Andrew Lim, Ching-Ting Wu
1993Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon.
Danny Z. Chen
1993Page Migration Algorithms Using Work Functions.
Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery R. Westbrook
1993Parallel Algorithms for Single-Layer Channel Routing.
Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih
1993Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs.
Xin He, Ming-Yang Kao
1993Permutation Routing on Reconfigurable Meshes.
J. C. Cogolludo, Sanguthevar Rajasekaran
1993Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications.
D. P. Wang, N. F. Huang, H. S. Chao, Richard C. T. Lee
1993Randomized Competitive Algorithms for Successful and Unsuccessful Search on Self-adjusting Linear Lists.
Lucas Chi Kwong Hui, Charles U. Martel
1993Randomized On-line Algorithms for the Page Replication Problem.
Hisashi Koga
1993Reaching a Goal with Directional Uncertainty.
Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir
1993Recent Developments on the Approximability of Combinatorial Problems.
Mihalis Yannakakis
1993Relativizing Complexity Classes With Random Oracles.
Ronald V. Book
1993Remembering Conflicts in History Yields Dynamic Algorithms.
Katrin Dobrindt, Mariette Yvinec
1993Robot Mapping: Foot-Prints versus Tokens.
Xiaotie Deng, Andy Mirzaian
1993Scheduling Algorithms for a Chain-like Task System.
Chi-lok Chan, Gilbert H. Young
1993Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs.
Christoph Meinel, Stephan Waack
1993Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA.
Hing Leung
1993Simple Combinatorial Gray Codes Constructed by Reversing Sublists.
Frank Ruskey
1993The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams.
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
1993The Maximum k-Dependent and f-Dependent Set Problem.
Anders Dessmark, Klaus Jansen, Andrzej Lingas
1993Threshold Computation and Cryptographic Security.
Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf
1993Time Space Tradeoffs (Getting Closer to the Barrier?).
Allan Borodin
1993Treewidth of Circle Graphs.
Ton Kloks
1993Using Fractal Geometry for Solving Divide-and-Conquer Recurrences.
Simant Dube
1993Vehicle Scheduling on a Tree with Release and Handling Times.
Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
1993Weighted Independent Perfect Domination on Cocomparability Graphs.
Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg