| 2010 | Real Root Isolation of Multi-Exponential Polynomials with Application. | Ming Xu, Liangyu Chen, Zhenbing Zeng, Zhi-bin Li |
| 2010 | A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs. | Mingyu Xiao |
| 2010 | A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. | Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki |
| 2010 | A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques. | Takeya Shigezumi, Yushi Uno, Osamu Watanabe |
| 2010 | The Covert Set-Cover Problem with Application to Network Discovery. | Sandeep Sen, V. N. Muralidhara |
| 2010 | Variants of Spreading Messages. | T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan |
| 2010 | FPT Algorithms for Connected Feedback Vertex Set. | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2010 | Pathwidth and Searching in Parameterized Threshold Graphs. | D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shashank, C. Pandu Rangan |
| 2010 | Reconstruction Algorithm for Permutation Graphs. | Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara |
| 2010 | A Rooted-Forest Partition with Uniform Vertex Demand. | Naoki Katoh, Shin-ichi Tanigawa |
| 2010 | Harmonious Coloring on Subclasses of Colinear Graphs. | Kyriaki Ioannidou, Stavros D. Nikolopoulos |
| 2010 | On Some Simple Widths. | Ling-Ju Hung, Ton Kloks |
| 2010 | The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing. | Emilio Di Giacomo, Giuseppe Liotta |
| 2010 | Approximation Algorithms for Art Gallery Problems in Polygons and Terrains. | Subir Kumar Ghosh |
| 2010 | Crossings between Curves with Many Tangencies. | Jacob Fox, Fabrizio Frati, Jnos Pach, Rom Pinchasi |
| 2010 | The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in | Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman |
| 2010 | Parallel Algorithms for Encoding and Decoding Blob Code. | Saverio Caminiti, Rossella Petreschi |
| 2010 | Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. | Guillaume Blin, Sylvie Hamel, Stphane Vialette |
| 2010 | A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. | Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya |
| 2010 | Switch-Regular Upward Planar Embeddings of Trees. | Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin |
| 2010 | Computation of Non-dominated Points Using Compact Voronoi Diagrams. | Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink |
| 2010 | A Global | Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hbner |
| 2010 | Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. | Tetsuo Asano, Wolfgang Mulzer, Yajun Wang |
| 2010 | Acyclically 3-Colorable Planar Graphs. | Patrizio Angelini, Fabrizio Frati |
| 2010 | Cutting a Convex Polyhedron Out of a Sphere. | Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam |