The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Gerold Jäger, Anand Srivastav, Katja Wolf
    Solving Generalized Maximum Dispersion with Linear Programming. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:1-10 [Conf]
  2. Marco Gaertler, Robert Görke, Dorothea Wagner
    Significance-Driven Graph Clustering. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:11-26 [Conf]
  3. Zhi-Zhong Chen, Ruka Tanahashi
    An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:27-36 [Conf]
  4. Boting Yang, Yi Cao
    Digraph Strong Searching: Monotonicity and Complexity. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:37-46 [Conf]
  5. Martin Fürer, Shiva Prasad Kasiviswanathan
    Algorithms for Counting 2-SatSolutions and Colorings with Applications. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:47-57 [Conf]
  6. Joachim Giesen, Dieter Mitsche, Eva Schuberth
    Collaborative Ranking: An Aggregation Algorithm for Individuals' Preference Estimation. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:58-67 [Conf]
  7. Katsuhisa Yamanaka, Shin-Ichi Nakano
    A Compact Encoding of Rectangular Drawings with Efficient Query Supports. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:68-81 [Conf]
  8. M. Sohel Rahman, Costas S. Iliopoulos
    A New Efficient Algorithm for Computing the Longest Common Subsequence. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:82-90 [Conf]
  9. Baoqiang Fan, Jianzhong Gu, Guochun Tang
    Scheduling a Flexible Batching Machine. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:91-99 [Conf]
  10. Hyun Joon Shin
    Global Search Method for Parallel Machine Scheduling. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:100-107 [Conf]
  11. Subhash C. Sarin, Vinod D. Shenai, Lixin Wang
    Releasing and Scheduling of Lots in a Wafer Fab. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:108-119 [Conf]
  12. Chad R. Meiners, Eric Torng
    Mixed Criteria Packet Scheduling. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:120-133 [Conf]
  13. Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
    Efficient Algorithms for k -Disjoint Paths Problems on DAGs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:134-143 [Conf]
  14. Rahul Muthu, N. Narayanan, C. R. Subramanian
    Acyclic Edge Colouring of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:144-152 [Conf]
  15. Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei Kuan Shih, Tsan-sheng Hsu
    Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:153-166 [Conf]
  16. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
    Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:167-177 [Conf]
  17. Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
    An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:178-190 [Conf]
  18. Francis Y. L. Chin, Yong Zhang, Hong Zhu
    Online OVSF Code Assignment with Resource Augmentation. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:191-200 [Conf]
  19. Richard J. Boucherie, Aloysius Irwan Endrayanto, Adriana Felicia Gabor
    Optimal Joint Rate and Power Allocation in CDMA Networks. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:201-210 [Conf]
  20. Hongkyu Jeong, Kyoung Y. Bae, Jinoo Joung
    Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:211-220 [Conf]
  21. Steve Butler, Jia Mao, Ronald L. Graham
    How to Play the Majority Game with Liars. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:221-230 [Conf]
  22. Vittorio Bilò
    On Satisfiability Games and the Power of Congestion Games. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:231-240 [Conf]
  23. Chenguang Liu, Kazuyuki Tanaka
    The Complexity of Algorithms Computing Game Trees on Random Assignments. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:241-250 [Conf]
  24. Tian-Shyr Dai, Yuh-Dauh Lyuu
    An Efficient, and Fast Convergent Algorithm for Barrier Options. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:251-261 [Conf]
  25. Tian-Shyr Dai, Jr-Yan Wang, Hui-Shan Wei
    An Ingenious, Piecewise Linear Interpolation Algorithm for Pricing Arithmetic Average Options. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:262-272 [Conf]
  26. Boris Goldengorin, John Keane, Viktor Kuzmenko, Michael Tso
    Optimal Order Allocation with Discount Pricing. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:273-284 [Conf]
  27. Hanno Lefmann
    Convex Hulls of Point-Sets and Non-uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:285-295 [Conf]
  28. Huaming Zhang, Xin He
    Optimal st -Orientations for Plane Triangulations. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:296-305 [Conf]
  29. Yang Yang, Mingen Lin, Jinhui Xu, Yulai Xie
    Minimum Spanning Tree with Neighborhoods. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:306-316 [Conf]
  30. Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi
    An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:317-326 [Conf]
  31. Xiaodong Wu, Xin Dou
    Optimal Field Splitting with Feathering in Intensity-Modulated Radiation Therapy. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:327-336 [Conf]
  32. Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas
    Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:337-345 [Conf]
  33. Dan He
    BMA*: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:346-357 [Conf]
  34. Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
    Strip Packing vs. Bin Packing. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:358-367 [Conf]
  35. David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier
    Probe Matrix Problems: Totally Balanced Matrices. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:368-377 [Conf]
  36. Ho-Leung Chan, Tak Wah Lam, Prudence W. H. Wong
    Efficiency of Data Distribution in BitTorrent-Like Systems. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:378-388 [Conf]
  37. Ka Ho Chan, Xiaowen Chu
    Design of a Fuzzy PI Controller to Guarantee Proportional Delay Differentiation on Web Servers. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:389-398 [Conf]
  38. Minghui Jiang
    Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:399-410 [Conf]
  39. Hong Seo Ryoo, In-Yong Jang
    A Heuristic Method for Selecting Support Features from Large Datasets. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:411-423 [Conf]
  40. Shang-Hua Teng
    Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:424- [Conf]
  41. Anna R. Karlin
    Ad Auctions - Current and Future Research. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:425- [Conf]
  42. Tuomas Sandholm
    Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:426- [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