| 1 |
Franz J Brandenburg and Mao-cheng Cai. Shortest Path and Maximum Flow Problems in Networks |
| |
with Additive Losses and Gains |
| 2 |
Wei Chen, Shang-Hua Teng, Yajun Wang and Yuan Zhou. On the -Sensitivity of Nash Equilibria in |
| |
PageRank-Based Network Reputation Games |
| 3 |
Hiroshi Nagamochi. Cop-Robber Guarding Game with Cycle Robber Region |
| 4 |
Xiang Zhou. CFI construction and balanced graphs |
| 5 |
Chi Zhang, Gang Wang, Xiaoguang Liu and Jing Liu. Approximating Scheduling Machines with |
| |
Capacity Constraints |
| 6 |
Fabian Stehn, Christian Knauer and Klaus Kriegel. Minimizing the weighted directed Hausdorff |
| |
distance between colored point sets under translations and rigid motions |
| 7 |
Chung-Shou Liao and Louxin Zhang. Approximating the Spanning k-Tree Forest Problem |
| 8 |
Jianxin Wang, Beiwei Chen, Qilong Feng and Jianer Chen. An Efficient Fixed-Parameter Enumeration |
| |
Algorithm for Weighted Edge Dominating Set |
| 9 |
Hongliang Yao, Jian Chang and Hao Wang. Junction Tree Factored Particle Inference Algorithm |
| |
for Multi-Agent Dynamic Influence diagrams |
| 10 |
Mostafa Nouri and Mohammad Ghodsi. Space--Query-time Tradeoff forComputing the Visibility |
| |
Polygon |
| 11 |
Xiaofeng Gu, Kamesh Madduri, K. Subramani and Hong-Jian Lai. Improved algorithms for |
| |
detecting negative cost cycles in undirected graphs |
| 12 |
Changjing Wang and Jinyun Xue. Formal Derivation of A High-Trustworthy Generic Algorithmic |
| |
Program for Solving a Class of Path Problems |
| 13 |
Yujun Zheng, Jinyun Xue and ZhengKang Zuo. Toward an Automatic Approach to Greedy Algorithms
|
| 14 |
78 1 Pinar Heggernes and Rodica Mihai. Edge search number of cographs in linear time
|
| 15 |
xinwang liu, Jianping yin, En zhu and miaomiao li. A Max-Margin Learning Algorithm with Additional |
| |
Features |
| 16 |
Yanyan Xu and Weiya Yue. The BDD-based Dynamic A* Algorithm for Real-Time Replanning
|
| 17 |
Xinjun Peng and Yifei Wang. Learning with Sequential Minimal Transductive Support Vector Machine
|
| 18 |
Meng Zhang. On Structure of Consistent Partitions of Substring Set of a Word |
| 19 |
chen mingwen, hu songlin and liu zhiyong. Covering-based Routing Algorithms for Cyclic |
| |
Content-Based P/S System |
| 20 |
Li Liu, Hao Li, Lian Li, Caihong Li and Jiazhao Lin. Achieving Mobile ObjectTracking Requirements in |
| |
Wireless Sensor Networks |
| 21 |
Mohammad Khairul Hasan, Sung-Eui Yoon and Kyung-Yong Chwa. Bounds on the Geometric Mean of |
| |
Arc Lengths for Bounded-Degree Planar Graphs |
| 22 |
Lusheng Wang and Binhai Zhu. Efficient Algorithms for the Closest String and Distinguishing String |
| |
Selection Problem |
| 23 |
Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher and Wanbin Son. |
| |
Square and Rectangle Covering with Outliers |
| 24 |
Li Hong, Hu XueGang and Zhang YanMing. An Improved Database classification algorithm for multi- |
| |
database mining |
| 25 |
Takaaki Mizuki and Hideaki Sone. Six-Card Secure AND and Four-Card Secure XOR |
| 26 |
Jie-ren CHENG, Jian-ping YIN and Yun LIU. DDoS attack detection method using IP Address |
| |
Features |
| 27 |
Yuan Chen. On modulo liked graphs |
| 28 |
Guomin Zhang, Jianping Yin, En Zhu and Ling Mao. A Backward Bit-Parallel Exact String Matching |
| |
Algorithm with Less Character Inspections |
| 29 |
Feng Wang and Yuanxiang Li. Covered Interest Arbitrage in Exchange Rate Forecasting Markets |
| 30 |
Jinghui Zhang, Junzhou Luo and Zhiang Wu. A Novel Approximate Algorithm for Admission Control |
| 31 |
Danny Z. Chen and Haitao Wang. Processing an Offline Insertion-Query Sequence with Applications |
| 32 |
Rodica Mihai and Ioan Todinca. Pathwidth is NP-hard for weighted trees |
| 33 |
Huaming Zhang. On minimizing one dimension of some two-dimensional geometric representations of |
| |
plane graphs |
