| 2012 | Online Exploration of Polygons with Holes. | Robert Georges, Frank Hoffmann, Klaus Kriegel |
| 2012 | Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs. | Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vincius G. P. de S, Raphael Machado |
| 2012 | Online Multi-Commodity Flow with High Demands. | Guy Even, Moti Medina |
| 2012 | Approximating the Throughput by Coolest First Scheduling. | Christoph Drr, Ioannis Milis, Julien Robert, Georgios Zois |
| 2012 | On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods. | Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro Lpez-Ortiz, Diego Seco |
| 2012 | Approximation Algorithms for the Wafer to Wafer Integration Problem. | Trivikram Dokka, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma |
| 2012 | Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract). | Stefan Dobrev, Rastislav Krlovic, Richard Krlovic |
| 2012 | Approximating Spanning Trees with Few Branches. | Markus Chimani, Joachim Spoerhase |
| 2012 | Some Anomalies of Farsighted Strategic Behavior. | Vittorio Bil, Michele Flammini, Gianpiero Monaco, Luca Moscardelli |
| 2012 | A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games. | Vittorio Bil |
| 2012 | A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs. | Therese Biedl |
| 2012 | The Primal-Dual Approach for Online Algorithms. | Nikhil Bansal |
| 2012 | R-LINE: A Better Randomized 2-Server Algorithm on the Line. | Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore |
| 2012 | Black and White Bin Packing. | Jnos Balogh, Jzsef Bksi, Gyrgy Dsa, Hans Kellerer, Zsolt Tuza |
| 2012 | Improved Approximation Guarantees for Lower-Bounded Facility Location. | Sara Ahmadian, Chaitanya Swamy |
| 2011 | Simpler 3/4-Approximation Algorithms for MAX SAT. | Anke van Zuylen |
| 2011 | Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models. | Jianqiao Zhu, Ho-Leung Chan, Tak Wah Lam |
| 2011 | Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat. | David B. Shmoys, Gwen Spencer |
| 2011 | Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. | Nadine Schwartges, Joachim Spoerhase, Alexander Wolff |
| 2011 | On Online Algorithms with Advice for the k-Server Problem. | Marc P. Renault, Adi Rosn |
| 2011 | Faster and Simpler Approximation of Stable Matchings. | Katarzyna E. Paluch |
| 2011 | Approximating Subset k-Connectivity Problems. | Zeev Nutov |
| 2011 | Learning in Stochastic Machine Scheduling. | Sebastin Marbn, Cyriel Rutten, Tjark Vredeveld |
| 2011 | Competitive Router Scheduling with Structured Data. | Yishay Mansour, Boaz Patt-Shamir, Dror Rawitz |
| 2011 | Scheduling Jobs on Identical and Uniform Processors Revisited. | Klaus Jansen, Christina Robenek |