| 2018 | Hitting and Covering Partially. | Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh |
| 2018 | Geometric Spanners in the MapReduce Model. | Sepideh Aghamolaei, Fatemeh Baharifard, Mohammad Ghodsi |
| 2018 | A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. | Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan |
| 2018 | New Bounds for Energy Complexity of Boolean Functions. | Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma |
| 2018 | An FPT Algorithm for Contraction to Cactus. | R. Krithika, Pranabendu Misra, Prafullkumar Tale |
| 2018 | Polygon Queries for Convex Hulls of Points. | Eunjin Oh, Hee-Kap Ahn |
| 2018 | Challenges from Cancer Immunotherapy. | Ming Li |
| 2017 | Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction. | Aizhong Zhou, Haitao Jiang, Jiong Guo, Haodi Feng, Nan Liu, Binhai Zhu |
| 2017 | An Efficient Potential Member Promotion Algorithm in Social Networks via Skyline. | Siman Zhang, Jiping Zheng |
| 2017 | A Local Search Approximation Algorithm for the k-means Problem with Penalties. | Dongmei Zhang, Chunlin Hao, Chenchen Wu, Dachuan Xu, Zhenning Zhang |
| 2017 | On the Complexity of k-Metric Antidimension Problem and the Size of k-Antiresolving Sets in Random Graphs. | Congsong Zhang, Yong Gao |
| 2017 | The Existence of Universally Agreed Fairest Semi-matchings in Any Given Bipartite Graph. | Jian Xu, Soumya Banerjee, Wenjing Rao |
| 2017 | Approximation Algorithms for Scheduling Multiple Two-Stage Flowshops. | Guangwei Wu, Jianxin Wang |
| 2017 | SHADE Algorithm Dynamic Analyzed Through Complex Network. | Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy |
| 2017 | Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models. | Sumedh Tirodkar, Sundar Vishwanathan |
| 2017 | Stable Matchings in Trees. | Satoshi Tayu, Shuichi Ueno |
| 2017 | Simple O(n~log^2~n) Algorithms for the Planar 2-Center Problem. | Xuehou Tan, Bo Jiang |
| 2017 | Complexity and Algorithms for Finding a Subset of Vectors with the Longest Sum. | Vladimir Shenmaier |
| 2017 | Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares. | Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy |
| 2017 | Graph Construction Based on Local Representativeness. | Eliska Ochodkova, Sarka Zehnalova, Milos Kudelka |
| 2017 | Bend Complexity and Hamiltonian Cycles in Grid Graphs. | Rahnuma Islam Nishat, Sue Whitesides |
| 2017 | Dynamic Rank-Maximal Matchings. | Prajakta Nimbhorkar, V Arvind Rameshwar |
| 2017 | Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. | Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2017 | An Incentive Compatible, Efficient Market for Air Traffic Flow Management. | Ruta Mehta, Vijay V. Vazirani |
| 2017 | Approximating Weighted Duo-Preservation in Comparative Genomics. | Saeed Mehrabi |