| 2014 | Better Algorithms for Online Bin Stretching. | Martin Bhm, Jir Sgall, Rob van Stee, Pavel Vesel |
| 2014 | A o(n) -Competitive Deterministic Algorithm for Online Matching on a Line. | Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato |
| 2014 | Improved Approximations for the Max k-Colored Clustering Problem. | Alexander A. Ageev, Alexander V. Kononov |
| 2013 | Approximating the Sparsest k-Subgraph in Chordal Graphs. | Rmi Watrigant, Marin Bougeret, Rodolphe Giroudeau |
| 2013 | Continuum Armed Bandit Problem of Few Variables in High Dimensions. | Hemant Tyagi, Bernd Grtner |
| 2013 | Approximating the Quadratic Knapsack Problem on Special Graph Classes. | Ulrich Pferschy, Joachim Schauer |
| 2013 | Low Dimensional Embeddings of Doubling Metrics. | Ofer Neiman |
| 2013 | Counting Approximately-Shortest Paths in Directed Acyclic Graphs. | Mats Mihalk, Rastislav Srmek, Peter Widmayer |
| 2013 | On Fixed Cost k-Flow Problems. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
| 2013 | Min-Sum 2-Paths Problems. | Trevor I. Fenner, Oded Lachish, Alexandru Popa |
| 2013 | Online Knapsack Revisited. | Marek Cygan, Lukasz Jez |
| 2013 | Approximability of Connected Factors. | Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul |
| 2013 | Inapproximability Results for Graph Convexity Parameters. | Erika M. M. Coelho, Mitre Costa Dourado, Rudini M. Sampaio |
| 2013 | Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter. | Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki |
| 2013 | On the max min vertex cover Problem. | Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos |
| 2013 | Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono |
| 2013 | Reordering Buffer Management with Advice. | Anna Adamaszek, Marc P. Renault, Adi Rosn, Rob van Stee |
| 2012 | Scheduling with an Orthogonal Resource Constraint. | Martin Niemeier, Andreas Wiese |
| 2012 | Asymptotically Optimal Online Page Migration on Three Points. | Akira Matsubayashi |
| 2012 | Minimizing Cache Usage in Paging. | Alejandro Lpez-Ortiz, Alejandro Salinger |
| 2012 | Probabilistic k-Median Clustering in Data Streams. | Christiane Lammersen, Melanie Schmidt, Christian Sohler |
| 2012 | Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. | Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis |
| 2012 | Algorithms for Cost-Aware Scheduling. | Janardhan Kulkarni, Kamesh Munagala |
| 2012 | On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract). | Itamar Hartstein, Mordechai Shalom, Shmuel Zaks |
| 2012 | Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. | Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs |