A Class of Graphs Containing the Polar Spaces. - Aart Blokhuis; Ton Kloks; Henny A. Wilbrink (Eur. J. Comb., 1986)

An infinite sequence of GammaDelta-regular graphs. - Ton Kloks (Discret. Math., 1989)

Complexity Aspects of Map Compression. - Hans L. Bodlaender; Teofilo F. Gonzalez; Ton Kloks (Data Compression Conference, 1991)

Better Algorithms for the Pathwidth and Treewidth of Graphs. - Hans L. Bodlaender; Ton Kloks (ICALP, 1991)

Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. - Hans L. Bodlaender; John R. Gilbert; Ton Kloks; Hjálmtyr Hafsteinsson (WG, 1991)

Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. - Ton Kloks; Hans L. Bodlaender (ISAAC, 1992)

Testing Superperfection of k-Trees. - Ton Kloks; Hans L. Bodlaender (SWAT, 1992)

Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. - Ton Kloks; Hans L. Bodlaender; Haiko Müller; Dieter Kratsch (ESA, 1993)

Treewidth of Bipartite Graphs. - Ton Kloks; Dieter Kratsch (STACS, 1993)

A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. - Hans L. Bodlaender; Ton Kloks (J. Algorithms, 1993)

Treewidth, Computations and Approximations - Ton Kloks (Springer, 1994)

Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. - Ton Kloks; Hans L. Bodlaender; Haiko Müller; Dieter Kratsch (ESA, 1994)

On Vertex Ranking for Permutations and Other Graphs. - Jitender S. Deogun; Ton Kloks; Dieter Kratsch; Haiko Müller (STACS, 1994)

Finding All Minimal Separators of a Graph. - Ton Kloks; Dieter Kratsch (STACS, 1994)

Ranking of Graphs. - Hans L. Bodlaender; Jitender S. Deogun; Klaus Jansen; Ton Kloks; Dieter Kratsch; Haiko Müller; Zsolt Tuza (WG, 1994)

Dominoes. - Ton Kloks; Dieter Kratsch; Haiko Müller (WG, 1994)

On the Equivalence Covering Number of Splitgraphs. - Aart Blokhuis; Ton Kloks (Inf. Process. Lett., 1995)

Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph. - Ton Kloks; Dieter Kratsch (Inf. Process. Lett., 1995)

Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. - Hans L. Bodlaender; John R. Gilbert; Hjálmtyr Hafsteinsson; Ton Kloks (J. Algorithms, 1995)

Treewidth of Chordal Bipartite Graphs. - Ton Kloks; Dieter Kratsch (J. Algorithms, 1995)

Complexity Aspects of Two-Dimensional Data Compression. - Hans L. Bodlaender; Teofilo F. Gonzalez; Ton Kloks (Nord. J. Comput., 1995)

Treewidth and Pathwidth of Permutation Graphs. - Hans L. Bodlaender; Ton Kloks; Dieter Kratsch (SIAM J. Discret. Math., 1995)

Shortest Path Problems with Time Constraints. - X. Cai; Ton Kloks; C. K. Wong (MFCS, 1996)

Treewidth of Circle Graphs. - Ton Kloks (Int. J. Found. Comput. Sci., 1996)

K_1, 3-Free and W_4-Free Graphs. - Ton Kloks (Inf. Process. Lett., 1996)

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs. - Hans L. Bodlaender; Ton Kloks (J. Algorithms, 1996)

Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. - Hajo Broersma; Elias Dahlhaus; Ton Kloks (WG, 1997)

Asteroidal Sets in Graphs. - Ton Kloks; Dieter Kratsch; Haiko Müller (WG, 1997)

Measuring the Vulnerability for Classes of Intersection Graphs. - Dieter Kratsch; Ton Kloks; Haiko Müller (Discret. Appl. Math., 1997)

Time-varying shortest path problems with constraints. - X. Cai; Ton Kloks; C. K. Wong (Networks, 1997)

On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. - Ton Kloks; Dieter Kratsch; Jeremy P. Spinrad (Theor. Comput. Sci., 1997)

Degree-Preserving Forests. - Hajo Broersma; Andreas Huck; Ton Kloks; Otto R. Koppius; Dieter Kratsch; Haiko Müller; Hilde Tuinstra (MFCS, 1998)

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 Müller (WG, 1998)

Bandwidth of Chain Graphs. - Ton Kloks; Dieter Kratsch; Haiko Müller (Inf. Process. Lett., 1998)

Vertex Ranking of Asteroidal Triple-Free Graphs. - Ton Kloks; Haiko Müller; C. K. Wong (Inf. Process. Lett., 1998)

Minimum Fill-in on Circle and Circular-Arc Graphs. - Ton Kloks; Dieter Kratsch; C. K. Wong (J. Algorithms, 1998)

Treewidth and Minimum Fill-in on d-Trapezoid Graphs. - Hans L. Bodlaender; Ton Kloks; Dieter Kratsch; Haiko Müller (J. Graph Algorithms Appl., 1998)

Listing All Minimal Separators of a Graph. - Ton Kloks; Dieter Kratsch (SIAM J. Comput., 1998)

Rankings of Graphs. - Hans L. Bodlaender; Jitender S. Deogun; Klaus Jansen; Ton Kloks; Dieter Kratsch; Haiko Müller; Zsolt Tuza (SIAM J. Discret. Math., 1998)

New Branchwidth Territories. - Ton Kloks; Jan Kratochvíl; Haiko Müller (STACS, 1999)

On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. - Jitender S. Deogun; Ton Kloks; Dieter Kratsch; Haiko Müller (Discret. Appl. Math., 1999)

SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s. - Hans L. Bodlaender; Ton Kloks; Rolf Niedermeier (Electron. Notes Discret. Math., 1999)

On the structure of graphs with bounded asteroidal number. - Ton Kloks; Dieter Kratsch; Haiko Müller (Electron. Notes Discret. Math., 1999)

Approximating the Bandwidth for Asteroidal Triple-Free Graphs. - Ton Kloks; Dieter Kratsch; Haiko Müller (J. Algorithms, 1999)

Independent Sets in Asteroidal Triple-Free Graphs. - Hajo Broersma; Ton Kloks; Dieter Kratsch; Haiko Müller (SIAM J. Discret. Math., 1999)

lambda-Coloring of Graphs. - Hans L. Bodlaender; Ton Kloks; Richard B. Tan; Jan van Leeuwen (STACS, 2000)

Bandwidth of Split and Circular Permutation Graphs. - Ton Kloks; Dieter Kratsch; Yvan Le Borgne; Haiko Müller (WG, 2000)

A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. - Hajo Broersma; Elias Dahlhaus; Ton Kloks (Discret. Appl. Math., 2000)

Finding and counting small induced subgraphs efficiently. - Ton Kloks; Dieter Kratsch; Haiko Müller (Inf. Process. Lett., 2000)

Degree-preserving trees. - Hajo Broersma; Otto R. Koppius; Hilde Tuinstra; Andreas Huck; Ton Kloks; Dieter Kratsch; Haiko Müller (Networks, 2000)

Maximum Clique Transversals. - Maw-Shang Chang; Ton Kloks; Chuan-Min Lee (WG, 2001)

Fixed-parameter complexity of lambda-labelings. - Jirí Fiala 001; Ton Kloks; Jan Kratochvíl (Discret. Appl. Math., 2001)

Bandwidth and topological bandwidth of graphs with few P4's. - Ton Kloks; Richard B. Tan (Discret. Appl. Math., 2001)

Efficient algorithms for graphs with few P4's. - Luitpold Babel; Ton Kloks; Jan Kratochvíl; Dieter Kratsch; Haiko Müller; Stephan Olariu (Discret. Math., 2001)

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 (WG, 2002)

Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. - Jochen Alber; Hans L. Bodlaender; Henning Fernau; Ton Kloks; Rolf Niedermeier (Algorithmica, 2002)

A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. - Hajo Broersma; Ton Kloks; Dieter Kratsch; Haiko Müller (Algorithmica, 2002)

On the Recognition of General Partition Graphs. - Ton Kloks; Chuan-Min Lee; Jiping Liu; Haiko Müller (WG, 2003)

Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. - Hans L. Bodlaender; Celina M. H. de Figueiredo; Marisa Gutierrez; Ton Kloks; Rolf Niedermeier (WEA, 2004)

Approximations for lambda-Colorings of Graphs. - Hans L. Bodlaender; Ton Kloks; Richard B. Tan; Jan van Leeuwen (Comput. J., 2004)

Stickiness, Edge-Thickness, and Clique-Thickness in Graphs. - Ton Kloks; Chuan-Min Lee; Jiping Liu (J. Inf. Sci. Eng., 2004)

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 (COCOON, 2005)

The PIGs Full Monty - A Floor Show of Minimal Separators. - Gerard Jennhwa Chang; Ton Kloks; Jiping Liu; Sheng-Lung Peng (STACS, 2005)

Roman Domination over Some Graph Classes. - Mathieu Liedloff; Ton Kloks; Jiping Liu; Sheng-Lung Peng (WG, 2005)

Computing the branchwidth of interval graphs. - Ton Kloks; Jan Kratochvíl; Haiko Müller (Discret. Appl. Math., 2005)

Probe interval bigraphs. - Gerard Jennhwa Chang; Ton Kloks; Sheng-Lung Peng (Electron. Notes Discret. Math., 2005)

Kernels in planar digraphs. - Gregory Z. Gutin; Ton Kloks; Chuan-Min Lee; Anders Yeo (J. Comput. Syst. Sci., 2005)

Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs. - David B. Chandler; Maw-Shang Chang; Ton Kloks; Jiping Liu; Sheng-Lung Peng (AAIM, 2006)

The Maximum Interval Graphs on Distance Hereditary Graphs. - Sheng-Lung Peng; Ton Kloks; Chuan-Min Lee (JCIS, 2006)

Improved bottleneck domination algorithms. - Ton Kloks; Dieter Kratsch; Chuan-Min Lee; Jiping Liu (Discret. Appl. Math., 2006)

Probe Matrix Problems: Totally Balanced Matrices. - David B. Chandler; Jiong Guo; Ton Kloks; Rolf Niedermeier (AAIM, 2007)

Probe Ptolemaic Graphs. - David B. Chandler; Maw-Shang Chang; Ton Kloks; Van Bang Le; Sheng-Lung Peng (COCOON, 2008)

Efficient algorithms for Roman domination on some classes of graphs. - Mathieu Liedloff; Ton Kloks; Jiping Liu; Sheng-Lung Peng (Discret. Appl. Math., 2008)

Partitioned probe comparability graphs. - David B. Chandler; Maw-Shang Chang; Ton Kloks; Jiping Liu; Sheng-Lung Peng (Theor. Comput. Sci., 2008)

Trivially-Perfect Width. - Ling-Ju Hung; Ton Kloks; Chuan-Min Lee (IWOCA, 2009)

On probe permutation graphs. - David B. Chandler; Maw-Shang Chang; Ton Kloks; Jiping Liu; Sheng-Lung Peng (Discret. Appl. Math., 2009)

Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. - Ton Kloks; Haiko Müller; Kristina Vuskovic (J. Comb. Theory B, 2009)

Kruskalian Graphs. - Ling-Ju Hung; Ton Kloks (CATS, 2010)

Classifying Rankwidth k-DH-Graphs. - Ling-Ju Hung; Ton Kloks (CSR, 2010)

On Some Simple Widths. - Ling-Ju Hung; Ton Kloks (WALCOM, 2010)

Black-and-White Threshold Graphs. - Ling-Ju Hung; Ton Kloks; Fernando Sánchez Villaamil (CATS, 2011)

k-Cographs are Kruskalian. - Ling-Ju Hung; Ton Kloks (Chic. J. Theor. Comput. Sci., 2011)

New parameterized algorithms for edge dominating set - Mingyu Xiao 001; Ton Kloks; Sheung-Hung Poon (CoRR, 2011)

A linear-time algorithm for the strong chromatic index of Halin graphs - Ton Kloks; Yue-Li Wang (CoRR, 2011)

On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs - Ton Kloks; Chin-Ting Ung; Yue-Li Wang (CoRR, 2011)

On the threshold-width of graphs. - Maw-Shang Chang; Ling-Ju Hung; Ton Kloks; Sheng-Lung Peng (J. Graph Algorithms Appl., 2011)

Block-graph width. - Maw-Shang Chang; Ling-Ju Hung; Ton Kloks; Sheng-Lung Peng (Theor. Comput. Sci., 2011)

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 (FAW-AAIM, 2012)

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 (COCOON, 2012)

The black-and-white coloring problem on permutation graphs - Ton Kloks (CoRR, 2012)

A note on probe cographs - Ton Kloks (CoRR, 2012)

Packing interval graphs with vertex-disjoint triangles - Ton Kloks (CoRR, 2012)

A note on triangle partitions - Ton Kloks (CoRR, 2012)

Edge-clique graphs of cocktail parties have unbounded rankwidth - Maw-Shang Chang; Ton Kloks; Ching-Hao Liu (CoRR, 2012)

Independent sets in edge-clique graphs - Maw-Shang Chang; Ton Kloks; Ching-Hao Liu (CoRR, 2012)

Independent sets in edge-clique graphs II - Ching-Hao Liu; Maw-Shang Chang; Ton Kloks; Sheung-Hung Poon (CoRR, 2012)

A note on "Folding wheels and fans." - Ton Kloks; Yue-Li Wang (CoRR, 2012)

On Edge-Independent Sets. - Ton Kloks; Ching-Hao Liu; Sheung-Hung Poon (FAW-AAIM, 2013)

On Perfect Absorbants in De Bruijn Digraphs. - Yue-Li Wang; Kuo-Hua Wu; Ton Kloks (FAW-AAIM, 2013)

On Independence Domination. - Wing-Kai Hon; Ton Kloks; Hsiang-Hsuan Liu 001; Sheung-Hung Poon; Yue-Li Wang (FCT, 2013)

Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs. - Jiawei Gao 001; Ton Kloks; Sheung-Hung Poon (WALCOM, 2013)

On Retracts, Absolute Retracts, and Folds in Cographs. - Ton Kloks; Yue-Li Wang (WG, 2013)

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; Hsiang-Hsuan Liu 001; Sheung-Hung Poon; Yue-Li Wang (CoRR, 2013)

On retracts and folds in cographs - Ton Kloks; Yue-Li Wang (CoRR, 2013)

Independent set in categorical products of cographs and splitgraphs - Wing-Kai Hon; Ton Kloks; Hsiang-Hsuan Liu 001; Sheung-Hung Poon; Yue-Li Wang (CoRR, 2013)

New parameterized algorithms for the edge dominating set problem. - Mingyu Xiao 001; Ton Kloks; Sheung-Hung Poon (Theor. Comput. Sci., 2013)

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 001; Sheung-Hung Poon; Yue-Li Wang (WALCOM, 2014)

On the complexity of the black-and-white coloring problem on some classes of perfect graphs. - Ton Kloks; Sheung-Hung Poon; Feng-Ren Tsai; Yue-Li Wang (Theor. Comput. Sci., 2014)

Gray Codes for AT-Free Orders via Antimatroids. - Jou-Ming Chang; Ton Kloks; Hung-Lung Wang (IWOCA, 2015)

Rainbow Domination and Related Problems on Some Classes of Perfect Graphs. - Wing-Kai Hon; Ton Kloks; Hsiang-Hsuan Liu 001; Hung-Lung Wang (TTCS, 2015)

Flood-it on AT-Free Graphs. - Wing-Kai Hon; Ton Kloks; Fu-Hong Liu; Hsiang-Hsuan Liu 001; Hung-Lung Wang (CoRR, 2015)

Convexities in Some Special Graph Classes - New Results in AT-free Graphs and Beyond. - Wing-Kai Hon; Ton Kloks; Hsiang-Hsuan Liu 001; Hung-Lung Wang; Yue-Li Wang (CoRR, 2015)

On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs. - Ton Kloks; Sheung-Hung Poon; Chin-Ting Ung; Yue-Li Wang (J. Discrete Algorithms, 2015)

On maximum independent set of categorical product and ultimate categorical ratios of graphs. - Wing-Kai Hon; Ton Kloks; Ching-Hao Liu; Hsiang-Hsuan Liu 001; Sheung-Hung Poon; Yue-Li Wang (Theor. Comput. Sci., 2015)

Edge-clique covers of the tensor product. - Wing-Kai Hon; Ton Kloks; Hsiang-Hsuan Liu 001; Yue-Li Wang (Theor. Comput. Sci., 2015)

On the P3-convexity of some classes of graphs with few P4s and permutation graphs. - Wing-Kai Hon; Ton Kloks; Hsiang-Hsuan Liu 001 (ACSW, 2016)

Convex Independence in Permutation Graphs. - Wing-Kai Hon; Ton Kloks; Fu-Hong Liu; Hsiang-Hsuan Liu 001 (COCOA, 2016)

P_3-Games. - Wing-Kai Hon; Ton Kloks; Fu-Hong Liu; Hsiang-Hsuan Liu 001; Tao-Ming Wang (CoRR, 2016)

P_3-Games on Chordal Bipartite Graphs. - Wing-Kai Hon; Ton Kloks; Fu-Hong Liu; Hsiang-Hsuan Liu 001; Tao-Ming Wang; Yue-Li Wang (CoRR, 2016)

On complexities of minus domination. - Luérbio Faria; Wing-Kai Hon; Ton Kloks; Hsiang-Hsuan Liu 001; Tao-Ming Wang; Yue-Li Wang (Discret. Optim., 2016)

On the Grundy number of Cameron graphs. - Wing-Kai Hon; Ton Kloks; Fu-Hong Liu; Hsiang-Hsuan Liu 001; Tao-Ming Wang (Electron. Notes Discret. Math., 2017)

On efficient absorbant conjecture in generalized De Bruijn digraphs. - Kuo-Hua Wu; Yue-Li Wang; Ton Kloks (Int. J. Comput. Math., 2017)

On retracts, absolute retracts, and foldings in cographs. - Ton Kloks; Yue-Li Wang (Optim. Lett., 2018)

Semitotal Domination on AT-Free Graphs and Circle Graphs. - Ton Kloks; Arti Pandey (CALDAM, 2021)

A note on the geodetic number and the Steiner number of AT-free graphs. - Wing-Kai Hon; Ton Kloks; Hsiang-Hsuan Liu 001; Hung-Lung Wang; Yue-Li Wang (Theor. Comput. Sci., 2021)

A Guide to Graph Algorithms - Ton Kloks; Mingyu Xiao 001 (Springer, 2022)

Complexity of paired domination in AT-free and planar graphs. - Vikash Tripathi; Ton Kloks; Arti Pandey; Kaustav Paul; Hung-Lung Wang (Theor. Comput. Sci., 2022)