Algorithms and Computation: 10th International Symposium, ISAAC’99 Chennai, India, December 16–18, 1999 ProceedingsAuthor: Alok Aggarwal, C. Pandu Rangan Published by Springer Berlin Heidelberg ISBN: 978-3-540-66916-6 DOI: 10.1007/3-540-46632-0Table of Contents:The Engineering of Some Bipartite Matching Programs General Splay: A Basic Theory and Calculus Static Dictionaries Supporting Rank Multiple Spin-Block Decisions Asynchronous Random Polling Dynamic Load Balancing Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability Hardness of Approximating Independent Domination in Circle Graphs Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs Ordered Binary Decision Diagrams as Knowledge-Bases Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots On-Line Load Balancing of Temporary Tasks Revisited Online Routing in Triangulations The Query Complexity of Program Checking by Constant-Depth Circuits Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle Efficient Approximation Algorithms for Multi-label Map Labeling Approximation Algorithms in Batch Processing LexBFS-Ordering in Asteroidal Triple-Free Graphs Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs Approximation Algorithms for Some Clustering and Classification Problems How Many People Can Hide in a Terrain?, Includes bibliographical references and index