| 2015 | On the Approximability of Digraph Ordering. | Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket |
| 2015 | A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity. | Bart M. P. Jansen, Stefan Kratsch |
| 2015 | Fast Output-Sensitive Matrix Multiplication. | Riko Jacob, Morten Stckel |
| 2015 | On the Equivalence among Problems of Bounded Width. | Yoichi Iwata, Yuichi Yoshida |
| 2015 | Faster Fully-Dynamic Minimum Spanning Forest. | Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen |
| 2015 | Monotone Drawings of 3-Connected Plane Graphs. | Xin He, Dayu He |
| 2015 | Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. | Sariel Har-Peled, Kent Quanrud |
| 2015 | The Offset Filtration of Convex Objects. | Dan Halperin, Michael Kerber, Doron Shaharabani |
| 2015 | Approximation Algorithms for Connected Maximum Cut and Related Problems. | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar |
| 2015 | Structural Parameterizations of the Mixed Chinese Postman Problem. | Gregory Z. Gutin, Mark Jones, Magnus Wahlstrm |
| 2015 | Improved Analysis of Complete-Linkage Clustering. | Anna Growendt, Heiko Rglin |
| 2015 | How to Sort by Walking on a Tree. | Daniel Graf |
| 2015 | Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. | Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck |
| 2015 | A Characterization of Visibility Graphs for Pseudo-polygons. | Matt Gibson, Erik Krohn, Qing Wang |
| 2015 | Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis |
| 2015 | An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem. | Kyle Genova, David P. Williamson |
| 2015 | Medial Axis Based Routing Has Constant Load Balancing Factor. | Jie Gao, Mayank Goswami |
| 2015 | Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints. | Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk |
| 2015 | The Temp Secretary Problem. | Amos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov |
| 2015 | Maximizing Symmetric Submodular Functions. | Moran Feldman |
| 2015 | Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem. | Michael Etscheid, Heiko Rglin |
| 2015 | Prophet Secretary. | Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh |
| 2015 | Selfish Vector Packing. | Leah Epstein, Elena Kleiman |
| 2015 | The Price of Matching with Metric Preferences. | Yuval Emek, Tobias Langner, Roger Wattenhofer |
| 2015 | Node-Balancing by Edge-Increments. | Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella |