| 2018 | Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition. | Jie You, Jianxin Wang, Qilong Feng |
| 2018 | Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints. | Piotr Wojciechowski, K. Subramani, Matthew D. Williamson |
| 2018 | On the Minmax Regret Path Center Problem on Trees. | Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li |
| 2018 | A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals. | Yong Wang, Jeffrey B. Remmel |
| 2018 | Efficient Algorithms for a Graph Partitioning Problem. | S. Vaishali, M. S. Atulya, Nidhi Purohit |
| 2018 | Guarding Polyhedral Terrain by k-Watchtowers. | Nitesh Tripathi, Manjish Pal, Minati De, Gautam K. Das, Subhas C. Nandy |
| 2018 | Non-orthogonal Homothetic Range Partial-Sum Query on Integer Grids - [Extended Abstract]. | Yuan Tang, Haibin Kan |
| 2018 | A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees. | Koki Takayama, Yusuke Kobayashi |
| 2018 | Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems. | M. R. Rani, Mohith Jagalmohanan, R. Subashini |
| 2018 | Kernelization for P | Wenjun Li, Junjie Ye, Yixin Cao |
| 2018 | Single Vehicle's Package Delivery Strategy with Online Traffic Congestion of Certain Delay Time. | Songhua Li, Yinfeng Xu |
| 2018 | Balanced Random Constraint Satisfaction: Phase Transition and Hardness. | Tian Liu, Chaoyi Wang, Wei Xu |
| 2018 | The Complexity of Weak Consistency. | Gaoang Liu, Xiuying Liu |
| 2018 | The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. | Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy |
| 2018 | Low-Weight Superimposed Codes and Their Applications. | Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro |
| 2018 | Improved Kernels for Several Problems on Planar Graphs. | Qilong Feng, Beilin Zhuo, Guanlan Tan, Neng Huang, Jianxin Wang |
| 2018 | On Bayesian Epistemology of Myerson Auction. | Xiaotie Deng, Keyu Zhu |
| 2018 | Two Kinds of Generalized 3-Connectivities of Alternating Group Networks. | Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Ro-Yu Wu |
| 2018 | Some (in)tractable Parameterizations of Coloring and List-Coloring. | Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman |
| 2018 | Exact Algorithms for Allocation Problems. | Sundar Annamalai, N. S. Narayanaswamy |
| 2018 | Exact Algorithms for the Max-Min Dispersion Problem. | Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa |
| 2018 | New Approximation Algorithms for the Minimum Cycle Cover Problem. | Wei Yu, Zhaohui Liu, Xiaoguang Bao |
| 2018 | On the Longest Spanning Tree with Neighborhoods. | Ke Chen, Adrian Dumitrescu |
| 2017 | Phase Transition for Maximum Not-All-Equal Satisfiability. | Junping Zhou, Shuli Hu, Tingting Zou, Minghao Yin |
| 2017 | Designing and Implementing Algorithms for the Closest String Problem. | Shota Yuasa, Zhi-Zhong Chen, Bin Ma, Lusheng Wang |