Conference Programs (tentative):

June 20, Saturday
Opening Ceremony (Lian Li)
Welcome speech (Lian Li)
8:15am-8:30am

Chairman’s Address（John Hopcroft)
8:30-9:00am

Invited talk: Andrew Chi-Chih Yao
Communication Complexity and Its Applications
9:00am-10:00am

Break.
10:00am-10:20am

Session 1: Graph Algorithms
10:20am-11:35am

Franz J Brandenburg and Mao-cheng Cai.Franz J Brandenburg and Mao-cheng Cai.
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains

Pinar Heggernes and Rodica Mihai.
Edge search number of cographs in linear time

Changjing Wang and Jinyun Xue.
Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems

Xiaofeng Gu, Kamesh Madduri, K. Subramani and Hong-Jian Lai.
Improved algorithms for detecting negative cost cycles in undirected graphs

Chen Mingwen, Hu Songlin and Liu Zhiyong.
Covering-based Routing Algorithms for Cyclic Content-Based P/S System

Lunch.
12noon-1:30pm

Invited talk: Frances Foong Yao
Algorithmic Problems in Computer and Network Power Management
1:30pm-2:30pm

Break.
2:30pm -2:50pm

Session 2: Game Theory with Applications
2:50pm-3:35pm

Wei Chen, Shang-Hua Teng, Yajun Wang and Yuan Zhou.
On the $\alpha$-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games

Hiroshi Nagamochi.
Cop-Robber Guarding Game with Cycle Robber Region

Feng Wang, Yuanxiang Li and Cheng Yang.
Covered Interest Arbitrage in Exchange Rate Forecasting Markets

Session 3: Graph Theory, Computational Geometry I
3:40pm-4:40pm

Xiang Zhou.
CFI Construction and Balanced Graphs

Fabian Stehn, Christian Knauer and Klaus Kriegel
Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions

Mostafa Nouri and Mohammad Ghodsi.
Space--Query-time Tradeoff for Computing the Visibility Polygon

Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher and Wanbin Son.
Square and Rectangle Covering with Outliers

Session 4: Graph Theory, Computational Geometry II
4:45pm-6:00pm
18: Mohammad Khairul Hasan, Sung-Eui Yoon and Kyung-Yong Chwa.
Danny Z. Chen and Haitao Wang.
Processing an Offline Insertion-Query Sequence with Applications

Mohammad Khairul Hasan, Sung-Eui Yoon and Kyung-Yong Chwa.
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs

Huaming Zhang.
On minimizing one dimension of some two-dimensional geometric representations of plane graphs

Yuan Chen.
On modulo liked graphs

Rodica Mihai and Ioan Todinca.
Pathwidth is NP-hard for weighted trees

June 21, Sunday

Invited talk: Guoliang Chen
Study on Parallel Computing
8:30am-9:30am

Break.
9:30am-9:50am

Session 1: Machine Learning
9:50am-10:50am

Xinwang Liu, Jianping Yin, En Zhu, Miaomiao Li and Yubin Zhan.
A Max-Margin Learning Algorithm with Additional Features

Jieren Cheng, Jianping Yin and Yun Liu.
DDoS attack detection method using IP Address Features

Xinjun Peng and Yifei Wang.
Learning with Sequential Minimal Transductive Support Vector Machine

Hongliang Yao, Jian Chang and Hao Wang.
Junction Tree Factored Particle Inference Algorithm for Multi-Agent Dynamic Influence diagrams

Session 2: Parameterized Algorithms, Heuristics and Analysis
10:55am-11:55am

Jianxin Wang, Beiwei Chen, Qilong Feng and Jianer Chen.
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set

Li Liu, Hao Li, Lian Li, Caihong Li and Junling Wang.
Heuristics for mobile object tracking problem in wireless sensor networks

Lusheng Wang and Binhai Zhu.
Efficient Algorithms for the Closest String and Distinguishing String Selection Problem

Yanyan Xu, Weiya Yue and Kaile Su.
The BDD-based Dynamic A* Algorithm for Real-Time Replanning

Lunch.
12noon-1:30pm

Best Paper Award (John Hopcroft)
1:30pm-1:45pm

Session 3: Approximation algorithms
1:45pm-2:45pm

Chi Zhang, Gang Wang, Xiaoguang Liu and Jing Liu.
Approximating Scheduling Machines with Capacity Constraints

Chung-Shou Liao and Louxin Zhang.
Approximating the Spanning k-Tree Forest Problem

Yujun Zheng, Jinyun Xue and ZhengKang Zuo.
Toward an Automatic Approach to Greedy Algorithms

Jinghui Zhang, Junzhou Luo and Zhiang Wu.
A Novel Approximate Algorithm for Admission Control

Session 4:Pattern Recognition Algorithms, Large Scale Data Mining
2:50pm-3:50pm

Meng Zhang.
On Structure of Consistent Partitions of Substring Set of a Word

Guomin Zhang, En Zhu, Ling Mao and Ming Yin.
A Backward Bit-Parallel Exact String Matching Algorithm with Less Character Inspections

Hong Li, XueGang Hu and YanMing Zhang.
An Improved Database classification algorithm for multi-database mining

Takaaki Mizuki and Hideaki Sone.
Six-Card Secure AND and Four-Card Secure XOR