Conferences in DBLP
Allan Borodin Further Reflections on a Theory for Basic Algorithms. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:1-9 [Conf ] Ming-Yang Kao Algorithmic DNA Self-assembly. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:10- [Conf ] Yiwei Jiang Online Scheduling on Parallel Machines with Two GoS Levels. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:11-21 [Conf ] Fanglei Yi , Yinfeng Xu , Chunlin Xin Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:22-31 [Conf ] Jihuan Ding , Guochuan Zhang Online Scheduling with Hard Deadlines on Parallel Machines. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:32-42 [Conf ] Jae-Hoon Kim Maximizing the Throughput of Multiple Machines On-Line. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:43-52 [Conf ] Xi Chen , Xiaotie Deng Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:53-63 [Conf ] Ola Svensson , Sergei G. Vorobyov Linear Programming Polytope and Algorithm for Mean Payoff Games. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:64-78 [Conf ] Costas Busch , Malik Magdon-Ismail Atomic Routing Games on Maximum Congestion. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:79-91 [Conf ] Qianqin Chen , Wei-Guo Zhang , Guoliang Kuang Equilibrium Distribution of Advertising Prices. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:92-101 [Conf ] Henning Köhler Finding Faithful Boyce-Codd Normal Form Decompositions. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:102-113 [Conf ] Jinoo Joung , Dongha Shin , Feifei Feng , Hongkyu Jeong Instant Service Policy and Its Application to Deficit Round Robin. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:114-125 [Conf ] Qiaofeng Yang , Stefano Lonardi , Avraham Melkman A Compression-Boosting Transform for Two-Dimensional Data. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:126-137 [Conf ] Rudolf Fleischer , Jian Li , Shijun Tian , Hong Zhu Non-metric Multicommodity and Multilevel Facility Location. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:138-148 [Conf ] Bin Fu , Zhixiang Chen Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:149-160 [Conf ] Shin-ichi Tanigawa , Naoki Katoh Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:161-172 [Conf ] Hanno Lefmann Distributions of Points and Large Convex Hulls of k Points. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:173-184 [Conf ] Otfried Cheong , Hazel Everett , Hyo-Sil Kim , Sylvain Lazard , René Schott Throwing Stones Inside Simple Polygons . [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:185-193 [Conf ] Boris Goldengorin , Gerold Jäger , Paul Molitor Some Basics on Tolerances. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:194-206 [Conf ] Adriana Felicia Gabor , Jan-Kees C. W. van Ommeren Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:207-219 [Conf ] Xiucui Guan , Jianzhong Zhang Inverse Bottleneck Optimization Problems on Networks. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:220-230 [Conf ] Naoyuki Kamiyama , Naoki Katoh , Atsushi Takizawa An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:231-242 [Conf ] Tianping Shuai , Xiao-Dong Hu Connected Set Cover Problem and Its Applications. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:243-254 [Conf ] Emgad H. Bachoore , Hans L. Bodlaender A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:255-266 [Conf ] David B. Chandler , Maw-Shang Chang , Ton Kloks , Jiping Liu , Sheng-Lung Peng Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:267-278 [Conf ] Peter J. Taillon A New Approach for Solving the Maximum Clique Problem. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:279-290 [Conf ] Zhixiang Chen , Bin Fu , Binhai Zhu The Approximability of the Exemplar Breakpoint Distance Problem. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:291-302 [Conf ] Qing Guo , Hui Zhang , Costas S. Iliopoulos Computing the lambda -Seeds of a String. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:303-313 [Conf ] Minghui Jiang Subsequence Packing: Complexity, Approximation, and Application. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:314-323 [Conf ] Junghee Han Decomposition Based Heuristic Approach to Frequency Reassignment Problem. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:324-333 [Conf ] Yuichiro Miyamoto , Tomomi Matsui Approximation Algorithms for Minimum Span Channel Assignment Problems. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:334-342 [Conf ] Gautam K. Das , Subhas C. Nandy Weighted Broadcast in Linear Radio Networks. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:343-353 [Conf ] Erran L. Li , Mohammad Mahdian , Vahab S. Mirrokni Secure Overlay Network Design. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:354-366 [Conf ] Wei-Guo Zhang , Qianqin Chen , Hai-Lin Lan A Portfolio Selection Method Based on Possibility Theory. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:367-374 [Conf ] Sampath Kameshwaran , Lyès Benyoucef Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:375-386 [Conf ] Winfried Hochstättler , Hui Jin 0002 , Robert Nickel Note on an Auction Procedure for a Matching Game in Polynomial Time. [Citation Graph (0, 0)][DBLP ] AAIM, 2006, pp:387-394 [Conf ]