The SCEAS System
Navigation Menu

Conferences in DBLP

Algorithmic Applications in Management (aaim)
2006 (conf/aaim/2006)

  1. Allan Borodin
    Further Reflections on a Theory for Basic Algorithms. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:1-9 [Conf]
  2. Ming-Yang Kao
    Algorithmic DNA Self-assembly. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:10- [Conf]
  3. Yiwei Jiang
    Online Scheduling on Parallel Machines with Two GoS Levels. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:11-21 [Conf]
  4. 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]
  5. Jihuan Ding, Guochuan Zhang
    Online Scheduling with Hard Deadlines on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:32-42 [Conf]
  6. Jae-Hoon Kim
    Maximizing the Throughput of Multiple Machines On-Line. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:43-52 [Conf]
  7. 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]
  8. 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]
  9. Costas Busch, Malik Magdon-Ismail
    Atomic Routing Games on Maximum Congestion. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:79-91 [Conf]
  10. Qianqin Chen, Wei-Guo Zhang, Guoliang Kuang
    Equilibrium Distribution of Advertising Prices. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:92-101 [Conf]
  11. Henning Köhler
    Finding Faithful Boyce-Codd Normal Form Decompositions. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:102-113 [Conf]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. Hanno Lefmann
    Distributions of Points and Large Convex Hulls of k Points. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:173-184 [Conf]
  18. 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]
  19. Boris Goldengorin, Gerold Jäger, Paul Molitor
    Some Basics on Tolerances. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:194-206 [Conf]
  20. 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]
  21. Xiucui Guan, Jianzhong Zhang
    Inverse Bottleneck Optimization Problems on Networks. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:220-230 [Conf]
  22. 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]
  23. Tianping Shuai, Xiao-Dong Hu
    Connected Set Cover Problem and Its Applications. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:243-254 [Conf]
  24. 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]
  25. 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]
  26. Peter J. Taillon
    A New Approach for Solving the Maximum Clique Problem. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:279-290 [Conf]
  27. 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]
  28. 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]
  29. Minghui Jiang
    Subsequence Packing: Complexity, Approximation, and Application. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:314-323 [Conf]
  30. Junghee Han
    Decomposition Based Heuristic Approach to Frequency Reassignment Problem. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:324-333 [Conf]
  31. Yuichiro Miyamoto, Tomomi Matsui
    Approximation Algorithms for Minimum Span Channel Assignment Problems. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:334-342 [Conf]
  32. Gautam K. Das, Subhas C. Nandy
    Weighted Broadcast in Linear Radio Networks. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:343-353 [Conf]
  33. Erran L. Li, Mohammad Mahdian, Vahab S. Mirrokni
    Secure Overlay Network Design. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:354-366 [Conf]
  34. 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]
  35. 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]
  36. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002