Ton Kloks

According to our database, Ton Kloks authored at least 127 papers between 1986 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

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

A Guide to Graph Algorithms

Ton Kloks, Mingyu Xiao

Springer, ISBN: 978-981-16-6349-9, 2022

2021

A note on the geodetic number and the Steiner number of AT-free graphs.

Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang, Yue-Li Wang

Theor. Comput. Sci., 2021

Semitotal Domination on AT-Free Graphs and Circle Graphs.

Ton Kloks, Arti Pandey

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2018

On retracts, absolute retracts, and foldings in cographs.

Ton Kloks, Yue-Li Wang

Optim. Lett., 2018

2017

On efficient absorbant conjecture in generalized De Bruijn digraphs.

Kuo-Hua Wu, Yue-Li Wang, Ton Kloks

Int. J. Comput. Math., 2017

On the Grundy number of Cameron graphs.

Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang

Electron. Notes Discret. Math., 2017

2016

On complexities of minus domination.

Luérbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang

Discret. Optim., 2016

P_3-Games on Chordal Bipartite Graphs.

Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang

CoRR, 2016

P_3-Games.

Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang

CoRR, 2016

Convex Independence in Permutation Graphs.

Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu

Proceedings of the Combinatorial Optimization and Applications, 2016

On the <i>P</i>₃-convexity of some classes of graphs with few <i>P</i>₄s and permutation graphs.

Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu

Proceedings of the Australasian Computer Science Week Multiconference, 2016

2015

Edge-clique covers of the tensor product.

Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Yue-Li Wang

Theor. Comput. Sci., 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, Sheung-Hung Poon, Yue-Li Wang

Theor. Comput. Sci., 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

Convexities in Some Special Graph Classes - New Results in AT-free Graphs and Beyond.

Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang, Yue-Li Wang

CoRR, 2015

Flood-it on AT-Free Graphs.

Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Hung-Lung Wang

CoRR, 2015

Rainbow Domination and Related Problems on Some Classes of Perfect Graphs.

Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang

Proceedings of the Topics in Theoretical Computer Science, 2015

Gray Codes for AT-Free Orders via Antimatroids.

Jou-Ming Chang, Ton Kloks, Hung-Lung Wang

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

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

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

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

2013

New parameterized algorithms for the edge dominating set problem.

Mingyu Xiao, Ton Kloks, Sheung-Hung Poon

Theor. Comput. Sci., 2013

Independent set in categorical products of cographs and splitgraphs

Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang

CoRR, 2013

On retracts and folds in cographs

Ton Kloks, Yue-Li Wang

CoRR, 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, Sheung-Hung Poon, Yue-Li Wang

CoRR, 2013

On Retracts, Absolute Retracts, and Folds in Cographs.

Ton Kloks, Yue-Li Wang

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and <i>k</i>-Planar Graphs.

Jiawei Gao, Ton Kloks, Sheung-Hung Poon

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

On Independence Domination.

Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

On Perfect Absorbants in De Bruijn Digraphs.

Yue-Li Wang, Kuo-Hua Wu, Ton Kloks

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

On Edge-Independent Sets.

Ton Kloks, Ching-Hao Liu, Sheung-Hung Poon

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

A note on "Folding wheels and fans."

Ton Kloks, Yue-Li Wang

CoRR, 2012

Independent sets in edge-clique graphs II

Ching-Hao Liu, Maw-Shang Chang, Ton Kloks, Sheung-Hung Poon

CoRR, 2012

Independent sets in edge-clique graphs

Maw-Shang Chang, Ton Kloks, Ching-Hao Liu

CoRR, 2012

Edge-clique graphs of cocktail parties have unbounded rankwidth

Maw-Shang Chang, Ton Kloks, Ching-Hao Liu

CoRR, 2012

A note on triangle partitions

Ton Kloks

CoRR, 2012

Packing interval graphs with vertex-disjoint triangles

Ton Kloks

CoRR, 2012

A note on probe cographs

Ton Kloks

CoRR, 2012

The black-and-white coloring problem on permutation graphs

Ton Kloks

CoRR, 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

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

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

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Block-graph width.

Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng

Theor. Comput. Sci., 2011

