Conference Program (Tentative)

Download Here. [PDF, DOC]

First Day (December 18, 2015)

Session Time Titles of Talks / Speakers and Authors
Registration 07:30 - 09:00
Keynote 09:00 - 10:00 Eunice Santos, Ph.D., Illinois Institute of Technology
Coffee Break 10:00 - 10:15
Session 1
Classic Combinatorial Optimization (Chair: Wolfgang Bein)
10:15 - 10:30 Directed Pathwidth and Palletizers
Frank Gurski, Jochen Rethmann, Egon Wanke
10:30 - 10:45 Local Search Algorithms for $k$-median and $k$-Facility Location Problem with Linear Penalties
Yishui Wang, Dachuan Xu, Donglei Du, Chenchen Wu
10:45 - 11:00 Improved MaxSAT Algorithms for Instances of Degree 3
Chao Xu, Jianer Chen, Jianxin Wang
11:00 - 11:15 Black And White Bin Packing Revisited
Jing Chen, Xin Han, Wolfgang Bein, Hingfung Ting
11:15 - 11:30 A (5.83+$\epsilon$)-approximation Algorithm for Universal Facility Location with Linear Penalty
Yicheng Xu, Dachuan Xu, Donglei Du, Chenchen Wu
11:30 - 11:45 Variants of Multi-Resource Scheduling Problems with Equal Processing Times
Hamed Fahimi, Claude-Guy Quimper
11:45 - 12:00 Improved Algorithms for the Evacuation Route Planning Problem
Gopinath Mishra, SUBHRA MAZUMDAR, Arindam Pal
Lunch 12:00-13:00
Session 2
Geometric Optimization (Chair: Alejandro Erickson)
13:00-13:15 An improved on-line strategy for exploring unknown polygons
Xuehou Tan, Qi Wei
13:15-13:30 Optimal self-assembly of finite shapes at temperature 1 in 3D
Scott Summers, David Furcy
13:30-13:45 Line Segment Covering of Cells in Arrangements
Matias Korman, Sheung-Hung Poon, Marcel Roeloffzen
13:45-14:00 The Discrete and Mixed Minimax 2-Center Problem
Yi Xu, Jigen Peng, Yinfeng Xu, Binhai Zhu
14:00-14:15 Approximation Algorithms for Generalized MST and TSP in Grid Clusters
Binay Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol
14:15-14:30 Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
Michael Khachay, Helen Zaytseva
14:30-14:45 Covering, Hitting, Piercing, and Packing Rectangles Intersecting an Inclined Line
Supantha Pandit, Apurva Mudgal
Coffee Break 14:45-15:00
Session 3
Network Optimization (Chair: Wolfgang Bein)
15:00-15:15 Distributed Algorithm for Mending Barrier Gaps via Sensor Rotation in Wireless Sensor Networks
Yueshi Wu, Mihaela Cardei
15:15-15:30 An efficient shortest-path routing algorithm in the data centre network DPillar
Alejandro Erickson, Abbas Kiasari, Javier Navaridas, Iain Stewart
15:30-15:45 Metric and Distributed On-line Algorithm for Minimizing Routing Interference in Wireless Sensor Networks
Kejia Zhang, Qilong Han, Zhipeng Cai, Guisheng Yin, Junyu Lin
15:45-16:00 WDCS: A Weight-Based Distributed Coordinate System
Yaning Liu, Hongwei Du, Qiang Ye
16:00-16:15 A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks
Gennaro Cordasco, Luisa Gargano, Marco Mecchia, Adele Rescigno, Ugo Vaccaro
16:15-16:30 Adaptive Scheduling over a Wireless Channel under Constrained Jamming
Antonio Fernández Anta, Chryssis Georgiou, Elli Zavou
16:30-16:45 A Sensor Deployment Strategy in Bus-based Hybrid Ad-hoc Networks
Rongrong Zhu, Hongwei Du, Xiaohua Jia, Chuang Liu
16:45-17:00 New insight into 2-community structures in graphs with applications in social networks
Cristina Bazgan, Janka Chlebikova, Thomas Pontoizeau

Second Day (December 19, 2015)

