| 2016 | From Graph Orientation to the Unweighted Maximum Cut. | Walid Ben-Ameur, Antoine Glorieux, Jos Neto |
| 2016 | The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model. | Florent Becker, Antonio Fernndez Anta, Ivan Rapaport, Eric Rmila |
| 2016 | Deterministic Algorithms for Unique Sink Orientations of Grids. | Luis Barba, Malte Milatz, Jerri Nummenpalo, Antonis Thomas |
| 2016 | Improved Space Efficient Algorithms for BFS, DFS and Applications. | Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman |
| 2016 | Approximating the Maximum Rectilinear Crossing Number. | Samuel Bald, Matthew P. Johnson, Ou Liu |
| 2016 | Polygon Simplification by Minimizing Convex Corners. | Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Debajyoti Mondal |
| 2016 | Computing a Minimum-Width Square or Rectangular Annulus with Outliers - [Extended Abstract]. | Sang Won Bae |
| 2016 | Truthfulness for the Sum of Weighted Completion Times. | Eric Angel, Evripidis Bampis, Fanny Pascual, Nicolas Thibault |
| 2016 | New Results for Network Pollution Games. | Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang |
| 2016 | An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem. | Sharareh Alipour, Mohammad Ghodsi, Amir Jafari |
| 2016 | Combinatorial Scoring of Phylogenetic Networks. | Nikita Alexeev, Max A. Alekseyev |
| 2016 | Minimum Width Color Spanning Annulus. | Ankush Acharyya, Subhas C. Nandy, Sasanka Roy |
| 2016 | The Monotone Circuit Value Problem with Bounded Genus Is in NC. | Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan |
| 2015 | Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. | Peng Zhang, Tao Jiang, Angsheng Li |
| 2015 | Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems. | Wei Yu, Zhaohui Liu |
| 2015 | Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem. | Deshi Ye, Guochuan Zhang |
| 2015 | Strategy-Proof Mechanism for Obnoxious Facility Location on a Line. | Deshi Ye, Lili Mei, Yong Zhang |
| 2015 | A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion. | Bang Ye Wu |
| 2015 | Speedy Colorful Subtrees. | W. Timothy J. White, Stephan Beyer, Kai Dhrkop, Markus Chimani, Sebastian Bcker |
| 2015 | An Approximation Algorithm for the Smallest Color-Spanning Circle Problem. | Yin Wang, Yinfeng Xu |
| 2015 | Private Certificate-Based Remote Data Integrity Checking in Public Clouds. | Huaqun Wang, Jiguo Li |
| 2015 | Bin Packing Game with an Interest Matrix. | Zhenbo Wang, Xin Han, Gyrgy Dsa, Zsolt Tuza |
| 2015 | Mining Preserving Structures in a Graph Sequence. | Takeaki Uno, Yushi Uno |
| 2015 | Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable. | Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka |
| 2015 | A New Non-Merkle-Damgrd Structural Hash Function with Provable Security. | Shenghui Su, Tao Xie, Shuwang L |