|
Conference Program (Tentative)
August 3
Registration |
14:00-19:00 |
Registration Package: Bags, Proceedings, badges, programs, notebooks, ball pens, receipts of registration fee, lunch/banquet/show/tour tickets, local maps |
|
August 4
|
Session 1
Algebraic Problems (Chair: Xuding Zhu) |
9:30-9:50 |
The Complexity of Testing Monomials in Multivariate Polynomials
Zhixiang Chen, Bin Fu |
9:50-10:10 |
Algorithms for Testing Monomials in Multivariate Polynomials
Zhixiang Chen, Bin Fu, Yang Liu, Robert Schweller
|
|
|
Session 2
Scheduling (Chair: Hongwei Du) |
10:20-10:40 |
Hybrid Artificial Bee Colony Search Algorithm Based on Disruptive Selection for Examination Timetabling Problems
Malek Fehaid, Salwani Abdullah
|
10:40-11:00 |
Heuristics for parallel machine scheduling with deterioration effect
Feifeng Zheng, Lu Wang, Yinfeng Xu, Liu Ming
|
11:00-11:20 |
A Comprehensive Study of an Online Packet Scheduling Algorithm
Fei Li
|
11:20-11:40 |
Optimal policy for single-machine scheduling with deterioration effects, learning effects, setup times, and availability constraints
Sheng Yu, Yinfeng Xu, Ming Liu, Feifeng Zheng
|
11:40-12:00 |
Algebraic Algorithm for Scheduling Data Retrieval in Multi-Channel Wireless Data Broadcast Environments
Xiaofeng Gao, Zaixin Lu, Weili Wu, Bin Fu |
|
|
Session 3
Optimizations in Graphs (Chair: Xiaofeng Gao) |
13:00- 13:20 |
Hamiltonian cycles through prescribed edges in k-ary n-cubes
Iain Stewart
|
13:20-13:40 |
A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges
Wei Ding, Guoliang Xue
|
13:40-14:00 |
Restricted Edge Connectivity of Harary Graphs
Xiaohui Huang, Zhao Zhang, Qinghai Liu
|
14:00-14:20 |
Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem
Sonia Toubaline, Daniel Vanderpooten, Cristina Bazgan
|
14:20-14:40 |
Euclidean Chains and Their Shortcuts
Boting Yang
|
14:40-15:00 |
List dynamic coloring of sparse graphs
Seog-Jin Kim, Won-Ji Park
|
15:00-15:20 |
Further Improvement on Maximum Independent Set in Degree-4 Graphs
Mingyu Xiao, Hiroshi Nagamochi |
|
|
Session 4
Computer and Communication Network (Chair: Zhao Zhang) |
15:30-15:50 |
Approximation Algorithms for Minimum Energy Multicast Routing with Reception Cost in Wireless Sensor Networks
Deying Li
|
15:50-16:10 |
Public Communication Based on Russian Cards Protocol: a Case Study
Jia He, Zhenhua Duan
|
16:10-16:30 |
Minimum Latency Data Aggregation in Wireless Sensor Network with Directional Antenna
Deying Li, Hui Liu, Zewen Liu, Hongwei Du
|
16:30-16:50 |
A Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet Classes
Fei Li
|
16:50-17:10 |
On the maximum locally clustered subgraph and some related problems
Bang Ye Wu
|
17:10-17:30 |
Quickest Paths in Anisotropic Media
Joachim Gudmundsson, Radwa El Shawi
|
17:30-17:50 |
Mechanisms for Obnoxious Facility Game on a Path
Guochuan Zhang, Wei Yu, Yukun Cheng |
|
|
August 5
Session 5
Problems Related to Biology (Chair: Wei Ding) |
8:30-8:50 |
Algorithmic Aspects of Heterogeneous Biological Networks Comparison
Guillaume FERTIN, Stéphane Vialette, Florian Sikora, Irena Rusu, Hafedh Mohamed-Babou, Guillaume Blin |
8:50-9:10 |
Minimum Interval Cover and Its Application to Genome Sequencing
Bin Fu, Binhai Zhu, Liang Ding |
9:10-9:30 |
Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem
Bin Fu, Boting Yang, Binhai Zhu, Haitao Jiang |
9:30-9:50 |
Complexity of the stamp folding problem
Takuya Umesato,Toshiki Saitoh, Ryuhei Uehara, Hiro Ito |
9:50-10:10 |
On the number of solutions of the discretizable molecular distance geometry problem
Antonio Mucherino, Carlile Lavor, Jon Lee, Benoit Masson, Leo Liberti |
|
|
Session 6
Miscellaneous (Chair: Zhenhua Duan) |
10:20-10:40 |
Integration of an LP Solver into Interval Constraint Propagation
Ernst Althaus, Stefan Kupferschmid, Daniel Dumitriu, Bernd Becker
|
10:40-11:00 |
A Saturation Algorithm for Homogeneous Binomial Ideals
shashank Mehta, Deepanjan Kesh
|
11:00-11:20 |
Improved Algorithms for Farthest Colored Voronoi Diagram of Segments
Yongding Zhu, Jinhui Xu
|
11:20-11:40 |
One-and-a-half-side Boundary Labeling
Chun-Cheng Lin, Hsu-Chun Yen, Hsiang-Yun Wu, Shigeo Takahashi, Sheung-Hung Poon
|
11:40-12:00 |
Approximation algorithms for a bilevel knapsack problem
Guochuan Zhang, Lin Chen |
|
|
Invited Session 1
Graphs and Computer Networks (Chair: Bin Fu) |
13:00-13:20 |
On the Surface Area of the Asymmetric Twisted Cube
Zhizhang Shen, Eddie Cheng, Ke Qiu
|
13:20-13:40 |
Tractable Feedback Vertex Sets in Restricted Bipartite Graphs
Tian Liu, Ke Xu, Wei Jiang
|
13:40-14:00 |
On the Partition of 3-Colorable Graphs
Yang Liu, Qing Wang
|
14:00-14:20 |
Kinetic Red-Blue Minimum Separating Circle
Marko Zivanic, Ovidiu Daescu, Yam Ki Cheung
|
14:20-14:40 |
A Semantic Model for Many-core Parallel Computing
Nan Zhang, Zhenhua Duan
|
14:40-15:00 |
On Unique Games with Negative Weights
Peng Cui, Tian Liu, Ke Xu |
|
|
Invited Session 2
Computer and Communication Networks (Chair: Nan Zhang) |
15:50-16:10 |
A Note on Treewidth in Random Graphs
Tian Liu, Ke Xu, Peng Cui, Chaoyi Wang
|
16:10-16:30 |
On the Two-Stage Stochastic Graph Partitioning Problem
Neng Fan, Qipeng Zheng, Panos Pardalos
|
16:30-16:50 |
A Spatio-Temporal Approach to the Discovery of Online Social Trends
Jie Wang, Harshavardhan Achrekar, Zheng Fang, Benyuan Liu, You Li, Cindy Chen
|
16:50-17:10 |
A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design
Peng Zhang
|
17:10-17:30 |
Greedy Algorithm for Least Privilege in RBAC Model
Jinling Liu, Hongwei Du, Hejiao Huang
|
17:30-17:50 |
Towards Minimum Delay Broadcasting and Multicasting in Multihop Wireless Networks
Maggie Cheng, Quanmin Ye
|
|
Cultural Program |
18:00-22:00 |
Gather at the lobby and then enjoy a dinner of local cuisine outside the hotel and watch a folk performance |
|
August 6 One Day Tour
One Day Tour |
8:00-17:00 |
Tianmen Mountain National Forest Park in the morning and Huanglong Karst Cave in the afternoon. (After conference participants may visit other famous scenic spots in Zhangjiajie, such as the Tianzishan Zhangjiajie Geopark and Jin Bianxi) |
|
|
|
|