Session Time Titles of Talks / Speakers and Authors
Keynote 09:00 - 10:00 My T. Thai, Ph.D., University of Florida
Coffee Break 10:00 - 10:15
Session 4
Complexity and Game (Chair: Yong Zhang)
10:15-10:30 Symbolic Model Checking for Alternating Projection Temporal Logic
Haiyang wang, zhenhua duan, Cong Tian
10:30-10:45 On the complexity of scaffolding problems: from cliques to sparse graphs
Mathias Weller, Annie Chateau, Rodolphe Giroudeau
10:45-11:00 Parameterized lower bound and NP-completeness of some H-free Edge Deletion problems
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
11:00-11:15 Multicast Network Design Game on a Ring
Akaki Mamageishvili, Matus Mihalak
11:15-11:30 Vertex Cover in Conflict Graphs: Complexity and A Near Optimal Approximation
Dongjing Miao, Jianzhong Li, Xianmin Liu, Hong Gao
11:30-11:45 Extreme witnesses and their applications
Andrzej Lingas, Mia Persson
11:45-12:00 Orbital independence in symmetric mathematical programs
Gustavo Dias, Leo Liberti
Lunch 12:00-13:00
Session 5
Optimization in Graphs I (Chair: Ugo Vaccaro)
13:00-13:15 Legally $(\Delta+2)$-coloring bipartite
Danjun Huang, Ko-Wei Lih, Weifan Wang
13:15-13:30 An I/O Efficient Algorithm for Minimum Spanning Trees.
Alka Bhushan, Gopalan Sajith
13:30-13:45 The Influence of Preprocessing on Steiner Tree Approximations
Stephan Beyer, Markus Chimani
13:45-14:00 Searching for (near) optimal codes
Xueliang Li, Yaoping Mao, Meiqin Wei, Ruihu Li
14:00-14:15 Algorithms for the Densest Subgraph with at least k Vertices and with a Specified Subset
Wenbin Chen, Lingxi Peng, Jianxiong Wang, Fufang Li
14:15-14:30 The connected p-centdian problem on block graphs
Liying Kang, Erfang Shan, Jianjie Zhou
14:30-14:45 Approximating the Restricted 1-Center in Graphs
Wei Ding, Ke Qiu
Coffee Break 14:45-15:00
Session 6
Optimization in Graphs II (Chair: Eunjeong Yi)
15:00-15:15 Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
Yuichi Asahiro, Yuya Doi, Eiji Miyano, Hirotaka Shimizu
15:15-15:30 Maximum Independent Set on $B_1$-VPG Graphs
Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian
15:30-15:45 Trees, Paths, Stars, Caterpillars and Spiders
Minghui Jiang
15:45-16:00 Online Minimum Bichromatic Separating Circle
Bogdan Armaselu, Ovidiu Daescu
16:00-16:15 Dynamic Single-Source Shortest Paths in Erd\"{o}s-R\'{e}nyi Random Graphs
Wei Ding, Ke Qiu
16:15-16:30 Edge-Disjoint Packing of Stars and Cycles
Minghui Jiang, Ge Xia, Yong Zhang
16:30-16:45 The disjunctive bondage number and the disjunctive total bondage number of graphs
Eunjeong Yi
16:45-17:00 Deleting edges to restrict the size of an epidemic: a new application for treewidth
Jessica Enright, Kitty Meeks
17:00-17:15 Adaptive Approximation Algorithms for Community Detection in Dynamic Networks
Xiang Li, My T. Thai

Third Day (December 20, 2015)

Session Time Titles of Talks / Speakers and Authors
Session 7
Applied Optimization (Chair: Wei Ding)
8:30-8:45 Indoor Localization via Candidate Fingerprints and Genetic Algorithm
Zeqi Song, Hongwei Du, Hejiao Huang, Chuang Liu
8:45-9:00 A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline
Dan Yang, Xiaohan He, Liang Song, Hejiao Huang, Hongwei Du
9:00-9:15 Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection
Ahmad Mahmoody, Eli Upfal, Evgenios Kornaropoulos
9:15-9:30 On clustering without replication in combinatorial circuits
Zola Donovan, Vahan Mkrtchyan, K. Subramani
9:30-9:45 Observing the state of a smart grid using bilevel programming
Sonia Toubaline, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti
9:45-10:00 On Replica Placement in High-Availability Storage under Correlated Failure
K. Alex Mills, R. Chandrasekaran, Neeraj Mittal
Coffee Break 10:00-10:15
Session 8
Miscellaneous (Chair: Michael Khachay)
10:15 - 10:27 Another easy QAP case with Robinsonian matrix: Is it easy to recognize?
Eranda Cela, Vladimir Deineko, Gerhard Woeginger
10:27 - 10:39 Algebraic Theory on Shortest Paths for All Flows
Tadao Takaoka
10:39 - 10:51 Searching Graph Communities by Modularity Maximization via Convex Optimization
Yuqing Zhu, Chengxu Sun, Deying Li, Cong Chen, Yinfeng Xu
10:51 - 11:03 Online scheduling for Electricity Cost in Smart Grid
Xin Feng, Yinfeng Xu, Feifeng Zheng
11:03 - 11:15 An online model of berth and quay crane integrated allocation in container terminals
Feifeng Zheng, Longliang Qiao
11:15 - 11:27 Listing Center Strings under the Edit Distance Metric
Hiromitsu Maji, Taisuke Izumi
11:27 - 11:39 Proportional Cost Buyback Problem with Weight Bounds
Yasushi Kawase, Xin Han, Kazuhisa Makino
11:39 - 11:51 The Minimum Acceptable Violation Ranking of Alternatives from Voters' Ordinal Rankings
Kelin Luo, Yinfeng Xu
11:51 - 12:03 On the Minimal Constraint Satisfaction Problem: Complexity and Generation
Guillaume Escamocher, Barry O'Sullivan