| 2010 | Some Observations on Holographic Algorithms. | Leslie G. Valiant |
| 2010 | The Language Theory of Bounded Context-Switching. | Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato |
| 2010 | Homotopic Rectilinear Routing with Few Links and Thick Edges. | Bettina Speckmann, Kevin Verbeek |
| 2010 | Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling. | Diego Recalde, Cyriel Rutten, Petra Schuurman, Tjark Vredeveld |
| 2010 | Limit Theorems for Random MAX-2-XORSAT. | Vonjy Rasendrahasina, Vlady Ravelomanana |
| 2010 | Iterated Shared Memory Models. | Sergio Rajsbaum |
| 2010 | Packet Routing on the Grid. | Britta Peis, Martin Skutella, Andreas Wiese |
| 2010 | Ambiguity and Deficiency in Costas Arrays and APN Permutations. | Daniel Panario, Brett Stevens, Qiang Wang |
| 2010 | Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming. | Carles Padr, Leonor Vzquez |
| 2010 | Continuous and Discrete Methods in Computer Science. | Cristopher Moore |
| 2010 | Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization. | Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav |
| 2010 | Finding the Best CAFE Is NP-Hard. | Elizabeth Maltais, Lucia Moura |
| 2010 | Modelling the LLL Algorithm by Sandpiles. | Manfred G. Madritsch, Brigitte Valle |
| 2010 | Radix Cross-Sections for Length Morphisms. | Sylvain Lombardy, Jacques Sakarovitch |
| 2010 | Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. | Marek Karpinski, Andrzej Rucinski, Edyta Szymanska |
| 2010 | Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight. | Tsunehiko Kameda, Ichiro Suzuki, John Z. Zhang |
| 2010 | Sparse Recovery Using Sparse Random Matrices. | Piotr Indyk |
| 2010 | Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. | Mark van Hoeij, Andrew Novocin |
| 2010 | Prize-Collecting Steiner Networks via Iterative Rounding. | MohammadTaghi Hajiaghayi, Arefeh A. Nasri |
| 2010 | Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set. | Qianping Gu, Navid Imani |
| 2010 | The I/O Complexity of Sparse Matrix Dense Matrix Multiplication. | Gero Greiner, Riko Jacob |
| 2010 | The Complexity of Counting Eulerian Tours in 4-Regular Graphs. | Qi Ge, Daniel Stefankovic |
| 2010 | Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. | Viliam Geffert, Giovanni Pighizzini |
| 2010 | Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. | Joachim von zur Gathen, Alfredo Viola, Konstantin Ziegler |
| 2010 | Optimal Polygonal Representation of Planar Graphs. | Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov |