Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th ISAAC 1999: Chennai, India
- Alok Aggarwal, C. Pandu Rangan:
Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings. Lecture Notes in Computer Science 1741, Springer 1999, ISBN 3-540-66916-7
Invited Talk
- Kurt Mehlhorn:
The Engineering of Some Bipartite Matching Programs. 1-3
Session 1(a) - Data Structure I
- George F. Georgakopoulos, David J. McClurkin:
General Splay: A Basic Theory and Calculus. 4-17 - Venkatesh Raman, S. Srinivasa Rao
:
Static Dictionaries Supporting Rank. 18-26
Session 1(b) - Parallel and Distributed Computing I
- Peter Damaschke:
Multiple Spin-Block Decisions. 27-36 - Peter Sanders:
Asynchronous Random Polling Dynamic Load Balancing. 37-48
Session 2(a) - Approximate Algorithm I
- Daya Ram Gaur, Ramesh Krishnamurti:
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. 49-55 - Mirela Damian-Iordache, Sriram V. Pemmaraju:
Hardness of Approximating Independent Domination in Circle Graphs. 56-69 - Mirela Damian-Iordache, Sriram V. Pemmaraju:
Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs. 70-82
Session 2(b) - Computational Intelligence
- Takashi Horiyama, Toshihide Ibaraki:
Ordered Binary Decision Diagrams as Knowledge-Bases. 83-92 - Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. 93-102
Session 3(a) - Online Algorithm
- Kar-Keung To, Prudence W. H. Wong:
On-Line Load Balancing of Temporary Tasks Revisited. 103-112 - Prosenjit Bose, Pat Morin:
Online Routing in Triangulations. 113-122
Session 3(b) - Complexity Theory I
- Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits. 123-132 - Kazuo Iwama, Shuichi Miyazaki:
Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle. 133-142
Session 4(a) - Approximate Algorithm II
- Binhai Zhu, Chung Keung Poon:
Efficient Approximation Algorithms for Multi-label Map Labeling. 143-152 - Xiaotie Deng, Chung Keung Poon, Yuzhong Zhang:
Approximation Algorithms in Batch Processing. 153-162
Session 4(b) - Graph Algorithm I
- Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko:
LexBFS-Ordering in Asteroidal Triple-Free Graphs. 163-172 - Fang-Rong Hsu, Yaw-Ling Lin, Yin-Te Tsai:
Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs. 173-182
Invited Talk
- Éva Tardos:
Approximation Algorithms for Some Clustering and Classification Problems. 183
Session 5(a) - Computational Geometry I
- Stephan J. Eidenbenz:
How Many People Can Hide in a Terrain? 184-194 - Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa:
Carrying Umbrellas: An Online Relocation Problem on Graphs. 195-204
Session 5(b) - Parallel and Distributed Computing II
- Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke:
Survivable Networks with Bounded Delay: The Edge Failure Case. 205-214 - Jacir Luiz Bordim, JiangTao Cui, Tatsuya Hayashi, Koji Nakano, Stephan Olariu:
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks. 215-224
Session 6(a) - Data Structure II
- Tetsuo Shibuya:
Constructing the Suffix Tree of a Tree with a Large Alphabet. 225-236 - Tadao Takaoka:
An O(1) Time Algorithm for Generating Multiset Permutations. 237-246
Session 6(b) - Complexity Theory II
- Nikhil Bansal, Venkatesh Raman:
Upper Bounds for MaxSat: Further Improved. 247-258 - Kazuhisa Makino:
A Linear Time Algorithm for Recognizing Regular Boolean Functions. 259-268
Session 7(a) - Computational Geometry II
- Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg:
Station Layouts in the Presence of Location Constraints. 269-278 - Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai:
Reverse Center Location Problem. 279-294
Session 7(b) - Algorithms in Practice
- Abhijit Das, C. E. Veni Madhavan:
Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields. 295-306 - Anil Maheshwari, Norbert Zeh:
External Memory Algorithms for Outerplanar Graphs. 307-316
Session 8(a) - Approximate Algorithm III
- Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima:
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. 317-326 - Jeannette C. M. Janssen, Lata Narayanan:
Approximation Algorithms for Channel Assignment with Constraints. 327-336
Session 8(b) - Graph Algorithm II
- Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki:
Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs. 337-346 - Shuji Isobe, Xiao Zhou, Takao Nishizeki:
A Linear Algorithm for Finding Total Colorings of Partial k-Trees. 347-356
Invited Talk
- Kokichi Sugihara:
Topology-Oriented Approach to Robust Geometric Computation. 357-366
Session 9(a) - Approximate Algorithm IV
- Santosh S. Vempala, Berthold Vöcking:
Approximating Multicast Congestion. 367-372 - Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. 373-382
Session 9(b) - Parallel and Distributed Computing III
- Jae-Ha Lee, Kyung-Yong Chwa:
Online Scheduling of Parallel Communications with Individual Deadlines. 383-392 - Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
A Faster Algorithm for Finding Disjoint Paths in Grids. 393-402
Session 10(a) - Computational Geometry III
- Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen:
Output-Sensitive Algorithms for Uniform Partitions of Points. 403-414 - Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss:
Convexifying Monotone Polygons. 415-424
Session 10(b) - Graph Algorithm III
- Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki:
Bisecting Two Subsets in 3-Connected Graphs. 425-434 - Binay K. Bhattacharya, Michael E. Houle:
Generalized Maximum Independent Sets for Trees in Subquadratic Time. 435-445
a service of 
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-04-22 20:01 CEST 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:
