FAW-AAIM 2013 Technical Program
——————————————————————————————————
Tuesday, June 25th 14:00 —19:00
Registration (Lobby of DMU Hotel and Bayshore Hotel)
All talks are presented at the Conference Room of DMU Exhibition Hall, map site 3.
During the conference (June. 26--28), a shuttle bus will send the participants from
Bayshore hotel to DMU in the morning, and back to the hotel at the night.
The departure time in the morning is 8:15
am.
——————————————————————————————————
1/6
——————————————————————————————————
Wednesday , June 26th at the Conference room of DMU Exhibition Hall
9:00-9:20: Opening Ceremony
Chair: Rong Chen


Binhai Zhu
Xinxiang Pan
9:20-10:20: Invited Talk I
Chair: Xuehou Tan

Jin Akiyama
An algorithm for determining whether a pair of polygons is reversible
10:20--10:40: Coffee Break
10:40--12:20: Session 1
Chair: Jin Akiyama

Dariusz Dereniowski, Danny Dyer, Ryan Tifenbach and Boting Yang
Zero-Visibility Cops & Robber Game on a Graph
(Best Paper Candidate)

Mingyu Xiao and Hiroshi Nagamochi
An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs

Ton Kloks, Ching-Hao Liu and Sheung-Hung Poon
On Edge-Independent Sets

Fernanda Couto, Luerbio Faria, Sulamita Klein, Fabio Protti and Loana
Nogueira
On (k,l)-Graph Sandwich Problems
12:20--13:40: Lunch (1st floor, Restaurant of DMU Hotel)
13:40--14:55: Session 2
Chair: Mingyu Xiao

Xin Han, Yasushi Kawase and Kazuhisa Makino
Randomized Algorithms for Removable Online Knapsack Problems
(Best Paper Candidate)

Zhi-Zhong Chen and Lusheng Wang
Faster Exact Computation of rSPR Distance

Masaki Kawabata and Takao Nishizeki
Spanning Distribution Trees of Graphs -Extended Abstract2/6
14:55-15:15: Coffee Break
15:15—16:30: Session 3
Chair: Takao Nishizeki
 Shenshi Chen
Monomial Testing and Applications

Xiaojie Deng, Bingkai Lin and Chihao Zhang
Multi-Multiway Cut Problem on Graphs of Bounded Branch Width

Chenglin Fan, Jun Luo, Farong Zhong and Binhai Zhu
Expected Computations on Color Spanning Sets
16:30--16:50: Coffee Break
16:50--18:05pm: Session 4
Chair: Boting Yang

Jason Crampton, Robert Crowston, Gregory Gutin, Mark Jones and
Ramanujan M. S.
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence
of Seniority Constraints

Yue-Li Wang, Kuo-Hua Wu and Ton Kloks
On the Perfect Absorbant of De Bruijn Digraphs

Carlos Martinhon and Luérbio Faria
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs
and Digraphs
18:40—20:40: Conference Banquet (at Zhonghai Building in Xinhai Square)
Please take the bus at the front square of DMU Exhibition Hall.
During the banquet, statistics about the submission and attendance will be reported.
Also, Best Paper awards will be announced. These will be presented by Binhai Zhu.
——————————————————————————————————
3/6
——————————————————————————————————
Thursday, June 27th at the Conference room of DMU Exhibition Hall, map site 3
9:00--10:00: Invited Talk II
Chair: Bihhai Zhu

Daniel Marx
The Square Root Phenomenon in Planar Graphs
10:00--10:20: Coffee Break
10:20--12:00: Session 5
Chair: Daniel Marx

Robert Bredereck, André Nichterlein and Rolf Niedermeier
Pattern-Guided k-Anonymity

Pawan Aurora, Sumit Singh and Shashank Mehta
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds

Mark Korenblit and Vadim E. Levit
A One-Vertex Decomposition Algorithm for Generating Algebraic
Expressions of Square Rhomboids

Yumei Huo and Hairong Zhao
Bi-criteria Scheduling on Multiple Machines Subject to Machine
Availability Constraints
12:00—12:10: Photograph Outdoor
12:10-13:30: Lunch (1st floor, Restaurant of DMU Hotel)
13:30—19:00: Half-day tour to LvShun (sightseeing: LvShun Port, and the bordering
line between the Yellow Sea and Bohai Sea)
Please take the bus at the front square of DMU Hotel.
14:00--16:00: Dalian Maritime University Oversea Distinguished Lecture at the other
Conference room of DMU Exhibition Hall, map site 3
Chair: Weishi Zhang

John Hopcroft
Further Directions in Computer Science research
——————————————————————————————————
4/6
——————————————————————————————————
Friday, June 28th at the Conference room of DMU Exhibition Hall, map site 3
9:00--10:40: Session 6
Chair: Kazuo Iwama

Huili Zhang and Yinfeng Xu
The optimal rescue path set problem in undirected graphs

Aritra Banik, Bhaswar Bhattacharya, Sandip Das and Sreeja Das
Two-round discrete Voronoi Game along a line

Yinfeng Xu and Lan Qin
Strategies of groups evacuation from a convex region in the plane

Yijie Han and Sanjeev Saxena
Algorithms for Testing Length Four Permutations
10:40--11:00: Coffee Break
11:00--12:15: Session 7
Chair: Tian Liu

Marcin Krzywkowski
An algorithm for listing all minimal 2-dominating sets of a tree

Ying Zheng, Jianxin Wang and Qilong Feng
Kernelization and Lower Bounds of the Signed Domination Problem

Xiangfu Zou and Daowen Qiu
Arbitrated quantum signature schemes: attacks and security
12:15--13:40: Lunch (1st floor, Restaurant of DMU Hotel)
13:40--14:55: Session 8
Chair: Yinfeng Xu

Tao-Ming Wang and Guang-Hui Zhang
Zero-Sum Flow Numbers of Hexagonal Grids

Longcheng Liu
Inverse maximum flow problems under the combining norms

Wei Wu, Chuan Luo and Kaile Su
FWLS: A Local Search for Graph Coloring
14:55--15:05pm: Coffee Break
5/6
15:05—16:20: Session 9
Chair: Xin Han

Chaoyi Wang, Tian Liu and Ke Xu
Large Hypertree Width on Sparse Random Hypergraphs

Bin Fu
On the Complexity of Approximate Sum of Sorted List

Min Lu, Tian Liu and Ke Xu
Independent Domination: Reductions from Circular- and Triad-Convex
Bipartite Graphs to Convex Bipartite Graphs
16:20—16:40: Coffee Break
16:40—17:30: Session 10
Chair: Xuehou Tan

Xianrong Liu, Wenhong Tian, Minxian Xu and Qin Xiong
A Cost-Efficient Scheduling Algorithm for Traffic Grooming

Ding Ma and Yunshu Gao
Disjoint Small Cycles in Graphs and Bipartite Graphs
17:40-18:40: Dinner (1st floor, Restaurant of DMU Hotel)
————————————End of Technical Program————————————
6/6