Ton Kloks

Orcid: 0000-0001-8825-3464

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Complexity of paired domination in AT-free and planar graphs.
Theor. Comput. Sci., 2022

A Guide to Graph Algorithms
Springer, ISBN: 978-981-16-6349-9, 2022

2021
A note on the geodetic number and the Steiner number of AT-free graphs.
Theor. Comput. Sci., 2021

Semitotal Domination on AT-Free Graphs and Circle Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2018
On retracts, absolute retracts, and foldings in cographs.
Optim. Lett., 2018

2017
On efficient absorbant conjecture in generalized De Bruijn digraphs.
Int. J. Comput. Math., 2017

On the Grundy number of Cameron graphs.
Electron. Notes Discret. Math., 2017

2016
On complexities of minus domination.
Discret. Optim., 2016

P_3-Games on Chordal Bipartite Graphs.
CoRR, 2016

P_3-Games.
CoRR, 2016

Convex Independence in Permutation Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2016

On the <i>P</i><sub>3</sub>-convexity of some classes of graphs with few <i>P</i><sub>4</sub>s and permutation graphs.
Proceedings of the Australasian Computer Science Week Multiconference, 2016

2015
Edge-clique covers of the tensor product.
Theor. Comput. Sci., 2015

On maximum independent set of categorical product and ultimate categorical ratios of graphs.
Theor. Comput. Sci., 2015

On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs.
J. Discrete Algorithms, 2015

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

Flood-it on AT-Free Graphs.
CoRR, 2015

Rainbow Domination and Related Problems on Some Classes of Perfect Graphs.
Proceedings of the Topics in Theoretical Computer Science, 2015

Gray Codes for AT-Free Orders via Antimatroids.
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.
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.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

2013
New parameterized algorithms for the edge dominating set problem.
Theor. Comput. Sci., 2013

Independent set in categorical products of cographs and splitgraphs
CoRR, 2013

On retracts and folds in cographs
CoRR, 2013

Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio.
CoRR, 2013

On Retracts, Absolute Retracts, and Folds in Cographs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and <i>k</i>-Planar Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

On Independence Domination.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

On Perfect Absorbants in De Bruijn Digraphs.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

On Edge-Independent Sets.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
A note on "Folding wheels and fans."
CoRR, 2012

Independent sets in edge-clique graphs II
CoRR, 2012

Independent sets in edge-clique graphs
CoRR, 2012

Edge-clique graphs of cocktail parties have unbounded rankwidth
CoRR, 2012

A note on triangle partitions
CoRR, 2012

Packing interval graphs with vertex-disjoint triangles
CoRR, 2012

A note on probe cographs
CoRR, 2012

The black-and-white coloring problem on permutation graphs
CoRR, 2012

Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs.
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.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
Block-graph width.
Theor. Comput. Sci., 2011

On the threshold-width of graphs.
J. Graph Algorithms Appl., 2011

On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs
CoRR, 2011

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

New parameterized algorithms for edge dominating set
CoRR, 2011

k-Cographs are Kruskalian.
Chic. J. Theor. Comput. Sci., 2011

Black-and-White Threshold Graphs.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010
On Some Simple Widths.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Classifying Rankwidth k-DH-Graphs.
Proceedings of the Computer Science, 2010

Kruskalian Graphs.
Proceedings of the Theory of Computing 2010, 2010

2009
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences.
J. Comb. Theory B, 2009

On probe permutation graphs.
Discret. Appl. Math., 2009

Trivially-Perfect Width.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Partitioned probe comparability graphs.
Theor. Comput. Sci., 2008

Efficient algorithms for Roman domination on some classes of graphs.
Discret. Appl. Math., 2008

Probe Ptolemaic Graphs.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Probe Matrix Problems: Totally Balanced Matrices.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Improved bottleneck domination algorithms.
Discret. Appl. Math., 2006

The Maximum Interval Graphs on Distance Hereditary Graphs.
Proceedings of the 2006 Joint Conference on Information Sciences, 2006

Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
Kernels in planar digraphs.
J. Comput. Syst. Sci., 2005

Probe interval bigraphs.
Electron. Notes Discret. Math., 2005

Computing the branchwidth of interval graphs.
Discret. Appl. Math., 2005

Roman Domination over Some Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

