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