| 2009 | A New Algorithm for Efficient Pattern Matching with Swaps. Matteo Campanelli, Domenico Cantone, Simone Faro |
| 2009 | An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios |
| 2009 | Antibandwidth of d-Dimensional Meshes. Lubomir Torok, Imrich Vrto |
| 2009 | Approximating the Max Edge-Coloring Problem. Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos |
| 2009 | Better Polynomial Algorithms on Graphs of Bounded Rank-Width. Robert Ganian, Petr Hlinený |
| 2009 | Bipartite Graphs of Large Clique-Width. Nicholas Korpelainen, Vadim V. Lozin |
| 2009 | Branching Systems. Jack Edmonds |
| 2009 | Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers Jirí Fiala, Jan Kratochvíl, Mirka Miller |
| 2009 | Combinatorial Models for Cooperation Networks. Michael Drmota, Bernhard Gittenberger, Reinhard Kutzelnigg |
| 2009 | Computability of Width of Submodular Partition Functions. Petr Skoda |
| 2009 | Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. David Coudert, Frédéric Giroire, Ignasi Sau |
| 2009 | Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and Christophe Crespelle, Philippe Gambette |
| 2009 | Embedded Trees and the Support of the ISE. Michael Drmota |
| 2009 | Evaluation of Recoverable-Robust Timetables on Tree Networks. Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra |
| 2009 | Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees. Petr Kovár, Michael Kubesa |
| 2009 | Fast Convolutions and Their Applications in Approximate String Matching. Kimmo Fredriksson, Szymon Grabowski |
| 2009 | Feedback Vertex Set on Graphs of Low Cliquewidth. Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle |
| 2009 | Forbidden Subgraph Colorings and the Oriented Chromatic Number. N. R. Aravind, C. R. Subramanian |
| 2009 | Fully Decomposable Split Graphs. Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger |
| 2009 | Gray Code Compression. Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski |
| 2009 | Integrality Properties of Certain Special Balanceable Families. Nicola Apollonio, Massimiliano Caramia |
| 2009 | Intractability in Graph Drawing and Geometry: FPT Approaches. Sue Whitesides |
| 2009 | Kernel in Oriented Circulant Graphs. Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Joice Punitha |
| 2009 | LPF Computation Revisited. Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
| 2009 | Lightweight Parameterized Suffix Array Construction. Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2009 | Limiting Distribution for Distances in Alexis Darrasse, Michèle Soria |
| 2009 | Minimax Trees in Linear Time with Applications. Pawel Gawrychowski, Travis Gagie |
| 2009 | New Word-Based Adaptive Dense Compressors. Petr Procházka, Jan Holub |
| 2009 | Note on Decomposition of Sylwia Cichacz, Dalibor Froncek, Petr Kovár |
| 2009 | On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices. Marián Klesc |
| 2009 | On the Maximal Number of Cubic Subwords in a String. Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2009 | Planar Biconnectivity Augmentation with Fixed Embedding. Carsten Gutwenger, Petra Mutzel, Bernd Zey |
| 2009 | Polar Permutation Graphs. Tínaz Ekim, Pinar Heggernes, Daniel Meister |
| 2009 | Polynomial Kernels for 3-Leaf Power Graph Modification Problems. Stéphane Bessy, Christophe Paul, Anthony Perez |
| 2009 | Rainbow Connection in Graphs with Minimum Degree Three. Ingo Schiermeyer |
| 2009 | Randomized Postoptimization of Covering Arrays. Peyman Nayeri, Charles J. Colbourn, Goran Konjevod |
| 2009 | Simpler Parameterized Algorithm for OCT. Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar |
| 2009 | Solution of Peter Winkler's Pizza Problem. Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr |
| 2009 | Succinct Representations of Trees. Giovanni Manzini |
| 2009 | The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree. Edyta Szymanska |
| 2009 | The Guarding Problem - Complexity and Approximation. T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan |
| 2009 | The Height and Range of Watermelons without Wall. Thomas Feierl |
| 2009 | Three Complexity Results on Coloring Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma |
| 2009 | Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. Michael R. Fellows |
| 2009 | Trivially-Perfect Width. Ling-Ju Hung, Ton Kloks, Chuan-Min Lee |
| 2009 | Weighted LCS. Amihood Amir, Zvi Gotthilf, B. Riva Shalom |