| 2017 | The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality. | Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing |
| 2017 | Incentive Ratios of a Proportional Sharing Mechanism in Resource Sharing. | Zhou Chen, Yukun Cheng, Qi Qi, Xiang Yan |
| 2017 | Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. | Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2017 | Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications. | Sankardeep Chakraborty, Srinivasa Rao Satti |
| 2017 | Deletion Graph Problems Based on Deadlock Resolution. | Alan Digo Aurlio Carneiro, Fbio Protti, Uverton S. Souza |
| 2017 | Constrained Routing Between Non-Visible Vertices. | Prosenjit Bose, Matias Korman, Andr van Renssen, Sander Verdonschot |
| 2017 | An Improved Lower Bound on the Growth Constant of Polyiamonds. | Gill Barequet, Mira Shalah, Yufei Zheng |
| 2017 | Depth Distribution in High Dimensions. | Jrmy Barbay, Pablo Prez-Lantero, Javiel Rojas-Ledesma |
| 2017 | Cooperative Game Theory Approaches for Network Partitioning. | Konstantin E. Avrachenkov, Aleksei Yu. Kondratev, Vladimir V. Mazalov |
| 2017 | Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing. | Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan |
| 2017 | An FPTAS for the Volume of Some | Ei Ando, Shuji Kijima |
| 2017 | A Time-Space Trade-Off for Triangulations of Points in the Plane. | Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri |
| 2017 | Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems. | Wei Yu, Zhaohui Liu |
| 2016 | Combiners for Chosen-Ciphertext Security. | Cong Zhang, David Cash, Xiuhua Wang, Xiaoqi Yu, Sherman S. M. Chow |
| 2016 | A Parameterized Algorithm for Bounded-Degree Vertex Deletion. | Mingyu Xiao |
| 2016 | On the Power of Simple Reductions for the Maximum Independent Set Problem. | Darren Strash |
| 2016 | Extending MSVL with Semaphore. | Xinfeng Shu, Zhenhua Duan |
| 2016 | The Maximum Disjoint Routing Problem. | Farhad Shahmohammadi, Amir Sharif-Zadeh, Hamid Zarrabi-Zadeh |
| 2016 | Balanced Allocation on Graphs: A Random Walk Approach. | Ali Pourmiri |
| 2016 | Locality-Sensitive Hashing Without False Negatives for l_p. | Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki |
| 2016 | Assigning Proximity Facilities for Gatherings. | Shin-Ichi Nakano |
| 2016 | Highly Bi-Connected Subgraphs for Computational Protein Function Annotation. | Jucheol Moon, Iddo Friedberg, Oliver Eulenstein |
| 2016 | On the Complexity of Insertion Propagation with Functional Dependency Constraints. | Dongjing Miao, Zhipeng Cai, Xianmin Liu, Jianzhong Li |
| 2016 | Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith's Methods. | Thierry Mefenza |
| 2016 | From Preemptive to Non-preemptive Scheduling Using Rejections. | Giorgio Lucarelli, Abhinav Srivastav, Denis Trystram |