On the threshold-width of graphs.

Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng

J. Graph Algorithms Appl., 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

A linear-time algorithm for the strong chromatic index of Halin graphs

Ton Kloks, Yue-Li Wang

CoRR, 2011

New parameterized algorithms for edge dominating set

Mingyu Xiao, Ton Kloks, Sheung-Hung Poon

CoRR, 2011

k-Cographs are Kruskalian.

Ling-Ju Hung, Ton Kloks

Chic. J. Theor. Comput. Sci., 2011

Black-and-White Threshold Graphs.

Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

On Some Simple Widths.

Ling-Ju Hung, Ton Kloks

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Classifying Rankwidth k-DH-Graphs.

Ling-Ju Hung, Ton Kloks

Proceedings of the Computer Science, 2010

Kruskalian Graphs.

Ling-Ju Hung, Ton Kloks

Proceedings of the Theory of Computing 2010, 2010

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

On probe permutation graphs.

David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng

Discret. Appl. Math., 2009

Trivially-Perfect Width.

Ling-Ju Hung, Ton Kloks, Chuan-Min Lee

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Partitioned probe comparability graphs.

David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng

Theor. Comput. Sci., 2008

Efficient algorithms for Roman domination on some classes of graphs.

Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng

Discret. Appl. Math., 2008

Probe Ptolemaic Graphs.

David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Probe Matrix Problems: Totally Balanced Matrices.

David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Improved bottleneck domination algorithms.

Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu

Discret. Appl. Math., 2006

The Maximum Interval Graphs on Distance Hereditary Graphs.

Sheng-Lung Peng, Ton Kloks, Chuan-Min Lee

Proceedings of the 2006 Joint Conference on Information Sciences, 2006

Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs.

David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Kernels in planar digraphs.

Gregory Z. Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo

J. Comput. Syst. Sci., 2005

Probe interval bigraphs.

Gerard Jennhwa Chang, Ton Kloks, Sheng-Lung Peng

Electron. Notes Discret. Math., 2005

Computing the branchwidth of interval graphs.

Ton Kloks, Jan Kratochvíl, Haiko Müller

Discret. Appl. Math., 2005

Roman Domination over Some Graph Classes.

Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

The PIGs Full Monty - A Floor Show of Minimal Separators.

Gerard Jennhwa Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng

Proceedings of the STACS 2005, 2005

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

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Stickiness, Edge-Thickness, and Clique-Thickness in Graphs.

Ton Kloks, Chuan-Min Lee, Jiping Liu

J. Inf. Sci. Eng., 2004

Approximations for lambda-Colorings of Graphs.

Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen

Comput. J., 2004

Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P₄'s.

Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003

On the Recognition of General Partition Graphs.

Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

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

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

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

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001

Efficient algorithms for graphs with few <i>P</i>₄'s.

Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu

Discret. Math., 2001

Bandwidth and topological bandwidth of graphs with few P4's.

Ton Kloks, Richard B. Tan

Discret. Appl. Math., 2001

Fixed-parameter complexity of lambda-labelings.

Jirí Fiala, Ton Kloks, Jan Kratochvíl

Discret. Appl. Math., 2001

Maximum Clique Transversals.

Maw-Shang Chang, Ton Kloks, Chuan-Min Lee

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

2000

Degree-preserving trees.

Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller

Networks, 2000

Finding and counting small induced subgraphs efficiently.

Ton Kloks, Dieter Kratsch, Haiko Müller

Inf. Process. Lett., 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

Bandwidth of Split and Circular Permutation Graphs.

Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

lambda-Coloring of Graphs.

Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen

Proceedings of the STACS 2000, 2000

1999

Independent Sets in Asteroidal Triple-Free Graphs.

Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller

SIAM J. Discret. Math., 1999

Approximating the Bandwidth for Asteroidal Triple-Free Graphs.

Ton Kloks, Dieter Kratsch, Haiko Müller

J. Algorithms, 1999

On the structure of graphs with bounded asteroidal number.

Ton Kloks, Dieter Kratsch, Haiko Müller

Electron. Notes Discret. Math., 1999

SIMPLE MAX-CUT for unit interval graphs and graphs with few P₄s.

Hans L. Bodlaender, Ton Kloks, Rolf Niedermeier

Electron. Notes Discret. Math., 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

New Branchwidth Territories.

Ton Kloks, Jan Kratochvíl, Haiko Müller

Proceedings of the STACS 99, 1999

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

Listing All Minimal Separators of a Graph.

Ton Kloks, Dieter Kratsch

SIAM J. Comput., 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

Minimum Fill-in on Circle and Circular-Arc Graphs.

Ton Kloks, Dieter Kratsch, C. K. Wong

J. Algorithms, 1998

Vertex Ranking of Asteroidal Triple-Free Graphs.

Ton Kloks, Haiko Müller, C. K. Wong

Inf. Process. Lett., 1998

Bandwidth of Chain Graphs.

Ton Kloks, Dieter Kratsch, Haiko Müller

Inf. Process. Lett., 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

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Degree-Preserving Forests.

Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs.

Ton Kloks, Dieter Kratsch, Jeremy P. Spinrad

Theor. Comput. Sci., 1997

Time-varying shortest path problems with constraints.

X. Cai, Ton Kloks, C. K. Wong

Networks, 1997

Measuring the Vulnerability for Classes of Intersection Graphs.

Dieter Kratsch, Ton Kloks, Haiko Müller

Discret. Appl. Math., 1997

Asteroidal Sets in Graphs.

Ton Kloks, Dieter Kratsch, Haiko Müller

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.

Hajo Broersma, Elias Dahlhaus, Ton Kloks

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs.

Hans L. Bodlaender, Ton Kloks

J. Algorithms, 1996

K_1, 3-Free and W_4-Free Graphs.

Ton Kloks

Inf. Process. Lett., 1996

Treewidth of Circle Graphs.

Ton Kloks

Int. J. Found. Comput. Sci., 1996

Shortest Path Problems with Time Constraints.

X. Cai, Ton Kloks, C. K. Wong

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995

Treewidth and Pathwidth of Permutation Graphs.

Hans L. Bodlaender, Ton Kloks, Dieter Kratsch

SIAM J. Discret. Math., 1995

Complexity Aspects of Two-Dimensional Data Compression.

Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks

Nord. J. Comput., 1995

Treewidth of Chordal Bipartite Graphs.

Ton Kloks, Dieter Kratsch

J. Algorithms, 1995

Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree.

Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks

J. Algorithms, 1995

Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph.

Ton Kloks, Dieter Kratsch

Inf. Process. Lett., 1995

On the Equivalence Covering Number of Splitgraphs.

Aart Blokhuis, Ton Kloks

Inf. Process. Lett., 1995

1994

Dominoes.

Ton Kloks, Dieter Kratsch, Haiko Müller

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Ranking of Graphs.

Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Finding All Minimal Separators of a Graph.

Ton Kloks, Dieter Kratsch

Proceedings of the STACS 94, 1994

On Vertex Ranking for Permutations and Other Graphs.

Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller

Proceedings of the STACS 94, 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

Proceedings of the Algorithms, 1994

Treewidth, Computations and Approximations

Ton Kloks

Lecture Notes in Computer Science 842, Springer, ISBN: 3-540-58356-4, 1994

1993

A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs.

Hans L. Bodlaender, Ton Kloks

J. Algorithms, 1993

Treewidth of Bipartite Graphs.

Ton Kloks, Dieter Kratsch

Proceedings of the STACS 93, 1993

Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators.

Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

Testing Superperfection of k-Trees.

Ton Kloks, Hans L. Bodlaender

Proceedings of the Algorithm Theory, 1992

Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs.

Ton Kloks, Hans L. Bodlaender

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height.

Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson

Proceedings of the 17th International Workshop, 1991

Better Algorithms for the Pathwidth and Treewidth of Graphs.

Hans L. Bodlaender, Ton Kloks

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Complexity Aspects of Map Compression.

Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks

Proceedings of the IEEE Data Compression Conference, 1991

1989

An infinite sequence of GammaDelta-regular graphs.

Ton Kloks

Discret. Math., 1989

1986

A Class of Graphs Containing the Polar Spaces.

Aart Blokhuis, Ton Kloks, Henny A. Wilbrink

Eur. J. Comb., 1986