| 2014 | Fault-Tolerant Approximate Shortest-Path Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2014 | Polynomial Decompositions in Polynomial Time. | Arnab Bhattacharyya |
| 2014 | The Batched Predecessor Problem in External Memory. | Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai |
| 2014 | Improved Approximation Algorithms for Box Contact Representations. | Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff |
| 2014 | Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. | Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balzs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis |
| 2014 | Recognizing Shrinkable Complexes Is NP-Complete. | Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard |
| 2014 | Distribution-Sensitive Construction of the Greedy Spanner. | Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink |
| 2014 | Convex Hulls under Uncertainty. | Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang |
| 2014 | The Space-Stretch-Time Tradeoff in Distance Oracles. | Rachit Agarwal |
| 2014 | Theory and Practice of Chunked Sequences. | Umut A. Acar, Arthur Charguraud, Mike Rainey |
| 2014 | Optimal Coordination Mechanisms for Multi-job Scheduling Games. | Fidaa Abed, Jos R. Correa, Chien-Chung Huang |
| 2014 | Losing Weight by Gaining Edges. | Amir Abboud, Kevin Lewi, Ryan Williams |
| 2013 | Shell: A Spatial Decomposition Data Structure for 3D Curve Traversal on Many-Core Architectures. | Kai Xiao, Danny Ziyi Chen, Xiaobo Sharon Hu, Bo Zhou |
| 2013 | Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling. | Kim Thang Nguyen |
| 2013 | On the Most Likely Convex Hull of Uncertain Points. | Subhash Suri, Kevin Verbeek, Hakan Yildiz |
| 2013 | Top-k Document Retrieval in External Memory. | Rahul Shah, Cheng Sheng, Sharma V. Thankachan, Jeffrey Scott Vitter |
| 2013 | Sparse Fault-Tolerant BFS Trees. | Merav Parter, David Peleg |
| 2013 | Euclidean Greedy Drawings of Trees. | Martin Nllenburg, Roman Prutkin |
| 2013 | Optimal Color Range Reporting in One Dimension. | Yakov Nekrich, Jeffrey Scott Vitter |
| 2013 | Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets. | Shin-ichi Minato |
| 2013 | The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial. | George B. Mertzios |
| 2013 | Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections. | Jannik Matuschke, Andreas Bley, Benjamin Mller |
| 2013 | Improved Approximation Algorithms for Projection Games - (Extended Abstract). | Pasin Manurangsi, Dana Moshkovitz |
| 2013 | Balanced Neighbor Selection for BitTorrent-Like Networks. | Sndor Laki, Tams Lukovszki |
| 2013 | On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility. | Stefan Kratsch |