| 2010 | Flows in One-Crossing-Minor-Free Graphs. | Erin W. Chambers, David Eppstein |
| 2010 | An Optimal Algorithm for Computing Angle-Constrained Spanners. | Paz Carmi, Michiel H. M. Smid |
| 2010 | On the Approximability of the Maximum Interval Constrained Coloring Problem. | Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman |
| 2010 | From Holant to #CSP and Back: Dichotomy for Holant | Jin-yi Cai, Sangxia Huang, Pinyan Lu |
| 2010 | On Coloring Graphs without Induced Forests. | Hajo Broersma, Petr A. Golovach, Danil Paulusma, Jian Song |
| 2010 | Unit-Time Predecessor Queries on Massive Data Sets. | Andrej Brodnik, John Iacono |
| 2010 | D | Gerth Stlting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis |
| 2010 | A Cache-Oblivious Implicit Dictionary with the Working Set Property. | Gerth Stlting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen |
| 2010 | Combining Two Worlds: Parameterised Approximation for Vertex Cover. | Ljiljana Brankovic, Henning Fernau |
| 2010 | Untitled record | Prosenjit Bose, Mirela Damian, Karim Doueb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer |
| 2010 | Should Static Search Trees Ever Be Unbalanced? | Prosenjit Bose, Karim Doueb |
| 2010 | Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. | Immanuel M. Bomze, Markus Chimani, Michael Jnger, Ivana Ljubic, Petra Mutzel, Bernd Zey |
| 2010 | Approximation Algorithms for the Multi-Vehicle Scheduling Problem. | Binay K. Bhattacharya, Yuzhuang Hu |
| 2010 | A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2. | Piotr Berman, Marek Karpinski, Alexander Zelikovsky |
| 2010 | Alphabet Partitioning for Compressed Rank/Select and Applications. | Jrmy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich |
| 2010 | Bounded Max-colorings of Graphs. | Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis |
| 2010 | The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract). | Sang Won Bae, Chan-Su Shin |
| 2010 | A Faster Algorithm for the Maximum Even Factor Problem. | Maxim A. Babenko |
| 2010 | On the Continuous CNN Problem. | John Augustine, Nick Gravin |
| 2010 | Approximate Periodicity. | Amihood Amir, Estrella Eisenberg, Avivit Levy |
| 2010 | New Upper Bounds on the Average PTF Density of Boolean Functions. | Kazuyuki Amano |
| 2010 | Computing the Discrete Frchet Distance with Imprecise Input. | Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron |
| 2010 | Maximum Overlap of Convex Polytopes under Translation. | Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher |
| 2010 | Parameterized Algorithms for Boxicity. | Abhijin Adiga, Rajesh Hemant Chitnis, Saket Saurabh |
| 2010 | Approximation and Hardness Results for the Maximum Edge | Anna Adamaszek, Alexandru Popa |