FAW 2018 Accepted Papers

Ke Chen and Adrian Dumitrescu. On the Longest Spanning Tree with Neighborhoods
Yong Wang and Jeffrey Remmel. A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals
Koki Takayama and Yusuke Kobayashi. A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees
Wenjun Li, Junjie Ye and Yixin Cao. Kernelization for P2-packing: A Gerrymandering Approach
Piotr Wojciechowski, K. Subramani and Matthew Williamson. Optimal length tree-like refutations of linear feasibility in UTVPI constraints}
Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno and Kunihiro Wasa. Exact Algorithms for the Max-Min Dispersion Problem
Wei Yu, Zhaohui Liu and Xiaoguang Bao. New Approximation Algorithms for the Minimum Cycle Cover Problem
Biing-Feng Wang, Jhih-Hong Ye and Chih-Yu Li. On the minmax regret path center problem on trees
Xiaotie Deng and Keyu Zhu. On Bayesian Epistemology of Myerson Auction
Nitesh Tripathi, Manjish Pal, Minati De, Gautam K Das and Subhas Nandy. Guarding Polyhedral Terrain by $k$-Watchtowers
Tian Liu, Chaoyi Wang and Wei Xu. Balanced Random Constraint Satisfaction: Phase Transition and Hardness
N.S. Narayanaswamy and Sundar Annamalai. Exact algorithms for allocation problems
Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das and Subhas C. Nandy. The Maximum Distance-$d$ Independent Set Problem on Unit Disk Graphs
Qilong Feng, Beilin Zhuo, Guanlan Tan, Neng Huang and Jianxin Wang. Improved kernels for several problems on planar graphs
Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang and Ro-Yu Wu. Two Kinds of Generalized 3-Connectivities of Alternating Group Networks
Gaoang Liu and Xiuying Liu. The Complexity of Weak Consistency
Yuan Tang. Non-Orthogonal Homothetic Range Partial-Sum Query on Integer Grids
Luisa Gargano, Adele Rescigno and Ugo Vaccaro. Low-Weight Superimposed Codes and their Applications
Rani M R, R. Subashini and Mohith Jagalmohanan. Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix \& Editing Problems
S Vaishali, M S Atulya and Nidhi Purohit. Efficient Algorithms for a Graph Partitioning Problem
Jie You, Jianxin Wang and Qilong Feng. Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition
Pranav Arora, Aritra Banik, Vijay Kumar Paliwal and Venkatesh Raman. Some (in)tractable parameterizations of Coloring and List-Coloring
Songhua Li and Yinfeng Xu. Single Vehicle’s Package Delivery Strategy with Online Traffic Congestion of Certain Recovery time