| 2010 | Dictionary-Symbolwise Flexible Parsing. | Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo |
| 2010 | Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. | Ferdinando Cicalese, Martin Milanic |
| 2010 | Efficient Reconstruction of RC-Equivalent Strings. | Ferdinando Cicalese, Pter L. Erds, Zsuzsanna Liptk |
| 2010 | Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures. | Danny Z. Chen, Haitao Wang |
| 2010 | Recognition of Probe Ptolemaic Graphs - (Extended Abstract). | Maw-Shang Chang, Ling-Ju Hung |
| 2010 | Blocks of Hypergraphs - Applied to Hypergraphs and Outerplanarity. | Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry |
| 2010 | Path-Based Supports for Hypergraphs. | Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry |
| 2010 | Skip Lift: A Probabilistic Alternative to Red-Black Trees. | Prosenjit Bose, Karim Doueb, Pat Morin |
| 2010 | The Complexity Status of Problems Related to Sparsest Cuts. | Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin |
| 2010 | Parameterized Complexity of | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola |
| 2010 | Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three. | Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov |
| 2010 | Worst Case Efficient Single and Multiple String Matching in the RAM Model. | Djamal Belazzougui |
| 2010 | Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures. | Cristina Bazgan, Sonia Toubaline, Zsolt Tuza |
| 2010 | Chains-into-Bins Processes. | Tugkan Batu, Petra Berenbrink, Colin Cooper |
| 2010 | Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. | Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter |
| 2010 | Efficient Chaining of Seeds in Ordered Trees. | Julien Allali, Cdric Chauve, Pascal Ferraro, Anne-Laure Gaillard |
| 2010 | On Fast Enumeration of Pseudo Bicliques. | Zareen Alamgir, Saira Karim, Syed Husnine |
| 2010 | The Cover Time of Cartesian Product Graphs. | Mohammed Amin Abdullah, Colin Cooper, Tomasz Radzik |
| 2009 | Intractability in Graph Drawing and Geometry: FPT Approaches. | Sue Whitesides |
| 2009 | Antibandwidth of d-Dimensional Meshes. | Lubomir Torok, Imrich Vrto |
| 2009 | Lightweight Parameterized Suffix Array Construction. | Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2009 | Untitled record | Robin Thomas |
| 2009 | The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree. | Edyta Szymanska |
| 2009 | Computability of Width of Submodular Partition Functions. | Petr Skoda |
| 2009 | Rainbow Connection in Graphs with Minimum Degree Three. | Ingo Schiermeyer |