| 2009 | A Complete Characterisation of the Linear Clique-Width of Path Powers. | Pinar Heggernes, Daniel Meister, Charis Papadopoulos |
| 2009 | Fixed-Parameter Algorithms for Graph-Modeled Date Clustering. | Jiong Guo |
| 2009 | Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability. | Bin Fu, Ming-Yang Kao, Lusheng Wang |
| 2009 | Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2009 | Searching Trees: An Essay. | Henning Fernau, Daniel Raible |
| 2009 | Improved Deterministic Algorithms for Weighted Matching and Packing Problems. | Qilong Feng, Yang Liu, Songjian Lu, Jianxin Wang |
| 2009 | Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. | Michael Elberfeld, Ilka Schnoor, Till Tantau |
| 2009 | Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces. | Ernst-Erich Doberkat |
| 2009 | The Extended Turing Model as Contextual Tool. | S. Barry Cooper |
| 2009 | On Parameterized Exponential Time Complexity. | Jianer Chen, Iyad A. Kanj, Ge Xia |
| 2009 | Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs. | Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng |
| 2009 | Block-Graph Width. | Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng |
| 2009 | Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms. | Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu, Guohua Wu |
| 2009 | Co-evolution and Information Signals in Biological Sequences. | Alessandra Carbone, Linda Dib |
| 2009 | A Computational Proof of Complexity of Some Restricted Counting Problems. | Jin-yi Cai, Pinyan Lu, Mingji Xia |
| 2009 | Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata. | Jasper Berendsen, Taolue Chen, David N. Jansen |
| 2009 | On the Red/Blue Spanning Tree Problem. | Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu |
| 2009 | On the Connection between Interval Size Functions and Path Counting. | Evangelos Bampas, Andreas-Nikolas Gbel, Aris Pagourtzis, Aris Tentes |
| 2009 | Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2009 | Quantitative Aspects of Speed-Up and Gap Phenomena. | Klaus Ambos-Spies, Thorsten Krling |
| 2009 | A Quadratic Kernel for 3-Set Packing. | Faisal N. Abu-Khzam |
| 2008 | Extensions of Embeddings in the Computably Enumerable Degrees. | Jitai Zhao |
| 2008 | A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable. | John Z. Zhang, Tsunehiko Kameda |
| 2008 | Symbolic Algorithm Analysis of Rectangular Hybrid Systems. | Haibin Zhang, Zhenhua Duan |
| 2008 | A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF. | Minzhu Xie, Jianxin Wang, Jianer Chen |