| 2013 | Succinct Data Structures for Representing Equivalence Classes. | Moshe Lewenstein, J. Ian Munro, Venkatesh Raman |
| 2013 | Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs. | Marc Lelarge, Hang Zhou |
| 2013 | Market Approach to Social Ads: The MyLikes Example and Related Problems. | Darja Krushevskaja, S. Muthukrishnan |
| 2013 | Pursuit Evasion on Polyhedral Surfaces. | Kyle Klein, Subhash Suri |
| 2013 | Computing the Smallest Color-Spanning Axis-Parallel Square. | Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi |
| 2013 | Approximate Čech Complex in Low and High Dimensions. | Michael Kerber, R. Sharathkumar |
| 2013 | Unit Cost Buyback Problem. | Yasushi Kawase, Xin Han, Kazuhisa Makino |
| 2013 | Better Bounds for Online k-Frame Throughput Maximization in Network Switches. | Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki |
| 2013 | New Inapproximability Bounds for TSP. | Marek Karpinski, Michael Lampis, Richard Schmied |
| 2013 | On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. | Mamadou Moustapha Kant, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno |
| 2013 | Euclidean Traveling Salesman Tours through Stochastic Neighborhoods. | Pegah Kamousi, Subhash Suri |
| 2013 | Computing Minimum Tile Sets to Self-Assemble Color Patterns. | Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki |
| 2013 | Terrain Visibility with Multiple Viewpoints. | Ferran Hurtado, Maarten Lffler, Ins Matos, Vera Sacristn, Maria Saumell, Rodrigo I. Silveira, Frank Staals |
| 2013 | The Number of Different Unfoldings of Polyhedra. | Takashi Horiyama, Wataru Shoji |
| 2013 | Trajectory-Based Dynamic Map Labeling. | Andreas Gemsa, Benjamin Niedermann, Martin Nllenburg |
| 2013 | Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching. | Pawel Gawrychowski, Damian Straszak |
| 2013 | Cops and Robbers on Intersection Graphs. | Tomas Gavenciak, Vt Jelnek, Pavel Klavk, Jan Kratochvl |
| 2013 | Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. | Sren Kristoffer Stiil Frederiksen, Peter Bro Miltersen |
| 2013 | Augmenting Graphs to Minimize the Diameter. | Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson |
| 2013 | The Distance 4-Sector of Two Points Is Unique. | Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro Lpez-Ortiz, J. Ian Munro, Patrick K. Nicholson |
| 2013 | Detecting and Counting Small Pattern Graphs. | Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell |
| 2013 | Exact Sublinear Binomial Sampling. | Martin Farach-Colton, Meng-Tsung Tsai |
| 2013 | Tight Approximation Bounds for Connectivity with a Color-Spanning Set. | Chenglin Fan, Jun Luo, Binhai Zhu |
| 2013 | Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds. | Michael Etscheid |
| 2013 | Approximating the Generalized Minimum Manhattan Network Problem. | Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff |