Ton Kloks

153 papers A* 4A 10B 26C 8Misc 4Journal 87Unranked 12
YearRankTypeTitle / Venue / Authors
2022 — book
A Guide to Graph Algorithms
Ton Kloks, Mingyu Xiao
2022 — conf
Complexity of Paired Domination in AT-free and Planar Graphs.
CALDAM
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
2022 J jnl
Complexity of paired domination in AT-free and planar graphs.
Theor. Comput. Sci.
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
2021 J jnl
A note on the geodetic number and the Steiner number of AT-free graphs.
Theor. Comput. Sci.
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang, Yue-Li Wang
2021 J jnl
Complexity of Paired Domination in AT-free and Planar Graphs.
CoRR
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
2021 — conf
Semitotal Domination on AT-Free Graphs and Circle Graphs.
CALDAM
Ton Kloks, Arti Pandey
2018 J jnl
On retracts, absolute retracts, and foldings in cographs.
Optim. Lett.
Ton Kloks, Yue-Li Wang
2017 J jnl
On efficient absorbant conjecture in generalized De Bruijn digraphs.
Int. J. Comput. Math.
Kuo-Hua Wu, Yue-Li Wang, Ton Kloks
2017 J jnl
On the Grundy number of Cameron graphs.
Electron. Notes Discret. Math.
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang
2016 C conf
Convex Independence in Permutation Graphs.
COCOA
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu
2016 J jnl
Convex Independence in Permutation Graphs.
CoRR
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu
2016 J jnl
On complexities of minus domination.
Discret. Optim.
Luérbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang
2016 — conf
On the
ACSW
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu
2016 J jnl
On the Grundy number of Cameron graphs.
CoRR
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang
2016 J jnl
P_3-Games on Chordal Bipartite Graphs.
CoRR
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang
2016 J jnl
P_3-Games.
CoRR
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang
2015 J jnl
Convexities in Some Special Graph Classes - New Results in AT-free Graphs and Beyond.
CoRR
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang, Yue-Li Wang
2015 J jnl
Edge-clique covers of the tensor product.
Theor. Comput. Sci.
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Yue-Li Wang
2015 J jnl
Flood-it on AT-Free Graphs.
CoRR
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Hung-Lung Wang
2015 C conf
Gray Codes for AT-Free Orders via Antimatroids.
IWOCA
Jou-Ming Chang, Ton Kloks, Hung-Lung Wang
2015 J jnl
On maximum independent set of categorical product and ultimate categorical ratios of graphs.
Theor. Comput. Sci.
Wing-Kai Hon, Ton Kloks, Ching-Hao Liu, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang
2015 J jnl
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs.
J. Discrete Algorithms
Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang
2015 — conf
Rainbow Domination and Related Problems on Some Classes of Perfect Graphs.
TTCS
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang
2015 J jnl
Rainbow domination and related problems on some classes of perfect graphs.
CoRR
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang
2014 C conf
Edge-Clique Covers of the Tensor Product.
AAIM
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Yue-Li Wang
2014 J jnl
On the complexity of the black-and-white coloring problem on some classes of perfect graphs.
Theor. Comput. Sci.
Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai, Yue-Li Wang
2014 B conf
Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio.
WALCOM
Wing-Kai Hon, Ton Kloks, Ching-Hao Liu, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang
2013 J jnl
Independent set in categorical products of cographs and splitgraphs
CoRR
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang
2013 J jnl
New parameterized algorithms for the edge dominating set problem.
Theor. Comput. Sci.
Mingyu Xiao, Ton Kloks, Sheung-Hung Poon
2013 C conf
On Complexities of Minus Domination.
COCOA
Luérbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang
2013 J jnl
On Complexities of Minus Domination.
CoRR
Luérbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang
2013 — conf
On Edge-Independent Sets.
FAW-AAIM
Ton Kloks, Ching-Hao Liu, Sheung-Hung Poon
2013 B conf
On Independence Domination.
FCT
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang
2013 — conf
On Perfect Absorbants in De Bruijn Digraphs.
FAW-AAIM
Yue-Li Wang, Kuo-Hua Wu, Ton Kloks
2013 B conf
On Retracts, Absolute Retracts, and Folds in Cographs.
WG
Ton Kloks, Yue-Li Wang
2013 J jnl
On independence domination
CoRR
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang
2013 J jnl
On retracts and folds in cographs
CoRR
Ton Kloks, Yue-Li Wang
2013 J jnl
Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio.
CoRR
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang
2013 B conf
Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and
WALCOM
Jiawei Gao, Ton Kloks, Sheung-Hung Poon
2012 J jnl
A note on "Folding wheels and fans."
CoRR
Ton Kloks, Yue-Li Wang
2012 J jnl
A note on probe cographs
CoRR
Ton Kloks
2012 J jnl
A note on triangle partitions
CoRR
Ton Kloks
2012 Misc conf
Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs.
COCOON
Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang
2012 J jnl
Edge-clique graphs of cocktail parties have unbounded rankwidth
CoRR
Maw-Shang Chang, Ton Kloks, Ching-Hao Liu
2012 J jnl
Independent sets in edge-clique graphs
CoRR
Maw-Shang Chang, Ton Kloks, Ching-Hao Liu
2012 J jnl
Independent sets in edge-clique graphs II
CoRR
Ching-Hao Liu, Maw-Shang Chang, Ton Kloks, Sheung-Hung Poon
2012 J jnl
On the threshold-width of graphs
CoRR
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
2012 J jnl
Packing interval graphs with vertex-disjoint triangles
CoRR
Ton Kloks
2012 — conf
The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs.
FAW-AAIM
Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai, Yue-Li Wang
2012 J jnl
The black-and-white coloring problem on permutation graphs
CoRR
Ton Kloks
2011 J jnl
A linear-time algorithm for the strong chromatic index of Halin graphs
CoRR
Ton Kloks, Yue-Li Wang
2011 J jnl
Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs
CoRR
Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang
2011 — conf
Black-and-White Threshold Graphs.
CATS
Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil
2011 J jnl
Black-and-white threshold graphs.
CoRR
Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil
2011 J jnl
Block-graph width.
Theor. Comput. Sci.
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
2011 B conf
New Parameterized Algorithms for the Edge Dominating Set Problem.
MFCS
Mingyu Xiao, Ton Kloks, Sheung-Hung Poon
2011 J jnl
New parameterized algorithms for edge dominating set
CoRR
Mingyu Xiao, Ton Kloks, Sheung-Hung Poon
2011 J jnl
On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs
CoRR
Ton Kloks, Chin-Ting Ung, Yue-Li Wang
2011 J jnl
On the threshold-width of graphs.
J. Graph Algorithms Appl.
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
2011 J jnl
The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs
CoRR
Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai, Yue-Li Wang
2011 J jnl
k-Cographs are Kruskalian.
Chic. J. Theor. Comput. Sci.
Ling-Ju Hung, Ton Kloks
2010 Misc conf
Classifying Rankwidth k-DH-Graphs.
CSR
Ling-Ju Hung, Ton Kloks
2010 — conf
Kruskalian Graphs.
CATS
Ling-Ju Hung, Ton Kloks
2010 B conf
On Some Simple Widths.
WALCOM
Ling-Ju Hung, Ton Kloks
2009 C conf
Block-Graph Width.
TAMC
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
2009 J jnl
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences.
J. Comb. Theory B
Ton Kloks, Haiko Müller, Kristina Vuskovic
2009 J jnl
On probe permutation graphs.
Discret. Appl. Math.
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
2009 C conf
Trivially-Perfect Width.
IWOCA
Ling-Ju Hung, Ton Kloks, Chuan-Min Lee
2008 J jnl
Efficient algorithms for Roman domination on some classes of graphs.
Discret. Appl. Math.
Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng
2008 J jnl
Partitioned probe comparability graphs.
Theor. Comput. Sci.
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
2008 Misc conf
Probe Ptolemaic Graphs.
COCOON
David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng
2007 C conf
Probe Matrix Problems: Totally Balanced Matrices.
AAIM
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier
2006 J jnl
Improved bottleneck domination algorithms.
Discret. Appl. Math.
Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu
2006 B conf
Partitioned Probe Comparability Graphs.
WG
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
2006 C conf
Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs.
AAIM
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
2006 — conf
The Maximum Interval Graphs on Distance Hereditary Graphs.
JCIS
Sheng-Lung Peng, Ton Kloks, Chuan-Min Lee
2005 J jnl
Computing the branchwidth of interval graphs.
Discret. Appl. Math.
Ton Kloks, Jan Kratochvíl, Haiko Müller
2005 J jnl
Kernels in planar digraphs.
J. Comput. Syst. Sci.
Gregory Z. Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo
2005 Misc conf
On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs.
COCOON
Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng
2005 J jnl
Probe interval bigraphs.
Electron. Notes Discret. Math.
Gerard Jennhwa Chang, Ton Kloks, Sheng-Lung Peng
2005 B conf
Roman Domination over Some Graph Classes.
WG
Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng
2005 A conf
The PIGs Full Monty - A Floor Show of Minimal Separators.
STACS
Gerard Jennhwa Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
2004 J jnl
Approximations for lambda-Colorings of Graphs.
Comput. J.
Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
2004 — conf
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P
WEA
Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier
2004 J jnl
Stickiness, Edge-Thickness, and Clique-Thickness in Graphs.
J. Inf. Sci. Eng.
Ton Kloks, Chuan-Min Lee, Jiping Liu
2003 B conf
On the Recognition of General Partition Graphs.
WG
Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller
2002 J jnl
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems.
Algorithmica
Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
2002 J jnl
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs.
Algorithmica
Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier
2002 B conf
New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs.
WG
Ton Kloks, Chuan-Min Lee, Jiping Liu
2001 J jnl
Bandwidth and topological bandwidth of graphs with few P4's.
Discret. Appl. Math.
Ton Kloks, Richard B. Tan
2001 J jnl
Efficient algorithms for graphs with few
Discret. Math.
Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
2001 J jnl
Fixed-parameter complexity of lambda-labelings.
Discret. Appl. Math.
Jirí Fiala, Ton Kloks, Jan Kratochvíl
2001 B conf
Maximum Clique Transversals.
WG
Maw-Shang Chang, Ton Kloks, Chuan-Min Lee
2001 J jnl
On the Structure of Graphs with Bounded Asteroidal Number.
Graphs Comb.
Ton Kloks, Dieter Kratsch, Haiko Müller
2000 J jnl
A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs.
Discret. Appl. Math.
Hajo Broersma, Elias Dahlhaus, Ton Kloks
2000 B conf
Bandwidth of Split and Circular Permutation Graphs.
WG
Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller
2000 J jnl
Degree-preserving trees.
Networks
Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller
2000 J jnl
Finding and counting small induced subgraphs efficiently.
Inf. Process. Lett.
Ton Kloks, Dieter Kratsch, Haiko Müller
2000 A conf
lambda-Coloring of Graphs.
STACS
Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
1999 J jnl
Approximating the Bandwidth for Asteroidal Triple-Free Graphs.
J. Algorithms
Ton Kloks, Dieter Kratsch, Haiko Müller
1999 B conf
Fixed-Parameter Complexity of lambda-Labelings.
WG
Jirí Fiala, Ton Kloks, Jan Kratochvíl
1999 J jnl
Independent Sets in Asteroidal Triple-Free Graphs.
SIAM J. Discret. Math.
Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
1999 A conf
New Branchwidth Territories.
STACS
Ton Kloks, Jan Kratochvíl, Haiko Müller
1999 J jnl
On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs.
Discret. Appl. Math.
Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
1999 J jnl
On the structure of graphs with bounded asteroidal number.
Electron. Notes Discret. Math.
Ton Kloks, Dieter Kratsch, Haiko Müller
1999 J jnl
SIMPLE MAX-CUT for unit interval graphs and graphs with few P
Electron. Notes Discret. Math.
Hans L. Bodlaender, Ton Kloks, Rolf Niedermeier
1998 B conf
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.
WG
Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
1998 J jnl
Bandwidth of Chain Graphs.
Inf. Process. Lett.
Ton Kloks, Dieter Kratsch, Haiko Müller
1998 B conf
Degree-Preserving Forests.
MFCS
Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra
1998 J jnl
Listing All Minimal Separators of a Graph.
SIAM J. Comput.
Ton Kloks, Dieter Kratsch
1998 J jnl
Minimum Fill-in on Circle and Circular-Arc Graphs.
J. Algorithms
Ton Kloks, Dieter Kratsch, C. K. Wong
1998 J jnl
Rankings of Graphs.
SIAM J. Discret. Math.
Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
1998 J jnl
Treewidth and Minimum Fill-in on d-Trapezoid Graphs.
J. Graph Algorithms Appl.
Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller
1998 J jnl
Vertex Ranking of Asteroidal Triple-Free Graphs.
Inf. Process. Lett.
Ton Kloks, Haiko Müller, C. K. Wong
1997 B conf
Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.
WG
Hajo Broersma, Elias Dahlhaus, Ton Kloks
1997 B conf
Asteroidal Sets in Graphs.
WG
Ton Kloks, Dieter Kratsch, Haiko Müller
1997 A* conf
Independent Sets in Asteroidal Triple-Free Graphs.
ICALP
Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
1997 J jnl
Measuring the Vulnerability for Classes of Intersection Graphs.
Discret. Appl. Math.
Dieter Kratsch, Ton Kloks, Haiko Müller
1997 J jnl
On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs.
Theor. Comput. Sci.
Ton Kloks, Dieter Kratsch, Jeremy P. Spinrad
1997 J jnl
Time-varying shortest path problems with constraints.
Networks
X. Cai, Ton Kloks, C. K. Wong
1996 J jnl
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs.
J. Algorithms
Hans L. Bodlaender, Ton Kloks
1996 J jnl
K_1, 3-Free and W_4-Free Graphs.
Inf. Process. Lett.
Ton Kloks
1996 A* conf
Minimum Fill-In on Circle and Circular-Arc Graphs.
ICALP
Ton Kloks, Dieter Kratsch, C. K. Wong
1996 B conf
Shortest Path Problems with Time Constraints.
MFCS
X. Cai, Ton Kloks, C. K. Wong
1996 J jnl
Treewidth of Circle Graphs.
Int. J. Found. Comput. Sci.
Ton Kloks
1996 B conf
Vertex Ranking of Asteroidal Triple-Free Graphs.
ISAAC
Ton Kloks, Haiko Müller, C. K. Wong
1995 J jnl
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree.
J. Algorithms
Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks
1995 A conf
Approximating the Bandwidth for Asteroidal Triple-Free Graphs.
ESA
Ton Kloks, Dieter Kratsch, Haiko Müller
1995 J jnl
Complexity Aspects of Two-Dimensional Data Compression.
Nord. J. Comput.
Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
1995 J jnl
Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph.
Inf. Process. Lett.
Ton Kloks, Dieter Kratsch
1995 B conf
Finding and Counting Small Induced Subgraphs Efficiently.
WG
Ton Kloks, Dieter Kratsch, Haiko Müller
1995 J jnl
On the Equivalence Covering Number of Splitgraphs.
Inf. Process. Lett.
Aart Blokhuis, Ton Kloks
1995 J jnl
Treewidth and Pathwidth of Permutation Graphs.
SIAM J. Discret. Math.
Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
1995 J jnl
Treewidth of Chordal Bipartite Graphs.
J. Algorithms
Ton Kloks, Dieter Kratsch
1994 B conf
Dominoes.
WG
Ton Kloks, Dieter Kratsch, Haiko Müller
1994 A conf
Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators.
ESA
Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
1994 A conf
Finding All Minimal Separators of a Graph.
STACS
Ton Kloks, Dieter Kratsch
1994 A conf
On Vertex Ranking for Permutations and Other Graphs.
STACS
Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
1994 B conf
Ranking of Graphs.
WG
Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
1994 — book
Treewidth, Computations and Approximations
Ton Kloks
1993 J jnl
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs.
J. Algorithms
Hans L. Bodlaender, Ton Kloks
1993 A conf
Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators.
ESA
Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
1993 A* conf
Treewidth and Pathwidth of Permutation Graphs.
ICALP
Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
1993 A conf
Treewidth of Bipartite Graphs.
STACS
Ton Kloks, Dieter Kratsch
1993 B conf
Treewidth of Circle Graphs.
ISAAC
Ton Kloks
1992 A conf
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs.
STACS
Hans L. Bodlaender, Ton Kloks
1992 B conf
Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs.
ISAAC
Ton Kloks, Hans L. Bodlaender
1992 — conf
Testing Superperfection of k-Trees.
SWAT
Ton Kloks, Hans L. Bodlaender
1991 B conf
Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height.
WG
Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson
1991 A* conf
Better Algorithms for the Pathwidth and Treewidth of Graphs.
ICALP
Hans L. Bodlaender, Ton Kloks
1991 B conf
Complexity Aspects of Map Compression.
Data Compression Conference
Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
1989 J jnl
An infinite sequence of GammaDelta-regular graphs.
Discret. Math.
Ton Kloks
1986 J jnl
A Class of Graphs Containing the Polar Spaces.
Eur. J. Comb.
Aart Blokhuis, Ton Kloks, Henny A. Wilbrink