The PIGs Full Monty - A Floor Show of Minimal Separators.
Proceedings of the STACS 2005, 2005

On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Stickiness, Edge-Thickness, and Clique-Thickness in Graphs.
J. Inf. Sci. Eng., 2004

Approximations for lambda-Colorings of Graphs.
Comput. J., 2004

Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P<sub>4</sub>'s.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003
On the Recognition of General Partition Graphs.
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.
Algorithmica, 2002

Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs.
Algorithmica, 2002

New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001
Efficient algorithms for graphs with few <i>P</i><sub>4</sub>'s.
Discret. Math., 2001

Bandwidth and topological bandwidth of graphs with few P4's.
Discret. Appl. Math., 2001

Fixed-parameter complexity of lambda-labelings.
Discret. Appl. Math., 2001

Maximum Clique Transversals.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

2000
Degree-preserving trees.
Networks, 2000

Finding and counting small induced subgraphs efficiently.
Inf. Process. Lett., 2000

A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs.
Discret. Appl. Math., 2000

Bandwidth of Split and Circular Permutation Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

lambda-Coloring of Graphs.
Proceedings of the STACS 2000, 2000

1999
Independent Sets in Asteroidal Triple-Free Graphs.
SIAM J. Discret. Math., 1999

Approximating the Bandwidth for Asteroidal Triple-Free Graphs.
J. Algorithms, 1999

On the structure of graphs with bounded asteroidal number.
Electron. Notes Discret. Math., 1999

SIMPLE MAX-CUT for unit interval graphs and graphs with few P<sub>4</sub>s.
Electron. Notes Discret. Math., 1999

On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs.
Discret. Appl. Math., 1999

New Branchwidth Territories.
Proceedings of the STACS 99, 1999

1998
Rankings of Graphs.
SIAM J. Discret. Math., 1998

Listing All Minimal Separators of a Graph.
SIAM J. Comput., 1998

Treewidth and Minimum Fill-in on d-Trapezoid Graphs.
J. Graph Algorithms Appl., 1998

Minimum Fill-in on Circle and Circular-Arc Graphs.
J. Algorithms, 1998

Vertex Ranking of Asteroidal Triple-Free Graphs.
Inf. Process. Lett., 1998

Bandwidth of Chain Graphs.
Inf. Process. Lett., 1998

A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Degree-Preserving Forests.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs.
Theor. Comput. Sci., 1997

Time-varying shortest path problems with constraints.
Networks, 1997

Measuring the Vulnerability for Classes of Intersection Graphs.
Discret. Appl. Math., 1997

Asteroidal Sets in Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs.
J. Algorithms, 1996

K_1, 3-Free and W_4-Free Graphs.
Inf. Process. Lett., 1996

Treewidth of Circle Graphs.
Int. J. Found. Comput. Sci., 1996

Shortest Path Problems with Time Constraints.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995
Treewidth and Pathwidth of Permutation Graphs.
SIAM J. Discret. Math., 1995

Complexity Aspects of Two-Dimensional Data Compression.
Nord. J. Comput., 1995

Treewidth of Chordal Bipartite Graphs.
J. Algorithms, 1995

Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree.
J. Algorithms, 1995

Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph.
Inf. Process. Lett., 1995

On the Equivalence Covering Number of Splitgraphs.
Inf. Process. Lett., 1995

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

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

Finding All Minimal Separators of a Graph.
Proceedings of the STACS 94, 1994

On Vertex Ranking for Permutations and Other Graphs.
Proceedings of the STACS 94, 1994

Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators.
Proceedings of the Algorithms, 1994

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

1993
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs.
J. Algorithms, 1993

Treewidth of Bipartite Graphs.
Proceedings of the STACS 93, 1993

Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
Testing Superperfection of k-Trees.
Proceedings of the Algorithm Theory, 1992

Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991
Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height.
Proceedings of the 17th International Workshop, 1991

Better Algorithms for the Pathwidth and Treewidth of Graphs.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Complexity Aspects of Map Compression.
Proceedings of the IEEE Data Compression Conference, 1991

1989
An infinite sequence of GammaDelta-regular graphs.
Discret. Math., 1989

1986
A Class of Graphs Containing the Polar Spaces.
Eur. J. Comb., 1986


  Loading...