| 2010 | The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs. | I Wayan Sudarsana, Adiwijaya, Selvy Musdalifah |
| 2010 | Clustering with or without the Approximation. | Frans Schalekamp, Michael Yu, Anke van Zuylen |
| 2010 | A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model. | Ricky Rosen |
| 2010 | Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph. | Aimal Rextin, Patrick Healy |
| 2010 | Finding Maximum Edge Bicliques in Convex Bipartite Graphs. | Doron Nussbaum, Shuye Pu, Jrg-Rdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh |
| 2010 | On the Hardness against Constant-Depth Linear-Size Circuits. | Chi-Jen Lu, Hsin-Lung Wu |
| 2010 | Imbalance Is Fixed Parameter Tractable. | Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
| 2010 | Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial. | Yunlong Liu, Xiaodong Wu |
| 2010 | On the Computation of 3D Visibility Skeletons. | Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang |
| 2010 | Counting Paths in VPA Is Complete for #NC | Andreas Krebs, Nutan Limaye, Meena Mahajan |
| 2010 | Directed Figure Codes: Decidability Frontier. | Michal Kolarz |
| 2010 | A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks. | Sayaka Kamei, Hirotsugu Kakugawa, Stphane Devismes, Sbastien Tixeuil |
| 2010 | Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. | Rahul Jain, Hartmut Klauck, Shengyu Zhang |
| 2010 | Computing with Cells: Membrane Systems. | Oscar H. Ibarra |
| 2010 | Faster Generation of Shorthand Universal Cycles for Permutations. | Alexander E. Holroyd, Frank Ruskey, Aaron Williams |
| 2010 | On the Density of Regular and Context-Free Languages. | Michael Hartwig |
| 2010 | Constant Time Approximation Scheme for Largest Well Predicted Subset. | Bin Fu, Lusheng Wang |
| 2010 | Online Preemptive Scheduling with Immediate Decision or Notification and Penalties. | Stanley P. Y. Fung |
| 2010 | The Cover Time of Deterministic Random Walks. | Tobias Friedrich, Thomas Sauerwald |
| 2010 | The Curse of Connectivity: | Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh |
| 2010 | The Rectilinear | Vladimir Estivill-Castro, Apichat Heednacram, Francis Suraweera |
| 2010 | Auspicious Tatami Mat Arrangements. | Alejandro Erickson, Frank Ruskey, Mark Schurch, Jennifer Woodcock |
| 2010 | The Violation Heap: A Relaxed Fibonacci-Like Heap. | Amr Elmasry |
| 2010 | The Longest Almost-Increasing Subsequence. | Amr Elmasry |
| 2010 | Detecting Areas Visited Regularly. | Bojan Djordjevic, Joachim Gudmundsson |