ISAAC B

45 papers

YearTitle / Authors
1997A Branch-and-Cut Approach for Minimum Weight Triangulation.
Yoshiaki Kyoda, Keiko Imai, Fumihiko Takeuchi, Akira Tajima
1997A Characterization of Planar Graphs by Pseudo-Line Arrangements.
Hisao Tamaki, Takeshi Tokuyama
1997A Faster One-Dimensional Topological Compaction Algorithm.
Hsiao-Feng Steven Chen, D. T. Lee
1997A New Efficient Off-line Anonymous Cash Scheme.
Khanh Quoc Nguyen, Vijay Varadharajan, Yi Mu
1997A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.
Chung Keung Poon, Vijaya Ramachandran
1997A Theoretical Framework of Hybrid Approaches to MAX SAT.
Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata
1997Airline Crew-Scheduling Problem with Many Irregular Flights.
Akira Tajima, Shinji Misono
1997Algorithmic Analysis of Multithreaded Algorithms (Abstract).
Charles E. Leiserson
1997Algorithms and Computation, 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997, Proceedings
Hon Wai Leong, Hiroshi Imai, Sanjay Jain
1997Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs.
Takeaki Uno
1997Algorithms for Finding Optimal Disjoint Paths Around a Rectangle.
Wun-Tat Chan, Francis Y. L. Chin
1997All-Cavity Maximum Matchings.
Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
1997An Adaptive Distributed Fault-Tolerant Routing Algorithm for the Star Graph.
Leqiang Bai, Hiroyuki Ebara, Hideo Nakano, Hajime Maeda
1997An Algorithm for Finding a Region with the Minimum Lotal L
Yoshiyuki Kusakari, Takao Nishizeki
1997An Efficient Approximation Scheme for the Subset-Sum Problem.
Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza
1997Approximating Unweighted Connectivity Problems in Parallel.
Zhi-Zhong Chen
1997Augmenting Edge and Vertex Connectivities Simultaneously.
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
1997Competitive Call Control in Mobile Networks.
Grammati E. Pantziou, George P. Pentaris, Paul G. Spirakis
1997Competitive Source Routing on Tori and Meshes.
Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen
1997Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals.
Rolf H. Möhring, Matthias Müller-Hannemann
1997Decision-Making by Hierarchies of Discordant Agents.
Xiaotie Deng, Christos H. Papadimitriou
1997Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae.
Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
1997Dynamic Programming on Distance-Hereditary Graphs.
Maw-Shang Chang, Sun-Yuan Hsieh, Gen-Huey Chen
1997Efficient Parallel Algorithms for Planar
Mikhail J. Atallah
1997Exponential Lower Bounds on the Size of OBDDs Representing Integer Divistion.
Takashi Horiyama, Shuzo Yajima
1997Fast Algorithms for Computing beta-Skeletons and Their Relatives.
S. V. Rao, Asish Mukhopadhyay
1997Formulation of the Addition-Shift-Sequence Problem and Its Complexity.
Kaihiro Matsuura, Akira Nagoya
1997Generalized Swap-with-Parent Schemes for Self-Organizing Sequential Linear Lists.
B. John Oommen, Juan Dong
1997Hard Instance Generation for SAT (Extended Abstract).
Satoshi Horie, Osamu Watanabe
1997Homophonic Coding with Logarithmic Memory Size.
Boris Ryabko, Andrei Fionov
1997Multi-Color Routing in the Undirected Hypercube.
Qian-Ping Gu, Hisao Tamaki
1997On Defect Sets in Bipartite Graphs (Extended Abstract).
Penny E. Haxell, Martin Loebl
1997On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs.
Serafino Cicerone, Gabriele Di Stefano
1997On the Size of Probabilistic Formulae.
Hartmut Klauck
1997On-Line Versus Off-Line in Money-Making Strategies with BROKERAGE.
Eisuke Dannoura, Kouichi Sakurai
1997Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract).
Petrisor Panaite, Andrzej Pelc
1997Peg-Solitaire, String Rewriting Systems and Finite Automata.
Bala Ravikumar
1997Playing Tetris on Meshes and Multi-Dimensional SHEARSORT.
Miroslaw Kutylowski, Rolf Wanka
1997Practical Approach to a Facility Location Problem for Large-Scale Logistics.
Kazuyoshi Hidaka, Hiroyuki Okano
1997Singularities Make Spatial Join Scheduling Hard.
Gabriele Neyer, Peter Widmayer
1997Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract).
Toshihide Ibaraki
1997The Complexity of Learning Branches and Strategies from Queries.
Matthias Ott, Frank Stephan
1997Topology Oriented vs. Exact Arithmetic - Experience in Implementing the Three-Dimensional Convex Hull Algorithm.
Tsuyoshi Minakawa, Kokichi Sugihara
1997Two-Face Horn Extensions.
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1997Weighted and Unweighted Selection Algorithms for k Sorted Sequences.
Tatsuya Hayashi, Koji Nakano, Stephan Olariu