| 2016 | COCOA | Convex Independence in Permutation Graphs. | Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu |
| 2015 | IWOCA | Gray Codes for AT-Free Orders via Antimatroids. | Jou-Ming Chang, Ton Kloks, Hung-Lung Wang |
| 2014 | AAIM | Edge-Clique Covers of the Tensor Product. | Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Yue-Li Wang |
| 2014 | WALCOM | Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio. | Wing-Kai Hon, Ton Kloks, Ching-Hao Liu, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang |
| 2013 | AAIM | On Edge-Independent Sets. | Ton Kloks, Ching-Hao Liu, Sheung-Hung Poon |
| 2013 | AAIM | On Perfect Absorbants in De Bruijn Digraphs. | Yue-Li Wang, Kuo-Hua Wu, Ton Kloks |
| 2013 | COCOA | On Complexities of Minus Domination. | Lurbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang |
| 2013 | FCT | On Independence Domination. | Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang |
| 2013 | WALCOM | Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and | Jiawei Gao, Ton Kloks, Sheung-Hung Poon |
| 2013 | WG | On Retracts, Absolute Retracts, and Folds in Cographs. | Ton Kloks, Yue-Li Wang |
| 2012 | AAIM | The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs. | Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai, Yue-Li Wang |
| 2012 | COCOON | Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs. | Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang |
| 2011 | MFCS | New Parameterized Algorithms for the Edge Dominating Set Problem. | Mingyu Xiao, Ton Kloks, Sheung-Hung Poon |
| 2010 | CSR | Classifying Rankwidth k-DH-Graphs. | Ling-Ju Hung, Ton Kloks |
| 2010 | WALCOM | On Some Simple Widths. | Ling-Ju Hung, Ton Kloks |
| 2009 | IWOCA | Trivially-Perfect Width. | Ling-Ju Hung, Ton Kloks, Chuan-Min Lee |
| 2009 | TAMC | Block-Graph Width. | Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng |
| 2008 | COCOON | Probe Ptolemaic Graphs. | David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng |
| 2007 | AAIM | Probe Matrix Problems: Totally Balanced Matrices. | David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier |
| 2006 | AAIM | Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs. | David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng |
| 2006 | WG | Partitioned Probe Comparability Graphs. | David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng |
| 2005 | COCOON | On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs. | Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng |
| 2005 | STACS | The PIGs Full Monty - A Floor Show of Minimal Separators. | Gerard Jennhwa Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng |
| 2005 | WG | Roman Domination over Some Graph Classes. | Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng |
| 2003 | WG | On the Recognition of General Partition Graphs. | Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Mller |
| 2002 | WG | New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs. | Ton Kloks, Chuan-Min Lee, Jiping Liu |
| 2001 | WG | Maximum Clique Transversals. | Maw-Shang Chang, Ton Kloks, Chuan-Min Lee |
| 2000 | STACS | lambda-Coloring of Graphs. | Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen |
| 2000 | WG | Bandwidth of Split and Circular Permutation Graphs. | Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Mller |
| 1999 | STACS | New Branchwidth Territories. | Ton Kloks, Jan Kratochvl, Haiko Mller |
| 1999 | WG | Fixed-Parameter Complexity of lambda-Labelings. | Jir Fiala, Ton Kloks, Jan Kratochvl |
| 1998 | MFCS | Degree-Preserving Forests. | Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Mller, Hilde Tuinstra |
| 1998 | WG | A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1997 | ICALP | Independent Sets in Asteroidal Triple-Free Graphs. | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1997 | WG | Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. | Hajo Broersma, Elias Dahlhaus, Ton Kloks |
| 1997 | WG | Asteroidal Sets in Graphs. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1996 | ICALP | Minimum Fill-In on Circle and Circular-Arc Graphs. | Ton Kloks, Dieter Kratsch, C. K. Wong |
| 1996 | ISAAC | Vertex Ranking of Asteroidal Triple-Free Graphs. | Ton Kloks, Haiko Mller, C. K. Wong |
| 1996 | MFCS | Shortest Path Problems with Time Constraints. | X. Cai, Ton Kloks, C. K. Wong |
| 1995 | ESA | Approximating the Bandwidth for Asteroidal Triple-Free Graphs. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1995 | WG | Finding and Counting Small Induced Subgraphs Efficiently. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1994 | ESA | Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. | Ton Kloks, Hans L. Bodlaender, Haiko Mller, Dieter Kratsch |
| 1994 | STACS | On Vertex Ranking for Permutations and Other Graphs. | Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1994 | STACS | Finding All Minimal Separators of a Graph. | Ton Kloks, Dieter Kratsch |
| 1994 | WG | Ranking of Graphs. | Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Mller, Zsolt Tuza |
| 1994 | WG | Dominoes. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1993 | ESA | Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. | Ton Kloks, Hans L. Bodlaender, Haiko Mller, Dieter Kratsch |
| 1993 | ICALP | Treewidth and Pathwidth of Permutation Graphs. | Hans L. Bodlaender, Ton Kloks, Dieter Kratsch |
| 1993 | ISAAC | Treewidth of Circle Graphs. | Ton Kloks |
| 1993 | STACS | Treewidth of Bipartite Graphs. | Ton Kloks, Dieter Kratsch |
| 1992 | ISAAC | Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. | Ton Kloks, Hans L. Bodlaender |
| 1992 | STACS | A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. | Hans L. Bodlaender, Ton Kloks |
| 1991 | DCC | Complexity Aspects of Map Compression. | Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks |
| 1991 | ICALP | Better Algorithms for the Pathwidth and Treewidth of Graphs. | Hans L. Bodlaender, Ton Kloks |
| 1991 | WG | Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. | Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjlmtyr Hafsteinsson |