| 2009 | Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming. | Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu |
| 2009 | Exact Algorithms for Set Multicover and Multiset Multicover Problems. | Qiang-Sheng Hua, Dongxiao Yu, Francis C. M. Lau, Yuexuan Wang |
| 2009 | Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract). | Pei-Chi Huang, Hsin-Wen Wei, Yen-Chiu Chen, Ming-Yang Kao, Wei-Kuan Shih, Tsan-sheng Hsu |
| 2009 | An Optimal Labeling for Node Connectivity. | Tai-Hsin Hsu, Hsueh-I Lu |
| 2009 | Finding All Approximate Gapped Palindromes. | Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao |
| 2009 | Upward Star-Shaped Polyhedral Graphs. | Seok-Hee Hong, Hiroshi Nagamochi |
| 2009 | Succinct Index for Dynamic Dictionary Matching. | Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Scott Vitter |
| 2009 | Hilbert's Thirteenth Problem and Circuit Complexity. | Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen |
| 2009 | Online Knapsack Problems with Limited Cuts. | Xin Han, Kazuhisa Makino |
| 2009 | Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in | Qian-Ping Gu, Hisao Tamaki |
| 2009 | Parameterized Complexity of Arc-Weighted Directed Steiner Problems. | Jiong Guo, Rolf Niedermeier, Ondrej Such |
| 2009 | Editing Graphs into Disjoint Unions of Dense Clusters. | Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann |
| 2009 | Pattern Matching for 321-Avoiding Permutations. | Sylvain Guillemot, Stphane Vialette |
| 2009 | Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. | Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung |
| 2009 | Bubblesort and Juggling Sequences. | Ronald L. Graham |
| 2009 | Succinct Greedy Geometric Routing in the Euclidean Plane. | Michael T. Goodrich, Darren Strash |
| 2009 | Induced Packing of Odd Cycles in a Planar Graph. | Petr A. Golovach, Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos |
| 2009 | Bandwidth on AT-Free Graphs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
| 2009 | Graph Orientations with Set Connectivity Requirements. | Takuro Fukunaga |
| 2009 | Computing Large Matchings in Planar Graphs with Fixed Minimum Degree. | Robert Franke, Ignaz Rutter, Dorothea Wagner |
| 2009 | A Linear Vertex Kernel for Maximum Internal Spanning Tree. | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stphan Thomass |
| 2009 | Exploration of Periodically Varying Graphs. | Paola Flocchini, Bernard Mans, Nicola Santoro |
| 2009 | On the Camera Placement Problem. | Rudolf Fleischer, Yihui Wang |
| 2009 | Minimum Covering with Travel Cost. | Sndor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt |
| 2009 | Complexity of Approximating the Vertex Centroid of a Polyhedron. | Khaled M. Elbassioni, Hans Raj Tiwary |